Smooth simultaneous structural graph matching and point-set registration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6658 LNCS, Issue , 2011, Pages 142-151

  Sanromà, Gerard ^a   Alquézar, René ^b   Serratosa, Francesc ^a  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^b CSIC   (Spain)

Author keywords

affine registration; correspondence problem; expectation maximization; softassign

Indexed keywords

AFFINE REGISTRATION; ASSIGNMENT PROBLEMS; COMPUTATIONAL TIME; CORRESPONDENCE PROBLEM; EM ALGORITHMS; EXPECTATION-MAXIMIZATION; GEOMETRICAL DEFORMATION; GRAPH MATCHING PROBLEMS; GRAPH TRANSFORMATION; GRAPH-MATCHING METHODS; MIXTURE-MODELLING; SOFTASSIGN; STRUCTURAL GRAPH; CORRESPONDENCE PROBLEMS; EXPECTATION - MAXIMIZATIONS; GRAPH TRANSFORMATION MATCHING; POINT-SET REGISTRATIONS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPHIC METHODS; MAXIMUM PRINCIPLE; PATTERN MATCHING; STATISTICS;

PATTERN MATCHING; PATTERN RECOGNITION;

EID: 79956308780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20844-7_15     Document Type: Article

References (18)

1. Http://www.featurespace.org/
2. Aguilar, W., Frauel, Y., Escolano, F., Martinez-Perez, M.: A robust graph transformation matching for non-rigid registration. Image and Vision Computing 27, 897-910 (2009)
3. Black, M., Rangarajan, A.: On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. International Journal of Computer Vision 19(1), 57-91 (1996) (Pubitemid 126713881)
4. Cross, A., Hancock, E.: Graph matching with a dual-step em algorithm. IEEE Trans. Pattern Analysis and Machine Intelligence 20(11), 1236-1253 (1998) (Pubitemid 128742000)
5. Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the em algorithm. Journal Royal Stat. Soc., Series B 39(1), 1-38 (1977)
6. Fischler, M. A., Bolles, R. C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Comunications of the ACM 24(6), 381-395 (1981)
7. Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Analysis and Machine Intelligence 18(4) (April 1996)
8. Harris, C., Stephens, M.: A combined corner and edge detection. In: Proceedings of The Fourth Alvey Vision Conference, pp. 147-151 (1988)
9. Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)
10. Kosowsky, J., Yuille, A.: The invisible hand algorithm - solving the assignment problem with statistical physics. Neural Networks 7(3), 477-490 (1994)
11. Luo, B., Hancock, E.: Feature matching with procrustes alignment and graph editing. In: 7th Int. Conf. on Image Proc. and Apps., vol. 465, pp. 72-76 (1999) (Pubitemid 30502899)
12. Luo, B., Hancock, E.: Structural graph matching using the em algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(10) (October 2001)
13. Luo, B., Hancock, E.: A unified framework for alignment and correspondence. Computer Vision and Image Understanding 92(1), 26-55 (2003)
14. Mikolajczyk, K., Schmid, C.: A performance evaluation of local descriptors. IEEE Trans. on Pattern Analysis and Machine Intelligence 27(10), 1615-1630 (2005) (Pubitemid 41555406)
15. Rangarajan, A., Gold, S., Mjolsness, E.: A novel optimizing network architecture with applications. Neural Computation 8(5), 1041-1060 (1996) (Pubitemid 126449957)
16. Sinkhorn, R.: Relationship between arbitrary positive matrices + doubly stochastic matrices. Annals of Mathematical Statistics 35(2), 876-879 (1964)
17. Wilson, R., Cross, A., Hancock, E.: Structural matching with active triangulations. Computer Vision and Image Understanding 72(1), 21-38 (1998) (Pubitemid 128417507)
18. Wilson, R., Hancock, E.: Structural matching by discrete relaxation. IEEE Trans. Pattern Analysis and Machine Intelligence 19(6), 634-648 (1997) (Pubitemid 127762257)