Browsing by Author "Serratosa Casanelles, Francesc"

A discrete labelling approach to attributed graph matching using SIFT features
Sanromà Güell, Gerard; Alquézar Mancho, René; Serratosa Casanelles, Francesc (2010)
Conference report
Open AccessLocal invariant feature extraction methods are widely used for imagefeatures matching. There exist a number of approaches aimed at the refinement of the matches between imagefeatures. It is a common strategy among these ... 
A new algorithm to compute the distance between multidimensional histograms
Serratosa Casanelles, Francesc; Sanromà Güell, Gerard; Sanfeliu Cortés, Alberto (Springer Verlag, 2007)
Part of book or chapter of book
Open AccessThe aim of this paper is to present a new algorithm to compute the distance between ndimensional histograms. There are some domains such as pattern recognition or image retrieval that use the distance between histograms ... 
A new graph matching method for pointset correspondence using the EM algorithm and Softassign
Sanromà Güell, Gerard; Alquézar Mancho, René; Serratosa Casanelles, Francesc (2012)
Article
Restricted access  publisher's policyFinding correspondences between two pointsets is a common step in many vision applications (e.g., image matching or shape retrieval). We present a graph matching method to solve the pointset correspondence problem, which ... 
An approximate algorithm for median graph computation using graph embedding
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (Institute of Electrical and Electronics Engineers (IEEE), 2008)
Conference report
Restricted access  publisher's policyGraphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for instance, how to obtain a representative of a ... 
Attributed graph matching for imagefeatures association using SIFT descriptors
Sanromà Güell, Gerard; Alquézar Mancho, René; Serratosa Casanelles, Francesc (Springer, 2010)
Conference report
Open AccessImagefeatures matching based on SIFT descriptors is subject to the misplacement of certain matches due to the local nature of the SIFT representations. Some wellknown outlier rejectors aim to remove those misplaced matches ... 
Experimental assessment of probabilistic integrated object recognition and tracking methods
Serratosa Casanelles, Francesc; Amézquita Gómez, Nicolás; Alquézar Mancho, René (Springer Verlag, 2009)
Conference report
Open AccessThis paper presents a comparison of two classifiers that are used as a first step within a probabilistic object recognition and tracking framework called PIORT. This first step is a static recognition module that provides ... 
Generalized median graph computation by means of graph embedding in vector spaces
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Riesen, Kaspar; Bunke, Horst (2010)
Article
Restricted access  publisher's policyThe median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we ... 
Graph matching using SIFT descriptors: an application to pose recovery of a mobile robot
Sanromà Güell, Gerard; Alquézar Mancho, René; Serratosa Casanelles, Francesc (2010)
Conference report
Open AccessImagefeature matching based on Local Invariant Feature Extraction (LIFE) methods has proven to be successful, and SIFT is one of the most effective. SIFT matching uses only local texture information to compute the ... 
Graphbased kmeans clustering: A comparison of the set versus the generalized median graph
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc; Bardaji Goikoetxea, Itziar; Bunke, Horst (Springer Berlin / Heidelberg, 2009)
Part of book or chapter of book
Restricted access  publisher's policyIn this paper we propose the application of the generalized median graph in a graphbased kmeans clustering algorithm. In the graphbased kmeans algorithm, the centers of the clusters have been traditionally represented ... 
Groupwise sparse correspondences between images based on a common labelling approach
Solé Ribalta, Albert; Sanromà Güell, Gerard; Serratosa Casanelles, Francesc; Alquézar Mancho, René (SciTePress, 2012)
Conference report
Restricted access  publisher's policyFinding sparse correspondences between two images is a usual process needed for several higherlevel computer vision tasks. For instance, in robot positioning, it is frequent to make use of images that the robot captures ... 
Median graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (Springer Berlin / Heidelberg, 2009)
Part of book or chapter of book
Restricted access  publisher's policyGiven a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical ... 
Median graph: a new exact algorithm using a distance based on the maximum common subgraph
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (2009)
Article
Restricted access  publisher's policyMedian graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more ... 
Median graphs: a genetic approach based on new theoretical properties
Ferrer Sumsi, Miquel; Valveny, Ernest; Serratosa Casanelles, Francesc (2009)
Article
Restricted access  publisher's policyGiven a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical ... 
MSClique: Multiple structure discovery through the maximum weighted clique problem
Sanromà Güell, Gerard; Peñate Sánchez, Adrián; Alquézar Mancho, René; Serratosa Casanelles, Francesc; MorenoNoguer, Francesc; AndradeCetto, Juan; González Ballester, Miguel Ángel (20160101)
Article
Open AccessWe present a novel approach for feature correspondence and multiple structure discovery in computer vision. In contrast to existing methods, we exploit the fact that pointsets on the same structure usually lie close to ... 
On the graph edit distance cost: Properties and applications
Solé Ribalta, Albert; Serratosa Casanelles, Francesc; Sanfeliu Cortés, Alberto (201208)
Article
Restricted access  publisher's policyWe model the edit distance as a function in a labeling space. A labeling space is an Euclidean space where coordinates are the edit costs. Through this model, we de¯ne a class of cost. A class of cost is a region in the ... 
On the graph edit distance costs: properties and applications
Solé, Albert; Serratosa Casanelles, Francesc; Sanfeliu Cortés, Alberto (2012)
Article
Restricted access  publisher's policyWe model the edit distance as a function in a labelling space. A labelling space is an Euclidean space where coordinates are the edit costs. Through this model, we define a class of cost. A class of cost is a region in the ... 
Smooth simultaneous structural graph matching and pointset registration
Sanromà Güell, Gerard; Alquézar Mancho, René; Serratosa Casanelles, Francesc (Springer, 2011)
Conference report
Open AccessWe present a graph matching method that encompasses both a model of structural consistency and a model of geometrical deformations. Our method poses the graph matching problem as one of mixture modelling which is solved ... 
Tracking deformable objects and dealing with same class object occlusion
Alquézar Mancho, René; Amézquita, N; Serratosa Casanelles, Francesc (INSTICC Press. Institute for Systems and Technologies of Information, Control and Communication, 2009)
Part of book or chapter of book
Open AccessThis paper presents an extension of a previously reported method for object tracking in video sequences to handle the problems of object crossing and occlusion by other objects in the same class that the one followed. The ...