Abstract book (pdf) - ICPR 2010

A Discrete Labelling Approach to Attributed Graph Matching using SIFT Features
Sanroma, Gerard, Univ. Rovira I Virgili
Alquezar, Rene, Univ. Pol. De Catalunya
Serratosa, Francesc, Univ. Rovira I Virgili
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches
aimed at the refinement of the matches between image-features. It is a common strategy among these approaches
to use geometrical criteria to reject a subset of outliers. One limitation of the outlier rejection design is that it is unable to
add new useful matches. We present a new model that integrates the local information of the SIFT descriptors along with
global geometrical information to estimate a new robust set of feature-matches. Our approach encodes the geometrical information
by means of graph structures while posing the estimation of the feature-matches as a graph matching problem.
Some comparative experimental results are presented.
09:00-11:10, Paper TuAT8.17
A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs
Igelmo, Manuel, Univ. Pol. De Catalunya
Sanfeliu, Alberto, Univ. Pol. De Catalunya
Ferrer, Miquel, Univ. Pol. De Catalunya
In this paper we propose a conductance electrical model to represent weighted undirected graphs that allows us to efficiently
compute approximate graph isomorphism in large graphs. The model is built by transforming a graph into an electrical
circuit. Edges in the graph become conductances in the electrical circuit. This model follows the laws of the electrical
circuit theory and we can potentially use all the existing theory and tools of this field to derive other approximate techniques
for graph matching. In the present work, we use the proposed circuital model to derive approximated graph isomorphism
solutions.
09:00-11:10, Paper TuAT8.18
Computing the Barycenter Graph by Means of the Graph Edit Distance
Bardaji, Itziar, Univ. Pol. De Catalunya
Ferrer, Miquel, Univ. Pol. De Catalunya
Sanfeliu, Alberto, Univ. Pol. De Catalunya
The barycenter graph has been shown as an alternative to obtain the representative of a given set of graphs. In this paper
we propose an extension of the original algorithm which makes use of the graph edit distance in conjunction with the
weighted mean of a pair of graphs. Our main contribution is that we can apply the method to attributed graphs with any
kind of labels in both the nodes and the edges, equipped with a distance function less constrained than in previous approaches.
Experiments done on four different datasets support the validity of the method giving good approximations of
the barycenter graph.
09:00-11:10, Paper TuAT8.19
Refined Morphological Methods of Moment Computation
Suk, Tomas, Inst. of Information Theory and Automation
Flusser, Jan, Inst. of Information Theory and Automation
A new method of moment computation based on decomposition of the object into rectangular blocks is presented. The decomposition
is accomplished by means of distance transform. The method is compared with earlier morphological methods,
namely with erosion decomposition to squares. All the methods are also compared with direct computation by definition.
09:00-11:10, Paper TuAT8.20
Robust Computation of the Polarisation Image
Saman, Gule, Univ. of York
Hancock, Edwin, Univ. of York
In this paper we show how to render the computation of polarisation information from multiple polariser angle images robust.
We make two contributions. First, we show how to use M-estimators to make robust moments estimates of the mean
intensity, polarisation and phase. Second, we show how directional statistics can be used to smooth the phase-angle, and
- 85 -