A Sparsity-Based InSAR Phase Denoising Algorithm Using Nonlocal Wavelet Shrinkage

An interferometric synthetic aperture radar (InSAR) phase denoising algorithm using the local sparsity of wavelet coefficients and nonlocal similarity of grouped blocks was developed. From the Bayesian perspective, the double- l 1 norm regularization model that enforces the local and nonlocal sparsity constraints was used. Taking advantages of coefficients of the nonlocal similarity between group blocks for the wavelet shrinkage, the proposed algorithm effectively filtered the phase noise. Applying the method to simulated and acquired InSAR data, we obtained satisfactory results. In comparison, the algorithm outperformed several widely-used InSAR phase denoising approaches in terms of the number of residues, root-mean-square errors and other edge preservation indexes.


Introduction
In the data processing of interferometric synthetic aperture radar (InSAR), the quality of the retrieved interferometric phase determines the accuracy of final products such as the estimation of ground deformation and digital elevation model (DEM). The phase retrieval is strongly affected by the phase denoising and phase unwrapping. When corrupted random phase noise exists, the result after the phase unwrapping is generally unsatisfactory. Therefore, the phase denoising using filtering is one of fundamental steps to obtain accurate phase estimation.
Numerous filtering approaches in the spatial domain or transformed domain are developed for the denoising. Examining the approaches carefully, one reveals some deficiencies. For instance, the direct filtering methods [1,2] applied in the spatial domain may not preserve details of fringes although the window direction-dependent [3] and size-dependent [4][5][6] methods are able to remedy the preservation difficulty to some degree. With the assumption that the true signal and noise could be separated in the frequency domain after transformation, the denoising is performed by suppressing part of the transformed coefficients. However, if the coherence is low or fringes are dense, the Goldstein filter [7] and its derivative method [8] in the frequency domain cannot offer the well-balanced noise reduction and the preservation of fringe texture. With the consideration of the coherence information of the local neighboring pixels, the joint subspace projection method [9] improves the balance. The method [9] might fail in the area of low correlation if the estimated dimension of noise subspace is not accurate.
Phase filtering methods using the wavelet [10,11] and wavelet packets [12] are characteristically of good spatial resolution preservation and high computational efficiency. To ensure the filtering performance in the areas of low coherence and dense fringe, modified shrinkage methods are studied [13][14][15]. The phase filtering using the wavelet packet and simultaneous detection and estimation [15] is able to filter the high frequency information but is not desired for noise removal. The phase filtering in the undecimated wavelet domain using simultaneous detection and estimation [15] has the ability to filter very noisy phase data even if the density of phase fringes is relatively moderate or low. A sparse regulation approach [16], which jointly performs phase noise reduction and despeckling is presented. However, the prior information of interferometric phase is required. An anisotropic diffusion filter is embedded into the wavelet domain [17] to achieve a robust speckle suppression at wide range of speckle variances. A sparse reconstruction method using simultaneous sparse coding (SSC) on the ordered patches [18] is proposed for multichannel POLSAR image filtering.
Nonlocal techniques [19,20] are known to reduce noise while preserving the structures by performing the weighted average of similar patches efficiently. The weight depends on the similarity between the patch centered at the target pixel and other patches in the search window. With the nonlocal similarity principle, block matching with 3D collaborative filtering (BM3D) [21] is investigated, which is based on the enhanced sparse representation in the transform domain. The enhancement of the sparsity is achieved by grouping similar 2-D fragments of the image into a 3-D data array. Due to the similarity between the grouped fragments, the transformation can achieve a highly sparse representation of the true signal. Thus, the noise can be well separated by the shrinkage. Similarly, several advanced patch-based phase filtering methods are later proposed [22,23], of which redundant patterns of the images are exploited and a large set of pixels is selected to estimate each given pixel. With the presence of strong noise or the low signal-to-noise ratio in low-coherence areas, details shared by the similar blocks are probably weakened by the inter-block transform and the simple thresholding function. Thus, the accuracy of the block similarity is adversely impacted.
In this paper, the nonlocal similarity and wavelet-domain sparsity are incorporated into a unified variational framework for the InSAR phase estimation through filtering. The nonlocal similar blocks of interferogram are clustered by grouping, and then the overlapped blocks are shrunk in 2D wavelet domain by the nonlocal wavelet shrinkage function. The nonlocal shrinkage function utilizes double-l 1 norm restriction enforcing local and nonlocal sparsity constraints by shrinkage operators. This filter combines the intra-and inter-blocks correlation by taking advantage of the self-similarity of overlapped blocks. Thus, the finest details shared by the grouped blocks and the essential unique features of each individual block are revealed. Details are given next.

