# Multiband CCD Image Compression for Space Camera with Large Field of View

Authors: Jin Li; Fei Xing; Ting Sun; Zheng You
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

Space multiband CCD camera compression encoder requires low-complexity, high-robustness, and high-performance because of its captured images information being very precious and also because it is usually working on the satellite where the resources, such as power, memory, and processing capacity, are limited. However, the traditional compression approaches, such as JPEG2000, 3D transforms, and PCA, have the high-complexity. The Consultative Committee for Space Data Systems-Image Data Compression (CCSDS-IDC) algorithm decreases the average PSNR by 2 dB compared with JPEG2000. In this paper, we proposed a low-complexity compression algorithm based on deep coupling algorithm among posttransform in wavelet domain, compressive sensing, and distributed source coding. In our algorithm, we integrate three low-complexity and high-performance approaches in a deeply coupled manner to remove the spatial redundant, spectral redundant, and bit information redundancy. Experimental results on multiband CCD images show that the proposed algorithm significantly outperforms the traditional approaches.


---

## Body

## 1. Introduction

Space multiband charge coupled devices (CCD) camera is now heading for a high spatial resolution, high spectral resolution, high radiation resolution, large field of view, and wide coverage development. All these result in the number of CCD mosaic growing, read-out rate increasing, quantization bits of AD converter increasing, and average shooting time increasing, so that the amount of digitization image data increases sharply. However, the highest data transmission rates of on-board downlink channel are limited. In addition, the amount of flash memory based SSR used on the satellite is also limited. So, it is necessary to compress the on-board CCD images as well.Space multiband CCD camera compression encoder requires low-complexity, high-robustness, and high-performance because of its captured images information being very precious, and also because it is usually working on the satellite where the resources, such as power, memory, and processing capacity, are limited. Reference [1] does statistics about the on-board image compression algorithm based on using the basis compression theory used in compression system for more than 40 space missions. The statistics result is shown in Figure 1. More than half of on-board image compression algorithms are based on a transform approach. About 80% are based on a prediction method.Figure 1
The statistics result of on-board image compression.The transform-based approach usually has an image transform stage, such as discrete cosine transform (DCT), discrete wavelet transform (DWT) [2], and Karhunen-Loeve transform (KLT) [3]. Then the transform coefficients are coding by compression algorithms, such as EZW [4], SPIHT, SPECK, EBCOT [5], and bit plane encoder (BPE). The typical transform-based algorithms are JPEG2000 [6] and the Consultative Committee for Space Data Systems-Image Data Compression (CCSDS-IDC) [7]. In JPEG2000 algorithm, EBCOT is very efficient to remove the redundancy between wavelet transforms coefficients, which makes JPEG2000 become the best-performing compression encoder in the existing image compression algorithms. However, it is too complex to be implemented in space mission. The CCSDS-IDC algorithm is composed of DWT and BPE. The BPE, which is a zero tree encoder makes the most of the structures of spatiotemporal orientation trees in bit plane. That is, grandchildren coefficients also become not important when children coefficients are important. This zero tree characteristic makes the bit plane exit a large amount of zero areas. Taking full advantage of these zero areas can improve coding efficiency. CCDS-IDC has progressive coding and fault-tolerant capability characteristic. But, BPE has low-complexity and occupies less storage capacity, which is very suitable for the application of on-board camera. However, it decreases the average PSNR by 2 dB compared with JPEG2000. In addition, CCDS-IDC is only suitable for the 2D image, which cannot exploit the spectral redundancy for 3D image.The prediction-based approaches are widely used by 3D image (like multispectral, hyperspectral image) compression. For now, to cover 1D, 2D, and 3D, coefficients prediction algorithms include hundreds of predictors. For the on-board application, the main prediction methods were DPCM, adaptive DPCM, CCSDS-LDC, CCSDS-MHD, JPEG-LS, and LUT [8]. The prediction-based approaches are very simple and realized easily in hardware. However, its compression performance is limited and it has low anti-BER (bit error rate). For now, on-board image compression based on prediction only is unusual. Generally, compression algorithm uses them in combination with other compression approaches, such as CCSDS-IDC, which use DPCM encoding the DC coefficients.Recently, two low-complexity compression approaches are already appearing which are distributed source coding (DSC) [9] and compressive sampling (CS) [10]. They have common characteristics, which can shift algorithm complexity from encoder to decoder. Different from 3D transform-based multispectral image compressor which uses the dependency of information source to improve the compression performance, DSC uses the dependency of the decoder to improve the compression performance. For CS, it is a new sampling theory, which breaks out of the Nyquist sampling theory. CS can reconstruct the original signal from a small number of measured signals. Many DSC-based compression schemes are proposed at present. Pan et al. propose a low-complexity DCT-based DSC compression method for hyperspectral images. Cheung et al. propose a wavelet-based predictive Slepian-Wolf coding for hyperspectral images. A number of CS-based compression approaches have also been proposed for now. Deng et al. proposed wavelet-based CS compression method. Meriño et al. proposed robust compression using compressive sensing. These compression schemes can be easily implemented from both software and hardware which made this algorithm more practical to on-board applications. However, DSC and CS also only combine the DSC with traditional approaches for now.For now, Peyré and Mallat [11] propose a new low-complexity compression approach based on posttransform (PT). PT is a transform to wavelet coefficients block. This approach can remove the redundancy between wavelets’ coefficients, which can improve compression performance. In addition, because it processes a 16-coefficient block and only carries out dot product operation, it does not require large amount of memories and could simply implement on hardware. To adapt on-board application, Delaunay et al. in [12] proposed a compression scheme using BPE from the CCSDS recommendation to code posttransform coefficients. However, the posttransforms destroy the zero-tree structure. The basis vectors must be ordered and sorted with respect to the energy contribution. This causes it to have an additive complexity and a low compression performance.In this paper, we proposed a low-complexity compression algorithm based on deep coupling algorithm among posttransform in wavelet domain, compressive sensing, and distributed source coding. In our algorithm, we integrate three low-complexity and high-performance approaches in a deeply coupled manner to remove the spatial redundancy, spectral redundancy, and bit information redundancy.The latter part of this paper is organized as follows. In Section2, we present a low-complexity compression algorithm based deep coupling approach. In Section 3, the experimental results are demonstrated. Section 4 concludes the proposed method.


