{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:27:01Z","timestamp":1726032421982},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030208660"},{"type":"electronic","value":"9783030208677"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-20867-7_12","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T19:14:41Z","timestamp":1560885281000},"page":"150-161","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Attribute Computation in Component-Hypertrees"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Morimitsu","sequence":"first","affiliation":[]},{"given":"Wonder Alexandre Luz","family":"Alves","sequence":"additional","affiliation":[]},{"given":"Dennis Jos\u00e9","family":"da Silva","sequence":"additional","affiliation":[]},{"given":"Charles Ferreira","family":"Gobber","sequence":"additional","affiliation":[]},{"given":"Ronaldo Fumio","family":"Hashimoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,31]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/cviu.2002.0961","volume":"85","author":"U Braga-Neto","year":"2002","unstructured":"Braga-Neto, U., Goutsias, J.: Connectivity on complete lattices: new results. Comput. Vis. Image Underst. 85(1), 22\u201353 (2002)","journal-title":"Comput. Vis. Image Underst."},{"doi-asserted-by":"crossref","unstructured":"Epshtein, B., Ofek, E., Wexler, Y.: Detecting text in natural scenes with stroke width transform. In: 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 2963\u20132970 (2010)","key":"12_CR2","DOI":"10.1109\/CVPR.2010.5540041"},{"issue":"5","key":"12_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/T-C.1971.223289","volume":"C\u201320","author":"SB Gray","year":"1971","unstructured":"Gray, S.B.: Local properties of binary images in two dimensions. IEEE Trans. Comput. C\u201320(5), 551\u2013561 (1971)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"12_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1006\/cviu.1999.0777","volume":"75","author":"R Jones","year":"1999","unstructured":"Jones, R.: Connected filtering and segmentation using component trees. Comput. Vis. Image Underst. 75(3), 215\u2013228 (1999)","journal-title":"Comput. Vis. Image Underst."},{"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, pp. 1485\u20131490 (2011)","key":"12_CR5","DOI":"10.1109\/ICDAR.2011.295"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-03613-2_7","volume-title":"Mathematical Morphology and Its Application to Signal and Image Processing","author":"FN Kiwanuka","year":"2009","unstructured":"Kiwanuka, F.N., Ouzounis, G.K., Wilkinson, M.H.F.: Surface-area-based attribute filtering in 3D. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 70\u201381. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03613-2_7"},{"key":"12_CR7","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-18720-4_57"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-030-14085-4_22","volume-title":"Discrete Geometry for Computer Imagery","author":"A Morimitsu","year":"2019","unstructured":"Morimitsu, A., Alves, W.A.L., Silva, D.J., Gobber, C.F., Hashimoto, R.F.: Minimal component-hypertrees. In: Couprie, M., Cousty, J., Kenmochi, Y., Mustafa, N. (eds.) DGCI 2019. LNCS, vol. 11414, pp. 276\u2013287. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-14085-4_22"},{"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. 01, pp. 1454\u20131459 (2017)","key":"12_CR9","DOI":"10.1109\/ICDAR.2017.237"},{"doi-asserted-by":"crossref","unstructured":"Neumann, L., Matas, J.: Real-time scene text localization and recognition. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 3538\u20133545 (2012)","key":"12_CR10","DOI":"10.1109\/CVPR.2012.6248097"},{"issue":"6","key":"12_CR11","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.F.: 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."},{"key":"12_CR12","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-21569-8_25"},{"issue":"10","key":"12_CR13","doi-asserted-by":"publisher","first-page":"2539","DOI":"10.1016\/j.patcog.2011.03.025","volume":"44","author":"N Passat","year":"2011","unstructured":"Passat, N., Naegel, B., Rousseau, F., Koob, M., Dietemann, J.L.: Interactive segmentation based on component-trees. Pattern Recogn. 44(10), 2539\u20132554 (2011). semi-Supervised Learning for Visual Content Analysis and Understanding","journal-title":"Pattern Recogn."},{"unstructured":"Retornaz, T., Marcotegui, B.: Scene text localization based on the ultimate opening. In: Proceedings of the 8 th International Symposium on Mathematical Morphology, October 10\u201313, 2007, MCT\/INPE, vol. 1, pp. 177\u2013188. Rio de Janeiro (2007)","key":"12_CR14"},{"issue":"4","key":"12_CR15","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":"12_CR16","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."},{"doi-asserted-by":"crossref","unstructured":"Silva, D.J., Alves, W.A.L., 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 (2016)","key":"12_CR17","DOI":"10.1109\/ICIP.2016.7533058"}],"container-title":["Lecture Notes in Computer Science","Mathematical Morphology and Its Applications to Signal and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20867-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T19:16:54Z","timestamp":1560885414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20867-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030208660","9783030208677"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20867-7_12","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":"31 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saarbr\u00fccken","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ismm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ismm.uni-saarland.de\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}