{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:38:41Z","timestamp":1725745121746},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402609"},{"type":"electronic","value":"9783642402616"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40261-6_14","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:08:46Z","timestamp":1376644126000},"page":"120-127","source":"Crossref","is-referenced-by-count":3,"title":["Complexity Fusion for Indexing Reeb Digraphs"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Escolano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edwin R.","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Biasotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TPAMI.2006.125","volume":"28","author":"A. Torsello","year":"2006","unstructured":"Torsello, A., Hancock, E.R.: Learning Shape-Classes Using a Mixture of Tree-Unions. IEEE Tran. on Pattern Analysis and Mach. Intelligence\u00a028(6), 954\u2013967 (2006)","journal-title":"IEEE Tran. on Pattern Analysis and Mach. Intelligence"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Torsello, A., Lowe, D.L.: Supervised Learning of a Generative Model for Edge-Weighted Graphs. In: Proc. of ICPR (2008)","DOI":"10.1109\/ICPR.2008.4761285"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Passerini, F., Severini, S.: The von Neumann Entropy of Networks. arXiv:0812.2597v1 (December 2008)","DOI":"10.2139\/ssrn.1382662"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Han, L., Escolano, F., Hancock, E.R., Wilson, R.: Graph Characterizations From Von Neumann Entropy. Pattern Recognition Letters (2012) (in press)","DOI":"10.1016\/j.patrec.2012.03.016"},{"key":"14_CR5","first-page":"186","volume":"188","author":"S. Lloyd","year":"1988","unstructured":"Lloyd, S., Pagels, H.: Complexity as Thermodynamic Depth Ann. Phys.\u00a0188, 186 (1988)","journal-title":"Phys."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"36206","DOI":"10.1103\/PhysRevE.85.036206","volume":"85","author":"F. Escolano","year":"2012","unstructured":"Escolano, F., Hancock, E.R., Lozano, M.A.: Heat Diffusion: Thermodynamic Depth Complexity of Networks. Phys. Rev. E\u00a085, 036206 (2012)","journal-title":"Phys. Rev. E"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-34166-3_21","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Escolano","year":"2012","unstructured":"Escolano, F., Bonev, B., Hancock, E.R.: Heat Flow-Thermodynamic Depth Complexity in Directed Networks. In: Gimel\u2019farb, G., Hancock, E., Imiya, A., Kuijper, A., Kudo, M., Omachi, S., Windeatt, T., Yamada, K. (eds.) SSPR & SPR 2012. LNCS, vol.\u00a07626, pp. 190\u2013198. Springer, Heidelberg (2012)"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.cviu.2012.11.007","volume":"117","author":"B. Bonev","year":"2013","unstructured":"Bonev, B., Escolano, F., Giorgi, D., Biasotti, S.: Information-theoretic Selection of High-dimensional Spectral Features for Structural Recognition. Computer Vision and Image Understanding\u00a0117(3), 214\u2013228 (2013)","journal-title":"Computer Vision and Image Understanding"},{"key":"14_CR9","first-page":"847","volume":"222","author":"G. Reeb","year":"1946","unstructured":"Reeb, G.: Sur les points singuliers d\u2019une forme de Pfaff compl\u00e8tement int\u00e9grable ou d\u2019une fonction num\u00e9rique. Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences\u00a0222, 847\u2013849 (1946)","journal-title":"Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences"},{"issue":"1-3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2007.10.018","volume":"392","author":"S. Biasotti","year":"2008","unstructured":"Biasotti, S., Giorgi, D., Spagnuolo, M., Falcidieno, B.: Reeb graphs for shape analysis and applications. Theoretical Computer Science\u00a0392(1-3), 5\u201322 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"14_CR11","first-page":"31","volume":"7","author":"S. Biasotti","year":"2005","unstructured":"Biasotti, S.: Topological coding of surfaces with boundary using Reeb graphs. Computer Graphics and Geometry\u00a07(3), 31\u201345 (2005)","journal-title":"Computer Graphics and Geometry"},{"key":"14_CR12","unstructured":"Biasotti, S.: Computational Topology Methods for Shape Modelling Applications. PhD Thesis, Universit\u00e1 degli Studi di Genova (May 2004)"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1391729.1391731","volume":"40","author":"S. Biasotti","year":"2008","unstructured":"Biasotti, S., De Floriani, L., Falcidieno, B., Frosini, P., Giorgi, D., Landi, C., Papaleo, L., Spagnuolo, M.: Describing shapes by geometrical-topological properties of real functions. ACM Comput. Surv.\u00a040(4), 1\u201387 (2008)","journal-title":"ACM Comput. Surv."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology Matching for Fully Automatic Similarity Estimation of 3D Shapes. In: Proc. of SIGGRAPH 2001, pp. 203\u2013212 (2001)","DOI":"10.1145\/383259.383282"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Belkin, M., Sun, J., Wang, Y.: Discrete Laplace Operator for Meshed Surfaces. In: Proc. Symposium on Computational Geometry, pp. 278\u2013287 (2008)","DOI":"10.1145\/1377676.1377725"},{"issue":"5","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1137\/050639296","volume":"28","author":"A.M. Bronstein","year":"2006","unstructured":"Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Efficient Computation of Isometry-Invariant Distances Between Surfaces. SIAM J. Sci. Comput.\u00a028(5), 1812\u20131836 (2006)","journal-title":"SIAM J. Sci. Comput."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-005-0237-z","volume":"9","author":"F. Chung","year":"2005","unstructured":"Chung, F.: Laplacians and the Cheeger Inequailty for Directed Graphs. Annals of Combinatorics\u00a09, 1\u201319 (2005)","journal-title":"Annals of Combinatorics"},{"key":"14_CR18","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bring Order to the Web (Technical Report). Stanford University (1998)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Johns, J., Mahadevan, S.: Constructing Basic Functions from Directed Graphs for Value Functions Approximation. In: Proc. of ICML (2007)","DOI":"10.1145\/1273496.1273545"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning from Labeled and Unlabeled Data on a Directed Graph. In: Proc. of ICML (2005)","DOI":"10.1145\/1102351.1102482"},{"key":"14_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/11564096_65","volume-title":"Machine Learning: ECML 2005","author":"R. Nock","year":"2005","unstructured":"Nock, R., Nielsen, F.: Fitting the Smallest Enclosing Bregman Ball. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol.\u00a03720, pp. 649\u2013656. Springer, Heidelberg (2005)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Tsang, I.W., Kocsor, A., Kwok, J.T.: Simple Core Vector Machines with Enclosing Balls. In: Proc. of ICLM (2007)","DOI":"10.1145\/1273496.1273611"},{"key":"14_CR23","unstructured":"Giorgi, D., Biasotti, S., Paraboschi, L.: SHape Retrieval Contest: Watertight Models Track, \n                  \n                    http:\/\/watertight.ge.imati.cnr.it"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40261-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:40:12Z","timestamp":1558028412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40261-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402609","9783642402616"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40261-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}