{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:29:08Z","timestamp":1743071348947,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319662718"},{"type":"electronic","value":"9783319662725"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66272-5_24","type":"book-chapter","created":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T10:55:47Z","timestamp":1503312947000},"page":"291-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale\/Irregular Geometric Representation and Generalized Linear Programming"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Vacavant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Kerautret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Roussillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Feschet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,22]]},"reference":[{"issue":"3","key":"24_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02574379","volume":"12","author":"N Amenta","year":"1994","unstructured":"Amenta, N.: Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12(3), 241\u2013261 (1994)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"24_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF01192049","volume":"14","author":"MJ Atallah","year":"1995","unstructured":"Atallah, M.J., et al.: An optimal algorithm for shortest paths on weighted interval and circular-arc graphs. Appl. Algorithmica 14(5), 429\u2013441 (1995)","journal-title":"Appl. Algorithmica"},{"key":"24_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-77281-8","volume-title":"Structured Document Image Analysis","author":"B H.S.","year":"1992","unstructured":"H.S., B.: Structured Document Image Analysis. Springer, Heidelberg (1992). doi:10.1007\/978-3-642-77281-8"},{"issue":"1","key":"24_CR4","first-page":"14","volume":"3","author":"P Bo","year":"2016","unstructured":"Bo, P., et al.: A graph-based method for fitting planar b-spline curves with intersections. J. Comput. Des. Eng. 3(1), 14\u201323 (2016)","journal-title":"J. Comput. Des. Eng."},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-10210-3_3","volume-title":"Combinatorial Image Analysis","author":"A Faure","year":"2009","unstructured":"Faure, A., Feschet, F.: Multi-primitive analysis of digital curves. In: Wiederhold, P., Barneva, R.P. (eds.) IWCIA 2009. LNCS, vol. 5852, pp. 30\u201342. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-10210-3_3"},{"issue":"1\u20133","key":"24_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.dam.2005.02.025","volume":"151","author":"F Feschet","year":"2005","unstructured":"Feschet, F., Tougne, L.: On the min DSS problem of closed discrete curves. Discrete Appl. Math. 151(1\u20133), 138\u2013153 (2005)","journal-title":"Discrete Appl. Math."},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-49126-0_3","volume-title":"Discrete Geometry for Computer Imagery","author":"F Feschet","year":"1999","unstructured":"Feschet, F., Tougne, L.: Optimal time computation of the tangent of a discrete curve: application to the curvature. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 31\u201340. Springer, Heidelberg (1999). doi:10.1007\/3-540-49126-0_3"},{"unstructured":"Goshtasby, A.A.: Fitting parametric curves to dense and noisy points. In: International Conference on Curves and Surfaces (1999)","key":"24_CR8"},{"issue":"6","key":"24_CR9","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1109\/TPAMI.2006.127","volume":"28","author":"X Hilaire","year":"2006","unstructured":"Hilaire, X., Tombre, K.: Robust and accurate vectorization of line drawings. IEEE Trans. Pattern Anal. Mach. Intell 28(6), 890\u2013904 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell"},{"issue":"6\u20137","key":"24_CR10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.robot.2009.01.003","volume":"57","author":"M Karasalo","year":"2009","unstructured":"Karasalo, M., et al.: Contour reconstruction using recursive smoothing splines - algorithms and experimental validation. Robot. Auton. Syst. 57(6\u20137), 617\u2013628 (2009)","journal-title":"Robot. Auton. Syst."},{"issue":"12","key":"24_CR11","doi-asserted-by":"publisher","first-page":"2379","DOI":"10.1109\/TPAMI.2012.38","volume":"34","author":"B Kerautret","year":"2012","unstructured":"Kerautret, B., Lachaud, J.O.: Meaningful scales detection along digital contours for unsupervised local noise estimation. IEEE Trans. Pattern Anal. Mach. Intell. 34(12), 2379\u20132392 (2012)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.5201\/ipol.2014.75","volume":"4","author":"B Kerautret","year":"2014","unstructured":"Kerautret, B., Lachaud, J.O.: Meaningful scales detection: an unsupervised noise detection algorithm for digital contours. Image Process. On Line 4, 98\u2013115 (2014)","journal-title":"Image Process. On Line"},{"unstructured":"Lachaud, J.O., Non-Euclidiens, E., d\u2019Image, A.: Mod\u00e8les D\u00e9formables Riemanniens et Discrets, Topologie et G\u00e9om\u00e9trie Discr\u00e8te. Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 Bordeaux 1 (2006). (en francais)","key":"24_CR13"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1017\/S0962492912000062","volume":"21","author":"M Lebrun","year":"2012","unstructured":"Lebrun, M., et al.: Secrets of image denoising cuisine. Acta Numer. 21, 475\u2013576 (2012)","journal-title":"Acta Numer."},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-319-32360-2_34","volume-title":"Discrete Geometry for Computer Imagery","author":"P Ngo","year":"2016","unstructured":"Ngo, P., Nasser, H., Debled-Rennesson, I., Kerautret, B.: Adaptive tangential cover for noisy digital contours. In: Normand, N., Gu\u00e9don, J., Autrusseau, F. (eds.) DGCI 2016. LNCS, vol. 9647, pp. 439\u2013451. Springer, Cham (2016). doi:10.1007\/978-3-319-32360-2_34"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1007\/978-3-642-21227-7_74","volume-title":"Image Analysis","author":"TP Nguyen","year":"2011","unstructured":"Nguyen, T.P., Debled-Rennesson, I.: Decomposition of a curve into arcs and line segments based on dominant point detection. In: Heyden, A., Kahl, F. (eds.) SCIA 2011. LNCS, vol. 6688, pp. 794\u2013805. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21227-7_74"},{"issue":"9","key":"24_CR17","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1145\/358746.358758","volume":"24","author":"J O\u2019Rourke","year":"1981","unstructured":"O\u2019Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. ACM 24(9), 574\u2013578 (1981)","journal-title":"Commun. ACM"},{"issue":"12","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1109\/34.476507","volume":"17","author":"PL Rosin","year":"1995","unstructured":"Rosin, P.L., West, G.A.W.: Nonparametric segmentation of curves into various representations. IEEE Trans. Pattern Anal. Mach. Intell. 17(12), 1140\u20131153 (1995)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-21073-0_7","volume-title":"Combinatorial Image Analysis","author":"T Roussillon","year":"2011","unstructured":"Roussillon, T., Lachaud, J.-O.: Accurate curvature estimation along digital contours with maximal digital circular arcs. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 43\u201355. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21073-0_7"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/3-540-55210-3_213","volume-title":"STACS 92","author":"M Sharir","year":"1992","unstructured":"Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 567\u2013579. Springer, Heidelberg (1992). doi:10.1007\/3-540-55210-3_213"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-37067-0_23","volume-title":"Discrete Geometry for Computer Imagery","author":"J-L Toutant","year":"2013","unstructured":"Toutant, J.-L., Vacavant, A., Kerautret, B.: Arc recognition on irregular isothetic grids and its application to reconstruction of noisy digital contours. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 265\u2013276. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-37067-0_23"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"E1","DOI":"10.1007\/11907350_58","volume-title":"Discrete Geometry for Computer Imagery","author":"A Vacavant","year":"2006","unstructured":"Vacavant, A., Coeurjolly, D., Tougne, L.: Topological and geometrical reconstruction of complex objects on irregular isothetic grids. In: Kuba, A., Ny\u00fal, L.G., Pal\u00e1gyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. E1\u2013E1. Springer, Heidelberg (2006). doi:10.1007\/11907350_58"},{"issue":"4","key":"24_CR23","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.cviu.2012.07.006","volume":"117","author":"A Vacavant","year":"2013","unstructured":"Vacavant, A., et al.: A combined multi-scale\/irregular algorithm for the vectorization of noisy digital contours. Comput. Vis. Image Underst. 117(4), 438\u2013450 (2013)","journal-title":"Comput. Vis. Image Underst."},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-56414-2_6","volume-title":"Reproducible Research in Pattern Recognition","author":"A Vacavant","year":"2017","unstructured":"Vacavant, A.: A novel definition of robustness for image processing algorithms. In: Kerautret, B., Colom, M., Monasse, P. (eds.) RRPR 2016. LNCS, vol. 10214, pp. 75\u201387. Springer, Cham (2017). doi:10.1007\/978-3-319-56414-2_6"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359\u2013370. Springer, Heidelberg (1991). doi:10.1007\/BFb0038202"},{"unstructured":"Wirjadi, O.: Survey of 3D image segmentation methods. Berichte des Fraunhofer ITWM, p. 23 (2007)","key":"24_CR26"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66272-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:07:56Z","timestamp":1629504476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66272-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662718","9783319662725"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66272-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"22 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry for Computer Imagery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2017","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":"dgci2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dgci2017.prip.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}