{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:44Z","timestamp":1759847684089,"version":"3.40.5"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T00:00:00Z","timestamp":1425081600000},"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":["Appl Intell"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10489-015-0646-1","type":"journal-article","created":{"date-parts":[[2015,2,27]],"date-time":"2015-02-27T03:05:42Z","timestamp":1425006342000},"page":"325-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A novel clique formulation for the visual feature matching problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Pablo","family":"San Segundo","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Artieda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,28]]},"reference":[{"key":"646_CR1","volume-title":"Computer vision","author":"DH Ballard","year":"1982","unstructured":"Ballard DH, Brown M (1982) Computer vision. Prentice-Hall, New York"},{"key":"646_CR2","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds), New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"646_CR3","doi-asserted-by":"crossref","unstructured":"Tomita E, Seki T (2003) An efficient branch and bound algorithm for finding a maximum clique. In: Calude C, Dinneen M, Vajnovszki V (eds) Discrete mathematics and theoretical computer science, vol 2731. LNCS, pp 278\u2013289","DOI":"10.1007\/3-540-45066-1_22"},{"key":"646_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume":"5942","author":"E Tomita","year":"2010","unstructured":"Tomita E, Sutani Y, Higashi T, Takahashi S, Wakatsuki M (2010) A simple and faster branch-and-bound algorithm for finding a maximum clique. Lect Notes Comput Sci 5942:191\u2013 203","journal-title":"Lect Notes Comput Sci"},{"key":"646_CR5","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc J, Jane\u010di\u010d D (2007) An improved branch and bound algorithm for the maximum clique problem. MATCH Commun Math Comput Chem 58:569\u2013590","journal-title":"MATCH Commun Math Comput Chem"},{"issue":"2","key":"646_CR6","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"P San Segundo","year":"2011","unstructured":"San Segundo P, Rodriguez-Losada D, Jimenez A (2011) An exact bit-parallel algorithm for the maximum clique problem. Comput Oper Res 38(2):571\u2013581","journal-title":"Comput Oper Res"},{"issue":"3","key":"646_CR7","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s11590-011-0431-y","volume":"7","author":"P San Segundo","year":"2011","unstructured":"San Segundo P, Matia F, Rodriguez-Losada D, Hernando M (2011) An improved bit parallel exact maximum clique algorithm. Optimization Letters 7(3):467\u2013479","journal-title":"Optimization Letters"},{"key":"646_CR8","unstructured":"Li CM, Quan Z (2010) An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem. AAAI, pp 128\u2013133"},{"key":"646_CR9","doi-asserted-by":"crossref","unstructured":"Li CM, Fang Z, Xu K (2013) Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem. In: 2013 IEEE 25th international conference on tools with articial intelligence (ICTAI), pp 939\u2013946","DOI":"10.1109\/ICTAI.2013.143"},{"issue":"2","key":"646_CR10","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10878-012-9592-6","volume":"27","author":"M Batsyn","year":"2014","unstructured":"Batsyn M, Goldengorin B, Maslov E, Pardalos P (2014) Improvements to MCS algorithm for the maximum clique problem. J Comb Optim 27(2):397\u2013416","journal-title":"J Comb Optim"},{"key":"646_CR11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.cor.2013.10.018","volume":"44","author":"P San Segundo","year":"2014","unstructured":"San Segundo P, Tapia C (2014) Relaxed approximate coloring in exact maximum clique search. Comput Oper Res 44:185\u2013192","journal-title":"Comput Oper Res"},{"issue":"4","key":"646_CR12","doi-asserted-by":"crossref","first-page":"545","DOI":"10.3390\/a5040545","volume":"5","author":"P Prosser","year":"2012","unstructured":"Prosser P (2012) Exact algorithms for maximum clique: a computational study. Algorithms 5(4):545\u2013587","journal-title":"Algorithms"},{"issue":"1","key":"646_CR13","first-page":"159","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Int Res 25(1):159\u2013185","journal-title":"J Artif Int Res"},{"issue":"4","key":"646_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade DV, Resende MGC, Werneck RF (2012) Fast local search for the maximum independent set problem. J Heuristics 18(4):525\u2013547","journal-title":"J Heuristics"},{"issue":"1","key":"646_CR15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s10878-011-9437-8","volume":"26","author":"Q Wu","year":"2013","unstructured":"Wu Q, Hao JK (2013) An adaptive multistart tabu search approach to solve the maximum clique problem. J Comb Optim 26(1):86\u2013108","journal-title":"J Comb Optim"},{"key":"646_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko S, Wilhelm WE (2006) Clique-detection models in computational biochemistry and genomics. Eur J Oper Res 173:1\u201317","journal-title":"Eur J Oper Res"},{"key":"646_CR17","first-page":"57","volume":"44","author":"K Hotta","year":"2003","unstructured":"Hotta K, Tomita E, Takahashi H (2003) Aview invariant human FACE detection method based on maximum cliques. Trans IPSJ 44:57\u201370. SIG14 (TOM9)","journal-title":"Trans IPSJ"},{"issue":"3","key":"646_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10489-008-0147-6","volume":"32","author":"P San Segundo","year":"2010","unstructured":"San Segundo P, Rodriguez-Losada D, Matia F, Galan R (2010) Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver. Appl Intell 32(3):311\u2013 329","journal-title":"Appl Intell"},{"issue":"5","key":"646_CR19","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1109\/TRO.2013.2264869","volume":"29","author":"P San Segundo","year":"2013","unstructured":"San Segundo P, Rodriguez-Losada D (2013) Robust global feature based data association with a sparse bit optimized maximum clique algorithm. IEEE Trans Robot 29(5):1332\u20131339","journal-title":"IEEE Trans Robot"},{"issue":"3","key":"646_CR20","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula DW (1983) Smallest-Last ordering and clustering and graph coloring algorithms. J Assoc Comput Mach 30(3):417\u2013 427","journal-title":"J Assoc Comput Mach"},{"key":"646_CR21","unstructured":"BBMC 1.0. http:\/\/intelligentcontrol.disam.etsii.upm.es\/arabot\/sites\/default\/files\/frontpage"},{"issue":"4","key":"646_CR22","first-page":"143","volume":"3","author":"L Juan","year":"2009","unstructured":"Juan L, Gwun O (2009) A comparison of sift, pca-sift and surf. Int J Image Process (IJIP) 3(4):143\u2013152","journal-title":"Int J Image Process (IJIP)"},{"key":"646_CR23","doi-asserted-by":"crossref","unstructured":"Zhang W, Kosecka J (2006) Generalized ransac framework for relaxed correspondence problems. In: Third international symposium on 3D data processing, visualization, and transmission. IEEE, pp 854\u2013860","DOI":"10.1109\/3DPVT.2006.67"},{"key":"646_CR24","doi-asserted-by":"crossref","unstructured":"Huber PJ (1981) Robust statistics. Wiley","DOI":"10.1002\/0471725250"},{"key":"646_CR25","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1080\/01621459.1984.10477105","volume":"79","author":"PJ Rousseeuw","year":"1984","unstructured":"Rousseeuw PJ (1984) Least median of squares regression. J Am Stat Assoc 79:871\u2013880","journal-title":"J Am Stat Assoc"},{"issue":"6","key":"646_CR26","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":"2","key":"646_CR27","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"D Lowe","year":"2004","unstructured":"Lowe D (2004) Distinctive image features from scale-invariant keypoints. Int J Comput Vis 60(2):91\u2013110","journal-title":"Int J Comput Vis"},{"issue":"3","key":"646_CR28","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1007927408552","volume":"24","author":"S Choi","year":"1997","unstructured":"Choi S, Kim T, Yu W (1997) Performance evaluation of RANSAC family. J Comput Vis 24(3):271\u2013300","journal-title":"J Comput Vis"},{"key":"646_CR29","doi-asserted-by":"crossref","unstructured":"Lacey AJ, Pinitkarn N, Thacker AN (2000) An evaluation of the performance of RANSAC algorithms for stereo camera calibrarion. BMVC","DOI":"10.5244\/C.14.65"},{"key":"646_CR30","doi-asserted-by":"crossref","unstructured":"Hartley R, Zisserman A (2003) Multiple view geometry in computer vision. Cambridge University Press","DOI":"10.1017\/CBO9780511811685"},{"key":"646_CR31","first-page":"147","volume":"15","author":"C Harris","year":"1988","unstructured":"Harris C, Stephens M (1988) A combined corner and edge detector. Proc 4th Alvey Vision Conference 15:147\u2013151","journal-title":"Proc 4th Alvey Vision Conference"},{"key":"646_CR32","doi-asserted-by":"crossref","unstructured":"Bay H, Tuytelaars T, Van Gool L (2006) Surf: speeded up robust features. Computer Vision\u2013ECCV, pp 404\u2013417","DOI":"10.1007\/11744023_32"},{"issue":"3","key":"646_CR33","first-page":"175","volume":"14","author":"A Gruen","year":"1985","unstructured":"Gruen A (1985) Adaptive least squares correlation: a powerful image matching technique. S Afr J Photogr, Remote Sens Cartogr 14(3):175\u2013187","journal-title":"S Afr J Photogr, Remote Sens Cartogr"},{"issue":"3","key":"646_CR34","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman JH, Bentley JL, Finkel R (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw (TOMS) 3(3):209\u2013226","journal-title":"ACM Trans Math Softw (TOMS)"},{"issue":"8","key":"646_CR35","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/S0262-8856(97)00010-3","volume":"15","author":"P Torr","year":"1997","unstructured":"Torr P, Zisserman A (1997) Robust parameterization and computation of the trifocal tensor. Image Vis Comput 15(8):591\u2013605","journal-title":"Image Vis Comput"},{"key":"646_CR36","doi-asserted-by":"crossref","unstructured":"Armstrong M, Zisserman A, Hartley R (1996) Self-calibration from image triplets. European Conference on Computer Vision (ECCV\u201996), pp 1\u201316","DOI":"10.1007\/BFb0015519"},{"key":"646_CR37","doi-asserted-by":"crossref","unstructured":"Beardsley P, Torr P, Zisserman A (1996) 3D model acquisition from extended image sequences. Computer Vision\u2014 European Conference on Computer Vision ECCV \u201996, pp 683\u2013695","DOI":"10.1007\/3-540-61123-1_181"},{"key":"646_CR38","doi-asserted-by":"crossref","unstructured":"Triggs B, McLauchlan PF, Hartley R, Fitzgibbon A (2000) Bundle adjustment\u2014A modern synthesis. Vision Algorithms: Theory and Practice, pp 298\u2013372","DOI":"10.1007\/3-540-44480-7_21"},{"issue":"1","key":"646_CR39","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1006\/cviu.1999.0832","volume":"78","author":"P Torr","year":"2000","unstructured":"Torr P, Zisserman A (2000) MLESAC: a new robust estimator with application to estimating image geometry. Comp Vision Image Underst (CVIU) 78 (1):138\u2013156","journal-title":"Comp Vision Image Underst (CVIU)"},{"issue":"2","key":"646_CR40","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MRA.2012.2182810","volume":"19","author":"F Fraundorfer","year":"2012","unstructured":"Fraundorfer F, Scaramuzza D (2012) Visual odometry: Part II: Matching, robustness, optimization, and applications. IEEE Robot Autom Mag 19(2):78\u201390","journal-title":"IEEE Robot Autom Mag"},{"issue":"1","key":"646_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1486525.1486527","volume":"36","author":"MIA Lourakis","year":"2009","unstructured":"Lourakis MIA, Argyros AA (2009) SBA: a software package for generic sparse bundle adjustment. ACM Trans Math Software 36(1):1\u201330","journal-title":"ACM Trans Math Software"},{"key":"646_CR42","unstructured":"Muja M, Lowe DG (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: International conference on computer vision theory and applications, VISAPP, vol 1, pp 331\u2013340"},{"key":"646_CR43","doi-asserted-by":"crossref","unstructured":"Yan K, Sukthankar R (2004) PCA-SIFT: a more distinctive representation for local image descriptors. Computer Vision and Pattern Recognition, 2","DOI":"10.1109\/CVPR.2004.1315206"},{"issue":"1","key":"646_CR44","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/B:VISI.0000027790.02288.f2","volume":"60","author":"K Mikolajczyk","year":"2004","unstructured":"Mikolajczyk K, Schmid C (2004) Scale & affine invariant interest point detectors. Int J Comput Vis 60 (1):63\u201386","journal-title":"Int J Comput Vis"},{"key":"646_CR45","unstructured":"Heligrande, Reduced and Skycam dataset. http:\/\/venus.elai.upm.es\/datasets\/"},{"key":"646_CR46","unstructured":"Alberta University Radish dataset. http:\/\/cres.usc.edu\/radishrepository\/view-one.php?name=ualberta-csc-flr3-vision"},{"key":"646_CR47","unstructured":"University of Oxford Visual Geometry Group datasets. http:\/\/www.robots.ox.ac.uk\/~vgg\/data1.html"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0646-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-015-0646-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0646-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:23:26Z","timestamp":1747715006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-015-0646-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,28]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["646"],"URL":"https:\/\/doi.org\/10.1007\/s10489-015-0646-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2015,2,28]]}}}