{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T13:10:01Z","timestamp":1747055401987,"version":"3.40.5"},"reference-count":14,"publisher":"American Institute of Aeronautics and Astronautics (AIAA)","issue":"1","license":[{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"am","delay-in-days":203,"URL":"https:\/\/www.aiaa.org\/userlicenses\/1.0\/#CompEndUserLicense"}],"funder":[{"DOI":"10.13039\/100006282","name":"Federal Aviation Administration","doi-asserted-by":"publisher","award":["AWD-102445"],"award-info":[{"award-number":["AWD-102445"]}],"id":[{"id":"10.13039\/100006282","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["arc.aiaa.org"],"crossmark-restriction":true},"short-container-title":["Journal of Aerospace Information Systems"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p> Helicopter wire strikes have been one of the most common sources of accidents in the past seven years. Poles and wires can be difficult to see for rotorcraft pilots because of their size, their location, and their blending into the background. This motivates the need to provide pilots with more tools and information about wire and pole locations. However, there is currently no comprehensive dataset summarizing the locations of poles and wires. As such, this work aims to leverage various types of data sources to generate a database of wires of interest. The proposed approach consists in first detecting pole and wire locations and then predicting a wire network. The first step combines a semantic segmentation approach applied to satellite imagery and a convolutional neural network classifier applied to street-view imagery to predict wire and pole locations. The second step applies the many-to-many Dijkstra algorithm to connect the predicted locations and generate a predicted wire map. This two-step approach is applied to a portion of Westchester County in New York, where publicly available imagery exists. Results indicate that this approach can successfully predict a wire map with high accuracy for wires alongside roads. <\/jats:p>","DOI":"10.2514\/1.i011427","type":"journal-article","created":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T17:10:42Z","timestamp":1739207442000},"page":"17-27","update-policy":"https:\/\/doi.org\/10.2514\/aiaa_crossmarkpolicy","source":"Crossref","is-referenced-by-count":0,"title":["Wire Databases Generation Using Deep Learning Methods for Rotorcraft Wire Strike Prevention"],"prefix":"10.2514","volume":"22","author":[{"given":"Gabriel","family":"Achour","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology"}]},{"given":"Caleb","family":"Harris","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]},{"given":"Alexia P.","family":"Payan","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]},{"given":"Dimitri N.","family":"Mavris","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]}],"member":"1387","reference":[{"key":"r3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2019.105665"},{"key":"r7","doi-asserted-by":"publisher","DOI":"10.1109\/MGRS.2017.2762307"},{"key":"r11","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2016.04.011"},{"key":"r12","doi-asserted-by":"publisher","DOI":"10.3390\/rs9080824"},{"key":"r13","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2007.895714"},{"key":"r14","doi-asserted-by":"publisher","DOI":"10.18100\/ijamec.60004"},{"key":"r16","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2016.04.011"},{"key":"r18","doi-asserted-by":"publisher","DOI":"10.3390\/rs10050661"},{"key":"r19","doi-asserted-by":"publisher","DOI":"10.3390\/s18082484"},{"key":"r22","unstructured":"SchultesD. \u201cRoute Planning in Road Networks,\u201d Ph.D. Dissertation, Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany, 2008."},{"key":"r23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"r24","unstructured":"KnoppS.SchulzF. \u201cEfficient Computation of Many-to-Many Shortest Paths,\u201d Ph.D. Dissertation, Universit\u00e4t Karlsruhe (TH), Karlsruhe, Germany, 2006."},{"key":"r26","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-019-0347-4"},{"key":"r29","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2795742"}],"container-title":["Journal of Aerospace Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arc.aiaa.org\/doi\/am-pdf\/10.2514\/1.I011427","content-type":"application\/pdf","content-version":"am","intended-application":"unspecified"},{"URL":"https:\/\/arc.aiaa.org\/doi\/pdf\/10.2514\/1.I011427","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/arc.aiaa.org\/doi\/pdf\/10.2514\/1.I011427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T12:41:43Z","timestamp":1747053703000},"score":1,"resource":{"primary":{"URL":"https:\/\/arc.aiaa.org\/doi\/10.2514\/1.I011427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.2514\/1.I011427"],"URL":"https:\/\/doi.org\/10.2514\/1.i011427","relation":{},"ISSN":["1940-3151","2327-3097"],"issn-type":[{"type":"print","value":"1940-3151"},{"type":"electronic","value":"2327-3097"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-01-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}