Class-count reduction techniques for content adaptive filtering

In the field of image/video enhancement, content adaptive filtering has shown superior performance over fixed linear filtering. The content adaptive filtering, first classifies the local image content based on different image features, such as structure and contrast. Then in every class, a least mean square (LMS) optimal filter is applied. A disadvantage of the concept is that many classes may be redundant, which leads to an inefficient implementation. In this paper, we propose and evaluate various class-count reduction techniques based on class-occurrence frequency, coefficient similarity and error advantage, which can greatly simplify the implementation without sacrificing much performance.

[1]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .

[2]  Jan P. Allebach,et al.  Optimal image scaling using pixel classification , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[3]  G. de Haan,et al.  Simultaneous Coding Artifact Reduction and Sharpness Enhancement , 2007, 2007 Digest of Technical Papers International Conference on Consumer Electronics.

[4]  de G Gerard Haan,et al.  Making the best of legacy video on modern displays , 2007 .

[5]  Gerard de Haan,et al.  Coding Artifacts Robust Resolution Up-conversion , 2007, 2007 IEEE International Conference on Image Processing.

[6]  M. Zhao,et al.  Content adaptive image de-blocking , 2004, IEEE International Symposium on Consumer Electronics, 2004.

[7]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .