• DocumentCode
    2477140
  • Title

    Greedy perceptual coding

  • Author

    Miller, Matt L.

  • Author_Institution
    NEC Labs. America, Princeton, NJ
  • fYear
    0
  • fDate
    0-0 0
  • Firstpage
    890
  • Lastpage
    894
  • Abstract
    This paper discusses an approach to quantization for lossy compression, termed greedy perceptual coding, in which the quantizer uses a perceptual model to determine the amount by which a work of media can be distorted, and then greedily tries to find the distortion that minimizes the number of bits that will be output by a subsequent lossless coder. The chief advantage of this approach is that the decoder does not need to know any distortion parameters used during compression, such as quantization step sizes or perceptual model parameters. As a result, the perceptual model can be arbitrarily complex. Since greedy perceptual coding changes the distribution of image values to be encoded, the best lossless codes for undistorted images are not the best to use in this context. A method is presented here for designing simple codes to use in the greedy-perceptual-coding context, and a preliminary compression system is implemented using these ideas
  • Keywords
    data compression; decoding; greedy algorithms; image coding; decoder; greedy perceptual coding; image value distribution; lossy compression; quantization; Control systems; Decoding; Encoding; Humans; Image coding; Image quality; National electric code; Nonlinear distortion; Quantization; Transform coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Communications and Signal Processing, 2005 Fifth International Conference on
  • Conference_Location
    Bangkok
  • Print_ISBN
    0-7803-9283-3
  • Type

    conf

  • DOI
    10.1109/ICICS.2005.1689177
  • Filename
    1689177