## 2. Proposed Scheme

To weigh the computational complexity and compression performance, in this paper, we proposed a low-complexity compression algorithm based on deep coupling algorithm for multiband CCD images. We integrate posttransform in wavelet domain, compressive sensing, and distributed source coding in a deeply coupled manner to remove the spatial redundant, spectral redundant, and bit information redundancy.


### 2.1. Proposed Algorithm Architecture

Figure2 shows the proposed deep coupling architecture. The key band Xkey is processed by deep coupling between the posttransform and CS. This key band is used to reconstruct the other bands in decoder. Other bands Xi are processed by deep coupling between the posttransform, CS, and DSC. First, Xi is performed by wavelet transform and posttransform. Then, the posttransform coefficients are sampled by the CS measurement matrix to obtain the resultant CS measurements. Finally, the resultant CS measurements are encoded by a Slepian-Wolf (SW) encoder. In our scheme, we choose QC-LDPC code as the powerful error-correcting code to realize the DSC strategy. The QC-LDPC-based SW coder is implemented to encode the resultant CS measurements bits to generate the check bits. The check bits are only entered into the compressed bit streams.Figure 2
Proposed deep coupling coding architecture for multiband CCD images.In decoding, the check bits and side information are combined in a new code word to correct errors. So the result measurements ofXi can be recovered. The side information can be X^i′ which can be obtained by the prediction approach from the X^i-1 and X^i-2, which are reconstructed from the Xi-1 and Xi-2. The reconstructed result measurements can be recovered by a recovery algorithm based on orthogonal matching pursuit (OMP) to obtain the reconstructed posttransformed coefficients. The reconstructed posttransformed coefficients are reversely transformed to obtain reconstructed wavelet coefficients. Finally, the reconstructed wavelet coefficients are reversely transformed to obtain the X^i.


