A modified multiple-component scattering power decomposition for analyzing polarimetric synthetic aperture radar(PolSAR)data is proposed.The modified decomposition involves two distinct steps.Firstly,ei⁃genvectors of ...A modified multiple-component scattering power decomposition for analyzing polarimetric synthetic aperture radar(PolSAR)data is proposed.The modified decomposition involves two distinct steps.Firstly,ei⁃genvectors of the coherency matrix are used to modify the scattering models.Secondly,the entropy and anisotro⁃py of targets are used to improve the volume scattering power.With the guarantee of high double-bounce scatter⁃ing power in the urban areas,the proposed algorithm effectively improves the volume scattering power of vegeta⁃tion areas.The efficacy of the modified multiple-component scattering power decomposition is validated using ac⁃tual AIRSAR PolSAR data.The scattering power obtained through decomposing the original coherency matrix and the coherency matrix after orientation angle compensation is compared with three algorithms.Results from the experiment demonstrate that the proposed decomposition yields more effective scattering power for different PolSAR data sets.展开更多
The correlation matrix, which is widely used in eigenvalue decomposition （EVD） or singular value decomposition （SVD）, usually can be denoted by R = E[yiy＇i]. A novel method for constructing the correlation matrix...The correlation matrix, which is widely used in eigenvalue decomposition （EVD） or singular value decomposition （SVD）, usually can be denoted by R = E[yiy＇i]. A novel method for constructing the correlation matrix R is proposed. The proposed algorithm can improve the resolving power of the signal eigenvalues and overcomes the shortcomings of the traditional subspace methods, which cannot be applied to low SNR. Then the proposed method is applied to the direct sequence spread spectrum （DSSS） signal＇s signature sequence estimation. The performance of the proposed algorithm is analyzed, and some illustrative simulation results are presented.展开更多
A low-complexity method for direction of arrival（DOA） estimation based on estimation signal parameters via rotational invariance technique（ESPRIT） is proposed.Instead of using the cross-correlation vectors in mult...A low-complexity method for direction of arrival（DOA） estimation based on estimation signal parameters via rotational invariance technique（ESPRIT） is proposed.Instead of using the cross-correlation vectors in multistage Wiener filter（MSWF）,the orthogonal residual vectors obtained in conjugate gradient（CG） method span the signal subspace used by ESPRIT.The computational complexity of the proposed method is significantly reduced,since the signal subspace estimation mainly needs two matrixvector complex multiplications at the iteration of data level.Furthermore,the prior training data are not needed in the proposed method.To overcome performance degradation at low signal to noise ratio（SNR）,the expanded signal subspace spanned by more basis vectors is used and simultaneously renders ESPRIT yield redundant DOAs,which can be excluded by performing ESPRIT once more using the unexpanded signal subspace.Compared with the traditional ESPRIT methods by MSWF and eigenvalue decomposition（EVD）,numerical results demonstrate the satisfactory performance of the proposed method.展开更多
The novel information criterion （NIC） algorithm can find the principal subspace quickly, but it is not an actual principal component analysis （PCA） algorithm and hence it cannot find the orthonormal eigen-space wh...The novel information criterion （NIC） algorithm can find the principal subspace quickly, but it is not an actual principal component analysis （PCA） algorithm and hence it cannot find the orthonormal eigen-space which corresponds to the principal component of input vector. This defect limits its application in practice. By weighting the neural network＇s output of NIC, a modified novel information criterion （MNIC） algorithm is presented. MNIC extractes the principal components and corresponding eigenvectors in a parallel online learning program, and overcomes the NIC＇s defect. It is proved to have a single global optimum and nonquadratic convergence rate, which is superior to the conventional PCA online algorithms such as Oja and LMSER. The relationship among Oja, LMSER and MNIC is exhibited. Simulations show that MNIC could converge to the optimum fast. The validity of MNIC is proved.展开更多
基金Supported by the National Natural Science Foundation of China(62376214)the Natural Science Basic Research Program of Shaanxi(2023-JC-YB-533)Foundation of Ministry of Education Key Lab.of Cognitive Radio and Information Processing(Guilin University of Electronic Technology)(CRKL200203)。
文摘A modified multiple-component scattering power decomposition for analyzing polarimetric synthetic aperture radar(PolSAR)data is proposed.The modified decomposition involves two distinct steps.Firstly,ei⁃genvectors of the coherency matrix are used to modify the scattering models.Secondly,the entropy and anisotro⁃py of targets are used to improve the volume scattering power.With the guarantee of high double-bounce scatter⁃ing power in the urban areas,the proposed algorithm effectively improves the volume scattering power of vegeta⁃tion areas.The efficacy of the modified multiple-component scattering power decomposition is validated using ac⁃tual AIRSAR PolSAR data.The scattering power obtained through decomposing the original coherency matrix and the coherency matrix after orientation angle compensation is compared with three algorithms.Results from the experiment demonstrate that the proposed decomposition yields more effective scattering power for different PolSAR data sets.
文摘The correlation matrix, which is widely used in eigenvalue decomposition （EVD） or singular value decomposition （SVD）, usually can be denoted by R = E[yiy＇i]. A novel method for constructing the correlation matrix R is proposed. The proposed algorithm can improve the resolving power of the signal eigenvalues and overcomes the shortcomings of the traditional subspace methods, which cannot be applied to low SNR. Then the proposed method is applied to the direct sequence spread spectrum （DSSS） signal＇s signature sequence estimation. The performance of the proposed algorithm is analyzed, and some illustrative simulation results are presented.
文摘A low-complexity method for direction of arrival（DOA） estimation based on estimation signal parameters via rotational invariance technique（ESPRIT） is proposed.Instead of using the cross-correlation vectors in multistage Wiener filter（MSWF）,the orthogonal residual vectors obtained in conjugate gradient（CG） method span the signal subspace used by ESPRIT.The computational complexity of the proposed method is significantly reduced,since the signal subspace estimation mainly needs two matrixvector complex multiplications at the iteration of data level.Furthermore,the prior training data are not needed in the proposed method.To overcome performance degradation at low signal to noise ratio（SNR）,the expanded signal subspace spanned by more basis vectors is used and simultaneously renders ESPRIT yield redundant DOAs,which can be excluded by performing ESPRIT once more using the unexpanded signal subspace.Compared with the traditional ESPRIT methods by MSWF and eigenvalue decomposition（EVD）,numerical results demonstrate the satisfactory performance of the proposed method.
文摘The novel information criterion （NIC） algorithm can find the principal subspace quickly, but it is not an actual principal component analysis （PCA） algorithm and hence it cannot find the orthonormal eigen-space which corresponds to the principal component of input vector. This defect limits its application in practice. By weighting the neural network＇s output of NIC, a modified novel information criterion （MNIC） algorithm is presented. MNIC extractes the principal components and corresponding eigenvectors in a parallel online learning program, and overcomes the NIC＇s defect. It is proved to have a single global optimum and nonquadratic convergence rate, which is superior to the conventional PCA online algorithms such as Oja and LMSER. The relationship among Oja, LMSER and MNIC is exhibited. Simulations show that MNIC could converge to the optimum fast. The validity of MNIC is proved.
