TY - GEN
T1 - Globally optimal smoothing functional for multichannel image restoration
AU - Kang, Moon G.
AU - Katsaggelos, Aggelos K.
PY - 1994
Y1 - 1994
N2 - It is expected that a globally optimal restored multichannel image should be superior to a suboptimally restored image without the use of cross-channel information. In this paper, a regularized multichannel image restoration approach is proposed, which is based on the minimum multichannel regularized noise power criterion. Furthermore, no prior knowledge about the variance of the noise at each channel and a bound on the high frequency energy of the image are assumed, but this information is estimated based on the partially restored result at each step. The multichannel smoothing functional to be minimized is formulated to have a global minimizer with the proper choice of the multichannel regularization functionals. With this algorithm, the regularization functional for each channel is determined by incorporating not only within-channel information but also cross-channel information. It is also shown that the proposed multichannel smoothing functional is convex, and therefore, has a global minimizer. The proposed multichannel algorithm not only does not depend on initial conditions but is also shown to be much more computationally efficient than existing algorithms.
AB - It is expected that a globally optimal restored multichannel image should be superior to a suboptimally restored image without the use of cross-channel information. In this paper, a regularized multichannel image restoration approach is proposed, which is based on the minimum multichannel regularized noise power criterion. Furthermore, no prior knowledge about the variance of the noise at each channel and a bound on the high frequency energy of the image are assumed, but this information is estimated based on the partially restored result at each step. The multichannel smoothing functional to be minimized is formulated to have a global minimizer with the proper choice of the multichannel regularization functionals. With this algorithm, the regularization functional for each channel is determined by incorporating not only within-channel information but also cross-channel information. It is also shown that the proposed multichannel smoothing functional is convex, and therefore, has a global minimizer. The proposed multichannel algorithm not only does not depend on initial conditions but is also shown to be much more computationally efficient than existing algorithms.
UR - http://www.scopus.com/inward/record.url?scp=0028747611&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028747611&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0028747611
SN - 081941638X
SN - 9780819416384
T3 - Proceedings of SPIE - The International Society for Optical Engineering
SP - 232
EP - 243
BT - Proceedings of SPIE - The International Society for Optical Engineering
T2 - Visual Communications and Image Processing '94
Y2 - 25 September 1994 through 29 September 1994
ER -