### 2.2. Deep Coupling between PT and CS

Figure3 shows the proposed deep coupling between the posttransform and CS. An image is decomposed by two-dimension DWT into three-level high-frequency subbands and one low-frequency subband. Each high-frequency subband is performed by posttransform. In our algorithm, the dictionary has two bases, which work at high bit rate and low bit rate. We use l-p norm-based, the best posttransform. Three levels of high posttransformed subbands are sampled by 3 CS measurements’ matrices Φ1, Φ2, and Φ3. The resultant CS measurements are quantized and entropy coding. The compressed stream bits can be obtained and then are grouped into packets and are sent to the decoder via signal channels. The size measurements matrix can be evaluated by an information evaluation. And the base used is selected by a bit evaluation.Figure 3
Proposed deep coupling coding between PT and CS.In this paper, to obtain a low-complexity yet an efficient posttransform, we use a very simple dictionary which is composed of the Hadamard basis and DCT basis; that is,Nb=2. Under the low bit rate, the bit rate R can be expressed as
(1)R≈γ0M,γ0=7,
where M is the number of nonzero posttransformed coefficients. Under the high bit rate, the bit rate R can be expressed as
(2)R≈h(x)-log⁡2q,H(X)=-∑i=1Npilog⁡2pi,
where H(x) is the entropy of image x and q is a quantizer step. According to (6) and (7), we proposed a new approach based on lp norm for the best posttransform basis selection.Under the low bit rate, the best posttransform basis selection can be expressed as(3)fb*=argmin⁡fb,b∈[0,Nb]∥fb∥0s.t.∥fb∥0=∑m=116Im,hhhhhhhhhhhhhhhIm={1,⌊|ab[m]|⌋≠0,0,⌊|ab[m]|⌋=0,
where ab[m] is a posttransformed coefficient.Under the high bit rate, the best posttransform basis selection can be expressed as(4)fb*=argmin⁡fb,b∈[0,Nb]∥fb∥1s.t.∥fb∥1=(∑m=015|ab[m]|).Given the different subbands which include varying degrees of image information, the CS sensing matrices have different sizes. Four CS sensing matrices are denoted asΦLL, ΦLH⁡, ΦHL, and ΦHH. The sensing process can be expressed as
(5)[YLLYLH⁡YHLYHH]=[ΦLLΦLH⁡ΦHLΦHH][XLLXLH⁡XHLXHH],
where YLL, YLH⁡, YHL, and YHH are CS measured result samples from posttransformed low subband and high subbands and XLL, XLH⁡, XHL, and XHH are posttransformed coefficients in low subband and high subbands, respectively.CS sensing matrices’ size is determined by bit rate. Since the best transform selectfb* is reflecting the image information, the bit rate can be evaluated by fb*. The bit rate can be expressed as
(6)ri=Ii∑i=110Ii×R,Ii=∑j=1Jifj,ib*,
where ri denotes ith subband allocated bit rate, R denotes total bit rate, Ii denotes ith subband of the amount of information, Jj denotes the number of ith subbands of the posttransform blocks, and fj,ib* is ith subband of jth best posttransform selection.The base used in dictionary selection is determined by CS result measurements. In result measurements, we use a prediction approach to compute the amount of information of CS result measurements. The prediction can be expressed as(7)f′(k,q)={min⁡(f(k,q-1),f(k-1,q)),f(k-1,q-1)≥max⁡(f(k,q-1),f(k-1,q))max⁡(f(k,q-1),f(k-1,q)),f(k-1,q-1)≤min⁡(f(k,q-1),f(k-1,q))(f(k,q-1)+f(k-1,q))-f(k-1,q-1),others.
Each CS result measurement l-1 norm can be expressed as
(8)Y*=∥Δ∥1,s.t.Δ=|f(k,q)-f′(k,q)|.
When Y* is considered as fb*, from (1), the base used in dictionary selection can be determined.


### 2.3. Deep Coupling among PT, CS, and DSC

Figure4 shows the proposed deep coupling among the posttransform, CS, and DSC.Figure 4
Proposed deep coupling coding among PT, CS, and DSC.The subset of the bandsXi-1 and Xi-2, which have been encoded, is used to compute the linear predictor coefficients α and β.The band Xi is decomposed by DWT and posttransform to obtain the posttransformed coefficients. The posttransformed coefficients combined with the coefficients α and β to obtain the prediction posttransformed coefficients’ band Xi′. The posttransformed coefficients Xi and Xi′ are sampled by CS measurements’ matrix to obtain the result measurements Yi and Yi′. Yi and Yi′ are used to compute the crossover probability p^i. The crossover probability determines the check matrix and the posttransform base used. The crossover probability and the best transform select fb* decided mutually the measurements’ matrix size.To ensure that theXi′ and Xi are similar as far as possible, we use a second-order filter to compute the prediction coefficients α and β. This can be expressed as
(9)x′=α(v-mv)+β(w-mw)+mx,
where v is the pixels colocated with the current pixel in band Xi-1, w is the pixels colocated with the current pixel in bands Xi-2, and mv and mw are the expectation value of the random variables v and w, respectively. This can be expressed as
(10)mv=E{v},mw=E{w}.
Under the minimum mean square error criteria, the statistical optimal prediction can be computed by solving a Wiener-Hopf equation as
(11)[δv2δwvδwvδw2][αβ]=[δxvδxw].
Define the context windows of the current band and the previous band as shown in Figure 5; the statistical parameters can be approximated as
(12)δv2=E{v2}-mv2=1M2(M∑i=1Mvi2-(∑i=1Mvi)2),δwx=E{wx}-mwmx=1M2(M∑i=1Mwixi-∑i=1Mwi∑i=1Mxi),
where M is the context window size. Other parameters can be likewise calculated.Definitions of context windows: (a) and (b) two previous bands, (c) current band.
(a)
(b)
(c)The theoretical limit of Slepian-Wolf bit rate isR⩾H(X∣Y); bit rate determinates the parity-check matrix of QC-LDPC. The conditional entropy H(X∣Y) can be expressed as
(13)H(X∣Y)=H(p)=-plog⁡2(p)-(1-p)log⁡2(1-p),
where p is the crossover probability. The crossover probability can be computed as
(14)Pi=E(Pn)=1M∑nPn≈1M∑nTn,hhhhhhhhhTn={1,ifYi,j≠Xi,j,0,ifYi,j=Xi,j.
To improve efficiency, we use subsample to evaluate the crossover probability. In addition, we use the QC-LDPC code to implement the SW encoder. For fast and efficient coding, in [13], cyclic matrix A uses a b×b permutation matrix as follows:
(15)P=[010⋯0001⋯0⋮⋮⋮⋱⋮000⋯1100⋯0].
Consider that Pj is a permutation matrix; it is obtained by unit matrix Pj that shifts i times right. i is a positive integer. P∞ is a zero matrix. A parity-check matrix is expressed as
(16)P=[Pa11Pa12⋯Pa1(k-1)Pa1kPa21Pa22⋯Pa2(k-2)Pa2k⋯⋯⋯⋯⋯Paj1Paj2⋯Paj(k-1)Pajk],
where ail∈{0,1,…,q-1,∞}. The bit rate is R≥1-j/k. In this paper, the designed parity-check matrix is expressed as follows:
(17)P=[III⋯I⋯I0IP⋯P(j-2)⋯P(k-2)00I⋯P2(j-3)⋯P2(k-3)⋯⋯⋯⋯⋯⋯⋯00⋯0I⋯P(j-1)(k-j)].
The bit rate can be determined by j and k. And the parity-check matrix can also be determined, and then coding is implemented. Since the elements of proposed parity-check matrix are 0 or 1 only and can be computed by simple additions and shifts, QC-LDPC encoder is suitable for the hard implementation.


## 2.1. Proposed Algorithm Architecture

Figure2 shows the proposed deep coupling architecture. The key band Xkey is processed by deep coupling between the posttransform and CS. This key band is used to reconstruct the other bands in decoder. Other bands Xi are processed by deep coupling between the posttransform, CS, and DSC. First, Xi is performed by wavelet transform and posttransform. Then, the posttransform coefficients are sampled by the CS measurement matrix to obtain the resultant CS measurements. Finally, the resultant CS measurements are encoded by a Slepian-Wolf (SW) encoder. In our scheme, we choose QC-LDPC code as the powerful error-correcting code to realize the DSC strategy. The QC-LDPC-based SW coder is implemented to encode the resultant CS measurements bits to generate the check bits. The check bits are only entered into the compressed bit streams.Figure 2
Proposed deep coupling coding architecture for multiband CCD images.In decoding, the check bits and side information are combined in a new code word to correct errors. So the result measurements ofXi can be recovered. The side information can be X^i′ which can be obtained by the prediction approach from the X^i-1 and X^i-2, which are reconstructed from the Xi-1 and Xi-2. The reconstructed result measurements can be recovered by a recovery algorithm based on orthogonal matching pursuit (OMP) to obtain the reconstructed posttransformed coefficients. The reconstructed posttransformed coefficients are reversely transformed to obtain reconstructed wavelet coefficients. Finally, the reconstructed wavelet coefficients are reversely transformed to obtain the X^i.


## 2.2. Deep Coupling between PT and CS

Figure3 shows the proposed deep coupling between the posttransform and CS. An image is decomposed by two-dimension DWT into three-level high-frequency subbands and one low-frequency subband. Each high-frequency subband is performed by posttransform. In our algorithm, the dictionary has two bases, which work at high bit rate and low bit rate. We use l-p norm-based, the best posttransform. Three levels of high posttransformed subbands are sampled by 3 CS measurements’ matrices Φ1, Φ2, and Φ3. The resultant CS measurements are quantized and entropy coding. The compressed stream bits can be obtained and then are grouped into packets and are sent to the decoder via signal channels. The size measurements matrix can be evaluated by an information evaluation. And the base used is selected by a bit evaluation.Figure 3
Proposed deep coupling coding between PT and CS.In this paper, to obtain a low-complexity yet an efficient posttransform, we use a very simple dictionary which is composed of the Hadamard basis and DCT basis; that is,Nb=2. Under the low bit rate, the bit rate R can be expressed as
(1)R≈γ0M,γ0=7,
where M is the number of nonzero posttransformed coefficients. Under the high bit rate, the bit rate R can be expressed as
(2)R≈h(x)-log⁡2q,H(X)=-∑i=1Npilog⁡2pi,
where H(x) is the entropy of image x and q is a quantizer step. According to (6) and (7), we proposed a new approach based on lp norm for the best posttransform basis selection.Under the low bit rate, the best posttransform basis selection can be expressed as(3)fb*=argmin⁡fb,b∈[0,Nb]∥fb∥0s.t.∥fb∥0=∑m=116Im,hhhhhhhhhhhhhhhIm={1,⌊|ab[m]|⌋≠0,0,⌊|ab[m]|⌋=0,
where ab[m] is a posttransformed coefficient.Under the high bit rate, the best posttransform basis selection can be expressed as(4)fb*=argmin⁡fb,b∈[0,Nb]∥fb∥1s.t.∥fb∥1=(∑m=015|ab[m]|).Given the different subbands which include varying degrees of image information, the CS sensing matrices have different sizes. Four CS sensing matrices are denoted asΦLL, ΦLH⁡, ΦHL, and ΦHH. The sensing process can be expressed as
(5)[YLLYLH⁡YHLYHH]=[ΦLLΦLH⁡ΦHLΦHH][XLLXLH⁡XHLXHH],
where YLL, YLH⁡, YHL, and YHH are CS measured result samples from posttransformed low subband and high subbands and XLL, XLH⁡, XHL, and XHH are posttransformed coefficients in low subband and high subbands, respectively.CS sensing matrices’ size is determined by bit rate. Since the best transform selectfb* is reflecting the image information, the bit rate can be evaluated by fb*. The bit rate can be expressed as
(6)ri=Ii∑i=110Ii×R,Ii=∑j=1Jifj,ib*,
where ri denotes ith subband allocated bit rate, R denotes total bit rate, Ii denotes ith subband of the amount of information, Jj denotes the number of ith subbands of the posttransform blocks, and fj,ib* is ith subband of jth best posttransform selection.The base used in dictionary selection is determined by CS result measurements. In result measurements, we use a prediction approach to compute the amount of information of CS result measurements. The prediction can be expressed as(7)f′(k,q)={min⁡(f(k,q-1),f(k-1,q)),f(k-1,q-1)≥max⁡(f(k,q-1),f(k-1,q))max⁡(f(k,q-1),f(k-1,q)),f(k-1,q-1)≤min⁡(f(k,q-1),f(k-1,q))(f(k,q-1)+f(k-1,q))-f(k-1,q-1),others.
Each CS result measurement l-1 norm can be expressed as
(8)Y*=∥Δ∥1,s.t.Δ=|f(k,q)-f′(k,q)|.
When Y* is considered as fb*, from (1), the base used in dictionary selection can be determined.


## 2.3. Deep Coupling among PT, CS, and DSC

Figure4 shows the proposed deep coupling among the posttransform, CS, and DSC.Figure 4
Proposed deep coupling coding among PT, CS, and DSC.The subset of the bandsXi-1 and Xi-2, which have been encoded, is used to compute the linear predictor coefficients α and β.The band Xi is decomposed by DWT and posttransform to obtain the posttransformed coefficients. The posttransformed coefficients combined with the coefficients α and β to obtain the prediction posttransformed coefficients’ band Xi′. The posttransformed coefficients Xi and Xi′ are sampled by CS measurements’ matrix to obtain the result measurements Yi and Yi′. Yi and Yi′ are used to compute the crossover probability p^i. The crossover probability determines the check matrix and the posttransform base used. The crossover probability and the best transform select fb* decided mutually the measurements’ matrix size.To ensure that theXi′ and Xi are similar as far as possible, we use a second-order filter to compute the prediction coefficients α and β. This can be expressed as
(9)x′=α(v-mv)+β(w-mw)+mx,
where v is the pixels colocated with the current pixel in band Xi-1, w is the pixels colocated with the current pixel in bands Xi-2, and mv and mw are the expectation value of the random variables v and w, respectively. This can be expressed as
(10)mv=E{v},mw=E{w}.
Under the minimum mean square error criteria, the statistical optimal prediction can be computed by solving a Wiener-Hopf equation as
(11)[δv2δwvδwvδw2][αβ]=[δxvδxw].
Define the context windows of the current band and the previous band as shown in Figure 5; the statistical parameters can be approximated as
(12)δv2=E{v2}-mv2=1M2(M∑i=1Mvi2-(∑i=1Mvi)2),δwx=E{wx}-mwmx=1M2(M∑i=1Mwixi-∑i=1Mwi∑i=1Mxi),
where M is the context window size. Other parameters can be likewise calculated.Definitions of context windows: (a) and (b) two previous bands, (c) current band.
(a)
(b)
(c)The theoretical limit of Slepian-Wolf bit rate isR⩾H(X∣Y); bit rate determinates the parity-check matrix of QC-LDPC. The conditional entropy H(X∣Y) can be expressed as
(13)H(X∣Y)=H(p)=-plog⁡2(p)-(1-p)log⁡2(1-p),
where p is the crossover probability. The crossover probability can be computed as
(14)Pi=E(Pn)=1M∑nPn≈1M∑nTn,hhhhhhhhhTn={1,ifYi,j≠Xi,j,0,ifYi,j=Xi,j.
To improve efficiency, we use subsample to evaluate the crossover probability. In addition, we use the QC-LDPC code to implement the SW encoder. For fast and efficient coding, in [13], cyclic matrix A uses a b×b permutation matrix as follows:
(15)P=[010⋯0001⋯0⋮⋮⋮⋱⋮000⋯1100⋯0].
Consider that Pj is a permutation matrix; it is obtained by unit matrix Pj that shifts i times right. i is a positive integer. P∞ is a zero matrix. A parity-check matrix is expressed as
(16)P=[Pa11Pa12⋯Pa1(k-1)Pa1kPa21Pa22⋯Pa2(k-2)Pa2k⋯⋯⋯⋯⋯Paj1Paj2⋯Paj(k-1)Pajk],
where ail∈{0,1,…,q-1,∞}. The bit rate is R≥1-j/k. In this paper, the designed parity-check matrix is expressed as follows:
(17)P=[III⋯I⋯I0IP⋯P(j-2)⋯P(k-2)00I⋯P2(j-3)⋯P2(k-3)⋯⋯⋯⋯⋯⋯⋯00⋯0I⋯P(j-1)(k-j)].
The bit rate can be determined by j and k. And the parity-check matrix can also be determined, and then coding is implemented. Since the elements of proposed parity-check matrix are 0 or 1 only and can be computed by simple additions and shifts, QC-LDPC encoder is suitable for the hard implementation.


## 3. Experimental Results

As usually done in the literature, we use the Quickbird multiband remote sensing images. Each group remote sensing images are used to evaluate our deep coupling compression scheme. The size of each group is512×512×4, and the bit depth of pixel is 8 bpp (bits per pixel). The compression rate is set to 1 bpp. All algorithms are implemented in MATLAB and run on PCs with 1.87 GHz E8400 CPU and 1 GB memory. The following diagrams illustrate the results. Figure 6 demonstrated the four original and reconstructed bands. From the displayed images, the original image and reconstructed image have almost no difference because the proposed compression algorithm has a high signal-to-noise ratio.Encoding multiband images at 2.0 bpp.
(a)
Original band 1
(b)
Original band 2
(c)
Original band 3
(d)
Original band 4
(e)
Reconstructed band 1
(f)
Reconstructed band 2
(g)
Reconstructed band 3
(h)
Reconstructed band 4To objectively evaluate the performance of proposed deep coupling-based compression scheme, extensive experiments were carried out on a number of multispectral data at various coding bit rates. In the first experimental part, we compare the compression results obtained with the proposed coder against those achieved with AT-3DSPIHT [14], 3D-DWT [15], 3D-PCA [16], 3D-SPECK [17], and SA-DCT [18] implemented independently. The quality assessment of the decoded images is based on rate-distortion results measured by means of the overall SNR given by
(18)PSNR=10log⁡10(PMSE)(dB),
where P and MSE denote the power of the original image and the mean squared error, respectively. The PSNR comparisons were demonstrated in Figure 7. Due to the full usage of posttransform, CS, and DSC, the proposed deep coupling-based compression scheme achieves the best compression performance and 0.3~1.3 dB PSNR gain on average against the other five compression codecs in norm bit rate 2.0~0.25 bpp. Overall, the proposed scheme shows excellent lossy compression performance and delivers better compression results than that of commonly used coders.The test result of multiband images.
(a)
(b)


## 4. Conclusion

In this paper, we proposed a low-complexity compression algorithm based on deep coupling algorithm among posttransform in wavelet domain, compressive sensing, and distributed source coding. In our algorithm, we integrate three low-complexity and high-performance approaches in a deeply coupled manner to remove the spatial redundant, spectral redundant, and bit information redundancy. Experimental results on multiband CCD images show that the proposed algorithm significantly outperforms the traditional approaches.



---

*Source: 374285-2014-07-06.xml*