Deringing cartoons by image analogies
Authors:
Open Access
- 1 October 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 25 (4) , 1360-1379
Abstract
In this article, we propose a novel method to reduce ringing artifacts in BDCT-encoded cartoon images using image analogies. The quantization procedure of BDCT compression (such as JPEG and MPEG) introduces annoying visual artifacts. Our main focus is on the removal of ringing artifacts that is seldom addressed by existing methods. In the proposed method, the contaminated image is modeled as a Markov random field (MRF). We “learn” the behavior of contamination by extracting massive numbers of artifact patterns from a training set, and organizing them using tree-structured vector quantization (TSVQ). Instead of postfiltering the input contaminated image, we synthesize an artifact-reduced image. Our method is noniterative and hence, can remove artifacts within a very short period of time. We show that substantial improvement is achieved using the proposed method in terms of visual quality and statistics.Keywords
This publication has 36 references indexed in Scilit:
- Example-based super-resolutionIEEE Computer Graphics and Applications, 2002
- Adaptive postfiltering of transform coefficients for the reduction of blocking artifactsIEEE Transactions on Circuits and Systems for Video Technology, 2001
- Texture mixing and texture movie synthesis using statistical learningIEEE Transactions on Visualization and Computer Graphics, 2001
- Learning Low-Level VisionInternational Journal of Computer Vision, 2000
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- A practical postprocessing technique for real-time block-based coding systemIEEE Transactions on Circuits and Systems for Video Technology, 1998
- The foundations of set theoretic estimationProceedings of the IEEE, 1993
- Vector Quantization and Signal Compression1992
- MPEGCommunications of the ACM, 1991
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975