{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T07:53:05Z","timestamp":1776930785891,"version":"3.51.2"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0165-1684(95)00009-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T05:23:11Z","timestamp":1027574591000},"page":"323-331","source":"Crossref","is-referenced-by-count":24,"title":["High-speed closest codeword search algorithms for vector quantization"],"prefix":"10.1016","volume":"43","author":[{"given":"Chang-Hsing","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling-Hwei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 10","key":"10.1016\/0165-1684(95)00009-3_BIB1","first-page":"1132","article-title":"An improvement of the minimum distortion encoding algorithm for vector quantization","volume":"Vol. COM-33","author":"Bei","year":"1985","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0165-1684(95)00009-3_BIB2","series-title":"Proc. IEEE Internat. Conf. Acoust. Speech Signal Process.","first-page":"9.11.1","article-title":"Fast search algorithms for vector quantization and pattern matching","author":"Cheng","year":"1984"},{"key":"10.1016\/0165-1684(95)00009-3_BIB3","series-title":"Proc. IEEE Internat. Conf. Acoust. Speech Signal Process.","first-page":"265","article-title":"A fast codebook search algorithm for nearest neighbour pattern matching","author":"Cheng","year":"1986"},{"key":"10.1016\/0165-1684(95)00009-3_BIB4","author":"Dougherty","year":"1990"},{"key":"10.1016\/0165-1684(95)00009-3_BIB5","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/29.35395","article-title":"A new vector quantization clustering algorithm","volume":"Vol. 37","author":"Equitz","year":"1989","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"10.1016\/0165-1684(95)00009-3_BIB6","author":"Gersho","year":"1992"},{"key":"10.1016\/0165-1684(95)00009-3_BIB7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/MASSP.1984.1162229","article-title":"Vector quantization","volume":"Vol. 1","author":"Gray","year":"1984","journal-title":"IEEE ASSP Magazine"},{"key":"10.1016\/0165-1684(95)00009-3_BIB8","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0167-8655(91)90014-D","article-title":"Fast codebook generatioin algorithm for vector quantization of images","volume":"Vol. 12","author":"Hsieh","year":"1991","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0165-1684(95)00009-3_BIB9","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/83.148613","article-title":"Fash full search equivalent encoding algorithms for image compression using vector quantization","volume":"Vol. 1","author":"Huang","year":"1992","journal-title":"IEEE Trans. Image Process."},{"key":"10.1016\/0165-1684(95)00009-3_BIB10","author":"Jain","year":"1988"},{"issue":"No. 1","key":"10.1016\/0165-1684(95)00009-3_BIB11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TCOM.1980.1094577","article-title":"An algorithm for vector quantizer design","volume":"Vol. COM-28","author":"Linde","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0165-1684(95)00009-3_BIB12","series-title":"Proc. IEEE Internat. Conf. Acoust. Speech Signal Process.","first-page":"2205","article-title":"Binary search trees for vector quantization","author":"Lowry","year":"1987"},{"issue":"No. 8","key":"10.1016\/0165-1684(95)00009-3_BIB13","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/26.3776","article-title":"Image coding using vector quantization: A review","volume":"Vol. COM-36","author":"Nasrabadi","year":"1988","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0165-1684(95)00009-3_BIB14","series-title":"Proc. IEEE Internat. Conf. Acoust. Speech Signal Process.","first-page":"2297","article-title":"A fast nearest-neighbor search algorithm","author":"Orchard","year":"1991"},{"key":"10.1016\/0165-1684(95)00009-3_BIB15","series-title":"Proc. European Signal Processing Conf.","first-page":"875","article-title":"An optimized k-d tree algorithm for fast vector quantization of speech","author":"Ramasubramanian","year":"1988"},{"issue":"No. 3","key":"10.1016\/0165-1684(95)00009-3_BIB16","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/78.120795","article-title":"Fast k-dimensional tree algorithms for nearest neighbor search with application to vector quantization encoding","volume":"Vol. 40","author":"Ramasubramanian","year":"1992","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/0165-1684(95)00009-3_BIB17","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0167-8655(92)90064-7","article-title":"An efficient approximation elimination algorithm for fast nearest-neighbor search based on a spherical distance coordinate formulation","volume":"Vol. 13","author":"Ramasubramanian","year":"1992","journal-title":"Pattern Recognition Lett."},{"issue":"No. 6","key":"10.1016\/0165-1684(95)00009-3_BIB18","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TCOM.1987.1096830","article-title":"An efficient nearest neighbor search method","volume":"Vol. COM-35","author":"Soleymani","year":"1987","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0165-1684(95)00009-3_BIB19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","article-title":"An algorithm for finding nearest neighbors in (approximately) constant average time complexity","volume":"Vol. 4","author":"Vidai","year":"1986","journal-title":"Pattern Recognition Lett."}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165168495000093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165168495000093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:27:02Z","timestamp":1556936822000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165168495000093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0165168495000093"],"URL":"https:\/\/doi.org\/10.1016\/0165-1684(95)00009-3","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}