Formulation of InSAR Phase Filtering
The complex interferogram is formed by a pointwise complex multiplication of corresponding pixels between two complex images z 1 and z * 2 . It consists of an argument processing in which the interferometric phase is wrapped from −π to π. The phase noise can be additively modeled [3,10] as where φ w is the noise-free InSAR phase. φ n is the noise. arg represents the argument of a complex quantity. * indicates the complex conjugate. φ w and φ n are assumed to be independent from each other. The goal of the phase denoising is to recover φ w from φ. According to the detailed analysis of [10], the real and imaginary parts of the phase can be modeled as where N c is a factor related to the coherence. v c and v s are defined as statistically equal noise term. They are considered as zero-mean additive noise and independent from φ w , respectively. Since the real and imaginary parts of the phase are of periodic characteristics as the phase is wrapped from −π to π. Therefore, the filtering should be performed on the real and imaginary parts separately in order to maintain the phase jumps. When the real and imaginary parts are filtered, the final filtered phase can be extracted. In our patch-based method, the noise in real and imaginary part of every phase image patch are assumed as independent and identical Gaussian noise.

Modeling of Nonlocal Wavelet Shrinkage Method
For an image x of size N × N pixels which is corrupted by random noise v, the additive noise observation model of the patch-based method can be expressed as where y i is a patch of size M × M pixels that is extracted from y at location i and ordered lexicographically as a column vector y i ∈ R n . x i is the noise-free patch corresponding to y i . v i is the noise patch. Under the assumption that the solution of upper linear inverse problem has a sparse expansion on an preassigned orthonormal basis, the following shrinkage model is introduced for denoising task using regularization with a sparsity constraint. The recovery problem is solved by an l 1 -minimization problem where λ is the regularization multiplier, α i is the coefficient in some transformed basis, and T −1 2D is the linear inverse transform.
Wavelet transform (WT) denoising is very promising because the phase information and noise can be more easily separated in the wavelet domain. For an effective restoration, the wavelet shrinkage coefficients, achieved by solving the objective function in Equation (5), are expected to be as close as possible to the true coefficients. Let us define β i as the true WT coefficients of x i (or a good estimation). The estimated α i may deviate from β i due to the degradation of the observed y i . In order to get approximate coefficients, we need to minimize γ i = α i − β i . Here we call it "wavelet coding noise" and build the regularization model as where α i is the estimated WT coefficients for patch x i , β i is a good estimation of the real WT coefficients for patch x i . λ 1 and λ 2 are the Lagrangian multipliers that are used to balance two regularization terms. p is the regularization norm for "wavelet coding noise" term.
Recently, many statistical approaches emerged as new tools for wavelet-based denoising, such as the Bivariate Shrinkage method [24]. The estimation of clean coefficients is expressed as a Bayesian estimation problem, such as the MAP estimator. In Equation (6), β i is treated as a peer hidden variable that can be utilized to promote more accurate shrinkage method. Under the Bayesian formula, the posterior estimator is formulated as According to probability theory, there is a relationship: P(α i , γ i ) = P(γ i |α i )P(α i ). The distribution of probability P(α i , γ i |y i ) is characterized by Gaussian distribution as where σ ω i is the noise standard deviation of y i . It should be pointed out that the Laplacian distribution for the clean wavelet coefficients is very meaningful [25]. Thus, α i is modeled as the Laplacian distribution γ i is also modeled as a Laplacian distribution where σ α i is the standard deviation of the clean coefficients of patch x i . σ γ i is the standard deviation of γ i . Substituting Equations (8)-(10) into Equation (7), we obtain From the point view of the Bayesian estimation, we can see that Equation (11) is equivalent to Equation (6). The regularization term of α i − β i p should use the l 1 norm (p = 1).
Also, we can set . It is a double-l 1 convex optimization problem [26].
It can be solved by alternatively updating α i via iterative algorithm [27] following the iterative shrinkage solution (see Appendix A) c is an auxiliary parameter guaranteeing the convexity of surrogate function. j denotes the number of iterations. Subscript i denotes the i-th entry in a vector. The generalized shrinkage operator S τ 1 ,τ 2 ,β i (t) is defined by [27] where b is the scalar component of β i .

