{"id":"https://openalex.org/W2896772426","doi":"https://doi.org/10.1109/bigmm.2018.8499296","title":"Stacked K-Means Hashing Quantization for Nearest Neighbor Search","display_name":"Stacked K-Means Hashing Quantization for Nearest Neighbor Search","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2896772426","doi":"https://doi.org/10.1109/bigmm.2018.8499296","mag":"2896772426"},"language":"en","primary_location":{"id":"doi:10.1109/bigmm.2018.8499296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigmm.2018.8499296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Fourth International Conference on Multimedia Big Data (BigMM)","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/A5087414478","display_name":"Yalin Chen","orcid":"https://orcid.org/0000-0002-3515-3360"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yalin Chen","raw_affiliation_strings":["Dalian Maritime University, Dalian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100730072","display_name":"Zhiyang Li","orcid":"https://orcid.org/0000-0002-5396-3447"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiyang Li","raw_affiliation_strings":["Dalian Maritime University, Dalian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101969482","display_name":"Jia Shi","orcid":"https://orcid.org/0000-0002-6506-1504"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jia Shi","raw_affiliation_strings":["Dalian Maritime University, Dalian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056093982","display_name":"Zhaobin Liu","orcid":"https://orcid.org/0000-0002-3203-6118"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhaobin Liu","raw_affiliation_strings":["Dalian Maritime University, Dalian, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian Maritime University, Dalian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041346888","display_name":"Wenyu Qu","orcid":"https://orcid.org/0000-0003-4817-5187"},"institutions":[{"id":"https://openalex.org/I162868743","display_name":"Tianjin University","ror":"https://ror.org/012tb2g32","country_code":"CN","type":"education","lineage":["https://openalex.org/I162868743"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenyu Qu","raw_affiliation_strings":["Tianjin University, Tianjin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tianjin University, Tianjin, China","institution_ids":["https://openalex.org/I162868743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"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.9998999834060669,"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.9998999834060669,"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/T10331","display_name":"Video Surveillance and Tracking Methods","score":0.9975000023841858,"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.9763000011444092,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6590169668197632},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6560686826705933},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.6166560649871826},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.6116844415664673},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.5499187111854553},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5478538870811462},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5294322967529297},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5116879940032959},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.5091504454612732},{"id":"https://openalex.org/keywords/locality-sensitive-hashing","display_name":"Locality-sensitive hashing","score":0.5081040859222412},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5079620480537415},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.49594053626060486},{"id":"https://openalex.org/keywords/quantization","display_name":"Quantization (signal processing)","score":0.4748518764972687},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.4734368324279785},{"id":"https://openalex.org/keywords/feature-hashing","display_name":"Feature hashing","score":0.4455403685569763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43528372049331665},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41443103551864624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39992356300354004},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.33937716484069824},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3191893696784973},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.2649695873260498},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23884829878807068},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17179283499717712},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.10503184795379639}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6590169668197632},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6560686826705933},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.6166560649871826},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.6116844415664673},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.5499187111854553},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5478538870811462},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5294322967529297},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5116879940032959},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.5091504454612732},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.5081040859222412},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5079620480537415},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.49594053626060486},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.4748518764972687},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.4734368324279785},{"id":"https://openalex.org/C133667856","wikidata":"https://www.wikidata.org/wiki/Q5439682","display_name":"Feature hashing","level":5,"score":0.4455403685569763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43528372049331665},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41443103551864624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39992356300354004},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.33937716484069824},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3191893696784973},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.2649695873260498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23884829878807068},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17179283499717712},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.10503184795379639},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigmm.2018.8499296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigmm.2018.8499296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Fourth International Conference on Multimedia Big Data (BigMM)","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":14,"referenced_works":["https://openalex.org/W272307001","https://openalex.org/W288635123","https://openalex.org/W1940543738","https://openalex.org/W1977182282","https://openalex.org/W2029205712","https://openalex.org/W2084363474","https://openalex.org/W2111006384","https://openalex.org/W2124509324","https://openalex.org/W2125671345","https://openalex.org/W2578537264","https://openalex.org/W2594105920","https://openalex.org/W4256757978","https://openalex.org/W6610514318","https://openalex.org/W6640501615"],"related_works":["https://openalex.org/W2100189723","https://openalex.org/W1554555624","https://openalex.org/W2184777945","https://openalex.org/W1998749283","https://openalex.org/W2253231004","https://openalex.org/W1997107867","https://openalex.org/W4212830455","https://openalex.org/W1982193706","https://openalex.org/W2104208555","https://openalex.org/W2074668987"],"abstract_inverted_index":{"Nowadays,":[0],"with":[1,46,135],"such":[2],"a":[3,30,58,111,125,130],"huge":[4],"amount":[5],"of":[6,32,76,84,119,153],"information":[7],"available":[8],"online,":[9],"one":[10],"key":[11],"challenge":[12],"is":[13,105],"how":[14],"to":[15,106],"retrieve":[16],"target":[17],"data":[18,28],"efficiently.":[19],"A":[20],"recent":[21],"state-of-art":[22],"solution,":[23],"k-means":[24,38,99],"hashing":[25,96,100],"(KMH),":[26],"codes":[27],"via":[29,129],"string":[31],"binary":[33,41],"code":[34,42],"obtained":[35],"by":[36,68,110,156],"iterative":[37],"clustering":[39],"and":[40,63],"optimizing.":[43],"To":[44,88],"deal":[45],"high":[47],"dimensional":[48],"data,":[49],"KMH":[50,136],"divides":[51],"the":[52,69,74,77,82,85,108,151],"space":[53],"into":[54],"low-dimensional":[55],"subspaces,":[56],"places":[57],"hypercube":[59,86],"in":[60,160],"each":[61],"subspace":[62],"finds":[64],"its":[65],"proper":[66],"location":[67],"mentioned":[70],"optimizing":[71,132],"process.":[72],"However,":[73],"complexity":[75],"optimization":[78],"increases":[79],"rapidly":[80],"when":[81],"dimension":[83],"increases.":[87],"address":[89],"this":[90],"issue,":[91],"we":[92],"propose":[93],"an":[94],"improved":[95],"method":[97,137,155],"stacked":[98],"(SKMH).":[101],"The":[102],"main":[103],"idea":[104],"increase":[107],"approximation":[109,127],"coarse-to-fine":[112],"multi-layer":[113],"lower-dimensional":[114,120],"cubes.":[115,140],"With":[116],"these":[117],"kinds":[118],"cubes,":[121],"SKMH":[122],"can":[123],"achieve":[124],"similar":[126],"ability":[128],"less":[131],"time,":[133],"compared":[134],"using":[138],"higher-dimensional":[139],"Extensive":[141],"experiments":[142],"have":[143],"been":[144],"conducted":[145],"on":[146],"two":[147],"public":[148],"databases,":[149],"demonstrating":[150],"performance":[152],"our":[154],"some":[157],"common":[158],"metrics":[159],"fast":[161],"nearest":[162],"neighbor":[163],"search.":[164]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}