{"id":"https://openalex.org/W2112359824","doi":"https://doi.org/10.1109/cvpr.2003.1211361","title":"The optimal distance measure for object detection","display_name":"The optimal distance measure for object detection","publication_year":2003,"publication_date":"2003-11-20","ids":{"openalex":"https://openalex.org/W2112359824","doi":"https://doi.org/10.1109/cvpr.2003.1211361","mag":"2112359824"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2003.1211361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2003.1211361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/The_Optimal_Distance_Measure_for_Object_Detection/6561257","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035919672","display_name":"S. Mahamud","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Mahamud","raw_affiliation_strings":["Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075246991","display_name":"Martial Hebert","orcid":"https://orcid.org/0000-0003-4566-5930"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Hebert","raw_affiliation_strings":["Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035919672"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":4.0409,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.94216418,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":null,"first_page":"I","last_page":"248"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10689","display_name":"Remote-Sensing Image Classification","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6854872107505798},{"id":"https://openalex.org/keywords/discriminative-model","display_name":"Discriminative model","score":0.6726979613304138},{"id":"https://openalex.org/keywords/distance-measures","display_name":"Distance measures","score":0.6590027809143066},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.6535515189170837},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6103854179382324},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.6096884608268738},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5927358865737915},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5857293605804443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5776005387306213},{"id":"https://openalex.org/keywords/object-detection","display_name":"Object detection","score":0.48019134998321533},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4686291515827179},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4531446397304535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4061972498893738},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2864277958869934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27301132678985596}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6854872107505798},{"id":"https://openalex.org/C97931131","wikidata":"https://www.wikidata.org/wiki/Q5282087","display_name":"Discriminative model","level":2,"score":0.6726979613304138},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.6590027809143066},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.6535515189170837},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6103854179382324},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.6096884608268738},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5927358865737915},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5857293605804443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5776005387306213},{"id":"https://openalex.org/C2776151529","wikidata":"https://www.wikidata.org/wiki/Q3045304","display_name":"Object detection","level":3,"score":0.48019134998321533},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4686291515827179},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4531446397304535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4061972498893738},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2864277958869934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27301132678985596},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/cvpr.2003.1211361","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2003.1211361","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.cmu.edu:robotics-1448","is_oa":false,"landing_page_url":"http://repository.cmu.edu/robotics/449","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Robotics Institute","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.6886","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.6886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~mahamud/cvpr-2003.pdf","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/6561257","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/The_Optimal_Distance_Measure_for_Object_Detection/6561257","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.1184/r1/6561257.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6561257.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/6561257","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/The_Optimal_Distance_Measure_for_Object_Detection/6561257","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W965934442","https://openalex.org/W1493297678","https://openalex.org/W1553558465","https://openalex.org/W1599057775","https://openalex.org/W1610836425","https://openalex.org/W1931972414","https://openalex.org/W2026311529","https://openalex.org/W2057175746","https://openalex.org/W2096077837","https://openalex.org/W2113119382","https://openalex.org/W2140758332","https://openalex.org/W2147717514","https://openalex.org/W2151709124","https://openalex.org/W2157237807","https://openalex.org/W2160754664","https://openalex.org/W2163030924","https://openalex.org/W2170120409","https://openalex.org/W2609517418","https://openalex.org/W2914885528","https://openalex.org/W6629421317"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455"],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,11,59,78,94,146,168],"multi-class":[3],"object":[4,16,162,170],"detection":[5,171,178],"framework":[6,122],"whose":[7],"core":[8],"component":[9],"is":[10,25,151],"nearest":[12,35,158],"neighbor":[13,36,49,159],"search":[14,50,114,160],"over":[15,115,161],"part":[17,163],"classes.":[18,68],"The":[19],"performance":[20],"of":[21,61,87,96],"the":[22,29,34,43,47,56,73,84,120,141,157],"overall":[23],"system":[24,172],"critically":[26],"dependent":[27],"on":[28],"distance":[30,39,75,90,128,138,148],"measure":[31,40,76],"used":[32],"in":[33,110],"search.":[37],"A":[38],"that":[41,58,82,150],"minimizes":[42],"misclassification":[44],"risk":[45],"for":[46],"1-nearest":[48],"can":[51],"be":[52,55],"shown":[53],"to":[54,66,98,112,125],"probability":[57],"pair":[60],"input":[62],"image":[63],"measurements":[64],"belong":[65],"different":[67],"In":[69],"practice,":[70],"we":[71,144],"model":[72,81,139,149],"optimal":[74],"using":[77],"linear":[79],"logistic":[80],"combines":[83],"discriminative":[85],"powers":[86],"more":[88],"elementary":[89],"measures":[91,129],"associated":[92,130],"with":[93,131,140],"collection":[95],"simple":[97,132],"construct":[99],"feature":[100],"spaces":[101],"like":[102],"color,":[103],"texture":[104],"and":[105,154,173],"local":[106],"shape":[107],"properties.":[108],"Furthermore,":[109],"order":[111],"perform":[113],"large":[116],"training":[117],"sets":[118],"efficiently,":[119],"same":[121],"was":[123,165],"extended":[124],"find":[126],"hamming":[127],"discriminators.":[133],"By":[134],"combining":[135],"this":[136],"discrete":[137],"continuous":[142],"model,":[143],"obtain":[145],"hierarchical":[147],"both":[152],"fast":[153],"accurate.":[155],"Finally,":[156],"classes":[164],"integrated":[166],"into":[167],"whole":[169],"evaluated":[174],"against":[175],"an":[176],"indoor":[177],"task":[179],"yielding":[180],"good":[181],"results.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-12T06:05:19.336698","created_date":"2025-10-10T00:00:00"}