I Introduction
From its very beginning ideas [1, 2, 3], radar interferometry technique has been developed for more than four decades. This technique requires that the two radar images have the same resolution after proper processing [4]. The resolution determines the fast and slowtime bandwidths of the radar signal, and thus it also determines the rate of the sampling devices and the pulse repetition frequency (PRF). Therefore, for highresolution applications, the requirement of high sampling rate brings a big challenge to sampling devices, and it often needs to sacrifice coverage [5] in spaceborne synthetic aperture radar (SAR). On the other hand, to obtain global digital elevation model (DEM), it needs to acquire large amounts of radar data, which puts huge burden on storage and downlink transmission. A example is the SRTM mission, by which the raw data collected is up to 9.8 Terabyte [6].
Motivated by these issues, this paper proposes a new radar interferometry method that involves two images with different resolutions: one image is highresolution and the other is lowresolution. The proposed method, which we refer to as dualresolution interferometry, can still extract highresolution terrain elevation information, as illustrated in Fig. 1.
The lowresolution acquisition means low observation bandwidths in range and azimuth dimensions, and thus brings a reduction in sampling/data rate and storage cost, and promotes wide coverage or small revisit time. Specifically, for a singlepass mission such as SRTM, we can use a pair of high and lowresolution radars, and the lowresolution one can bring a reduction in sampling rate and storage cost. For a repeatpass mission such as Sentinel1, we can alternate the TOPS mode (lowresolution) and the stripmap mode (highresolution) in two adjacent repeat cycles to reduce the revisit time.
Different from the conventional radar or SAR interferometry, we describe the interferometry with dual resolutions as a compressive sensing [7] problem. By exploiting the sparsity of interferogram in wavelet domain, the interferometric processing is transformed into a sparse recovery problem. According to compressive sensing theory, the sensing matrix of our model should have suitable properties, such as small mutual coherence [8]. Thanks to the inherent randomness of the speckle effect in coherent radar imaging [9, 10], the sensing matrix of our model is random. It is expected to have small mutual coherence, and thus the performance of our method will be guaranteed. Numerical experiments on Sentinel1 data shows that our method can still extract terrain elevation effectively even when the low resolution is only of the high resolution in range and azimuth dimensions. Note that the proposed method can be incorporated into most existing SAR systems to simplify radar interferometry applications, so it may provide a better way for longterm Earth observation.
Ii Background
Let us denote a complexvalued radar image by , where and are integers indexing the image pixels. The phase of can be decomposed into three components (ignore interference and noise) [11]
(1) 
where is the scattering phase, and are the phases due to flat Earth and terrain elevation, respectively. To retrieve the elevation information, radar interferometry exploits the phases of two radar images [4]. Suppose that images and are observed with the same frequency band but at slightly different look angles, then after coregistration, they can be combined pixel by pixel
(2) 
where denote the conjugate of . This operation results in a interferometric phase
(3) 
under the assumption of fully correlation ( is the same for the two images [4]). Then by removing flatEarth contribution using auxiliary orbit data, we have , which contains the terrain elevation information.
For the pixelbypixel interferometry operation (2), it is required that the two images should have the same resolution after proper processing. Otherwise, each pixel pair will be decorrelated. Can we derive the terrain elevation from two images that have different resolutions? This is the problem we shall discuss in the reminder of this paper.
Iii DualResolution Model
In this section, we develop the mathematical model of the proposed dualresolution radar interferometry problem.
Iiia Relations between Dualresolution Images
We consider this case: the first image has the bandwidth in fast time and slow time , and the second image (, ) has the bandwidth with . Then the first image has the (fasttime and slowtime) resolution while the second image has the reduced resolution . For simplicity, we assume that the two images are acquired using the stripmap mode with the same carrier frequency.
Based on the assumption of sinc point spread function of bandlimited radar [4, Li1990Studies], the image can be viewed as lowfrequency part of the original image . Then the spectrum of and can be aligned by common band filtering [11] as
(4) 
where the operator
is the twodimensional discrete Fourier transform (2D DFT) and
is the 2D lowpass common band filter.Note that according to (3). Then we can rewrite the image as
(5) 
where and . Since the phase of contains the interferometric information, we call it as interferogram in this paper. Substituting (5) into (4), we have
(6) 
In practice, (5) and (6) will be corrupted due to the noise introduced by atmosphere, temporal change and look angle. This mismodeling will be considered later.
IiiB Underdetermined Model
For ease of discussing interferogram formation, we shall express the linear model (6
) in matrixvector form. To describe the involved DFT operations, we define four DFT matrices,
, , and , where the subscripts denote the points of corresponding DFT operations. To describe the 2D lowpass filter , let us define two submatrices and of and identity matrices, which extract the (in percentage) lowpass frequency in range and azimuth dimensions, respectively. Next, we denote , and as the matrix forms of , and , respectively. Then we can rewrite (6) in matrix form(7) 
where denotes the Hadamard product, and , and refer to the conjugate, transpose and conjugate transpose of the matrix , respectively. Let and be the columnwise vectors of matrices and , respectively. The linear system (7) can be reformulated into a standard matrixvector form
(8) 
where
(9) 
In (9), refers to the Kronecker product, and denotes the diagonal matrix that has the diagonal element . It can be seen that the size of is , and because the lowresolution image has a smaller size. Then (8) is an underdetermined system. So, different from the conventional interferometry problem, interferogram formation from (8) is an illposed problem and thus cannot be solved directly.
Iv Interferogram Formation
In virtue of compressive sensing theory, we now recover the interferogram by solving a sparse recovery problem.
Iva Interferogram Formation via Compressive Sensing
We use a wavelet basis to sparsely represent the interferogram as , where is a sparse coefficient vector. Incorporating this representation into (8) and defining a matrix , we can describe the underdetermined system (8) by a compressive sensing model
(10) 
where is called the sensing matrix. According to compressive sensing theory, if the vector is reasonably sparse and the sensing matrix has small mutual coherence, we can recover by solving the following optimization problem [12]
(11) 
where is a regularization parameter used to tradeoff between the sparsity of and the modeling accuracy. For the problem (11), there exist a variety of fast solvers, such as the fast iterative shrinkagethresholding algorithm (FISTA) [13].
In the context of compressive sensing, the sensing matrix usually is required to have small mutual coherence, such that the recovery error can be well bounded [7]. In the following, we will analyze the sensing matrix to show that it is expected to have small mutual coherence.
IvB Speckle Effect and Random Sensing Matrix
To get small mutual coherence, injecting randomness has taken the leading role in the design of sensing matrices [14]. For our model (10), the sensing matrix contains natural randomness: due to the speckle effect, the phase of
is a independent random variable uniformly distributed in
. Hence, the matrixcan be viewed as a random matrix with i.i.d. entries uniformly distributed in the unit circle of the complex field. An example illustrating the random phase of a SAR image is shown in Fig.
2. Then from (7), we find that our model actually consists of random modulation by , filtering and resampling by 2D DFT, lowpass filter and 2D inverse DFT. This structure is similar to random demodulation [15], which is an effective compressive sensing system. Therefore, the sensing matrix is expected to have small mutual coherence according to the compressive sensing theory. The strict mathematical analysis of our model is in progress and we only validate it by numerical experiments in this paper. It is notable that the proposed model does not need artificially injecting randomness, which is comprehensively exploited in compressive sensingbased applications, and thus avoids complicating the radar data acquisition.V Numerical Experiments
We test the proposed method by several idealized numerical experiments using Sentinel1 single look complex (SLC) images (online available at https://scihub.copernicus.eu/dhus). Results processed by our method using a highresolution image and a lowresolution one, are compared with that processed by the conventional method using two highresolution images. The relative root mean squared error (RRMSE) are used to evaluate the performance of our method. The RRMSE is defined by the unwrapped phase and a reference phase as follows
(12) 
Va Setup
The used Sentinel1 SLC images contains pixels, which are collected on 20171122 and 20171204, respectively, and the illuminated area is located in Iran, near Kavir desert. The images are collected in stripmap mode with m spatial resolution. To generate a lowresolution image that is equivalent to the acquisition using a smaller bandwidth, the second image is filtered by an ideal lowpass filter, followed by resampling.
After forming two images with dual resolutions, we recover the interferogram by solving (11). We choose the Daubechies4 wavelet basis to sparsely represent the interferogram and set the regularization parameter to . Then we use FISTA as the recovery algorithm and set its maximum number of iterations to . Next, the interferogram returned by FISTA is filtered using Goldstein filter and unwrapped by the SNAPHU software [16]. The filtering and unwrapping uses the default parameters in the SNAP software (online available at http://step.esa.int/main/snap50released/).
VB Results and Discussions
Fig. 3 shows the interferogram formed by the conventional method using two highresolution images and those by our method using a highresolution image and a lowresolution one. As shown in the first and second rows of Fig. 3, although the second interferometric image has low resolutions, our method can still recover the highresolution interferogram with good visual qualities. Moreover, we find that our method results in cleaner interferograms, because (11) naturally has the ability of denoising [17].
RRMSE  28.7dB  25.1dB 
Since the interferogram formed from the two highresolution images is noisy, which usually needs filtering to reduce noise for phase unwrapping, direct comparison of these interferograms is not fair. As an alternative, we compare the filtered and unwrapped phases. As seen in the third and fourth rows of Fig. 3, the filtered and unwrapped phases of our results are almost the same as the conventional results. To quantitatively measure our results, we take the unwrapped phase processed by the conventional method as the reference (the first image in row 4 of Fig. 3), and calculate the RRMSE of our unwrapped phases (the second and third images in row 4 of Fig. 3). As shown in Table I, when we reduce the resolution of the second image to of its original values in range and azimuth dimensions, the resulting unwrapped phase still have good qualities, i.e., dB RRMSE. These numerical experiments demonstrate the effectiveness of our method.
Vi Conclusion and Future Works
In this paper, we proposed a new method for effective extraction of interferometric information from radar images with different resolutions. We found that the underlying highresolution interferogram is embedded into an underdetermined system. Then interferogram formation is transformed into a standard sparse recovery problem in compressive sensing by exploiting the sparsity of interferogram in wavelet domain. We found that the sensing matrix of our model is expected to have small mutual coherence due to the speckle effect. Thus the recovery performance will be guaranteed according to the compressive sensing theory. Numerical experiments on Sentinel1 data were made to illustrate the promising performance of our method. However, we should point out that our method needs more computing resources to solve the compressive sensingbased interferometry problem.
Currently, theoretical analysis as well as some potential applications, including multimode SAR interferometry and deferential SAR interferometry, are under our research.
References
 [1] D. B. Campbell, R. F. Jurgens, R. B. Dyce, F. S. Harris, and G. H. Pettengill, “Radar interferometric observations of venus at 70centimeter wavelength.” Science, vol. 170, no. 3962, pp. 1090–1092, 1970.
 [2] I. I. Shapiro, S. H. Zisk, M. A. Slade, and T. W. Thompson, “Lunar topography: Global determination by radar,” Science, vol. 178, no. 4064, pp. 939–948, 1972.
 [3] L. C. Graham, “Synthetic interferometer radar for topographic mapping,” Proceedings of the IEEE, vol. 62, no. 6, pp. 763–768, June 1974.
 [4] R. Bamler, “Synthetic aperture radar interferometry,” Inverse Problems, vol. 14, no. 4, pp. 12–13, 1999.
 [5] I. G. Cumming and F. H. Wong, Digital Signal Processing of Synthetic Aperture Radar Data: Algorithms and Implementation. Norwood, MA, USA: Artech House, 2004.
 [6] R. Bamler et al., “The SRTM mission: A worldwide 30 m resolution DEM from SAR interferometry in 11 days,” in Photogrammetric Week, vol. 99. Berlin, Germany: Wichmann Verlag, 1999, pp. 145–154.
 [7] E. J. Candès and M. B. Wakin, “An introduction to compressive sampling,” IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21–30, 2008.
 [8] Y. C. Eldar and G. Kutyniok, Compressed sensing: theory and applications. Cambridge University Press, 2012.
 [9] B. Frieden, “Laser speckle and related phenomena,” Optica Acta International Journal of Optics, vol. 23, no. 10, pp. 842–843, 1976.
 [10] J. W. Goodman, “Some fundamental properties of speckle,” Journal of the Optical Society of America (19171983), vol. 66, no. 66, pp. 1,145–1,150, 1976.
 [11] A. Ferretti, A. MontiGuarnieri, C. Prati, F. Rocca, and D. Massonet, InSAR Principles  Guidelines for SAR Interferometry Processing and Interpretation, 2007.
 [12] D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006.
 [13] A. Beck and M. Teboulle, “A fast iterative shrinkagethresholding algorithm for linear inverse problems,” SIAM Journal on Imaging Sciences, vol. 2, no. 1, pp. 183–202, 2009.
 [14] S. Foucart and H. Rauhut, A mathematical introduction to compressive sensing. Birkhäuser Basel, 2013, vol. 1, no. 3.
 [15] S. Kirolos, J. Laska, M. Wakin, M. Duarte, D. Baron, T. Ragheb, Y. Massoud, and R. Baraniuk, “Analogtoinformation conversion via random demodulation,” in IEEE Dallas/CAS Workshop on Design, Applications, Integration and Software, Oct 2006, pp. 71–74.
 [16] C. W. Chen and H. A. Zebker, “SNAPHU: Statisticalcost, networkflow algorithm for phase unwrapping,” https://web.stanford.edu/group/radar/softwareandlinks/sw/snaphu/.

[17]
M. Elad, B. Matalon, and M. Zibulevsky, “Image denoising with shrinkage and
redundant representations,” in
IEEE Computer Society Conference on Computer Vision & Pattern Recognition
, 2006, pp. 1924–1931.
Comments
There are no comments yet.