Feature correspondence based on directed structural model matching
作者： Xu Yang , Hong Qiao , Zhi-Yong Liu , None
DOI: 10.1016/J.IMAVIS.2014.11.001
关键词:
摘要: Feature correspondence lays the foundation for many tasks in computer vision and pattern recognition. In this paper directed structural model is utilized to represent feature set, problem then formulated as matching. Compared with undirected model, proposed provides more discriminating ability invariance against rotation scale transformations. Finally, recently convex-concave relaxation procedure (CCRP) generalized approximately solve problem. Extensive experiments on synthetic real data witness effectiveness of method. A correspondence.It than commonly used model.The casted a "directed matching" problem.The
sci-hub.se 参考文章(41)
Martin Jaggi, Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization international conference on machine learning. pp. 427- 435 ,(2013)
Takahiro Watanabe, Document Analysis and Recognition IEICE Transactions on Information and Systems. ,vol. 82, pp. 601- 610 ,(1999)
Jutta Willamowski, Christopher R. Dance, Gabriella Csurka, Damian Arregui, Lixin Fan, Categorizing Nine Visual Classes using Local Appearance Descriptors ,(2004)
Donatello Conte, Pasquale Foggia, Carlo Sansone, Mario Vento, How and Why Pattern Recognition and Computer Vision Applications Use Graphs computer vision and pattern recognition. pp. 85- 135 ,(2007) , 10.1007/978-3-540-68020-8_4
Christian Schellewald, Christoph Schnörr, Probabilistic Subgraph Matching Based on Convex Relaxation Lecture Notes in Computer Science. pp. 171- 186 ,(2005) , 10.1007/11585978_12
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Rother, Feature Correspondence Via Graph Matching: Models and Global Optimization Lecture Notes in Computer Science. pp. 596- 609 ,(2008) , 10.1007/978-3-540-88688-4_44
Masao Fukushima, A modified Frank-Wolfe algorithm for solving the traffic assignment problem Transportation Research Part B-methodological. ,vol. 18, pp. 169- 177 ,(1984) , 10.1016/0191-2615(84)90029-8
E. S. Ng, N. G. Kingsbury, Matching of interest point groups with pairwise spatial constraints international conference on image processing. pp. 2693- 2696 ,(2010) , 10.1109/ICIP.2010.5651903
Jungmin Lee, Minsu Cho, Kyoung Mu Lee, Hyper-graph matching via reweighted random walks computer vision and pattern recognition. pp. 1633- 1640 ,(2011) , 10.1109/CVPR.2011.5995387
Gayathri Mahalingam, Chandra Kambhamettu, Age invariant face recognition using graph matching international conference on biometrics theory applications and systems. pp. 1- 7 ,(2010) , 10.1109/BTAS.2010.5634496