{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T21:10:04Z","timestamp":1743887404377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337193"},{"type":"electronic","value":"9783030337209"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-33720-9_45","type":"book-chapter","created":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T10:48:15Z","timestamp":1576666095000},"page":"579-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Swarm Optimization Algorithm for Road Bypass Extrapolation"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Rowland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glenn M.","family":"Suir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael L.","family":"Mayo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Austin","family":"Davis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"issue":"1","key":"45_CR1","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. Numerishe Math. 1(1), 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numerishe Math."},{"key":"45_CR2","volume-title":"Linear Programming and Extensions","author":"GB Danzig","year":"1962","unstructured":"Danzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1962)"},{"issue":"2","key":"45_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968). https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"45_CR4","doi-asserted-by":"publisher","unstructured":"Meyer, U.: Single-source shortest-paths on arbitrary directed graphs in linear average-case time. In: 12th Symposium on Discrete Algorithms, pp. 797\u2013806 (2001). https:\/\/doi.org\/10.1145\/365411.365784","DOI":"10.1145\/365411.365784"},{"key":"45_CR5","doi-asserted-by":"publisher","unstructured":"Thorup, M.: Integer Priority queues with decrease key in constant time and the single soruce shortest paths problem. In: 35th ACM Symposium on Theory of Computing, pp. 149\u2013158 (2003). https:\/\/doi.org\/10.1016\/j.jcss.2004.04.003","DOI":"10.1016\/j.jcss.2004.04.003"},{"key":"45_CR6","unstructured":"Goldbeter, A.V., Harrelson, C.: Computing the shortest path: A* meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 156\u2013165. ACM Press, New York (2005)"},{"key":"45_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., Brattari, M.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"10","key":"45_CR8","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1109\/JSTARS.2015.2477097","volume":"8","author":"D Yin","year":"2015","unstructured":"Yin, D., Du, S., Wang, S., Guo, Z.: A direction-guided ant colony optimization method for extraction of urban road information from very-high-resolution images. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sen. 8(10), 4785\u20134794 (2015). https:\/\/doi.org\/10.1109\/JSTARS.2015.2477097","journal-title":"IEEE J. Sel. Top. Appl. Earth Obs. Remote Sen."},{"issue":"1","key":"45_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1080\/01431161.2016.1264026","volume":"38","author":"M Maboudi","year":"2017","unstructured":"Maboudi, M., Amini, J., Hahn, M., Saati, M.: Object-based road extraction from satellite images using ant colony optimization. Int. J. Remote Sens. 38(1), 179\u2013198 (2017). https:\/\/doi.org\/10.1080\/01431161.2016.1264026","journal-title":"Int. J. Remote Sens."},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Suir, G.M., Reif, M., Hammond, S., Jackson, S., Brodie, K.: Unmanned Aircraft Systems to Support Environmental Applications within USACE Civil Works. No. ERDC SR-18-3, U.S. Engineer Research and Development Center, Vicksburg, MS (2018)","DOI":"10.21079\/11681\/27428"},{"key":"45_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.ocecoaman.2018.10.029","volume":"168","author":"GM Suir","year":"2018","unstructured":"Suir, G.M., Sasser, C.E.: Redistribution and impacts of nearshore berm sediments on the Chandeleur barrier islands, Louisiana. Ocean Coast. Manag. 168, 103\u2013115 (2018)","journal-title":"Ocean Coast. Manag."},{"key":"45_CR12","unstructured":"RedEdge by MicaSense. http:\/\/www.micasense.com\/rededge\/. Accessed 16 Apr 2019"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Broussard III, W., Suir, G.M., Visser, J.M.: Unmanned Aircraft Systems (UAS) and Satellite Imagery Collections in a Coastal Intermediate Marsh to Determine the Land-Water Interface, Vegetation Types, and Normalized Difference Vegetation Index (NDVI) Values. No. ERDC\/TN WRAP-18-1, U.S. Engineer Research and Development Center, Vicksburg, MS (2018)","DOI":"10.21079\/11681\/29517"},{"key":"45_CR14","unstructured":"ENVI: ENVI Field Guide - ENVI Feature Extraction Module User\u2019s Guide. ITT Visual Information Solutions, Boulder, CO (2008)"},{"key":"45_CR15","unstructured":"ENVI: ENVI Classification Tools. ITT Visual Information Solutions, Boulder, CO (2019) https:\/\/www.harrisgeospatial\/docs\/editclassificationimages.html"},{"key":"45_CR16","unstructured":"Suir, G.M., Jones, W.R., Garber, A.L., Gailani, J.Z: Landscape Evolution of the Oil Spill Mitigation Sand Bern in the Chandeleur Islands, Louisiana. No. ERDC-TR-16-15, US Army Engineer Research and Development Center, Vicksburg, MS (2016)"},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"e453","DOI":"10.7717\/peerj.453","volume":"2","author":"S van der Walt","year":"2014","unstructured":"van der Walt, S., et al.: Scikit-image: image processing in Python. PeerJ 2, e453 (2014). https:\/\/doi.org\/10.7717\/peerj.453","journal-title":"PeerJ"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33720-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T20:51:56Z","timestamp":1743886316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-33720-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337193","9783030337209"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33720-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISVC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Visual Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lake Tahoe, NV","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isvc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isvc.net\/","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":"163","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":"91","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":"56% - 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)"}}]}}