Professional Documents
Culture Documents
Institute of Remote Sensing and Digital Earth, Chinese Academy of Sciences
Institute of Remote Sensing and Digital Earth, Chinese Academy of Sciences
SPLIT
i . (5)
T (i ) yi i 1i i 1 . (3) d xi
1 2
d xi x 1 i bxi
2
2
i
The optimization problem of equation (3) can be recast d yi d yi y 1 i byi
1 2 2
as a linear program, and it can be solved using methods such
as Bregman split method [2], Basis-Pursuit (BP) [3] and the One can break this algorithm down into several easy steps
Orthogonal Matching-pursuit (OMP) algorithms [4], by equation (6)-(12).
Bayesian estimation [5] iterative thresholding algorithms or
i k
accelerated iterative thresholding [6][7], and CoSaMP [8]. ik 1 arg min yi i 1 ik 2 d ik bk
Recently, in CS field, Non-convex regularization using i 2 i i 2
, (6)
L p functional for p < 1 can also be solved approximately
i d x x 1 i bx i d y y 1 i by
using re-weighting schemes [9][10] [14]. 2 i i 2 2 i i 2
T ( i ) yi i 1 i i i 1 i k
2
(4) d xki 1 arg min d xki d x x 1i k 1 bxk (8)
i x i i y i 2
1 1 d xi 1 i i 2
1 1
where i x is the
is the regularization parameter, i k
d yki1 arg min d yki d y y 1i k 1 byk (9)
differential operator in horizon direction and y is the diy 1 2 i i 2
differential operator in the vertical direction. When i is bki1 bki ki1 dki1 (10)
the coefficient of wavelet transform of the image, i is
1
2559
i 1 y d 1k 1 , , Nk 1 d1k 1 , , d Nk 1 by
T 1 k k
bi transform back to
i i i i i i
inverse PCA for every band image.
i x 1 d b
T 1 (16) 6. Transform x 11k 1 bxk1 , , x Nk 1 bxkN1
x i xi xi
i y 1 T
d b 0
y
1
i yi yi
into 1k , , Nk by PCA
Shrink 1 , , N , get 1 , , N , and then
k k k 1 k 1
7.
When ik is looked as variable, we rearrange equation (16)
transform 1 , , N back to d x , , d x
k 1 k 1 k 1 k 1
by
and get 1 N
2560
[3] S. S. Chen, D. Donoho, M. Saunders, “Atomic decomposition
by basis pursuit,” SIAM Journal on Scientific Computing 20
(1), pp. 33-61, 1998.
[4] D. Donoho, Y. Tsaig, I. Drori, and J. Starck, “Sparse solution
of underdetermined systems of linear equations by stagewise
orthogonal matching pursuit,” IEEE Trans. Information
Theory, 58(2), pp.1094-1121, 2012.
[5] S. Ji, Y. Xue, and L. Carin, “Bayesian compressive sensing,”
IEEE Trans. Signal Process., 56(6), pp. 2346-2356, 2008.
[6] J. M. B. Dias, M. A. T. Figueiredo, A new twIST: Two-step
iterative shrinkage/thresholding algorithms for image
(a)Original image (b) SCR-CS restoration, IEEE Trans. Image Proc., 16 (12), pp. 2992-
3004, 2007.
[7] T. Blumensath, “Accelerated Iterative Hard Threshoding,”
Signal Processing, 92, pp. 752-756, 2011.
[8] D. Needell, J. A. Tropp, “Cosamp: Iterative signal recovery
from incomplete and inaccurate samples,” J. of Appl. and
Comput. Harmonic Analysis, 26, pp. 301-321, 2009.
[9] I. F. Gorodnitsky, B. D. Rao, “Sparse signal reconstruction
from limited data using FOCUSS: a re-weighted minimum
norm algorithm,” IEEE Trans. Image Proc. 45(3), pp. 600-
616, 1997.
[10] M. Salman Asif and Justin Romberg, “Fast and accurate
(c) PCA-CS (d) MSE vs. algorithms for re-weighted L1 norm minimization,”
Fig.1 Comparison of different method when the measurement is 30% of Submitted to IEEE Transactions on Signal Processing , 2012.
[11] E. J. Candès and M. Wakin. “An introduction to compressive
total number of pixels. The multispectral image is from LandSat7. sampling,” IEEE Signal Processing Magazine, 25(2), pp. 21-
30, 2008.
Table 1. Compare the result when the number of measurement is different. [12] J. Romberg, “Imaging via compressive sampling,” IEEE
Signal Processing Magazine, 25(2), pp. 14-20, 2008.
Compare the MSE of results [13] P. Nagesh, B. Li, “Compressive imaging of color images,”
Image1 Image2 Image3 IEEE Int. Conf.Acoust., Speech Signal Process. (2009)
[14] Angshul Majumdar, Rabab K. Ward, “Compressed sensing of
m Optimal Optimal Optimal color images”, Signal Processing, 90(12), pp. 3122–3127
Method
MSE MSE MSE 2010.
SRC-CS 29.96 27.73 33.24 [15] N. Lian, V. Zagorodnov, and Y. Tan, “Edge-preserving
0.2 n
PCA-CS 22.62 21.64 27.86 image denoising via optimal color space projection”, IEEE
SRC-CS 26.11 24.94 29.42 Transactions on Image Processing, 15(9), pp.2575-2587,
0.3 n 2006.
PCA-CS 18.75 17.42 23.39
[16] Zhilin Zhang, Bhaskar D. Rao, “Extension of SBL Algorithms
SRC-CS 24.11 20.91 26.77
0.4 n for the Recovery of Block Sparse Signals with Intra-Block
PCA-CS 15.82 15.35 22.33 Correlation”, IEEE Trans. on Signal Processing, 61(8), pp.
2009-2015, 2013.
5. CONCLUSIONS
Using the compressive sensing theory framework and its
extension, we proposed an algorithm to recover
multispectral image based on Bregman split and PCA. The
regularization in both spatial domain and transform domain
are employed. The algorithms have the ability to explore and
exploit the correlation in multi-band images and thereby
improve performance. We experimentally demonstrated that
the algorithm significantly outperform existing algorithms.
6. REFERENCE
[1] D. Donoho, “Compressed sensing,” IEEE Trans. on
Information Theory, 52(4), pp. 1289 - 1306, April 2006
[2] T. Goldstein, S. Osher, “The Split Bregman Method for L1-
Regularized Problem,” SIAM Journal on Imaging Sciences
archive. 2(2), pp. 323-343, 2009.
2561