{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:54:01Z","timestamp":1743033241050,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442391"},{"type":"electronic","value":"9783031442407"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-44240-7_22","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T22:01:45Z","timestamp":1695160905000},"page":"223-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Structural Analysis of the Additive Noise Impact on the $${\\alpha \\text {-tree}}$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6477-7666","authenticated-orcid":false,"given":"Baptiste","family":"Esteban","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4617-4922","authenticated-orcid":false,"given":"Guillaume","family":"Tochon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5737-5266","authenticated-orcid":false,"given":"Edwin","family":"Carlinet","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6315-052X","authenticated-orcid":false,"given":"Didier","family":"Verna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Bosilj, P., Kijak, E., Lef\u00e8vre, S.: Partition and inclusion hierarchies of images: a comprehensive survey. J. Imaging 4(2), 33 (2018). https:\/\/doi.org\/10.3390\/jimaging4020033","key":"22_CR1","DOI":"10.3390\/jimaging4020033"},{"issue":"4","key":"22_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). https:\/\/doi.org\/10.1109\/83.663500","journal-title":"IEEE Trans. Image Process."},{"issue":"5","key":"22_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":"7","key":"22_CR4","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 Trans. Pattern Anal. Mach. Intell. 30(7), 1132\u20131145 (2008). https:\/\/doi.org\/10.1109\/TPAMI.2007.70817","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"publisher","unstructured":"Cousty, J., Najman, L.: Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) Mathematical Morphology and Its Applications to Image and Signal Processing. LNCS, vol. 6671, pp. 272\u2013283. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21569-8_24","key":"22_CR5","DOI":"10.1007\/978-3-642-21569-8_24"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1109\/83.841934","volume":"9","author":"P Salembier","year":"2000","unstructured":"Salembier, P., Garrido, L.: Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval. IEEE Trans. Image Process. 9(4), 561\u2013576 (2000). https:\/\/doi.org\/10.1109\/83.841934","journal-title":"IEEE Trans. Image Process."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-38294-9_8","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"J Cousty","year":"2013","unstructured":"Cousty, J., Najman, L., Perret, B.: Constructive links between some morphological hierarchies on edge-weighted graphs. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 86\u201397. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38294-9_8"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.patrec.2019.10.008","volume":"128","author":"B Perret","year":"2019","unstructured":"Perret, B., Cousty, J., Ferzoli Guimar\u00e3es, S.J., Kenmochi, Y., Najman, L.: Removing non-significant regions in hierarchical clustering and segmentation. Pattern Recogn. Lett. 128, 433\u2013439 (2019). https:\/\/doi.org\/10.1016\/j.patrec.2019.10.008","journal-title":"Pattern Recogn. Lett."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-57240-6_31","volume-title":"Mathematical Morphology and Its Applications to Signal and Image Processing","author":"P Bosilj","year":"2017","unstructured":"Bosilj, P., Damodaran, B.B., Aptoula, E., Mura, M.D., Lef\u00e8vre, S.: Attribute profiles from partitioning trees. In: Angulo, J., Velasco-Forero, S., Meyer, F. (eds.) ISMM 2017. LNCS, vol. 10225, pp. 381\u2013392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57240-6_31"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1109\/TIP.2017.2779604","volume":"27","author":"B Perret","year":"2018","unstructured":"Perret, B., Cousty, J., Guimar\u00e3es, S.J.F., Maia, D.S.: Evaluation of hierarchical watersheds. IEEE Trans. Image Process. 27(4), 1676\u20131688 (2018). https:\/\/doi.org\/10.1109\/TIP.2017.2779604","journal-title":"IEEE Trans. Image Process."},{"doi-asserted-by":"publisher","unstructured":"Ko\u00e7, S.G., Aptoula, E., Bosilj, P., Damodaran, B.B., Dalla Mura, M., Lefevre, S.: A comparative noise robustness study of tree representations for attribute profile construction. In: 2017 25th Signal Processing and Communications Applications Conference (SIU), pp. 1\u20134. IEEE (2017). https:\/\/doi.org\/10.1109\/SIU.2017.7960159","key":"22_CR11","DOI":"10.1109\/SIU.2017.7960159"},{"key":"22_CR12","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"},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11263-005-6299-0","volume":"68","author":"L Guigues","year":"2006","unstructured":"Guigues, L., Cocquerez, J.P., Le Men, H.: Scale-sets image analysis. Int. J. Comput. Vision 68(3), 289\u2013317 (2006). https:\/\/doi.org\/10.1007\/s11263-005-6299-0","journal-title":"Int. J. Comput. Vision"},{"key":"22_CR14","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"},{"issue":"4","key":"22_CR15","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."},{"issue":"5","key":"22_CR16","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1002\/cpa.3160420503","volume":"42","author":"D Mumford","year":"1989","unstructured":"Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Commun. Pure Appl. Math. 42(5), 577\u2013685 (1989). https:\/\/doi.org\/10.1002\/cpa.3160420503","journal-title":"Commun. Pure Appl. Math."}],"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-031-44240-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T22:07:08Z","timestamp":1695161228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44240-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442391","9783031442407"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44240-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","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":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caip2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cyprusconferences.org\/caip2023\/","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":"https:\/\/www.easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","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":"81% - 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.06","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":"2.09","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}