Regularized reconstruction to reduce blocking artifacts of block discrete cosine transform compressed images
IEEE Transactions on Circuits and Systems for Video TechnologyPublished 1 January 1993
Yongyi Yang, N.P. Galatsanos, Aggelos K. Katsaggelos
Citations355
SJR quartileQ1
SJR score1.86
SNIP2.89
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The reconstruction of images from incomplete block discrete cosine transform (BDCT) data is examined and two methods are proposed for solving this regularized recovery problem based on the theory of projections onto convex sets (POCS) and the constrained least squares (CLS).
Abstract
The reconstruction of images from incomplete block discrete cosine transform (BDCT) data is examined. The problem is formulated as one of regularized image recovery. According to this formulation, the image in the decoder is reconstructed by using not only the transmitted data but also prior knowledge about the smoothness of the original image, which complements the transmitted data. Two methods are proposed for solving this regularized recovery problem. The first is based on the theory of projections onto convex sets (POCS) while the second is based on the constrained least squares (CLS) approach. For the POCS-based method, a new constraint set is defined that conveys smoothness information not captured by the transmitted BDCT coefficients, and the projection onto it is computed. For the CLS method an objective function is proposed that captures the smoothness properties of the original image. Iterative algorithms are introduced for its minimization. Experimental results are presented.>
Keywords
Computer ScienceEngineering
Fundamentals of digital image processing
7,016 Citations1988Anil K. Jain
Society for Industrial and Applied Mathematics eBooksIterative Solution of Nonlinear Equations in Several Variables
6,875 Citations2000J. M. Ortega, Werner C. Rheinboldt
Convergence of Minimization Methods An Annotated List of Basic Reference Books Bibliography Author Index Subject Index.
Discrete Cosine Transform: Algorithms, Advantages, Applications
1,875 Citations1990K.R. Rao, P. Yip +1 more
This paper presents two Dimensional DCT Algorithms and their relations to the Karhunen-Loeve Transform, and some applications of the DCT, which demonstrate the ability of these algorithms to solve the discrete cosine transform problem.
IEEE Signal Processing MagazineDigital image restoration
1,669 Citations1997M.R. Banham, Aggelos K. Katsaggelos
The article introduces digital image restoration to the reader who is just beginning in this field, and provides a review and analysis for the readers who may already be well-versed in image restoration.
IEEE Transactions on Medical ImagingImage Restoration by the Method of Convex Projections: Part 1ߞTheory
1,021 Citations1982Dante C. Youla, H. Webb
This paper exploits the properties of projection operators Pi onto a closed convex set in Hilbert space to develop several iterative algorithms for image restoration from partial data which permit any number of nonlinear constraints of a certain type to be subsumed automatically.
Proceedings of the IEEEAdvances in picture coding
736 Citations1985H.G. Musmann, P. Pirsch +1 more
This paper presents a review of the advances in digital coding of video signals during the last four years, and summarizes the first promising results of motion adaptive frame interpolation.
IEEE Transactions on ComputersThe Application of Constrained Least Squares Estimation to Image Restoration by Digital Computer
522 Citations1973B.R. Hunt
It is demonstrated that, for convolution-type models of image restoration, special properties of the linear system of equations can be used to reduce the computational requirements.
IEEE Transactions on Image ProcessingMethods for choosing the regularization parameter and estimating the noise variance in image restoration and their relation
486 Citations1992N.P. Galatsanos, Aggelos K. Katsaggelos
An error analysis based on an objective mean-square-error (MSE) criterion is used to motivate regularization and two approaches for choosing the regularization parameter and estimating the noise variance are proposed.
Proceedings of the IEEEConstrained iterative restoration algorithms
423 Citations1981Ronald W. Schafer, R.M. Mersereau +1 more
It is shown that by predistorting the signal (and later removing this predistortion) it is possible to achieve spectral extrapolation, to broaden the class of signals for which these algorithms achieve convergence, and to improve their performance in the presence of broad-band noise.
IEEE Transactions on Circuits and Systems for Video TechnologyIterative procedures for reduction of blocking effects in transform image coding
416 Citations1992Avideh Zakhor
IEEE Transactions on Circuits and SystemsGeneralized Image Restoration by the Method of Alternating Orthogonal Projections
391 Citations1978Dante C. Youla
This work adopts a view that suggests that many problems of image restoration are probably geometric in character and admits the following initial linear formulation: the original f is a vector known a priori to belong to a linear subspace {\cal P}_b of a parent Hilbert space {\cal H}( , but all that is available to the observer is its image P_{a} f, the projection of f onto a known linear sub Space P_a (also in \cal H ).
IEEE Transactions on Acoustics Speech and Signal ProcessingRegularized iterative image restoration with ringing reduction
291 Citations1988Reginald L. Lagendijk, J. Biemond +1 more
A regularized iterative image restoration algorithm is proposed in which both ringing reduction methods are included by making use of the theory of the projections onto convex sets and the concept of norms in a weighted Hilbert space.
IEEE Transactions on Signal ProcessingA regularized iterative image restoration algorithm
285 Citations1991Aggelos K. Katsaggelos, J. Biemond +2 more
The adaptively restored images have better quality than the nonadaptively restored ones based on visual observations and on an objective criterion of merit which accounts for the noise masking property of the visual system.
IEEE Transactions on Acoustics Speech and Signal ProcessingThe feasible solution in signal restoration
273 Citations1984H.J. Trussell, M. Reha Civanlar
Projection onto closed convex sets is the numerical method used to obtain a feasible solution to the signal restoration problem.
IEEE Transactions on Acoustics Speech and Signal ProcessingNonlinear space-variant postprocessing of block coded images
265 Citations1986Bhaskar Ramamurthi, A. Gersho
A new nonlinear, space-variant filtering algorithm is proposed which smooths jagged edges without blurring them, and smooths out abrupt intensity changes in monotone areas.
Optical EngineeringIterative Image Restoration Algorithms
252 Citations1989Aggelos K. Katsaggelos
This tutorial paper discusses the use of successive-approximation-based iterative restoration algorithms for the removal of linear blurs and noise from images and regularization is introduced as a means for preventing the excessive noise magnification that is typically associated with ill-posed inverse problems such as the deblurring problem.
Reduction of blocking effect in image coding
175 Citations2005Howard C. Reeve, Jae Sung Lim
Two methods are developed to reduce the blocking effect when the image is reconstructed at the decoder, which can develop due to discontinuities between the subimages.
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>Iterative procedures for reduction of blocking effects in transform image coding</title>
95 Citations1991Ruth Rosenholtz, Avideh Zakhor
A new iterative block reduction technique based on the theory of projection onto convex sets to restore the coded image in such a way as to restore it to its original artifact-free form.
IEEE International Conference on Acoustics Speech and Signal ProcessingReduction of coding artifacts in transform image coding
90 Citations1993Robert Louis Stevenson
The problem of image decompression is cast as an ill-posed inverse problem, and a stochastic regularization technique is used to form a well-posed reconstruction algorithm which produces reconstructed images which greatly reduced the noticeable artifacts which exist using standard techniques.
IEEE Transactions on Image ProcessingPrioritized DCT for compression and progressive transmission of images
64 Citations1992Yicong Huang, Howard M. Dreizen +1 more
The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order and the resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding.
IEEE Transactions on Acoustics Speech and Signal ProcessingThe Landweber iteration and projection onto convex sets
59 Citations1985H.J. Trussell, M. Reha Civanlar
For circulant systems, the Landweber iteration with a special step size is shown to be equivalent to a variation of the projection method, and it is conjectured that the projection technique has a better convergence rate.
A general formulation of constrained iterative restoration algorithms
45 Citations2005Aggelos K. Katsaggelos, J. Biemond +2 more
This paper introduces a general formulation of constrained iterative restoration algorithms in which deterministic and/or statistical information about the undistorted signal and statistical Information about the noise are directly incorporated into the iterative procedure.
Journal of the Optical Society of America AProjection-based image restoration
23 Citations1992Henry Stark, Elwood T. Olsen
Systems, methods, and computer readable media that are capable of producing reliable registrations even when the number of high frequency image features is small and the disclosed techniques may also provide a quantitative measure of a registration's quality.
IEEE Journal on Selected Areas in CommunicationsUsing Convex Set Techniques for Combined Pixel and Frequency Domain Coding of Time-Varying Images
15 Citations1987Peter Santago, Sarah Rajala
An image coding technique based on convex sets and projections based on pixel and frequency domain information is developed in order to improve image quality over standard transform coding at given bit rates.