{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T00:45:26Z","timestamp":1777077926971,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031048807","type":"print"},{"value":"9783031048814","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-04881-4_41","type":"book-chapter","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T15:02:54Z","timestamp":1650898974000},"page":"515-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Topological Disparity Characterization of\u00a0Square-Pixel Binary Image Data by\u00a0a\u00a0Labeled Bipartite Graph"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Sanchez-Cuevas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Real","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"D\u00edaz-del-R\u00edo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helena","family":"Molina-Abril","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":[[2022,4,26]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Boutry, N., Gonz\u00e1lez-D\u00edaz, R., Jim\u00e9nez, M., Paluzo-Hidalgo, E.: Strong euler well-composedness. J. Comb. Optim. (2021)","DOI":"10.1007\/s10878-021-00837-8"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Boutry, N., G\u00e9raud, T., Najman, L.: A tutorial on well-composedness. J. Math. Imaging Vision 60 (2018)","DOI":"10.1007\/s10851-017-0769-6"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Chao, Y., Kang, S., Yao, B., Zhao, X., He, L.: An efficient euler number computing algorithm. In: 2015 IEEE International Conference on Information and Automation (2015)","DOI":"10.1109\/ICInfA.2015.7279463"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Chen, S.y., Cai, H., Wang, X., Xia, M., Wang, Y.: Entropy-based maximally stable extremal regions for robust feature detection. Math. Probl. Eng. 2012, 857210 (2012)","DOI":"10.1155\/2012\/857210"},{"issue":"11","key":"41_CR5","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/0167-8655(93)90148-7","volume":"14","author":"F Chiavetta","year":"1993","unstructured":"Chiavetta, F., Di Ges\u00f9, V.: Parallel computation of the euler number via connectivity graph. Pattern Recogn. Lett. 14(11), 849\u2013859 (1993)","journal-title":"Pattern Recogn. Lett."},{"issue":"9","key":"41_CR6","doi-asserted-by":"publisher","first-page":"2725","DOI":"10.1109\/TIP.2015.2425540","volume":"24","author":"L He","year":"2015","unstructured":"He, L., Chao, Y.: A very fast algorithm for simultaneously performing connected-component labeling and euler number computing. IEEE Trans. Image Process. 24(9), 2725\u20132735 (2015)","journal-title":"IEEE Trans. Image Process."},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Kang, S., Cha, D., Kim, Y., Han, D.: Text region extraction in high contrasting image. Int. J. Future Comput. Commun. 6, 106\u2013109 (2017)","DOI":"10.18178\/ijfcc.2017.6.3.499"},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0734-189X(89)90147-3","volume":"48","author":"T Kong","year":"1989","unstructured":"Kong, T., Ronsenfeld, A.: Digital topology: introduction and survey. Comput. Vis. Graph. Image Process. 48(3), 357\u2013393 (1989)","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"41_CR9","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":"1","key":"41_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/cviu.1995.1006","volume":"61","author":"L Latecki","year":"1995","unstructured":"Latecki, L., Eckhardt, U., Rosenfeld, A.: Well-composed sets. Comput. Vis. Image Underst. 61(1), 70\u201383 (1995)","journal-title":"Comput. Vis. Image Underst."},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Matas, J., Chum, O., Urban, M., Pajdla, T.: Robust wide-baseline stereo from maximally stable extremal regions. Image Vis. Comput. 22(10), 761\u2013767 (2004)","DOI":"10.1016\/j.imavis.2004.02.006"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Murty, A., Natarajan, V., Vadhiyar, S.: Efficient homology computations on multicore and manycore systems. In: 20th Annual International Conference on High Performance Computing, pp. 333\u2013342 (2013)","DOI":"10.1109\/HiPC.2013.6799139"},{"key":"41_CR13","unstructured":"REDHOM: http:\/\/redhom.ii.uj.edu.pl\/. Institute of Computer Science, Jagiellonian University (2015)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Diaz-del Rio, F., et. al.: Computing the component-labeling and the adjacency tree of a binary digital image in near logarithmic-time. CTIC, pp. 82\u201395 (2019)","DOI":"10.1007\/978-3-030-10828-1_7"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Diaz-del Rio, F., et. al.: Parallel connected-component-labeling based on homotopy trees. Pattern Recogn. Lett. 131, 71\u201378 (2020)","DOI":"10.1016\/j.patrec.2019.11.039"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.patrec.2016.07.023","volume":"83","author":"F Diaz-del Rio","year":"2016","unstructured":"Diaz-del Rio, F., Real, P., Onchis, D.: A parallel homological spanning forest framework for 2d topological image analysis. Pattern Recogn. Lett. 83, 49\u201358 (2016)","journal-title":"Pattern Recogn. Lett."},{"key":"41_CR17","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"},{"key":"41_CR18","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1080\/00029890.1979.11994873","volume":"86","author":"A Rosenfeld","year":"1979","unstructured":"Rosenfeld, A.: Digital topology. Amer. Math. Monthly 86, 621\u2013630 (1979)","journal-title":"Amer. Math. Monthly"},{"key":"41_CR19","unstructured":"Toriwaki, J., Yonekura, T.: Euler number and connectivity indexes of a three dimensional digital picture. Forma 17, 183\u2013209 (2002)"},{"key":"41_CR20","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1186\/s40064-015-1511-8","volume":"4","author":"B Yao","year":"2015","unstructured":"Yao, B., He, L., Kang, S., Chao, Y., Zhao, X.: A novel bit-quad-based euler number computing algorithm. Springerplus 4, 735\u2013735 (2015)","journal-title":"Springerplus"},{"key":"41_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-319-49409-8_63","volume-title":"Computer Vision \u2013 ECCV 2016 Workshops","author":"A \u015aluzek","year":"2016","unstructured":"\u015aluzek, A.: Improving performances of mser features in matching and retrieval tasks. In: Hua, G., J\u00e9gou, H. (eds.) ECCV 2016. LNCS, vol. 9915, pp. 759\u2013770. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49409-8_63"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04881-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T00:01:55Z","timestamp":1777075315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04881-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031048807","9783031048814"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04881-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IbPRIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iberian Conference on Pattern Recognition and Image Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aveiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ibpria2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ibpria.org\/2022\/","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":"72","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":"54","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":"75% - 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":"3","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"}]}}