Title :
Reducing the computational complexity of a MAP post-processing algorithm for video sequences
Author :
Robertson, Mark A. ; Stevenson, Robert L.
Author_Institution :
Dept. of Electr. Eng., Notre Dame Univ., IN, USA
Abstract :
Maximum a posteriori (MAP) filtering using the Huber-Markov (1981) random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts in images. Unfortunately, this MAP formulation requires iterative techniques for the solution of a constrained optimization problem. In the past, these iterative techniques have been computationally intensive, making the filter infeasible in situations where it is desired to filter images (or video frames) quickly. This paper introduces two methods for reducing the computational requirements of the constrained optimization, as well as theoretical and experimental justifications for using them
Keywords :
Markov processes; computational complexity; data compression; discrete cosine transforms; filtering theory; image sequences; optimisation; transform coding; video coding; Huber-Markov random field; MAP post-processing algorithm; Seidel relaxation; block discrete cosine transform; compression artifacts reduction; computational complexity reduction; constrained optimization problem; image model; iterative techniques; maximum a posteriori filtering; motion compensation; video frames; video sequences; video signal compression; Computational complexity; Constraint optimization; Constraint theory; Filtering algorithms; Filters; Image coding; Iterative algorithms; Pixel; Video compression; Video sequences;
Conference_Titel :
Image Processing, 1998. ICIP 98. Proceedings. 1998 International Conference on
Print_ISBN :
0-8186-8821-1
DOI :
10.1109/ICIP.1998.723503
