{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:09:09Z","timestamp":1760404149568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319106045"},{"type":"electronic","value":"9783319106052"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10605-2_51","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T19:10:18Z","timestamp":1407957018000},"page":"788-802","source":"Crossref","is-referenced-by-count":35,"title":["Progressive Mode-Seeking on Graphs for Sparse Feature Matching"],"prefix":"10.1007","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingqiao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","unstructured":"Cho, M., Lee, J., Lee, K.M.: Feature correspondence and deformable object matching via agglomerative correspondence clustering. In: ICCV (2009)"},{"key":"51_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-15555-0_36","volume-title":"Computer Vision \u2013 ECCV 2010","author":"M. Cho","year":"2010","unstructured":"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.\u00a06315, pp. 492\u2013505. Springer, Heidelberg (2010)"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Cho, M., Lee, K.M.: Authority-shift clustering: Hierarchical clustering by authority seeking on graphs. In: CVPR (2010)","DOI":"10.1109\/CVPR.2010.5540081"},{"key":"51_CR4","unstructured":"Cho, M., Lee, K.M.: Mode-seeking on graphs via random walks. In: CVPR (2012)"},{"key":"51_CR5","unstructured":"Cho, M., Lee, K.M.: Progressive graph matching: Making a move of graphs via probabilistic voting. In: CVPR (2012)"},{"key":"51_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-88693-8_11","volume-title":"Computer Vision \u2013 ECCV 2008","author":"M. Cho","year":"2008","unstructured":"Cho, M., Shin, Y.M., Lee, K.M.: Co-recognition of image pairs by data-driven monte carlo image exploration. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part IV. LNCS, vol.\u00a05305, pp. 144\u2013157. Springer, Heidelberg (2008)"},{"issue":"5","key":"51_CR7","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/34.1000236","volume":"24","author":"D. Comaniciu","year":"2002","unstructured":"Comaniciu, D., Meer, P.: A robust approach toward feature space analysis. TPAMI\u00a024(5), 603\u2013619 (2002)","journal-title":"TPAMI"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI, 265\u2013298 (2004)","DOI":"10.1142\/S0218001404003228"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. In: CVPR (2009)","DOI":"10.1109\/CVPRW.2009.5206619"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Joulin, A., Ponce., J.: A graph-matching kernel for object categorization. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126445"},{"issue":"2","key":"51_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s11263-005-3964-7","volume":"67","author":"V. Ferrari","year":"2006","unstructured":"Ferrari, V., Tuytelaars, T., Gool, L.V.: Simultaneous object recognition and segmentation from single or multiple model views. IJCV\u00a067(2), 159\u2013188 (2006)","journal-title":"IJCV"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Freedman, D., Kisilev, P.: Fast mean shift by compact density representation. In: CVPR (2009)","DOI":"10.1109\/CVPRW.2009.5206716"},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"Georgescu, B., Shimshoni, I., Meer, R.: Mean shift based clustering in high dimensions: A texture classification example. In: ICCV (2003)","DOI":"10.1109\/ICCV.2003.1238382"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Jouili, S., Tabbone, S., Lacroix, V.: Median graph shift: A new clustering algorithm for graph domain. In: ICPR (2010)","DOI":"10.1109\/ICPR.2010.238"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.M.: Hyper-graph matching via reweighted random walks. In: CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"51_CR16","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV (2005)","DOI":"10.1109\/ICCV.2005.20"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Liu, H., Latecki, L.J., Yan, S.: Fast detection of dense subgraph with iterative shrinking and expansion. TPAMI (2013)","DOI":"10.1109\/TPAMI.2013.16"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"Lowe, D.G.: Object recognition from local scale-invariant features. In: ICCV (1999)","DOI":"10.1109\/ICCV.1999.790410"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Matas, J., Chum, O., Urban, M., Pajdla, T.: Robust wide baseline stereo from maximally stable extremal regions. In: BMVC (2002)","DOI":"10.5244\/C.16.36"},{"key":"51_CR20","doi-asserted-by":"crossref","unstructured":"Mikolajczyk, K., Schmid, C.: Scale and affine invariant interest point detectors. In: IJCV (2004)","DOI":"10.1023\/B:VISI.0000027790.02288.f2"},{"key":"51_CR21","doi-asserted-by":"crossref","unstructured":"Paris, S., Durand, F.: A topological approach to hierarchical segmentation using mean shift. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383228"},{"key":"51_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-540-88688-4_44","volume-title":"Computer Vision \u2013 ECCV 2008","author":"L. Torresani","year":"2008","unstructured":"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.\u00a05303, pp. 596\u2013609. Springer, Heidelberg (2008)"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"51_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-642-33718-5_31","volume-title":"Computer Vision \u2013 ECCV 2012","author":"W. Zhang","year":"2012","unstructured":"Zhang, W., Wang, X., Zhao, D., Tang, X.: Graph degree linkage: agglomerative clustering on a directed graph. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part I. LNCS, vol.\u00a07572, pp. 428\u2013441. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10605-2_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T09:50:57Z","timestamp":1575280257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10605-2_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319106045","9783319106052"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10605-2_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}