{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:15:16Z","timestamp":1773792916692,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/iscas.2004.1328887","type":"proceedings-article","created":{"date-parts":[[2004,9,7]],"date-time":"2004-09-07T10:26:45Z","timestamp":1094552805000},"page":"III-877","source":"Crossref","is-referenced-by-count":0,"title":["Fast search algorithms for ECVQ using projection pyramids and variance of codewords"],"prefix":"10.1109","author":[{"given":"A.","family":"Swilem","sequence":"first","affiliation":[{"name":"Kanazawa Univ., Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Imamura","sequence":"additional","affiliation":[{"name":"Kanazawa Univ., Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Hashimoto","sequence":"additional","affiliation":[{"name":"Kanazawa Univ., Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1049\/ip-vis:19941140"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/29.17498"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1049\/el:20000237"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICIAP.1999.797733"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/83.977878"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.1996.560521"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095851"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2003.1206013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/83.855438"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094577"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1109\/26.380218","article-title":"A fast search algorithm for vector quantization using mean pyramids of codewords","volume":"43","author":"lee","year":"1995","journal-title":"IEEE Trans Commun"},{"key":"ref1","author":"gersho","year":"1991","journal-title":"Vector Quantization and Signal Compression"}],"event":{"name":"2004 IEEE International Symposium on Circuits and Systems (ISCAS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2004,5,23]]},"end":{"date-parts":[[2004,5,26]]}},"container-title":["2004 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9255\/29374\/01328887.pdf?arnumber=1328887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:23:09Z","timestamp":1773778989000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1328887\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/iscas.2004.1328887","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}