{"id":"https://openalex.org/W2294345698","doi":"https://doi.org/10.1109/cvpr.2008.4587819","title":"Finding trails","display_name":"Finding trails","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2294345698","doi":"https://doi.org/10.1109/cvpr.2008.4587819","mag":"2294345698"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2008.4587819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2008.4587819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070715293","display_name":"Scott H. Morris","orcid":"https://orcid.org/0000-0001-9684-4627"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Scott Morris","raw_affiliation_strings":["Computer Science Department, University of Arizona Tucson, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Arizona Tucson, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082471157","display_name":"Kobus Barnard","orcid":"https://orcid.org/0000-0002-8568-9518"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kobus Barnard","raw_affiliation_strings":["Computer Science Department, University of Arizona Tucson, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Arizona Tucson, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I138006243"],"apc_list":null,"apc_paid":null,"fwci":2.7042,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.89189189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9708999991416931,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6736932992935181},{"id":"https://openalex.org/keywords/pixel","display_name":"Pixel","score":0.6519246697425842},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5707082748413086},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4633871018886566},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43452364206314087},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.42893102765083313},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.426617830991745},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3666823208332062},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.33011215925216675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3263043761253357},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21559691429138184}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6736932992935181},{"id":"https://openalex.org/C160633673","wikidata":"https://www.wikidata.org/wiki/Q355198","display_name":"Pixel","level":2,"score":0.6519246697425842},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5707082748413086},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4633871018886566},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43452364206314087},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42893102765083313},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.426617830991745},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3666823208332062},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.33011215925216675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3263043761253357},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21559691429138184},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cvpr.2008.4587819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2008.4587819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W298422314","https://openalex.org/W1488650253","https://openalex.org/W1511279056","https://openalex.org/W1540550673","https://openalex.org/W1625504505","https://openalex.org/W1934863104","https://openalex.org/W2049633694","https://openalex.org/W2056760934","https://openalex.org/W2104095591","https://openalex.org/W2115738369","https://openalex.org/W2121947440","https://openalex.org/W2128439793","https://openalex.org/W2137471889","https://openalex.org/W2138309709","https://openalex.org/W2140000690","https://openalex.org/W2156909104","https://openalex.org/W2465039551","https://openalex.org/W2481018560","https://openalex.org/W2752885492","https://openalex.org/W3037554287","https://openalex.org/W4285719527","https://openalex.org/W6636859864","https://openalex.org/W6678889226"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"We":[0,153,193,205],"present":[1,123],"a":[2,116,131,141,159,185,201],"statistical":[3],"learning":[4],"approach":[5,95,208],"for":[6,65,99],"finding":[7,66,91,165],"recreational":[8,73],"trails":[9,40,46,67],"in":[10,24,31,225],"aerial":[11],"images.":[12],"While":[13],"the":[14,32,34,79,86,105,119,156,169,198,214,226],"problem":[15,37,89],"of":[16,38,90,158],"recognizing":[17],"relatively":[18],"straight":[19],"and":[20,47,57,75,150],"well":[21,29],"defined":[22],"roadways":[23],"digital":[25],"images":[26,212],"has":[27,41],"been":[28],"studied":[30],"literature,":[33],"more":[35,59,87],"difficult":[36],"extracting":[39],"received":[42],"no":[43],"attention.":[44],"However,":[45,167],"rough":[48],"roads":[49],"are":[50,83,229],"less":[51],"likely":[52],"to":[53,71,85,114],"be":[54,69],"adequately":[55],"mapped,":[56],"change":[58],"rapidly":[60],"over":[61],"time.":[62],"Automated":[63],"tools":[64],"will":[68],"useful":[70],"cartographers,":[72],"users":[74],"governments.":[76],"In":[77],"addition,":[78],"methods":[80,178],"developed":[81],"here":[82],"applicable":[84],"general":[88],"linear":[92],"structure.":[93],"Our":[94],"combines":[96],"local":[97,120],"estimates":[98],"image":[100],"pixel":[101],"trail":[102,164,171,202],"probabilities":[103],"with":[104,200],"global":[106,132,142,148],"constraint":[107],"that":[108,145,155],"such":[109],"pixels":[110],"must":[111],"link":[112],"together":[113],"form":[115],"path.":[117],"For":[118],"part,":[121],"we":[122,139,183],"results":[124,199],"using":[125],"three":[126],"classification":[127],"techniques.":[128],"To":[129],"construct":[130],"solution":[133],"(a":[134],"trail)":[135],"from":[136],"these":[137],"probabilities,":[138],"propose":[140],"cost":[143],"function":[144],"includes":[146],"both":[147],"probability":[149],"path":[151],"length.":[152],"show":[154],"addition":[157],"length":[160],"term":[161],"significantly":[162],"improves":[163],"ability.":[166],"computing":[168],"optimal":[170],"becomes":[172],"intractable":[173],"as":[174],"known":[175],"dynamic":[176],"programming":[177],"do":[179],"not":[180],"apply.":[181],"Thus":[182],"describe":[184],"new":[186],"splitting":[187],"heuristic":[188],"based":[189],"on":[190,209],"Dijkstra's":[191],"algorithm.":[192],"then":[194],"further":[195],"improve":[196],"upon":[197],"sampling":[203],"scheme.":[204],"test":[206],"our":[207],"500":[210],"challenging":[211],"along":[213],"2500":[215],"mile":[216],"continental":[217],"divide":[218],"mountain":[219],"bike":[220],"trail,":[221],"where":[222],"assumptions":[223],"prevalent":[224],"road":[227],"literature":[228],"violated.":[230]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-06-24T00:00:00"}