Nonlocal Estimation of β i
It's impossible to directly obtain the true WT coefficients of clean interferogram because it cannot be directly measured. Since the 2π-periodic nature of the interferometric phase provides abundant self-similar structure, many harmonious patches that we call "groups" can be extracted by clustering or grouping. Figure 1 illustrates the nonlocal self-similar patches in acquired InSAR phase images. The patches in solid line are similar to the reference patch in dash line. In the adaptive estimation strategy, the nonlocal means is introduced in [19]. All similar pixels in its neighborhood can be used to estimate the value. As the patches in one group exhibit perfect similarity, each patch should get some approximately same significant transform coefficients. Inspired by this, the WT coefficients in one similar group can be utilized to get a good estimation of β i in the wavelet domain. It can be computed as the weighted average of those WT coefficients associated with the nonlocal similar patches. For a patch y i , similar patches can be extracted and expressed as a group C i = {y l |y l is similar to y i , l = 1, 2, ..., K num }. K num is the number of patches for one group. The k-th coefficient of β i can be estimated byβ where α l,k is the k−th coefficient of α l . ω i,l is the weight, which determines the contribution factor for patch y l in denoising the reference patch y i .
where ω is the normalization factor with h is a constant proportional to the noise deviation and can take values as h = 12σ ω . Since the nonlocal structural self-similarity are utilized to estimate β i , the updating of α i is conducted following the iterative shrinkage solution in Equation (A7). Therefore, the local sparsity in wavelet domain and the nonlocal structural self-similarity are combined in phase denoising.

Parameter Selection
Interferometric phase noise is spatially variant. Therefore, the filtering parameter should be estimated locally and adjusted to obtain a better filtering performance. For a patch y i , a local estimator of σ ω i [28] is where 'Med(M)' is to obtain the median value of M. y i is the gradient of y i . In wavelet domain, the relation of noisy coefficients, clean coefficients, and noise coefficients are formulated as follows where Wy i are noisy coefficients of patch y i , Wx i and Wv i are clean coefficients, and noise coefficients, respectively. The signal and noise are assumed independent [12]. Hence, σ 2

The standard deviation of noisy coefficients σ α Wv i
is estimated as the method in [12], which is where Wy i is the mean value of the noisy wavelet coefficients Wy i . According to the method of [13], the standard deviation of noise WT coefficients is (20) where Wy HH1 represents the wavelet coefficients in the first level HH wavelet subband. After obtaining the values of σ α Wy i and σ α Wv i , σ α i is calculated using the relation where 'eps' is a small positive value. 'Max' operation is to ensure σ α i is not positive. λ 1 can be Figure 2 is the flowchart of the proposed InSAR phase filtering algorithm. As discussed in Section 2.1, the nonlocal structural similarity of the real and imaginary parts of the phase is derived separately. Thus, the filtering is applied to the real and imaginary parts separately. The patches are processed by successively extracting similar patches as one similar group. Grouping is accomplished using the block matching [21]. Each patch is filtered by the nonlocal wavelet shrinkage Equation (A7). Due to the overlapping operation, the patch-based representation is highly redundant. Therefore, the recovery of x from x i becomes an over-determined problem. A final estimation is made by aggregating all of the obtained local estimates using a weighted average. The filtered blocks are then returned to their original positions. The step-by-step description is given next.

