NDLI: Fast encoding method for vector quantization based on subvector technique with a modified data structure

Content Provider	IEEE Xplore Digital Library
Author	Zhibin Pan Kotani, K. Ohmi, T.
Copyright Year	2004
Description	Author affiliation: New Ind. Creation Hatchery Center, Tohoku Univ., Sendai, Japan (Zhibin Pan)
Abstract	The encoding process of vector quantization (VQ) is a time bottleneck to its practical application. In order to speed up the process of VQ encoding, it is possible to estimate the Euclidean distance first with just a lighter computation to try to reject a candidate codeword. In order to estimate the Euclidean distance, appropriate features of a vector become necessary. By using the famous statistical features of the sum and variance for a k-dimensional vector and furthermore for its two corresponding (k/2)-dimensional subvectors, it is easy to estimate the Euclidean distance so as to reject most of the unlikely codewords for a certain input vector (Guan, L and Kamel, M., 1992; Lec, C.H. and Chen, L H., 1994; Baek, S. et al., 1997; Pan, J.S. et al., 2003). Because it is very heavy to compute the variance of a k-dimensional vector online, a new feature, which is based on the variances of two subvectors, is constructed to estimate the Euclidean distance. Meanwhile, a modified more memory-efficient data structure is proposed for storing all features of a vector to reduce extra memory requirement compared to the latest previous work (Pan, J.S. et al., 2003). Experimental results confirmed that the proposed method is more search efficient.
Sponsorship	IEEE
Starting Page	570
Ending Page	573
File Size	931095
Page Count	4
File Format	PDF
ISBN	0780386396
DOI	10.1109/ISPACS.2004.1439121
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-11-18
Publisher Place	South Korea
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Encoding Vector quantization Data structures Euclidean distance Image coding Nearest neighbor searches Search methods Electronics industry Industrial electronics Data engineering
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Improved fast encoding method for vector quantization based on subvector technique

Fast encoding method for vector quantization by dynamically constructing subvectors

Fast encoding method for vector quantization based on a new mixed pyramid data structure [image coding applications]

An enhanced fast encoding method for vector quantization by constructing new feature based on the variances of subvectors

An improved fast encoding method for vector quantization based on memory-efficient data structure

Fast search method for vector quantization by simultaneously using two subvectors

A memory-efficient fast encoding method for vector quantization using 2-pixel-merging sum pyramid

Fast nearest neighbor search for vector quantization of image data

Improved fast encoding method of vector quantization based on dynamic element reordering for codewords

Fast encoding method for vector quantization based on subvector technique with a modified data structure

Similar Documents

Improved fast encoding method for vector quantization based on subvector technique

Fast encoding method for vector quantization by dynamically constructing subvectors

Fast encoding method for vector quantization based on a new mixed pyramid data structure [image coding applications]

An enhanced fast encoding method for vector quantization by constructing new feature based on the variances of subvectors

An improved fast encoding method for vector quantization based on memory-efficient data structure

Fast search method for vector quantization by simultaneously using two subvectors

A memory-efficient fast encoding method for vector quantization using 2-pixel-merging sum pyramid

Fast nearest neighbor search for vector quantization of image data

Improved fast encoding method of vector quantization based on dynamic element reordering for codewords

Fast encoding method for vector quantization based on subvector technique with a modified data structure