{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T17:22:59Z","timestamp":1712078579813},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T00:00:00Z","timestamp":1432771200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10044-015-0486-y","type":"journal-article","created":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T08:21:54Z","timestamp":1432714914000},"page":"201-213","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Correspondence consensus of two sets of correspondences through optimisation functions"],"prefix":"10.1007","volume":"20","author":[{"given":"Carlos Francisco","family":"Moreno-Garc\u00eda","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,28]]},"reference":[{"issue":"1\u20132","key":"486_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The Hungarian method for the assignment problem export. Naval Res Logist Q 2(1\u20132):83\u201397","journal-title":"Naval Res Logist Q"},{"issue":"6","key":"486_CR2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"MA Fischler","year":"1981","unstructured":"Fischler MA, Bolles RC (1981) Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun ACM 24(6):381\u2013395","journal-title":"Commun ACM"},{"issue":"7","key":"486_CR3","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H (2009) Approximate graph edit distance computation by means of bipartite graph matching. Image Vis Comput 27(7):950\u2013959","journal-title":"Image Vis Comput"},{"key":"486_CR4","doi-asserted-by":"crossref","first-page":"2029","DOI":"10.1016\/j.patrec.2012.04.008","volume":"33","author":"G Sanrom\u00e0","year":"2012","unstructured":"Sanrom\u00e0 G, Alqu\u00e9zar R, Serratosa F, Herrera B (2012) Smooth point-set registration using neighbouring constraints. Pattern Recogn Lett 33:2029\u20132037","journal-title":"Pattern Recogn Lett"},{"issue":"2","key":"486_CR5","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.cviu.2011.10.009","volume":"116","author":"G Sanrom\u00e0","year":"2012","unstructured":"Sanrom\u00e0 G, Alqu\u00e9zar R, Serratosa F (2012) A new graph matching method for point-set correspondence using the EM algorithm and softassign. Comput Vis Image Underst 116(2):292\u2013304","journal-title":"Comput Vis Image Underst"},{"issue":"1","key":"486_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.eswa.2014.07.051","volume":"42","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s X, Serratosa F (2015) An interactive method for the image alignment problem based on partially supervised correspondence. Expert Syst Appl 42(1):179\u2013192","journal-title":"Expert Syst Appl"},{"issue":"2","key":"486_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00129684","volume":"9","author":"C Tomasi","year":"1992","unstructured":"Tomasi C, Kanade T (1992)\u00a0Shape and motion from image streams under orthography: a factorization method.\u00a0Int J Comput Vis\u00a09(2):137\u2013154","journal-title":"Int J Comput Vis"},{"key":"486_CR8","first-page":"695","volume":"13","author":"W Han","year":"2005","unstructured":"Han W, Brady M (2005) Real-time corner detection algorithm for motion estimation. Image Vis Comput 13:695\u2013703","journal-title":"Image Vis Comput"},{"key":"486_CR9","doi-asserted-by":"crossref","unstructured":"Rosten E, Drummond T (2006) Machine learning for high-speed corner detection. In: European conference on computer vision, vol. 1, pp. 430\u2013443","DOI":"10.1007\/11744023_34"},{"issue":"10","key":"486_CR10","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1109\/TPAMI.2005.188","volume":"27","author":"K Mikolajczyk","year":"2005","unstructured":"Mikolajczyk K, Schmid C (2005) A performance evaluation of local descriptors. IEEE Trans Pattern Anal Mach Intell 27(10):1615\u20131630","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"486_CR11","doi-asserted-by":"crossref","unstructured":"Lowe DG (1999) Object recognition from local scale-invariant features. In: Proceedings of the international conference on computer vision 2, pp. 1150\u20131157","DOI":"10.1109\/ICCV.1999.790410"},{"issue":"3","key":"486_CR12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.cviu.2007.09.014","volume":"110","author":"H Bay","year":"2008","unstructured":"Bay H, Ess A, Tuytelaars T, Gool LV (2008) SURF: speeded up robust features. Comput Vis Image Underst 110(3):346\u2013359","journal-title":"Comput Vis Image Underst"},{"key":"486_CR13","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa F (2014) Fast computation of bipartite graph matching. Pattern Recogn Lett 45:244\u2013250","journal-title":"Pattern Recogn Lett"},{"key":"486_CR14","doi-asserted-by":"crossref","unstructured":"Serratosa F (2015) Speeding up fast bipartite graph matching trough a new cost matrix. Int J Pattern Recognit Artif Intell 29(2)","DOI":"10.1142\/S021800141550010X"},{"issue":"4","key":"486_CR15","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1016\/j.patcog.2014.10.033","volume":"48","author":"F Serratosa","year":"2015","unstructured":"Serratosa F, Cort\u00e9s X (2015) Interactive graph-matching using active query strategies. Pattern Recognit 48(4):1360\u20131369","journal-title":"Pattern Recognit"},{"key":"486_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.patrec.2013.08.010","volume":"43","author":"R Timoftea","year":"2014","unstructured":"Timoftea R, Gool LV (2014) Adaptive and weighted collaborative representations for image classification. Pattern Recognit Lett 43:127\u2013135","journal-title":"Pattern Recognit Lett"},{"key":"486_CR17","volume-title":"Weighted mean of a pair of clusterings, pattern analysis applications","author":"F Franek","year":"2012","unstructured":"Franek F, Jiang X, He C (2012) Weighted mean of a pair of clusterings, pattern analysis applications. Springer, New York"},{"key":"486_CR18","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.patcog.2010.09.008","volume":"44","author":"S Mimaroglu","year":"2010","unstructured":"Mimaroglu S, Erdil E (2010) Combining multiple clusterings using similarity graphs. Pattern Recognit 44:694\u2013703","journal-title":"Pattern Recognit"},{"key":"486_CR19","doi-asserted-by":"crossref","first-page":"1604","DOI":"10.1016\/j.patrec.2011.05.003","volume":"32","author":"L Murino","year":"2011","unstructured":"Murino L, Angelini C, De Feis I, Raiconi G, Tagliaferri R (2011) Beyond classical consensus clustering: the least squares approach to multiple solutions. Pattern Recognit Lett 32:1604\u20131612","journal-title":"Pattern Recognit Lett"},{"issue":"1\u20132","key":"486_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/A:1023949509487","volume":"52","author":"S Monti","year":"2003","unstructured":"Monti S, Tamayo P, Mesirov JP, Golub TR (2003) Consensus clustering: a resampling-based method for class discovery and visualization of gene expression microarray data. Mach Learn 52(1\u20132):91\u2013118","journal-title":"Mach Learn"},{"key":"486_CR21","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-28650-9_5","volume-title":"Unsupervised learning. Advanced lectures on machine learning","author":"Z Ghahramani","year":"2004","unstructured":"Ghahramani Z (2004) Unsupervised learning. Advanced lectures on machine learning. Springer, New York, pp 72\u2013112"},{"key":"486_CR22","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C Papadimitriou","year":"1998","unstructured":"Papadimitriou C, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover Publications, Prentice Hall"},{"issue":"1","key":"486_CR23","first-page":"1","volume":"27","author":"A Sol\u00e9","year":"2013","unstructured":"Sol\u00e9 A, Serratosa F (2013) Graduated assignment algorithm for multiple graph matching based on a common labelling. Int J Pattern Recognit Artif Intell 27(1):1\u201327","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"7","key":"486_CR24","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1016\/j.cviu.2010.12.007","volume":"115","author":"A Sol\u00e9","year":"2011","unstructured":"Sol\u00e9 A, Serratosa F (2011) Models and algorithms for computing the common labelling of a set of attributed graphs. Comput Vis Image Underst 115(7):929\u2013945","journal-title":"Comput Vis Image Underst"},{"issue":"9","key":"486_CR25","doi-asserted-by":"crossref","first-page":"2003","DOI":"10.1016\/j.patcog.2009.01.034","volume":"42","author":"M Ferrer","year":"2009","unstructured":"Ferrer M, Valveny E, Serratosa F (2009) Median graphs: a genetic approach based on new theoretical properties. Pattern Recogn 42(9):2003\u20132012","journal-title":"Pattern Recogn"},{"issue":"5","key":"486_CR26","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.patrec.2008.12.014","volume":"30","author":"M Ferrer","year":"2009","unstructured":"Ferrer M, Valveny E, Serratosa F (2009) Median graph: a new exact algorithm using a distance based on the maximum common subgraph. Pattern Recogn Lett 30(5):579\u2013588","journal-title":"Pattern Recogn Lett"},{"key":"486_CR27","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1109\/TPAMI.2008.242","volume":"31","author":"AK Jain","year":"2009","unstructured":"Jain AK, Feng J (2009) Latent palmprint matching. IEEE Trans Pattern Anal Mach Intell 31:1032\u20131047","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"486_CR28","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1016\/j.eswa.2012.10.071","volume":"40","author":"F Serratosa","year":"2013","unstructured":"Serratosa F, Cort\u00e9s X, Sol\u00e9 A (2013) Component retrieval based on a database of graphs for hand-written electronic-scheme digitalisation. Expert Syst Appl 40:2493\u20132502","journal-title":"Expert Syst Appl"},{"key":"486_CR29","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.patrec.2015.01.009","volume":"56","author":"X Cort\u00e9s","year":"2015","unstructured":"Cort\u00e9s X, Serratosa F (2015) Learning graph-matching edit-costs based on the optimality of the oracle\u2019s node correspondences. Pattern Recogn Lett 56:22\u201329","journal-title":"Pattern Recogn Lett"},{"key":"486_CR30","doi-asserted-by":"crossref","unstructured":"Moreno-Garc\u00eda CF, Serratosa F (2014) Weighted mean assignment of a pair of correspondences using optimisation functions. In: Syntactic Structural Pattern Recognition, S+SSPR 2014, Finland","DOI":"10.1007\/978-3-662-44415-3_31"},{"key":"486_CR31","doi-asserted-by":"crossref","unstructured":"Sol\u00e9 A, Serratosa F, Sanfeliu A (2012) On the graph edit distance cost: properties and applications. Int J Pattern Recognit Artif Intell 26(5)","DOI":"10.1142\/S021800141260004X"},{"key":"486_CR32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.datak.2012.06.003","volume":"85","author":"S Saha","year":"2013","unstructured":"Saha S, Ekbal A (2013) Combining multiple classifiers using vote based classifier ensemble technique for named entity recognition. Data Knowl Eng 85:15\u201339","journal-title":"Data Knowl Eng"},{"key":"486_CR33","doi-asserted-by":"crossref","unstructured":"Funada J et al (1998) Feature extraction method for palmprint considering elimination of creases. In: Proceedings of 14th international conference on pattern recognition, pp. 1849\u20131854","DOI":"10.1109\/ICPR.1998.712091"},{"issue":"5","key":"486_CR34","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TPAMI.2010.164","volume":"33","author":"J Dai","year":"2011","unstructured":"Dai J, Zhou J (2011) Multifeature-based high-resolution palmprint recognition. IEEE Trans Pattern Anal Mach Intell 33(5):945\u2013957","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"8","key":"486_CR35","doi-asserted-by":"crossref","first-page":"1618","DOI":"10.1109\/TPAMI.2011.237","volume":"34","author":"J Dai","year":"2012","unstructured":"Dai J, Feng J, Zhou J (2012) Robust and efficient ridge based palmprint matching. IEEE Trans Pattern Anal Mach Intell 34(8):1618\u20131632","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"486_CR36","unstructured":"http:\/\/www.featurespace.org . Accessed 21 May 2015"},{"key":"486_CR37","unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/databases\/ . Accessed 21 May 2015"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-015-0486-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-015-0486-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-015-0486-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-015-0486-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T16:39:20Z","timestamp":1566751160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-015-0486-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,28]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["486"],"URL":"https:\/\/doi.org\/10.1007\/s10044-015-0486-y","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,28]]}}}