iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1007/978-3-030-20867-7_22
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:26:54Z","timestamp":1726032414518},"publisher-location":"Cham","reference-count":27,"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_22","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T19:14:41Z","timestamp":1560885281000},"page":"281-294","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Formalism for Time and Memory Efficient Morphological Attribute-Space Connected Filters"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Babai","sequence":"first","affiliation":[]},{"given":"Ananda S.","family":"Chowdhury","sequence":"additional","affiliation":[]},{"given":"Michael H. F.","family":"Wilkinson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,31]]},"reference":[{"key":"22_CR1","unstructured":"Babai, M., Kalantar-Nayestanaki, N., Messchendorp, J.G., Wilkinson, M.H.F.: An efficient attribute-space connected filter on graphs to reconstruct paths in point-clouds. Pattern Recognition (submitted)"},{"issue":"4","key":"22_CR2","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.cviu.2012.10.013","volume":"117","author":"I Bloch","year":"2013","unstructured":"Bloch, I., Bretto, A.: Mathematical morphology on hypergraphs, application to similarity and positive kernel. Comput. Vis. Image Underst. 117(4), 342\u2013354 (2013)","journal-title":"Comput. Vis. Image Underst."},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1024476403183","volume":"19","author":"U Braga-Neto","year":"2003","unstructured":"Braga-Neto, U., Goutsias, J.: A theoretical tour of connectivity in image processing and analysis. J. Math. Imag. Vis. 19, 5\u201331 (2003)","journal-title":"J. Math. Imag. Vis."},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1006\/cviu.1996.0066","volume":"64","author":"EJ Breen","year":"1996","unstructured":"Breen, E.J., Jones, R.: Attribute openings, thinnings and granulometries. Comp. Vis. Image Understand. 64(3), 377\u2013389 (1996)","journal-title":"Comp. Vis. Image Understand."},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.cviu.2012.08.016","volume":"117","author":"J Cousty","year":"2013","unstructured":"Cousty, J., Najman, L., Dias, F., Serra, J.: Morphological filtering on graphs. Comput. Vis. Image Underst. 117(4), 370\u2013385 (2013). \n https:\/\/doi.org\/10.1016\/j.cviu.2012.08.016\n \n . \n http:\/\/www.sciencedirect.com\/science\/article\/pii\/S107731421200183X\n \n , special issue on Discrete Geometry for Computer Imagery","journal-title":"Comput. Vis. Image Underst."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-03613-2_14","volume-title":"Mathematical Morphology and Its Application to Signal and Image Processing","author":"J Cousty","year":"2009","unstructured":"Cousty, J., Najman, L., Serra, J.: Some morphological operators in graph spaces. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 149\u2013160. Springer, Heidelberg (2009). \n https:\/\/doi.org\/10.1007\/978-3-642-03613-2_14"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1140\/epja\/i2013-13025-8","volume":"49","author":"PCW Erni","year":"2013","unstructured":"Erni, P.C.W., Keshelashvili, I., Krusche, B., et al.: Technical design report for the panda straw tube tracker. Eur. Phys. J. A 49, 25 (2013). Special Article - Tools for Experiment and Theory","journal-title":"Eur. Phys. J. A"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s11263-009-0213-5","volume":"85","author":"E Franken","year":"2009","unstructured":"Franken, E., Duits, R.: Crossing-preserving coherence-enhancing diffusion on invertible orientation scores. Int. J. Comput. Vis. 85, 253\u2013278 (2009)","journal-title":"Int. J. Comput. Vis."},{"volume-title":"Mathematical Morphology: 40 Years On","year":"2005","author":"T G\u00e9raud","key":"22_CR9","unstructured":"G\u00e9raud, T.: Ruminations on Tarjan\u2019s union-find algorithm and connected operators. In: Ronse, C., Najman, L., Decenci\u00e9re, E. (eds.) Mathematical Morphology: 40 Years On, vol. 30. Springer, Dordrecht (2005)"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/34.993556","volume":"24","author":"A Meijster","year":"2002","unstructured":"Meijster, A., Wilkinson, M.H.F.: A comparison of algorithms for connected set openings and closings. IEEE Trans. Pattern Anal. Mach. Intell. 24(4), 484\u2013494 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"22_CR11","unstructured":"Nacken, P.F.M.: Image analysis methods based on hierarchies of graphs and multi-scale mathematical morphology. Ph.D. thesis, University of Amsterdam, Amsterdam, The Netherlands (1994)"},{"key":"22_CR12","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 Proc. 15, 3531\u20133539 (2006)","journal-title":"IEEE Trans. Image Proc."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.patrec.2014.05.007","volume":"47","author":"L Najman","year":"2014","unstructured":"Najman, L., Cousty, J.: A graph-based mathematical morphology reader. Pattern Recogn. Lett. 47, 3\u201317 (2014)","journal-title":"Pattern Recogn. Lett."},{"key":"22_CR14","unstructured":"Oosterbroek, J., Wilkinson, M.H.F.: Mask-edge connectivity: theory, computation, and application to historical document analysis. In: Proceedings of 21st International Conference on Pattern Recognition, pp. 3112\u20133115 (2012)"},{"key":"22_CR15","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, 990\u20131004 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"22_CR16","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2161322","author":"B Perret","year":"2011","unstructured":"Perret, B., Lefevre, S., Collet, C., Slezak, E.: Hyperconnections and hierarchical representations for grayscale and multiband image processing. IEEE Trans. Image Process. (2011). \n https:\/\/doi.org\/10.1109\/TIP.2011.2161322","journal-title":"IEEE Trans. Image Process."},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1008210216583","volume":"8","author":"C Ronse","year":"1998","unstructured":"Ronse, C.: Set-theoretical algebraic approaches to connectivity in continuous or digital spaces. J. Math. Imag. Vis. 8, 41\u201358 (1998)","journal-title":"J. Math. Imag. Vis."},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1109\/83.403422","volume":"4","author":"P Salembier","year":"1995","unstructured":"Salembier, P., Serra, J.: Flat zones filtering, connected operators, and filters by reconstruction. IEEE Trans. Image Proc. 4, 1153\u20131160 (1995)","journal-title":"IEEE Trans. Image Proc."},{"key":"22_CR19","first-page":"37","volume-title":"Image Analysis and Mathematical Morphology, II: Theoretical Advances","author":"J Serra","year":"1988","unstructured":"Serra, J.: Mathematical morphology for Boolean lattices. In: Serra, J. (ed.) Image Analysis and Mathematical Morphology, II: Theoretical Advances, pp. 37\u201358. Academic Press, London (1988)"},{"issue":"3","key":"22_CR20","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. Imag. Vis. 9(3), 231\u2013251 (1998)","journal-title":"J. Math. Imag. Vis."},{"key":"22_CR21","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 22, 215\u2013225 (1975)","journal-title":"J. ACM"},{"key":"22_CR22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"RE Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. SIAM, Philadelphia (1983)"},{"issue":"4","key":"22_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0165-1684(89)90031-5","volume":"16","author":"L Vincent","year":"1989","unstructured":"Vincent, L.: Graphs and mathematical morphology. Signal Processing 16(4), 365\u2013388 (1989). \n https:\/\/doi.org\/10.1016\/0165-1684(89)90031-5\n \n . \n http:\/\/www.sciencedirect.com\/science\/article\/pii\/0165168489900315\n \n , special Issue on Advances in Mathematical Morphology","journal-title":"Signal Processing"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.imavis.2006.04.015","volume":"25","author":"MHF Wilkinson","year":"2007","unstructured":"Wilkinson, M.H.F.: Attribute-space connectivity and connected filters. Image Vis. Comput. 25, 426\u2013435 (2007)","journal-title":"Image Vis. Comput."},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-03613-2_5","volume-title":"Mathematical Morphology and Its Application to Signal and Image Processing","author":"MHF Wilkinson","year":"2009","unstructured":"Wilkinson, M.H.F.: Hyperconnectivity, attribute-space connectivity and path openings: theoretical relationships. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 47\u201358. Springer, Heidelberg (2009). \n https:\/\/doi.org\/10.1007\/978-3-642-03613-2_5"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Wilkinson, M.H.F.: A fast component-tree algorithm for high dynamic-range images and second generation connectivity. In: 2011 Proceedings of International Conference Image Processing, pp. 1041\u20131044 (2011)","DOI":"10.1109\/ICIP.2011.6115597"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-21569-8_7","volume-title":"Mathematical Morphology and Its Applications to Image and Signal Processing","author":"MHF Wilkinson","year":"2011","unstructured":"Wilkinson, M.H.F.: Hyperconnections and openings on complete lattices. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 73\u201384. Springer, Heidelberg (2011). \n https:\/\/doi.org\/10.1007\/978-3-642-21569-8_7"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T19:16:02Z","timestamp":1560885362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20867-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030208660","9783030208677"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20867-7_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":"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"}}]}}