Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A new graph matching method for point-set correspondence using the EM algorithm and Softassign

Autor
Sanromà, G.; Alquezar, R.; Serratosa, F.
Tipus d'activitat
Article en revista
Revista
Computer vision and image understanding
Data de publicació
2012
Volum
116
Número
2
Pàgina inicial
292
Pàgina final
304
DOI
https://doi.org/10.1016/j.cviu.2011.10.009 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/16937 Obrir en finestra nova
Resum
Finding correspondences between two point-sets is a common step in many vision applications (e.g., image matching or shape retrieval). We present a graph matching method to solve the point-set correspondence problem, which is posed as one of mixture modelling. Our mixture model encompasses a model of structural coherence and a model of affine-invariant geometrical errors. Instead of absolute positions, the geometrical positions are represented as relative positions of the points with respect to ...
Citació
Sanromà, G.; Alquezar, R.; Serratosa, F. A new graph matching method for point-set correspondence using the EM algorithm and Softassign. "Computer vision and image understanding", 2012, vol. 116, núm. 2, p. 292-304.
Paraules clau
Correspondence Problem, Graph Matching, Affine Registration, Outlier Detection, Expectation Maximization, Softassign
Grup de recerca
SOCO - Soft Computing

Participants