Step 1. Grouping by the block matching:
For each M × M size reference patch y i in the original noisy image (real part or imaginary part), find the blocks y l that are similar to the current processed one, and then cluster them together as a group C i , i.e., C i = {y l |d(y i , y l ) < d hard }. The original noisy image is searched for in a reference block-centered W × W neighborhood. This is achieved by the pairwise-testing the similarity between the reference fragment and the candidate fragments located at the nonlocal spatial locations. Here l 2 -distance is selected in the identification of the similar blocks As the noise will influence the precision of similarity adjudgment, it is reasonable to use a higher threshold d hard to select enough similar patches, i.e., d hard = π 2 4 . In order to restrict the number of similar patches, the K-nearest neighbor strategy is also implemented. K num patches with the smallest dissimilarity are chosen to be the similar patches of the reference patch. For each similar group, weights w i,l can be calculated and saved, and are used in Step 3 to calculate β i . Step

Discrete wavelet transform (DWT):
For every block in each group C i , the data are transformed into the wavelet domain.
Step 3. Calculation of nonlocal mean value of wavelet coefficients: Since nonlocal weights are obtained in Step 1, the nonlocal mean value of the wavelet coefficients in each group is calculated using Equation (15). λ 1 and λ 1 can be calculated by the method of Section 3.1.
Step 4. Nonlocal wavelet shrinkage by double-header l 1 optimization: For each group, the wavelet coefficients are shrunk using Equation (A7).
Step 5. Inverse wavelet transform and aggregation: The filtered data are inversely transformed into the spatial domain. The aggregation or an averaging procedure that takes advantage of the redundancy is carried out. Similar to the BM3D and the nonlocal filtering method based on the higher order singular value decomposition (HoSVD) [23], a processed pixel can be in different groups by the overlapped patches. Thus, the result after the filtering has to be returned to its original position and to be weighted by an averaging of the block-wise estimates.
Step 6. Estimation updating: The estimation of recovered phase image is updated by where δ is a pre-determined positive constant controlling the amount of the noise fed back to the iteration. Then, the procedures from Step 1 to Step 6 is iteratively performed until the changes of estimations between two consecutive loops are less than a threshold. The average change of estimations is expressed as . This threshold can be chosen according to your filtering precision, such as 1/50 or even smaller.
Step 7. Phase calculation: Once the real and imaginary parts of the InSAR phase are estimated, the filtered phase image is obtained from where arg() represents the argument of a complex quantity.

Results
It should be noted that the details preservation is very vital for evaluating the quality of the filtering methods. The structural similarity (SSIM) index offers a direct way to compare the structural similarity of the reference and the filtered image when the reference image is available. The SSIM for two windowed reference patch i and filtered patch j can be expressed as [29], where µ i and µ j are the means of reference patch and the filtered patch, respectively. σ ij is the covariance of the reference patch and the filtered patch. C 1 and C 2 are constants to avoid instability when µ 2 i + µ 2 j or σ 2 i + σ 2 j is very close to zero. SSIM is distributed in the interval of [−1, 1]. The structural preservation quality is worst when SSIM is −1 and best when SSIM is −1. A mean SSIM (MSSIM) index [29] is utilized to evaluate the overall quality as MSSI M = 1 K ∑ M i=1 SSI M(i, j). The metrics for edge preservation such as root-mean-square errors (RMSEs) [23] and SSIM are not available when the reference/clean phase image is unknown. For acquired InSAR data, the reference/clean image is not available. The no-reference metric Q [30] is shown good visual performance in balancing between denoising and detail preservation, so it can be used as a quantitative measure of true phase image content.
In addition, different wavelet bases (Haar wavelet, Daubechies wavelets, bi-orthogonal spline wavelet) are implemented in the developed algorithm. The searching window is limited within the size of 58 × 58 pixels. The block size is 16 × 16 pixels. A fixed value K num = 20 is determined in grouping step. The proposed algorithms are implemented in MATLAB R2013b on a 64 bit 3.10 GHz Intel R core TM i5-2400 computer with 16 Gb random access memory (RAM).

