{"id":"https://openalex.org/W2557733076","doi":"https://doi.org/10.1109/ivcnz.2015.7761538","title":"How to select hashing bits? A direct measurement approach","display_name":"How to select hashing bits? A direct measurement approach","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2557733076","doi":"https://doi.org/10.1109/ivcnz.2015.7761538","mag":"2557733076"},"language":"en","primary_location":{"id":"doi:10.1109/ivcnz.2015.7761538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ivcnz.2015.7761538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Image and Vision Computing New Zealand (IVCNZ)","raw_type":"proceedings-article"},"type":"article","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/A5043701100","display_name":"Xiping Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I80281795","display_name":"University of Otago","ror":"https://ror.org/01jmxt844","country_code":"NZ","type":"education","lineage":["https://openalex.org/I80281795"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Xiping Fu","raw_affiliation_strings":["Dept. of Computer Science, University of Otago, Dunedin, NZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Otago, Dunedin, NZ","institution_ids":["https://openalex.org/I80281795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045878695","display_name":"Brendan McCane","orcid":"https://orcid.org/0000-0001-8055-3331"},"institutions":[{"id":"https://openalex.org/I80281795","display_name":"University of Otago","ror":"https://ror.org/01jmxt844","country_code":"NZ","type":"education","lineage":["https://openalex.org/I80281795"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Brendan McCane","raw_affiliation_strings":["Dept. of Computer Science, University of Otago, Dunedin, NZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Otago, Dunedin, NZ","institution_ids":["https://openalex.org/I80281795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000800532","display_name":"Steven Mills","orcid":"https://orcid.org/0000-0002-4933-7777"},"institutions":[{"id":"https://openalex.org/I80281795","display_name":"University of Otago","ror":"https://ror.org/01jmxt844","country_code":"NZ","type":"education","lineage":["https://openalex.org/I80281795"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Steven Mills","raw_affiliation_strings":["Dept. of Computer Science, University of Otago, Dunedin, NZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Otago, Dunedin, NZ","institution_ids":["https://openalex.org/I80281795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001631971","display_name":"Michael Albert","orcid":"https://orcid.org/0009-0006-0659-7743"},"institutions":[{"id":"https://openalex.org/I80281795","display_name":"University of Otago","ror":"https://ror.org/01jmxt844","country_code":"NZ","type":"education","lineage":["https://openalex.org/I80281795"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Michael Albert","raw_affiliation_strings":["Dept. of Computer Science, University of Otago, Dunedin, NZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Otago, Dunedin, NZ","institution_ids":["https://openalex.org/I80281795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24378158,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"220","issue":null,"first_page":"1","last_page":"6"},"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":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.9837999939918518,"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/computer-science","display_name":"Computer science","score":0.6856775879859924},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.6734469532966614},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.6079820990562439},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.572134792804718},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5473331809043884},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4971366226673126},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.48785829544067383},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48165857791900635},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.4723794758319855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4620681405067444},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.44243958592414856},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.4361320436000824},{"id":"https://openalex.org/keywords/consistent-hashing","display_name":"Consistent hashing","score":0.41048139333724976},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3379825949668884},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.27836713194847107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21681076288223267},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1636452078819275},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.12785407900810242}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6856775879859924},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.6734469532966614},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.6079820990562439},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.572134792804718},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5473331809043884},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4971366226673126},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.48785829544067383},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48165857791900635},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.4723794758319855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4620681405067444},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.44243958592414856},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.4361320436000824},{"id":"https://openalex.org/C56856351","wikidata":"https://www.wikidata.org/wiki/Q1757218","display_name":"Consistent hashing","level":5,"score":0.41048139333724976},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3379825949668884},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.27836713194847107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21681076288223267},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1636452078819275},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.12785407900810242},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ivcnz.2015.7761538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ivcnz.2015.7761538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Image and Vision Computing New Zealand (IVCNZ)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W14890737","https://openalex.org/W1225120373","https://openalex.org/W1922199343","https://openalex.org/W1972036246","https://openalex.org/W2007972815","https://openalex.org/W2010642153","https://openalex.org/W2024060531","https://openalex.org/W2029205712","https://openalex.org/W2084363474","https://openalex.org/W2089632823","https://openalex.org/W2124509324","https://openalex.org/W2147717514","https://openalex.org/W2148554573","https://openalex.org/W2162006472","https://openalex.org/W2171790913","https://openalex.org/W2221852422","https://openalex.org/W2251864938","https://openalex.org/W2253231004","https://openalex.org/W2293597654","https://openalex.org/W6600599744","https://openalex.org/W6627797583","https://openalex.org/W6688844344","https://openalex.org/W6691474080","https://openalex.org/W6697214482"],"related_works":["https://openalex.org/W156296397","https://openalex.org/W2184777945","https://openalex.org/W2949049896","https://openalex.org/W2100189723","https://openalex.org/W2058196845","https://openalex.org/W2292992741","https://openalex.org/W2981938443","https://openalex.org/W4212830455","https://openalex.org/W1982193706","https://openalex.org/W2075667668"],"abstract_inverted_index":{"Hashing,":[0],"which":[1],"encodes":[2],"data":[3],"points":[4],"into":[5],"binary":[6],"codes,":[7],"has":[8],"become":[9],"a":[10,27,35,41,64],"popular":[11],"approach":[12],"for":[13],"approximate":[14,50],"nearest":[15,51],"neighbor":[16,52],"searching":[17,53],"tasks":[18],"because":[19],"of":[20,29,37],"its":[21],"storage":[22],"and":[23,77],"retrieval":[24],"efficiency.":[25],"Given":[26],"pool":[28],"bits,":[30],"we":[31],"propose":[32],"to":[33,40,46,62],"select":[34],"set":[36],"bits":[38],"according":[39],"quality":[42],"measurement":[43],"directly":[44],"related":[45],"the":[47],"large":[48],"scale":[49],"problem.":[54],"An":[55],"alternating":[56],"greedy":[57],"optimization":[58,73],"method":[59,74],"is":[60,75],"proposed":[61],"find":[63],"locally":[65],"optimal":[66],"solution.":[67],"The":[68],"experimental":[69],"results":[70],"show":[71],"this":[72],"efficient":[76],"effective.":[78]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}