Graph matching with nonnegative sparse model

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

Volumn 7877 LNCS, Issue , 2013, Pages 41-50

  Jiang, Bo ^a   Tang, Jin ^a   Luo, Bin ^a  

^a ANHUI UNIVERSITY   (China)

Author keywords

Graph matching; Nonnegative matrix factorization; Sparse model

Indexed keywords

ESSENTIAL PROBLEMS; GRAPH MATCHINGS; GRAPH-MATCHING METHODS; MATCHING METHODS; NON NEGATIVES; NONNEGATIVE MATRIX FACTORIZATION; SPARSE MODELING; SPARSE SOLUTIONS;

ALGORITHMS; IMAGE MATCHING;

PATTERN RECOGNITION;

EID: 84883376244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38221-5_5     Document Type: Conference Paper

References (13)

1. Cho, M., Lee, J., Lee, K.M.: Reweighted random walks for graph matching. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 492-505. Springer, Heidelberg (2010)
2. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence, 265-298 (2004)
3. Leordeanu, M., Hebert, M.: A spectral technique for correspondence problem using pairwise constraints. In: ICCV, pp. 1482-1489 (2005)
4. Choi, O., Kweon, I.S.: Robust feature point matching by preserving local geometric consistency. CVIU 113, 726-742 (2009)
5. Cour, M., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS, pp. 313-320 (2006)
6. Enqvist, O., Josephon, K., Kahl, F.: Optimal correspondences from pairwise constraints. In: ICCV, pp. 1295-1302 (2009)
7. Torresani, L., Kolmogorov, V., Rother, C.: Feature correspondence via graph matching: Models and global optimization. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part II. LNCS, vol. 5303, pp. 596-609. Springer, Heidelberg (2008)
8. Leordeanu, M., Hebert, M.: An integer projected fixed point method for graph matching and map inference. In: NIPS, pp. 1114-1122 (2009)
9. Zhou, F., Torre, F.D.: Factorized graph matching. In: CVPR, pp. 127-134 (2012)
10. Donoho, D.: Compressed sensing. Technical Report, Stanford University (2006)
11. Donoho, D.: For most large underdetermined systerms of linear equations, the minimal l1-norm solution is also the sparsest solution. In: Comm. Pure Appl. Math., vol. 59 (2006)
12. Duchi, J., Shwartz, S.S., Singer, Y., Chandra, T.: Efficient projections onto the l1-ball for learning in high dimensions. In: ICML (2008)
13. Ding, C., Li, T., Jordan, M.I.: Convex and semi-nonnegative matrix factorization. PAMI 32(1), 45-55 (2010)