{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:13:49Z","timestamp":1742984029090,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645696"},{"type":"electronic","value":"9783540693543"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055688","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T21:07:35Z","timestamp":1154034455000},"page":"528-543","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Self inducing relational distance and its application to image segmentation"],"prefix":"10.1007","author":[{"given":"Jianbo","family":"Shi","sequence":"first","affiliation":[]},{"given":"Jitendra","family":"Malik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(76)90049-1","volume":"4","author":"H.G. Barrow","year":"1976","unstructured":"H.G. Barrow and R.M. Burstall. Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters, 4:83\u201384, 1976.","journal-title":"Information Processing Letters"},{"key":"33_CR2","first-page":"377","volume":"6","author":"H.G. Barrow","year":"1971","unstructured":"H.G. Barrow and R.J. Popplestone. Relational descriptions in picture processing. Machine Intelligence, 6:377\u2013396, 1971.","journal-title":"Machine Intelligence"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/34.3880","volume":"10","author":"K. Boyer","year":"1988","unstructured":"K. Boyer and A. Kak. Structural stereopsis for 3d vision. IEEE Trans. Pattern Anal. Mach. Intell., 10:144\u2013166, 1988.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"R.W. Brockett. Least squares matching problems. Linear Algebra and its applications, pages 761\u2013777, 1989.","DOI":"10.1016\/0024-3795(89)90675-7"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"R.W. Brockett. Dynamical systems that sorts lists, diagonalize matrices, and solve linear programming problem. Linear Algebra and its applications, pages 79\u201391, 1991.","DOI":"10.1016\/0024-3795(91)90021-N"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/0262-8856(96)01093-1","volume":"14","author":"W. Christmas","year":"1996","unstructured":"W. Christmas, J. Kittle, and M. Petrou. Probabilistic feature labeling schemes \u2014 modeling compatibility coefficient distribution. Image and Vision Computing, 14:617\u2013625, 1996.","journal-title":"Image and Vision Computing"},{"key":"33_CR7","unstructured":"C.E. Cormen, R.L. Leiserson, and L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990."},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TPAMI.1981.4767164","volume":"3","author":"O.D. Faugeras","year":"1981","unstructured":"O.D. Faugeras and K.E. Price. Semantic labeling of aerial images using stochastic relaxation. IEEE Trans. Pattern Anal. Mach. Intell., 3:633\u2013642, 1981.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell., 18:377\u2013388, 1996.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"D.J. Heeger and J.R Bergen. Pyramid-based texture analysis\/synthesis. In SIGGRAPH 95, pages 229\u2013238, 1995.","DOI":"10.1145\/218380.218446"},{"issue":"12","key":"33_CR11","first-page":"1167","volume":"24","author":"A.K. Jain","year":"1991","unstructured":"A.K. Jain and F. Farrokhnia. Unsupervised texture segmentation using gabor filters. IEEE Trans. Pattern Anal. Mach. Intell., 24(12):1167\u20131186, 1991.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"33_CR12","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1364\/JOSAA.7.000923","volume":"7","author":"J. Malik","year":"1990","unstructured":"J. Malik and P. Perona. Preattentive texture discrimination with early vision mechanisms. J. Opt. Soc. Am. A, 7(5):923\u2013932, 1990.","journal-title":"J. Opt. Soc. Am. A"},{"issue":"8","key":"33_CR13","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1109\/34.531803","volume":"18","author":"B.S. Manjunath","year":"1996","unstructured":"B.S. Manjunath and W.Y. Ma. Texture features for browsing and retrieval of image data. IEEE Trans. Pattern Anal. Mach. Intell., 18(8):837\u2013842, 1996.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR14","unstructured":"C.H. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"J. Puzicha, T. Hofmann, and J.M. Buhmann. Non-parametric similarity measures for unsupervised texture segmentation and image retrieval. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, pages 267\u2013272, 1997.","DOI":"10.1109\/CVPR.1997.609331"},{"key":"33_CR16","first-page":"420","volume":"6","author":"A. Rosenfeld","year":"1976","unstructured":"A. Rosenfeld, R. Hummel, and S. Zucker. Scene labeling by relaxation operations. IEEE SMC, 6:420\u2013433, 1976.","journal-title":"IEEE SMC"},{"key":"33_CR17","first-page":"353","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graph. IEEE SMC, 13:353\u2013362, 1983.","journal-title":"IEEE SMC"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"G.L. Scott and H.C. Longuet-Higgins. An algorithm for associating the features of two images. In Proc. R. Soc. Lond. B., pages 21\u201326, 1991.","DOI":"10.1098\/rspb.1991.0045"},{"key":"33_CR19","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TPAMI.1985.4767621","volume":"7","author":"L. Shapiro","year":"1985","unstructured":"L. Shapiro and R.M. Haralick. A metric for comparing relational descriptions. IEEE Trans. Pattern Anal. Mach. Intell., 7:90\u201394, 1985.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR20","unstructured":"J. Shi and J. Malik. Normalized cuts and image segmentation. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, pages 731\u2013737, 1997."},{"issue":"5","key":"33_CR21","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S. Umeyama","year":"1988","unstructured":"S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell., 10(5):695\u2013703, 1988.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR22","first-page":"286","volume":"1","author":"J. Neumann von","year":"1937","unstructured":"J. von Neumann. Some matrix-inequalities and metrization of matric-spaces. Tomsk Univ. Rev., 1:286\u2013300, 1937. also in John von Neumann: Collected Works, (A.H. Taub, Ed.) Vol. IV, Pergamon, New York, 1962, pp 205\u2013218.","journal-title":"Tomsk Univ. Rev."},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"G. Vosselman. Relational Matching. Springer-Verlag, 1992. Lectures in Computer Science, number 628.","DOI":"10.1007\/3-540-55798-9"},{"key":"33_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/34.601251","volume":"19","author":"R.C. Wilson","year":"1997","unstructured":"R.C. Wilson and E.R. Hancock. Structual matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell., 19:1\u20132, 1997.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR25","unstructured":"S.C. Zhu, Y. Wu, and D. Mumford. Frame: Filters, random fields, and minimax entropy. In Proc. IEEE Conf. Computer Vision and Pattern Recognition, pages 686\u2013693, 1996."}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2014 ECCV'98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T03:50:39Z","timestamp":1736481039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645696","9783540693543"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0055688","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"28 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}