Simulated InSAR Data
The data are simulated using an available DEM. The interferogram data without noise are 512 × 512 pixels with different fringe densities (Figure 3). For a single-look interferometric phase, the variance of phase noise can be calculated as σ 2 n = π 2 3 − π arcsin(|ρ|) + arcsin 2 (|ρ|) − Li 2 (|ρ| 2 ) 2 . Here Li 2 (·) is Euler's dilograrithm. ρ is the coherence. According to four coherence values of 0.3, 0.5, 0.7, and 0.9, we then add Gaussian noise with zero mean and variance σ 2 n . The related interferogram datasets are Data-I ( Figure 4A1), Data-II ( Figure 4B1), Data-III ( Figure 4C1) and Data-IV ( Figure 4D1). Noise exists and varies spatially ( Figure 4A1-D1). Also, the higher the coherence value is, the less the noise in the InSAR phase data (e.g., Figure 4D1 c.f. Figure 4A1). After three iterations with our developed algorithm, we can obtain satisfactory results. There is significant reduction in noise (e.g., Figure 4A2 c.f. Figure 4A1). The edges of the interferogram is well delineated since the nonlocal wavelet shrinkage method can preserve edges well even though the coherence values are low in phase data. In comparison of the noise-free data ( Figure 3) with each filtered phase dataset ( Figure 4A2-D2), they look similar. To analyze fringe details preservation, SSIM maps are calculated and shown in Figure 4. Figure 4A3-D3 are SSIM maps between clean phase image and noisy images. Figure 4A4-D4 are SSIM maps between clean phase image and filtered phase images. After filtering, the SSIM values are dramatically increased. Meanwhile, the similarity increases as coherence level increases. For example, the SSIM value in Figure 4D4 are higher than that in Figure 4A4.  We then compute differences of Figures 3 and 4A2, Figures 3 and 4B2, Figures 3 and 4C2, and Figures 3 and 4D2, respectively, and show the differences as Figure 4A5-D5. Difference exists, varies spatially and can be large (e.g., Figure 4A5). Difference values along the transect (shown as a white segment in Figure 3) for the four difference images are extracted and shown ( Figure 4A6-D6). The difference ranges from about −2.5 to 1.5 rad in Figure 4A6, and from about −0.15 to 0.15 rad in Figure 4D6. It is clear the algorithm performs better when the coherence value is high.
The number of residues, RMSEs and MSSIM for each dataset before (Table 1) and after (Table 2) filtering are listed. Comparative experiments are conducted to test the effectiveness and robustness of our proposed method. The transformations are Haar, the Haar wavelet, Dbp, the Daubechies wavelet with p (p = 2, 4, 6) vanishing moments, Bior1.N r , bi-orthogonal spline wavelet with the vanishing moments of the decomposing and the reconstructing wavelet functions being 1 and N r . From Table 2, we can see that the filtering results with different wavelet bases are very close. The number of residues and RMSEs decrease. For example, the number of residues decrease from 76,502 to 19, and the RMSE from 2.3814 to 0.1059 for Data-I. MSSIM represents the total structural preservation quality. Via comparing Tables 1 and 2, one can see that MSSIM is above 0.65 even when the phase noise is very high (Data-I). Thus, the performance of the algorithm is quantitatively satisfactory.

