Consider a set of S of n data points in real d-dimensional space, Rd, where distances are
measured using any Minkowski metric. In nearest neighbor searching, we preprocess S into …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

This paper presents a survey of the literature on the information-theoretic problems of
statistical inference under multiterminal data compression with rate constraints. Significant …

In fractal image compression the encoding step is computationally expensive. A large
number of sequential searches through a list of domains (portions of the image) are carried …

License-plate location in sensor images plays an important role in vehicle identification for
automated transport systems (ATS). This paper presents a novel method based on vector …

In this paper, a new and fast encoding algorithm for vector quantization is presented. This
algorithm makes full use of two characteristics of a vector: the sum and the variance. A vector …

In the field of digital multimedia, numerous researchers have exploited data hiding for
providing secure communications. Because most multimedia is compressed in advance to …

In this letter, we present a fast encoding algorithm for vector quantization that uses two
characteristics of a vector, mean, and variance. Although a similar method using these …

In this paper we propose partial yet efficient codebook search algorithm which uses sorting
technique and uses only comparison. Our proposed algorithm does not use Euclidean …

In this paper we propose segmentation approach based on Vector Quantization technique.
Here we have used Kekre's fast codebook generation algorithm for segmenting low-altitude …