{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:34:43Z","timestamp":1743118483554,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031319747"},{"type":"electronic","value":"9783031319754"}],"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-31975-4_22","type":"book-chapter","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T23:30:02Z","timestamp":1683761402000},"page":"288-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep Accurate Solver for\u00a0the\u00a0Geodesic Problem"],"prefix":"10.1007","author":[{"given":"Saar","family":"Huberman","sequence":"first","affiliation":[]},{"given":"Amit","family":"Bracha","sequence":"additional","affiliation":[]},{"given":"Ron","family":"Kimmel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,10]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-73301-2","volume-title":"Numerical Geometry of Non-rigid Shapes","author":"AM Bronstein","year":"2008","unstructured":"Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Numerical Geometry of Non-rigid Shapes. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-73301-2"},{"issue":"5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2516971.2516977","volume":"32","author":"K Crane","year":"2013","unstructured":"Crane, K., Weischedel, C., Wardetzky, M.: Geodesics in heat: a new approach to computing distance based on heat flow. ACM Trans. Graph. (TOG) 32(5), 1\u201311 (2013)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Elad, A., Kimmel, R.: Bending invariant representations for surfaces. In: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2001, vol. 1, pp. I-I. IEEE (2001)","DOI":"10.1109\/CVPR.2001.990472"},{"issue":"184","key":"22_CR5","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1090\/S0025-5718-1988-0935077-0","volume":"51","author":"B Fornberg","year":"1988","unstructured":"Fornberg, B.: Generation of finite difference formulas on arbitrarily spaced grids. Math. Comput. 51(184), 699\u2013706 (1988)","journal-title":"Math. Comput."},{"key":"22_CR6","unstructured":"Hysing, S.R., Turek, S.: The eikonal equation: numerical efficiency vs. algorithmic complexity on quadrilateral grids. In: Proceedings of ALGORITMY, vol. 22 (2005)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Ion, A., Artner, N.M., Peyr\u00e9, G., M\u00e1rmol, S.B.L., Kropatsch, W.G., Cohen, L.: 3D shape matching by geodesic eccentricity. In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, pp. 1\u20138. IEEE (2008)","DOI":"10.1109\/CVPRW.2008.4563032"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/70.678452","volume":"14","author":"R Kimmel","year":"1998","unstructured":"Kimmel, R., Kiryati, N., Bruckstein, A.M.: Multivalued distance maps for motion planning on surfaces with moving obstacles. IEEE Trans. Robot. Autom. 14(3), 427\u2013436 (1998)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"22_CR9","unstructured":"Kimmel, R., Maurer, R.: Method of computing sub-pixel euclidean distance maps, application filed Dec. 2000, US Patent 7,113,617 (2006)"},{"issue":"15","key":"22_CR10","doi-asserted-by":"publisher","first-page":"8431","DOI":"10.1073\/pnas.95.15.8431","volume":"95","author":"R Kimmel","year":"1998","unstructured":"Kimmel, R., Sethian, J.A.: Computing geodesic paths on manifolds. Proc. Natl. Acad. Sci. 95(15), 8431\u20138435 (1998)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1011234012449","volume":"14","author":"R Kimmel","year":"2001","unstructured":"Kimmel, R., Sethian, J.A.: Optimal algorithm for shape from shading and path planning. J. Math. Imaging Vis. 14(3), 237\u2013244 (2001)","journal-title":"J. Math. Imaging Vis."},{"issue":"17","key":"22_CR12","doi-asserted-by":"publisher","first-page":"8191","DOI":"10.1016\/j.jcp.2008.05.018","volume":"227","author":"F Li","year":"2008","unstructured":"Li, F., Shu, C.W., Zhang, Y.T., Zhao, H.: A second order discontinuous galerkin fast sweeping method for eikonal equations. J. Comput. Phys. 227(17), 8191\u20138208 (2008)","journal-title":"J. Comput. Phys."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-030-22368-7_4","volume-title":"Scale Space and Variational Methods in Computer Vision","author":"M Lichtenstein","year":"2019","unstructured":"Lichtenstein, M., Pai, G., Kimmel, R.: Deep Eikonal solvers. In: Lellmann, J., Burger, M., Modersitzki, J. (eds.) SSVM 2019. LNCS, vol. 11603, pp. 38\u201350. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22368-7_4"},{"key":"22_CR14","unstructured":"Ma, X., Qin, C., You, H., Ran, H., Fu, Y.: Rethinking network design and local geometry in point cloud: a simple residual MLP framework. arXiv preprint arXiv:2202.07123 (2022)"},{"issue":"4","key":"22_CR15","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"JS Mitchell","year":"1987","unstructured":"Mitchell, J.S., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16(4), 647\u2013668 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0021-9991(88)90002-2","volume":"79","author":"S Osher","year":"1988","unstructured":"Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79(1), 12\u201349 (1988)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"22_CR17","first-page":"1","volume":"32","author":"D Panozzo","year":"2013","unstructured":"Panozzo, D., Baran, I., Diamanti, O., Sorkine-Hornung, O.: Weighted averages on surfaces. ACM Trans. Graph. (TOG) 32(4), 1\u201312 (2013)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1073\/pnas.93.4.1591","volume":"93","author":"JA Sethian","year":"1996","unstructured":"Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93(4), 1591\u20131595 (1996)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Shamai, G., Kimmel, R.: Geodesic distance descriptors. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 6410\u20136418 (2017)","DOI":"10.1109\/CVPR.2017.386"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1145\/1073204.1073228","volume":"24","author":"V Surazhsky","year":"2005","unstructured":"Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S.J., Hoppe, H.: Fast exact and approximate geodesics on meshes. ACM Trans. Graph. (TOG) 24(3), 553\u2013560 (2005)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"9","key":"22_CR21","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/9.412624","volume":"40","author":"JN Tsitsiklis","year":"1995","unstructured":"Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control 40(9), 1528\u20131538 (1995)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1409625.1409626","volume":"27","author":"O Weber","year":"2008","unstructured":"Weber, O., Devir, Y.S., Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Trans. Graph. (TOG) 27(4), 1\u201316 (2008)","journal-title":"ACM Trans. Graph. (TOG)"},{"issue":"250","key":"22_CR23","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1090\/S0025-5718-04-01678-3","volume":"74","author":"H Zhao","year":"2005","unstructured":"Zhao, H.: A fast sweeping method for eikonal equations. Math. Comput. 74(250), 603\u2013627 (2005)","journal-title":"Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Scale Space and Variational Methods in Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31975-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T04:58:57Z","timestamp":1729400337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31975-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031319747","9783031319754"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31975-4_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":"10 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSVM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Scale Space and Variational Methods in Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Margherita di Pula","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"21 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scalespace2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eventi.unibo.it\/ssvm2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","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":"57","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":"79% - 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":"3","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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}