LUT filters for quantized processing of signals

We introduce a method to perform filtering on approximations (quantized versions) of the input signal, which lends itself to a practical implementation solely based on look-up tables (LUTs). The LUT filter approximates the performance of some traditional nonlinear filters at a fraction of the cost. The filter is divided into an approximation stage that is constant for all filters and a filtering stage, which is one LUT that can change in order to implement different filters. We introduce an overlapped hierarchical vector quantization (OHVQ) scheme that is used as the approximation stage. The output is produced by mapping the OHVQ codes to filtered data. Hence, all processing is done via LUTs, even though the filter size needs to be small because of typical OHVQ contraints. Switching among filters demands changing pointers to only one small LUT. Preliminary analysis and image processing examples are shown, demonstrating the efficacy of the proposed method.

[1]  Philip A. Chou,et al.  An efficient algorithm for hierarchical compression of video , 1994, Proceedings of 1st International Conference on Image Processing.

[2]  R. Queiroz,et al.  Very fast JPEG compression using hierarchical vector quantization , 2000, IEEE Signal Processing Letters.

[3]  Robert M. Gray,et al.  A fast, table-lookup algorithm for classifying document images , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[4]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[5]  Philip A. Chou,et al.  Constrained and recursive hierarchical table-lookup vector quantization , 1996, Proceedings of Data Compression Conference - DCC '96.

[6]  Philip A. Chou,et al.  Hierarchical vector quantization of perceptually weighted block transforms , 1995, Proceedings DCC '95 Data Compression Conference.