{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:44:16Z","timestamp":1720640656112},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1571-0653(04)00483-4","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"166-177","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Image Segmentation by Dominant Sets"],"prefix":"10.1016","volume":"12","author":[{"given":"Pavan","family":"Massimiliano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pelillo","family":"Marcello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00483-4_BIB1","series-title":"Computer Vision","author":"Ballard","year":"1982"},{"key":"10.1016\/S1571-0653(04)00483-4_BIB2","series-title":"Computer Vision: A Modern Approach","author":"Forsyth","year":"2002"},{"issue":"10","key":"10.1016\/S1571-0653(04)00483-4_BIB3","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1109\/34.954598","article-title":"Sef-organization in vision: Stochastic clustering for image segmentation, perceptual grouping, and image database organization","volume":"23","author":"Gdalyahu","year":"2001","journal-title":"IEEE Trans. Pattern Anal. Machine Intell"},{"key":"10.1016\/S1571-0653(04)00483-4_BIB4","unstructured":"J. Hofbauer. Imitation dynamics for games. Collegium Budapest, preprint, 1995."},{"key":"10.1016\/S1571-0653(04)00483-4_BIB5","series-title":"Evolutionary Games and Population Dynamics","author":"Hofbauer","year":"1998"},{"key":"10.1016\/S1571-0653(04)00483-4_BIB6","series-title":"Algorithms for Clustering Data","author":"Jain","year":"1988"},{"key":"10.1016\/S1571-0653(04)00483-4_BIB7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Turan","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S1571-0653(04)00483-4_BIB8","unstructured":"M. Pavan, M. Pelillo, and E. Jabara. Towards a generalization of the motzkin-straus theorem to edge-weighted graphs. Technical Report CS-2002-3, Department of Computer Science, University of Venice, Mar. 2002."},{"issue":"8","key":"10.1016\/S1571-0653(04)00483-4_BIB9","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1162\/089976699300016034","article-title":"Replicator equations, maximal cliques, and graph isomorphism","volume":"11","author":"Pelillo","year":"1999","journal-title":"Neural Computation"},{"issue":"11","key":"10.1016\/S1571-0653(04)00483-4_BIB10","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1109\/TPAMI.2002.1046176","article-title":"Matching free trees, maximal cliques, and monotone game dynamics","volume":"24","author":"Pelillo","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Machine Intell"},{"key":"10.1016\/S1571-0653(04)00483-4_BIB11","first-page":"411","article-title":"Feasible and infeasible maxima in a quadratic program for maximum clique","volume":"2","author":"Pelillo","year":"1995","journal-title":"J. Artif. Neural Networks"},{"key":"10.1016\/S1571-0653(04)00483-4_BIB12","doi-asserted-by":"crossref","unstructured":"S. Sarkar and K. L. Boyer. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. In Proc. 1996 Conference on Computer Vision and Pattern Recognition, volume 2059, pages 478-483, 1996.","DOI":"10.1109\/CVPR.1996.517115"},{"issue":"8","key":"10.1016\/S1571-0653(04)00483-4_BIB13","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Machine Intell"},{"key":"10.1016\/S1571-0653(04)00483-4_BIB14","series-title":"Evolutionary Game Theory","author":"Weibull","year":"1995"},{"issue":"11","key":"10.1016\/S1571-0653(04)00483-4_BIB15","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/34.244673","article-title":"An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation","volume":"15","author":"Wu","year":"1993","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004834?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004834?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T10:25:00Z","timestamp":1549794300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":15,"alternative-id":["S1571065304004834"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00483-4","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}