{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:20:10Z","timestamp":1743106810771,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"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_21","type":"book-chapter","created":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T10:55:47Z","timestamp":1503312947000},"page":"254-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Updating Feasible Regions for Fitting Discrete Polynomial Curve"],"prefix":"10.1007","author":[{"given":"Fumiki","family":"Sekiya","sequence":"first","affiliation":[]},{"given":"Akihiro","family":"Sugimoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,22]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-45986-3_33","volume-title":"Discrete Geometry for Computer Imagery","author":"L Buzer","year":"2002","unstructured":"Buzer, L.: An incremental linear time algorithm for digital line and plane recognition using a linear incremental feasibility problem. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, pp. 372\u2013381. Springer, Heidelberg (2002). doi:10.1007\/3-540-45986-3_33"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Kenmochi, Y., Buzer, L., Talbot, H.: Efficiently computing optimal consensus of digital line fitting. In: International Conference on Pattern Recognition (ICPR 2010), pp. 1064\u20131067. IEEE (2010)","DOI":"10.1109\/ICPR.2010.266"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-37067-0_21","volume-title":"Discrete Geometry for Computer Imagery","author":"G Largeteau-Skapin","year":"2013","unstructured":"Largeteau-Skapin, G., Zrour, R., Andres, E.: O(n\n          3logn) time complexity for the optimal consensus set computation for 4-connected digital circles. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 241\u2013252. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-37067-0_21"},{"key":"21_CR4","unstructured":"Largeteau-Skapin, G., Zrour, R., Andres, E., Sugimoto, A., Kenmochi, Y.: Optimal consensus set and preimage of 4-connected circles in a noisy environment. In: Proceedings of the International Conference on Pattern Recognition (ICPR 2012), pp. 3774\u20133777. IEEE (2012)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-21073-0_15","volume-title":"Combinatorial Image Analysis","author":"L Provot","year":"2011","unstructured":"Provot, L., Gerard, Y.: Recognition of digital hyperplanes and level layers with forbidden points. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol. 6636, pp. 144\u2013156. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21073-0_15"},{"issue":"1\u20132","key":"21_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10472-014-9425-7","volume":"75","author":"F Sekiya","year":"2015","unstructured":"Sekiya, F., Sugimoto, A.: Fitting discrete polynomial curve and surface to noisy data. Ann. Math. Artif. Intell. 75(1\u20132), 135\u2013162 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"key":"21_CR7","series-title":"Mathematics for Industry","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-4-431-55483-7_4","volume-title":"Mathematical Progress in Expressive Image Synthesis II","author":"F Sekiya","year":"2015","unstructured":"Sekiya, F., Sugimoto, A.: On connectivity of discretized 2D explicit curve. In: Ochiai, H., Anjyo, K. (eds.) Mathematical Progress in Expressive Image Synthesis II. MI, vol. 18, pp. 33\u201344. Springer, Tokyo (2015). doi:10.1007\/978-4-431-55483-7_4"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-319-54427-4_35","volume-title":"Computer Vision \u2013 ACCV 2016 Workshops","author":"F Sekiya","year":"2017","unstructured":"Sekiya, F., Sugimoto, A.: Discrete polynomial curve fitting guaranteeing inclusion-wise maximality of inlier set. In: Chen, C.-S., Lu, J., Ma, K.-K. (eds.) ACCV 2016. LNCS, vol. 10117, pp. 477\u2013492. Springer, Cham (2017). doi:10.1007\/978-3-319-54427-4_35"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Sere, A., Sie, O., Andres, E.: Extended standard Hough transform for analytical line recognition. In: Proceedings of International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT 2012), pp. 412\u2013422. IEEE (2012)","DOI":"10.1109\/SETIT.2012.6481950"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-09955-2_28","volume-title":"Discrete Geometry for Computer Imagery","author":"J-L Toutant","year":"2014","unstructured":"Toutant, J.-L., Andres, E., Largeteau-Skapin, G., Zrour, R.: Implicit digital surfaces in arbitrary dimensions. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds.) DGCI 2014. LNCS, vol. 8668, pp. 332\u2013343. Springer, Cham (2014). doi:10.1007\/978-3-319-09955-2_28"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/ima.20269","volume":"21","author":"R Zrour","year":"2011","unstructured":"Zrour, R., Kenmochi, Y., Talbot, H., Buzer, L., Hamam, Y., Shimizu, I., Sugimoto, A.: Optimal consensus set for digital line and plane fitting. Int. J. Imaging Syst. Technol. 21(1), 45\u201357 (2011)","journal-title":"Int. J. Imaging Syst. Technol."},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-19867-0_30","volume-title":"Discrete Geometry for Computer Imagery","author":"R Zrour","year":"2011","unstructured":"Zrour, R., Largeteau-Skapin, G., Andres, E.: Optimal consensus set for annulus fitting. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 358\u2013368. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-19867-0_30"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-26145-4_8","volume-title":"Combinatorial Image Analysis","author":"R Zrour","year":"2015","unstructured":"Zrour, R., Largeteau-Skapin, G., Andres, E.: Optimal consensus set for nD fixed width annulus fitting. In: Barneva, R.P., Bhattacharya, B.B., Brimkov, V.E. (eds.) IWCIA 2015. LNCS, vol. 9448, pp. 101\u2013114. Springer, Cham (2015). doi:10.1007\/978-3-319-26145-4_8"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:06:30Z","timestamp":1629504390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66272-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662718","9783319662725"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66272-5_21","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"}]}}