{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:27:05Z","timestamp":1726032425573},"publisher-location":"Cham","reference-count":18,"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_13","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"162-173","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Bit-Quads Count in Tree of Shapes"],"prefix":"10.1007","author":[{"given":"Dennis Jos\u00e9","family":"da Silva","sequence":"first","affiliation":[]},{"given":"Wonder Alexandre Luz","family":"Alves","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Morimitsu","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":"5","key":"13_CR1","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":"4","key":"13_CR2","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":"5","key":"13_CR3","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/83.841532","volume":"9","author":"P Monasse","year":"2000","unstructured":"Monasse, P., Guichard, F.: Fast computation of a contrast-invariant image representation. IEEE Trans. Image Process. 9(5), 860\u2013872 (2000)","journal-title":"IEEE Trans. Image Process."},{"issue":"6","key":"13_CR4","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/MSP.2009.934154","volume":"26","author":"P Salembier","year":"2009","unstructured":"Salembier, P., Wilkinson, M.H.F.: Connected operators. IEEE Signal Process. Mag. 26(6), 136\u2013157 (2009)","journal-title":"IEEE Signal Process. Mag."},{"key":"13_CR5","unstructured":"Xu, Y., G\u00e9raud, T., Najman, L.: Morphological filtering in shape spaces: applications using tree-based image representations. In: International Conference on Pattern Recognition (ICPR), pp. 485\u2013488 (2012)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Alves, W.A.L., Hashimoto, R.F.: Ultimate grain filter. In: IEEE International Conference on Image Processing (ICIP), pp. 2953\u20132957 (2014)","DOI":"10.1109\/ICIP.2014.7025597"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.patrec.2014.10.012","volume":"53","author":"J Climent","year":"2015","unstructured":"Climent, J., Oliveira, L.S.: A new algorithm for number of holes attribute filtering of grey-level images. Pattern Recogn. Lett. 53, 24\u201330 (2015)","journal-title":"Pattern Recogn. Lett."},{"key":"13_CR8","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: IEEE International Conference on Image Processing (ICIP), pp. 3738\u20133742 (2016)","DOI":"10.1109\/ICIP.2016.7533058"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-38294-9_4","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"L Najman","year":"2013","unstructured":"Najman, L., G\u00e9raud, T.: Discrete set-valued continuity and interpolation. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 37\u201348. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38294-9_4"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-38294-9_9","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"T G\u00e9raud","year":"2013","unstructured":"G\u00e9raud, T., Carlinet, E., Crozet, S., Najman, L.: A quasi-linear algorithm to compute the tree of shapes of nD images. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 98\u2013110. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38294-9_9"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Carlinet, E., Crozet, S., G\u00e9raud, T.: The tree of shapes turned into a max-tree: a simple and efficient linear algorithm. In: IEEE International Conference on Image Processing (ICIP), pp. 1488\u20131492 (2018)","DOI":"10.1109\/ICIP.2018.8451180"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-18720-4_23","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"WAL Alves","year":"2015","unstructured":"Alves, W.A.L., Morimitsu, A., Hashimoto, R.F.: Scale-space representation based on levelings through hierarchies of level sets. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 265\u2013276. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-18720-4_23"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s11117-007-2150-2","volume":"12","author":"V Caselles","year":"2008","unstructured":"Caselles, V., Meinhardt, E., Monasse, P.: Constructing the tree of shapes of an image by fusion of the trees of connected components of upper and lower level sets. Positivity 12(1), 55\u201373 (2008)","journal-title":"Positivity"},{"key":"13_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04611-7","volume-title":"Geometric Description of Images as Topographic Maps","author":"V Caselles","year":"2009","unstructured":"Caselles, V., Monasse, P.: Geometric Description of Images as Topographic Maps, 1st edn. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04611-7","edition":"1"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Berger, C., Geraud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E.: Effective component tree computation with application to pattern recognition in astronomical imaging. In: IEEE International Conference on Image Processing, vol. 4, pp. IV-41\u2013IV-44 (2007)","DOI":"10.1109\/ICIP.2007.4379949"},{"issue":"9","key":"13_CR16","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":"13_CR17","unstructured":"Le\u00f3n, M., Mallo, S., Gasull, A.: A tree structured-based caption text detection approach. In: Fifth IASTED VIIP, pp. 220\u2013225 (2005)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-319-18720-4_58","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Carlinet, E., G\u00e9raud, T., Najman, L.: Efficient computation of attributes and saliency maps on tree-based image representations. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 693\u2013704. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-18720-4_58"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:16:59Z","timestamp":1560899819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20867-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030208660","9783030208677"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20867-7_13","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"}}]}}