{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:15:58Z","timestamp":1743056158969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030891305"},{"type":"electronic","value":"9783030891312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89131-2_11","type":"book-chapter","created":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T06:18:05Z","timestamp":1635574685000},"page":"120-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Building Hierarchical Tree Representations Using Homological-Based Tools"],"prefix":"10.1007","author":[{"given":"Fernando","family":"D\u00edaz-del-R\u00edo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Sanchez-Cuevas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helena","family":"Molina-Abril","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Real","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda Jos\u00e9","family":"Moron-Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,31]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.3390\/jimaging4020033","volume":"4","author":"P Bosilj","year":"2018","unstructured":"Bosilj, P., Kijak, E., Lef\u00e8vre, S.: Partition and inclusion hierarchies of images: a comprehensive survey. J. Imaging 4, 33 (2018)","journal-title":"J. Imaging"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10851-017-0768-7","volume":"60","author":"J Cousty","year":"2018","unstructured":"Cousty, J., et al.: Hierarchical segmentations with graphs: quasi-flat zones, minimum spanning trees, and saliency maps. JMIV 60(4), 479\u2013502 (2018)","journal-title":"JMIV"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-38294-9_10","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"J Havel","year":"2013","unstructured":"Havel, J., Merciol, F., Lef\u00e8vre, S.: Efficient schemes for computing $$\\alpha $$-tree representations. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 111\u2013122. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38294-9_10"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s11554-016-0604-0","volume":"16","author":"J Havel","year":"2016","unstructured":"Havel, J., Merciol, F., Lef\u00e8vre, S.: Efficient tree construction for multiscale image representation and processing. J. Real-Time Image Proc. 16(4), 1129\u20131146 (2016). https:\/\/doi.org\/10.1007\/s11554-016-0604-0","journal-title":"J. Real-Time Image Proc."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-20867-7_20","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"J You","year":"2019","unstructured":"You, J., Trager, S.C., Wilkinson, M.H.F.: A fast, memory-efficient alpha-tree algorithm using flooding and tree size estimation. In: Burgeth, B., Kleefeld, A., Naegel, B., Passat, N., Perret, B. (eds.) ISMM 2019. LNCS, vol. 11564, pp. 256\u2013267. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20867-7_20"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-30503-3_27","volume-title":"Combinatorial Image Analysis","author":"V Kovalevsky","year":"2004","unstructured":"Kovalevsky, V.: Algorithms in digital geometry based on cellular topology. In: Klette, R., \u017duni\u0107, J. (eds.) IWCIA 2004. LNCS, vol. 3322, pp. 366\u2013393. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30503-3_27"},{"issue":"11","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1016\/j.patrec.2012.01.014","volume":"33","author":"H Molina-Abril","year":"2012","unstructured":"Molina-Abril, H., Real, P.: Homological optimality in discrete morse theory through chain homotopies. Pattern Recogn. Lett. 33(11), 1501\u20131506 (2012)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10472-012-9297-7","volume":"64","author":"H Molina-Abril","year":"2012","unstructured":"Molina-Abril, H., Real, P.: Homological spanning forest framework for 2D image analysis. Ann. Math. Artif. Intell. 64(4), 385\u2013409 (2012)","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-38294-9_12","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"L Najman","year":"2013","unstructured":"Najman, L., Cousty, J., Perret, B.: Playing with kruskal: algorithms for morphological trees in edge-weighted graphs. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 135\u2013146. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38294-9_12"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-030-10828-1_7","volume-title":"Computational Topology in Image Context","author":"F D\u00edaz del R\u00edo","year":"2019","unstructured":"D\u00edaz del R\u00edo, F., Molina-Abril, H., Real, P.: Computing the component-labeling and the adjacency tree of a binary digital image in near logarithmic-time. In: Marfil, R., Calder\u00f3n, M., D\u00edaz del R\u00edo, F., Real, P., Bandera, A. (eds.) CTIC 2019. LNCS, vol. 11382, pp. 82\u201395. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10828-1_7"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.patrec.2019.11.039","volume":"131","author":"F Diaz-del Rio","year":"2020","unstructured":"Diaz-del Rio, F., et al.: Parallel connected-component-labeling based on homotopy trees. Pattern Recogn. Lett. 131, 71\u201378 (2020)","journal-title":"Pattern Recogn. Lett."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/S0019-9958(74)90696-2","volume":"26","author":"A Rosenfeld","year":"1974","unstructured":"Rosenfeld, A.: Adjacency in digital pictures. Inform. Control 26, 24\u201333 (1974)","journal-title":"Inform. Control"},{"issue":"7","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1109\/TPAMI.2007.70817","volume":"30","author":"P Soille","year":"2008","unstructured":"Soille, P.: Constrained connectivity for hierarchical image partitioning and simplification. IEEE PAMI 30(7), 1132\u20131145 (2008)","journal-title":"IEEE PAMI"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89131-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T06:19:08Z","timestamp":1635574748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89131-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030891305","9783030891312"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89131-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Analysis of Images and Patterns","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caip2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cyprusconferences.org\/caip2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyAcademia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"129","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}