×

A total variation regularization based super-resolution reconstruction algorithm for digital video. (English) Zbl 1168.94345

Summary: Super-resolution (SR) reconstruction technique is capable of producing a high-resolution image from a sequence of low-resolution images. In this paper, we study an efficient SR algorithm for digital video. To effectively deal with the intractable problems in SR video reconstruction, such as inevitable motion estimation errors, noise, blurring, missing regions, and compression artifacts, the total variation (TV) regularization is employed in the reconstruction model. We use the fixed-point iteration method and preconditioning techniques to efficiently solve the associated nonlinear Euler-Lagrange equations of the corresponding variational problem in SR. The proposed algorithm has been tested in several cases of motion and degradation. It is also compared with the Laplacian regularization-based SR algorithm and other TV-based SR algorithms. Experimental results are presented to illustrate the effectiveness of the proposed algorithm.

MSC:

94A08 Image processing (compression, reconstruction, etc.) in information and communication theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[2] doi:10.1109/29.56062 · doi:10.1109/29.56062
[3] doi:10.1109/83.242363 · doi:10.1109/83.242363
[4] doi:10.1117/1.602177 · doi:10.1117/1.602177
[5] doi:10.1137/S1064827500383123 · Zbl 1031.68127 · doi:10.1137/S1064827500383123
[6] doi:10.1002/ima.20014 · doi:10.1002/ima.20014
[7] doi:10.1007/BF01200891 · Zbl 1052.94500 · doi:10.1007/BF01200891
[8] doi:10.1016/1049-9652(92)90065-6 · doi:10.1016/1049-9652(92)90065-6
[9] doi:10.1016/1049-9652(91)90045-L · doi:10.1016/1049-9652(91)90045-L
[11] doi:10.1109/83.605404 · doi:10.1109/83.605404
[12] doi:10.1109/83.503915 · doi:10.1109/83.503915
[13] doi:10.1109/83.650118 · doi:10.1109/83.650118
[14] doi:10.1109/83.748893 · doi:10.1109/83.748893
[15] doi:10.1088/0266-5611/22/4/009 · Zbl 1147.93302 · doi:10.1088/0266-5611/22/4/009
[16] doi:10.1109/83.650116 · doi:10.1109/83.650116
[17] doi:10.1109/TIP.2005.860355 · Zbl 05453423 · doi:10.1109/TIP.2005.860355
[18] doi:10.1109/TIP.2006.888334 · Zbl 05453860 · doi:10.1109/TIP.2006.888334
[19] doi:10.1109/TIP.2005.860336 · Zbl 05452873 · doi:10.1109/TIP.2005.860336
[20] doi:10.1109/TIP.2005.854479 · Zbl 05452731 · doi:10.1109/TIP.2005.854479
[21] doi:10.1109/TIP.2004.827230 · Zbl 05453310 · doi:10.1109/TIP.2004.827230
[22] doi:10.1109/MSP.2003.1203208 · doi:10.1109/MSP.2003.1203208
[23] doi:10.1109/TIP.2004.834669 · Zbl 05452876 · doi:10.1109/TIP.2004.834669
[24] doi:10.1137/S0036139900368844 · Zbl 1050.68157 · doi:10.1137/S0036139900368844
[25] doi:10.1109/MSP.2003.1203207 · doi:10.1109/MSP.2003.1203207
[26] doi:10.1109/83.941854 · Zbl 1037.68784 · doi:10.1109/83.941854
[27] doi:10.1109/MSP.2003.1203211 · doi:10.1109/MSP.2003.1203211
[28] doi:10.1006/jvci.1997.0370 · doi:10.1006/jvci.1997.0370
[30] doi:10.1002/ima.20007 · doi:10.1002/ima.20007
[31] doi:10.1016/0167-2789(92)90242-F · Zbl 0780.49028 · doi:10.1016/0167-2789(92)90242-F
[32] doi:10.1109/83.679423 · Zbl 0993.94519 · doi:10.1109/83.679423
[34] doi:10.1109/83.503914 · doi:10.1109/83.503914
[35] doi:10.1137/0917016 · Zbl 0847.65083 · doi:10.1137/0917016
[37] doi:10.1137/030601272 · Zbl 1080.65036 · doi:10.1137/030601272
[38] doi:10.1109/83.791976 · doi:10.1109/83.791976
[39] doi:10.1016/S0024-3795(99)00274-8 · Zbl 0993.65056 · doi:10.1016/S0024-3795(99)00274-8
[40] doi:10.1137/0614004 · Zbl 0767.65037 · doi:10.1137/0614004
[41] doi:10.1109/83.913592 · Zbl 1040.68567 · doi:10.1109/83.913592
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.