In this paper an iterative algorithm of alternating projection between two convex sets is proposed to calculate regression coefficient in linear model. The descent computation and ill-condition seperating of regressio...In this paper an iterative algorithm of alternating projection between two convex sets is proposed to calculate regression coefficient in linear model. The descent computation and ill-condition seperating of regression coefficient are realized.展开更多
An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programmin...An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.展开更多
The high dimensions of hyperspectral imagery have caused burden for further processing. A new Fast Independent Component Analysis (FastICA) approach to dimensionality reduction for hyperspectral imagery is presented. ...The high dimensions of hyperspectral imagery have caused burden for further processing. A new Fast Independent Component Analysis (FastICA) approach to dimensionality reduction for hyperspectral imagery is presented. The virtual dimensionality is introduced to determine the number of dimensions needed to be preserved. Since there is no prioritization among independent components generated by the FastICA,the mixing matrix of FastICA is initialized by endmembers,which were extracted by using unsupervised maximum distance method. Minimum Noise Fraction (MNF) is used for preprocessing of original data,which can reduce the computational complexity of FastICA significantly. Finally,FastICA is performed on the selected principal components acquired by MNF to generate the expected independent components in accordance with the order of endmembers. Experimental results demonstrate that the proposed method outperforms second-order statistics-based transforms such as principle components analysis.展开更多
The problem of two-dimensional direction of arrival(2D-DOA)estimation for uniform planar arrays(UPAs)is investigated by employing the reduced-dimensional(RD)polynomial root finding technique and 2D multiple signal cla...The problem of two-dimensional direction of arrival(2D-DOA)estimation for uniform planar arrays(UPAs)is investigated by employing the reduced-dimensional(RD)polynomial root finding technique and 2D multiple signal classification(2D-MUSIC)algorithm.Specifically,based on the relationship between the noise subspace and steering vectors,we first construct 2D root polynomial for 2D-DOA estimates and then prove that the 2D polynomial function has infinitely many solutions.In particular,we propose a computationally efficient algorithm,termed RD-ROOT-MUSIC algorithm,to obtain the true solutions corresponding to targets by RD technique,where the 2D root-finding problem is substituted by two one-dimensional(1D)root-finding operations.Finally,accurate 2DDOA estimates can be obtained by a sample pairing approach.In addition,numerical simulation results are given to corroborate the advantages of the proposed algorithm.展开更多
文摘In this paper an iterative algorithm of alternating projection between two convex sets is proposed to calculate regression coefficient in linear model. The descent computation and ill-condition seperating of regression coefficient are realized.
基金The National Natural Science Foundation of China(No. 50908235 )China Postdoctoral Science Foundation (No.201003520)
文摘An optimal dimension-down iterative algorithm （DDIA） is proposed for solving a mixed （continuous/ discrete） transportation network design problem （MNDP）, which is generally expressed as a mathematical programming with equilibrium constraints （MPEC）. The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium （UE） model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables （discrete/continuous） are fixed to altemately optimize another group of variables （continuous/discrete）. Some continuous network design problems （CNDPs） and discrete network design problems （DNDPs） are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.
基金Supported by the National Natural Science Foundation of China (No. 60572135)
文摘The high dimensions of hyperspectral imagery have caused burden for further processing. A new Fast Independent Component Analysis (FastICA) approach to dimensionality reduction for hyperspectral imagery is presented. The virtual dimensionality is introduced to determine the number of dimensions needed to be preserved. Since there is no prioritization among independent components generated by the FastICA,the mixing matrix of FastICA is initialized by endmembers,which were extracted by using unsupervised maximum distance method. Minimum Noise Fraction (MNF) is used for preprocessing of original data,which can reduce the computational complexity of FastICA significantly. Finally,FastICA is performed on the selected principal components acquired by MNF to generate the expected independent components in accordance with the order of endmembers. Experimental results demonstrate that the proposed method outperforms second-order statistics-based transforms such as principle components analysis.
基金supported by the National Natural Science Foundation of China(Nos.61631020,61971218,61601167,61371169)。
文摘The problem of two-dimensional direction of arrival(2D-DOA)estimation for uniform planar arrays(UPAs)is investigated by employing the reduced-dimensional(RD)polynomial root finding technique and 2D multiple signal classification(2D-MUSIC)algorithm.Specifically,based on the relationship between the noise subspace and steering vectors,we first construct 2D root polynomial for 2D-DOA estimates and then prove that the 2D polynomial function has infinitely many solutions.In particular,we propose a computationally efficient algorithm,termed RD-ROOT-MUSIC algorithm,to obtain the true solutions corresponding to targets by RD technique,where the 2D root-finding problem is substituted by two one-dimensional(1D)root-finding operations.Finally,accurate 2DDOA estimates can be obtained by a sample pairing approach.In addition,numerical simulation results are given to corroborate the advantages of the proposed algorithm.
