{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T08:42:53Z","timestamp":1761986573613,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031414978"},{"type":"electronic","value":"9783031414985"}],"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-41498-5_8","type":"book-chapter","created":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T19:23:19Z","timestamp":1692040999000},"page":"105-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reconstruction of\u00a0Power Lines from\u00a0Point Clouds"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Gribov","sequence":"first","affiliation":[]},{"given":"Khalid","family":"Duri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,15]]},"reference":[{"key":"8_CR1","unstructured":"AHN3 downloads. Actueel Hoogtebestand Nederland (current height file, Netherlands). https:\/\/app.pdok.nl\/ahn3-downloadpage\/"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Hatibovic, A.: Derivation of equations for conductor and sag curves of an overhead line based on a given catenary constant. Periodica Polytechnica Electr. Eng. Comput. Sci. 58(1), 23\u201327 (2014). https:\/\/doi.org\/10.3311\/PPee.6993","DOI":"10.3311\/PPee.6993"},{"key":"8_CR3","unstructured":"2020 Wildfire Activity Statistics. California Department of Forestry and Fire Protection. https:\/\/www.fire.ca.gov\/our-impact\/statistics"},{"key":"8_CR4","unstructured":"2021 Wildfire Activity Statistics. California Department of Forestry and Fire Protection. https:\/\/www.fire.ca.gov\/our-impact\/statistics"},{"key":"8_CR5","unstructured":"2019 Wildfire Activity Statistics. California Department of Forestry and Fire Protection. https:\/\/www.fire.ca.gov\/our-impact\/statistics"},{"key":"8_CR6","unstructured":"2018 Wildfire Activity Statistics. California Department of Forestry and Fire Protection. https:\/\/www.fire.ca.gov\/our-impact\/statistics"},{"key":"8_CR7","unstructured":"2017 Wildfire Activity Statistics. California Department of Forestry and Fire Protection. https:\/\/www.fire.ca.gov\/our-impact\/statistics"},{"key":"8_CR8","unstructured":"Bor\u016fvka, O.: O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. In: Pr\u00e1ce Moravsk\u00e9 p\u0159\u00edrodov\u011bdeck\u00e9 spole\u00e7nosti, Czech, German, vol. III, no. 3, pp. 37\u201358 (1926). http:\/\/hdl.handle.net\/10338.dmlcz\/500114"},{"key":"8_CR9","unstructured":"\u2014. P\u0159\u00edsp\u011bvek k ot\u00e1zce ekonomick\u00e9 stavby elektrovodn\u00fdch s\u00edt\u00ed. In: Elektrotechnick\u00fd obzor, Czech, German, vol. 15, pp. 153\u2013154 (1926). http:\/\/hdl.handle.net\/10338.dmlcz\/500188"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956). https:\/\/doi.org\/10.1090\/S0002-9939-1956-0078686-7","journal-title":"Proc. Am. Math. Soc."},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957). https:\/\/doi.org\/10.1002\/j.1538-7305.1957.tb01515.x","journal-title":"Bell Syst. Tech. J."},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Ne\u0161et\u0159il, J., Milkov\u00e1, E., Ne\u0161et\u0159ilov\u00e1, H.: Otakar Bor\u016fvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history. Disc. Math. 233(1\u20133), 3\u201336 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00224-7","DOI":"10.1016\/S0012-365X(00)00224-7"},{"key":"8_CR13","unstructured":"Bock, H.-H.: Origins and extensions of the $$ k $$-means algorithm in cluster analysis. J. Electronique d\u2019Histoire des Probabilit\u00e9s et de la Statistique\/Electron. J. Hist. Probabil. Stat. 4(2), 1\u201318 (2008). http:\/\/www.jehps.net\/Decembre2008\/Bock.pdf"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-540-27868-9_54","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"A Gribov","year":"2004","unstructured":"Gribov, A., Bodansky, E.: A new method of polyline approximation. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR \/SPR 2004. LNCS, vol. 3138, pp. 504\u2013511. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27868-9_54"},{"key":"8_CR15","unstructured":"Gribov, A., Duri, K.: Reconstruction of power lines from point clouds, pp. 1\u201315. ArXiv e-prints (2022). https:\/\/arxiv.org\/abs\/2201.12499"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust Region Methods. Society for Industrial and Applied Mathematics (2000). https:\/\/doi.org\/10.1137\/1.9780898719857","DOI":"10.1137\/1.9780898719857"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K Levenberg","year":"1944","unstructured":"Levenberg, K.: A method for the solution of certain non-linear problems in least squares. Q. Appl. Math. 2, 164\u2013168 (1944). https:\/\/doi.org\/10.1090\/qam\/10666","journal-title":"Q. Appl. Math."},{"issue":"2","key":"8_CR18","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"DW Marquardt","year":"1963","unstructured":"Marquardt, D.W.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Ind. Appl. Math. 11(2), 431\u2013441 (1963). https:\/\/doi.org\/10.1137\/0111030","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"8_CR19","unstructured":"Ranganathan, A.: The Levenberg-Marquardt algorithm (2004). http:\/\/www.ananth.in\/Notes_files\/lmtut.pdf"},{"key":"8_CR20","unstructured":"Gavin, H.P.: The Levenberg-Marquardt method for nonlinear least squares curve-fitting problems (2020). https:\/\/people.duke.edu\/~hpgavin\/ce281\/lm.pdf"},{"key":"8_CR21","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes, Third Edition: The Art of Scientific Computing. Cambridge University Press, Cambridge (2007). www.cambridge.org\/9780521880688"},{"key":"8_CR22","unstructured":"Extract power lines from point cloud (3D Analyst). Retrieved October 2021. https:\/\/pro.arcgis.com\/en\/pro-app\/latest\/tool-reference\/3d-analyst\/extract-power-lines-from-point-cloud.htm"}],"container-title":["Lecture Notes in Computer Science","Document Analysis and Recognition \u2013 ICDAR 2023 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41498-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T19:24:46Z","timestamp":1692041086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41498-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031414978","9783031414985"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41498-5_8","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":"15 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Document Analysis and Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Jos\u00e9, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdar2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdar2023.org\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"316","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":"154","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":"49% - 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.89","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":"1.50","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)"}},{"value":"Number and type of other papers accepted : IJDAR track papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}