• DocumentCode
    3411851
  • Title

    Gradient preserving quantization

  • Author

    Makar, M. ; Lakshman, H. ; Chandrasekhar, V. ; Girod, B.

  • Author_Institution
    Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
  • fYear
    2012
  • fDate
    Sept. 30 2012-Oct. 3 2012
  • Firstpage
    2505
  • Lastpage
    2508
  • Abstract
    Local features are widely used for content-based image retrieval and object recognition. Most feature descriptors are calculated from the gradients of a canonical patch around repeatable keypoints in the image. In this paper, we propose a technique for designing quantization matrices that reduce the mean squared error distortion of the gradient derived from DCT-encoded canonical patches. Experimental results demonstrate that our proposed patch encoder greatly outperforms a JPEG encoder at the same encoding complexity. Moreover, our quantization matrices achieve lower gradient distortion and larger number of feature matches at the same bit-rate.
  • Keywords
    discrete cosine transforms; image coding; matrix algebra; mean square error methods; DCT-encoded canonical patch; content-based image retrieval; encoding complexity; feature descriptors; gradient distortion; gradient preserving quantization; local feature; mean squared error distortion; object recognition; quantization matrix; Discrete cosine transforms; Feature extraction; Image coding; Image matching; Quantization; Transform coding; Image compression; gradient; image matching; quantization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing (ICIP), 2012 19th IEEE International Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    1522-4880
  • Print_ISBN
    978-1-4673-2534-9
  • Electronic_ISBN
    1522-4880
  • Type

    conf

  • DOI
    10.1109/ICIP.2012.6467407
  • Filename
    6467407