Acquired InSAR Data
The algorithm is further applied to three acquired datasets ( Figure 5A1-C1). Data-V ( Figure 5A1) and Data-VI ( Figure 5B1) are from the airborne C-band SAR using repeat-pass interferometry. Fringes in Data-VI are not as clearly visible as those in Data-V. Data-VI is much noisier than Data-V. Coherence values in Data-V are high ( Figure 5A2), but low in Data-VI ( Figure 5B2). Data-VII is acquired by the SIR-C/X-SAR mission. Data-VII is selected because the variable fringe density ( Figure 5C1) and low-coherence values ( Figure 5C2) in mountainous areas.
Interferogram data after filtering are shown in Figure 5A3-C3. When the coherence is high (Figure 5A2), the filtering performs well ( Figure 5A3). The fringes are clearly delineated. The performance is satisfactory ( Figure 5B3) even if the interferogram is very noisy ( Figure 5B1) and the coherence is low ( Figure 5B2). The fringes are better depicted (c.f. Figure 5B3 vs. Figure 5B1). The filtered result ( Figure 5C3) is still acceptable although the fringes may be not very well delineated in low coherence area. For further analysis on noise reduction and structural preservation, number of residues and metric Q before and after filtering are given in Tables 3 and 4. Via using our proposed method, the number of residues decreases significantly. Overall, the method performs satisfactorily for the interferogram data of variable fringe densities and coherence values.
In simulate experiment, pixels are clustered by using LARK-based K-means cluster in PLOW method methods. In BM3D method, 3D transform is implemented by exploiting 2D bior1.5 wavelet transform for the inter-block and 1D 'Haar' wavelet for intra-blocks. In NLHoSVD method, similar patches are formed as a "order-3 tensor" and then HOSVD is applied to the order-3 tensor.
Results from the simulated data using the methods are presented in Figure 6. Quantitative assessment is tabulated in Table 5. Four points are summarized in the comparison study (Figure 4 vs. Figure 6, Table 2 vs. Table 5).  (1) The Goldstein method and the WInPF method show large numbers of errors in almost all the areas of phase image, especially in areas of low coherence value and high fringe density. The number of residues increases with the increase of noise level. The texture in the region of dense fringes is not well preserved. (2) The noise suppressing performance of nonlocal based methods is superior than Goldstein and WInPF methods. According to PLOW based on LARK feature method, some phase noise still exists since one cluster may have different noise levels. Some fringes in Figure 6A3 are broken or merged with neighboring fringes. (3) The filtering performance of BM3D is comparable to NLHoSVD when the coherence is relatively high. Its details preservation are probably weakened with the presence of strong noise or low signal-to-noise ratio in low-coherence areas. The performance of NlHoSVD is better than that of Goldstein, WInPF, BM3D or PLOW. However, the filter employs the simple hard thresholding method such that the nonlocal similarity might not be fully exploited. (4) Dataset-by-dataset, the proposed method has the least number of residues and the smallest RMSE (Table 2 c.f. Table 5). In the simulation experiment of Data-II, Data-III and Data-IV, the numbers of residues are all zeros. In addition, the method overcomes the problems of the discontinuity and blurring, and suppresses the phase residues of grainy noise even in areas of low coherence and high fringe.
Similarly, the four methods are used to the acquired data. Pixels are clustered according to their coherence in modified patch-based locally optimal Wiener (PLOW) method [28]. As examples, filtered results for Data-VII are given in Figure 7. From the left to right, the results are from the Goldstein, WInPF, modified PLOW, BM3D and NlHoSVD. Close-up views of area within the white rectangle A and B are shown in the second and third row, respectively. The average coherence value of area A is 0.37 and area B is 0.27.The coherence of area B is very low (See the coherence Figure 5C2). Overall, all methods reduce noise. The Goldstein filter may introduce some artifacts in the areas of severe-phase variation and low coherence, especially in the regions affected by the grainy noise. As compared to results from the Goldstein method, both WInPF methods and nonlocal based methods improve the performance of noise reduction and effectively suppress the residues. The filtered results from WInPF method become worse in the area of low coherence with broken fringes and spike-like fringes ( Figure 7B2,B3). However, the modified PLOW, BM3D and NlHoSVD methods significantly suppress noise even in the relatively low-coherence area A. In the very low coherence area B, filtering result of NlHoSVD method is better than the modified PLOW and BM3D methods. The close-up view of the area within the rectangle area A and B from the proposed method is shown in Figure 8. Comparing Figures 7  and 8, we can see that our method in area B is more smooth than other methods. Clearly, the filtered result has the least amount of blurring and discontinuity in phase fringes. The proposed method has the smallest number of residues and the smallest RMSEs (Table 4 c.f. Table 6). In the aspect of detail preservation, metric Q is utilized as a quantitative measure of true phase image content. It can be seen that our proposed method can obtain the highest metric Q. From this point of view, our proposed method is superior to the other methods. The processing time for each method is also given in Table 6. The Goldstein method is the fastest one with 0.2 s, and the NlHoSVD is the slowest one with 665.8 s. The processing time of the proposed method is 546.0 s.

