DCT histogram optimization for image database retrieval

  • Authors:
  • Daidi Zhong;Irek Defée

  • Affiliations:
  • Institute of Signal Processing, Tampere University of Technology, P.O. Box 553, FIN-33101 Tampere, Finland;Institute of Signal Processing, Tampere University of Technology, P.O. Box 553, FIN-33101 Tampere, Finland

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2005

Quantified Score

Hi-index 0.10

Visualization

Abstract

Information extraction from images and video has been traditionally done in the pixel domain. Currently great majority of pictures and video are available in compressed form with compression based on block DCT transform. Compression removes significant amount of information leaving only perceptually important part and this has potential advantage from the information retrieval point. Optimization of compression for retrieval purposes is thus of interest but topic has not been much emphasized in the past. In this paper we study the problem of image database retrieval from the compression perspective. The approach is based on histograms of quantized DCT blocks. We show how these histograms can be optimized in order to achieve best retrieval performance by optimizing the selection of quantization factor and the number of DCT blocks under normalization of luminance. Results of experiments on face databases show that optimized histograms are robust in retrieval tasks. This indicates that selection and local feature compression optimization is an important step for effective pattern retrieval.