In this paper we propose a method to estimate the InSAR interferometric phase of the steep terrain based on the terrain model of local plane by using the joint subspace projection technique proposed in our previous pa...In this paper we propose a method to estimate the InSAR interferometric phase of the steep terrain based on the terrain model of local plane by using the joint subspace projection technique proposed in our previous paper. The method takes advantage of the coherence information of neighboring pixel pairs to auto-coregister the SAR images and employs the projection of the joint signal subspace onto the corresponding joint noise subspace to estimate the terrain interferometric phase. The method can auto-coregister the SAR images and reduce the interferometric phase noise simultaneously. Theoretical analysis and computer simulation results show that the method can provide accurate estimate of the interferometric phase （interferogram） of very steep terrain even if the coregistration error reaches one pixel. The effectiveness of the method is verified via simulated data and real data.展开更多
Presents a way to construct orthogonal piece-wise polynomials on an arbitrary triangular domain via barycentric coordinates. Solution of a boundary value problem for Laplace equation; Methodology; Results and discussion.
In this paper we propose the well-known Fourier method on some non-tensor product domains in Rd, including simplex and so-called super-simplex which consists of （d ＋ 1）! simplices. As two examples, in 2-D and 3-D c...In this paper we propose the well-known Fourier method on some non-tensor product domains in Rd, including simplex and so-called super-simplex which consists of （d ＋ 1）! simplices. As two examples, in 2-D and 3-D case a super-simplex is shown as a parallel hexagon and a parallel quadrilateral dodecahedron, respectively. We have extended most of concepts and results of the traditional Fourier methods on multivariate cases, such as Fourier basis system, Fourier series, discrete Fourier transform （DFT） and its fast algorithm （FFT） on the super-simplex, as well as generalized sine and cosine transforms （DST, DCT） and related fast algorithms over a simplex. The relationship between the basic orthogonal system and eigen-functions of a LaDlacian-like operator over these domains is explored.展开更多
文摘In this paper we propose a method to estimate the InSAR interferometric phase of the steep terrain based on the terrain model of local plane by using the joint subspace projection technique proposed in our previous paper. The method takes advantage of the coherence information of neighboring pixel pairs to auto-coregister the SAR images and employs the projection of the joint signal subspace onto the corresponding joint noise subspace to estimate the terrain interferometric phase. The method can auto-coregister the SAR images and reduce the interferometric phase noise simultaneously. Theoretical analysis and computer simulation results show that the method can provide accurate estimate of the interferometric phase （interferogram） of very steep terrain even if the coregistration error reaches one pixel. The effectiveness of the method is verified via simulated data and real data.
基金Project supported by the Major Basic Project of China (No.G19990328) and National Natural ScienceFoundation of China.
文摘Presents a way to construct orthogonal piece-wise polynomials on an arbitrary triangular domain via barycentric coordinates. Solution of a boundary value problem for Laplace equation; Methodology; Results and discussion.
基金This work was partly supported by National Science Foundation of China （No. 10431050 and 60573023）, the Major Basic Project of China （2005CB321702） and by Natural Science Foundation of United States （No. CCF0305666） during the author＇s visit at University of Colorado at Boulder.
文摘In this paper we propose the well-known Fourier method on some non-tensor product domains in Rd, including simplex and so-called super-simplex which consists of （d ＋ 1）! simplices. As two examples, in 2-D and 3-D case a super-simplex is shown as a parallel hexagon and a parallel quadrilateral dodecahedron, respectively. We have extended most of concepts and results of the traditional Fourier methods on multivariate cases, such as Fourier basis system, Fourier series, discrete Fourier transform （DFT） and its fast algorithm （FFT） on the super-simplex, as well as generalized sine and cosine transforms （DST, DCT） and related fast algorithms over a simplex. The relationship between the basic orthogonal system and eigen-functions of a LaDlacian-like operator over these domains is explored.
