• Publications
  • Influence
QBIC project: querying images by content, using color, texture, and shape
The main algorithms for color texture, shape and sketch query that are presented, show example query results, and discuss future directions are presented.
Efficient Color Histogram Indexing for Quadratic Form Distance Functions
An improved shipping container having novel locking features in the end panel and corner flaps and improved bulge resistance at the end panels from sideward bulge of the product.
Successive refinement of information
It is shown that in order to achieve optimal successive refinement the necessary and sufficient conditions are that the solutions of the rate distortion problem can be written as a Markov chain and all finite alphabet signals with Hamming distortion satisfy these requirements.
Efficient and effective Querying by Image Content
A set of novel features and similarity measures allowing query by image content, together with the QBIC system, and a new theorem that makes efficient filtering possible by bounding the non-Euclidean, full cross-term quadratic distance expression with a simple Euclidean distance.
A new vector quantization clustering algorithm
  • W. Equitz
  • Mathematics, Computer Science
    IEEE Trans. Acoust. Speech Signal Process.
  • 1 October 1989
The pairwise nearest neighbor (PNN) algorithm is presented as an alternative to the Linde-Buzo-Gray (1980, LBG) (generalized Lloyd, 1982) algorithm for vector quantization clustering. The PNN
Interactive outlining: an improved approach using active contours
An improved method based on energy minimizing active contours or `snakes' is used to outline objects on images in an interactive environment using a two-stage algorithm and gives the user the possibility of incremental contour tracking, thus providing feedback on the refinement process.
Technical features of the JBIG standard for progressive bi-level image compression
The simple strategy of treating bit-planes as independent bi-level images for JBIG coding yields compressions at least comparable to and sometimes better than the JPEG standard in its lossless mode, making it attractive in a wide variety of environments.
Addendum to 'Successive refinement of information' (Mar 91 269-275)
Fast algorithms for vector quantization picture coding
  • W. Equitz
  • Computer Science, Mathematics
    ICASSP '87. IEEE International Conference on…
  • 1 April 1987
A data structure (k-d trees, developed by Bentley) is demonstrated to be appropriate for implementing exact nearest neighbor searching in time logarithmic in codebook size and is generalizable to any vector quantization application with the appropriate distortion measure.
Efficient query by image content for very large image databases
The QBIC project in the IBM Almaden Research Center in San Jose, CA is conducting a theoretical, experimental, and prototyping study of the problem of querying large still image databases efficiently based on image content to discover general principles and identify target application(s) for which concrete pilot systems will be prototyped.