{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:17:04Z","timestamp":1742948224069,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030140847"},{"type":"electronic","value":"9783030140854"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-14085-4_22","type":"book-chapter","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T16:39:58Z","timestamp":1550853598000},"page":"276-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimal Component-Hypertrees"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Morimitsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wonder Alexandre Luz","family":"Alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis Jose","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles Ferreira","family":"Gobber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronaldo Fumio","family":"Hashimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,23]]},"reference":[{"issue":"9","key":"22_CR1","doi-asserted-by":"publisher","first-page":"3885","DOI":"10.1109\/TIP.2014.2336551","volume":"23","author":"E Carlinet","year":"2014","unstructured":"Carlinet, E., G\u00e9raud, T.: A comparative review of component tree computation algorithms. IEEE Trans. Image Process. 23(9), 3885\u20133895 (2014)","journal-title":"IEEE Trans. Image Process."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Karatzas, D., Mestre, S.R., Mas, J., Nourbakhsh, F., Roy, P.P.: ICDAR 2011 robust reading competition-challenge 1: reading text in born-digital images (web and email). In: 2011 International Conference on Document Analysis and Recognition (ICDAR), pp. 1485\u20131490. IEEE (2011)","DOI":"10.1109\/ICDAR.2011.295"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-319-18720-4_57","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"A Morimitsu","year":"2015","unstructured":"Morimitsu, A., Alves, W.A.L., Hashimoto, R.F.: Incremental and efficient computation of families of component trees. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 681\u2013692. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18720-4_57"},{"issue":"11","key":"22_CR4","doi-asserted-by":"publisher","first-page":"3531","DOI":"10.1109\/TIP.2006.877518","volume":"15","author":"L Najman","year":"2006","unstructured":"Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Trans. Image Process. 15(11), 3531\u20133539 (2006)","journal-title":"IEEE Trans. Image Process."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Nayef, N., et al.: ICDAR 2017 robust reading challenge on multi-lingual scene text detection and script identification-RRC-MLT. In: 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR), vol. 1, pp. 1454\u20131459. IEEE (2017)","DOI":"10.1109\/ICDAR.2017.237"},{"issue":"6","key":"22_CR6","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1109\/TPAMI.2007.1045","volume":"29","author":"GK Ouzounis","year":"2007","unstructured":"Ouzounis, G.K., Wilkinson, M.H.: Mask-based second-generation connectivity and attribute filters. IEEE Trans. Pattern Anal. Mach. Intell. 29(6), 990\u20131004 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TPAMI.2010.74","volume":"33","author":"GK Ouzounis","year":"2011","unstructured":"Ouzounis, G.K., Wilkinson, M.H.: Hyperconnected attribute filters based on k-flat zones. IEEE Trans. Pattern Anal. Mach. Intell. 33(2), 224\u2013239 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-21569-8_25","volume-title":"Mathematical Morphology and Its Applications to Image and Signal Processing","author":"N Passat","year":"2011","unstructured":"Passat, N., Naegel, B.: Component-hypertrees for image segmentation. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 284\u2013295. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21569-8_25"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/83.663500","volume":"7","author":"P Salembier","year":"1998","unstructured":"Salembier, P., Oliveras, A., Garrido, L.: Antiextensive connected operators for image and sequence processing. IEEE Trans. Image Process. 7(4), 555\u2013570 (1998)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1008324520475","volume":"9","author":"J Serra","year":"1998","unstructured":"Serra, J.: Connectivity on complete lattices. J. Math. Imaging Vis. 9(3), 231\u2013251 (1998)","journal-title":"J. Math. Imaging Vis."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Silva, D.J., Alves, W.A., Morimitsu, A., Hashimoto, R.F.: Efficient incremental computation of attributes based on locally countable patterns in component trees. In: 2016 IEEE International Conference on Image Processing (ICIP), pp. 3738\u20133742. IEEE (2016)","DOI":"10.1109\/ICIP.2016.7533058"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM (JACM) 22(2), 215\u2013225 (1975)","journal-title":"J. ACM (JACM)"},{"issue":"10","key":"22_CR13","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1109\/TPAMI.2007.70836","volume":"30","author":"MH Wilkinson","year":"2008","unstructured":"Wilkinson, M.H., Gao, H., Hesselink, W.H., Jonker, J.E., Meijster, A.: Concurrent computation of attribute filters on shared memory parallel machines. IEEE Trans. Pattern Anal. Mach. Intell. 30(10), 1800\u20131813 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14085-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T01:09:17Z","timestamp":1679188157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14085-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030140847","9783030140854"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14085-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgci2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dgci2019.sciencesconf.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","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":"38","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":"76% - 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":"3","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":"1-2","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}