Fast and Efficient Realization
Although the filtering result of our method is convincing, the computational efficiency is intuitively low because it needs pixel-wise window group matching in which the Euclidian distance between similar patches and the weights in the image is computed. For a N × N phase image with W × W searching window and M × M patch size, the complexity of the block matching is O( M 2 W 2 N 2 N 2 step ) by setting N step pixel steps between neighboring processed patches. However, the computational complexity can be reduced by restricting the searching size of similar window, steps and patch size. Once the window size and patch size is chosen, further expedients are utilized to improve the computational efficiency in the following: The Summed Squares Image (SSI) scheme and Fast Fourier Transform (FFT) are proposed [31] to speed up the calculation of similarity among blocks. The Euclidian distance between image blocks is transformed to computation of convolution and summation of squares. In particular, to calculate the distance d between patch N 1 and N 2 , we assume the patch size is M = 2s + 1, then the distance is (S 2 2 (x, y)) − 2S 1 (x, y) * S 3 (m, n) where S 1 and S 2 are the corresponding pixels in image patch N 1 and N 2 , respectively. S 3 is the mirrored image of S 2 with m = 2S + 1 and n = 2S + 1 (Figure 9). The first and second terms in Equation (26) need to calculate the sum of squares [31] for any block. The sum of squares for each pixel in any rectangles of the image can be got using SSI. For example in Figure 10, the sum of squares in rectangle A can be expressed as K(x 1 , y 1 ) = ∑ x≤x 1 ∑ y≤y 1 S(x, y) 2 (27) A B C D Figure 10. Using SSI to compute the summed squared pixels in rectangle D.
To calculate the sum of squares in rectangle D, only 3 addition operations are required, With the SSI, the sum of squares for each pixel in any rectangle can be derived only by additional operations. Since each pixel in the original image is only processed once, the computational complexity for computing the SSI is O(N 2 ). The third term is calculated by convolution with multiplifications under the FFT. In order to accelerate the algorithm, convolution and summation of squares are utilized in calculating l 2 -distance.
In our experiments, convolution and summation of squares are utilized in calculating Euclidian distance. The processing time of accelerated method is 176.6 s. The computational time is reduced and accelerated 3.1 times with respect to the original method.

Conclusions
In order to preserve fringe details in InSAR denoising processing, especially when dealing with a low-coherence and high-noise area, we develop an InSAR phase filtering algorithm in wavelet domain that utilizes the local sparsity of wavelet coefficients and nonlocal similarity of grouped blocks. In the algorithm, the double-l 1 norm restriction is used, which enforces the local and nonlocal sparsity constraints by efficient shrinkage operators. The nonlocal similar blocks of interferogram are clustered by block matching, and then the overlapped blocks are shrunk in 2D wavelet domain by the nonlocal wavelet shrinkage function. The filter combines the intra-and inter-blocks correlation. Thus, the finest details shared by the grouped blocks and the essential unique features of each individual block are revealed.
Four sets of simulated phase data and three sets of acquired data are used to assess the performance of the proposed method. The simulated InSAR datasets are with high-dense fringes and different level of noise. Results demonstrate the algorithm's ability to filter noise and to preserve fringe texture even in areas of low coherence and high fringe density. Three acquired datasets with variable fringe densities are analyzed. The outcomes are satisfactory.
For comparison, four widely-used interferometric phase filtering methods are applied to the datasets. Qualitative assessments show that the proposed method outperforms the state-of-the-art with lower root-mean-square error, and less noisy fringes.