Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connecte...Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connected single instruction stream-multiple data stream(SIMD) parallel computer. This method is based on a one-sided orthogonalization algorithm due to Hestenes. On the cube connected SIMD parallel computer with o(n) processors, the (M -- N) SVD of a matrix A requires a computation time of o(m3 log m/n).展开更多
The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this prob...The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this problem,we propose a new affine registration algorithm based on correntropy which works well in the affine registration of point sets with outliers.Firstly,we substitute the traditional measure of least squares with a maximum correntropy criterion to build a new registration model,which can avoid the influence of outliers.To maximize the objective function,we then propose a robust affine ICP algorithm.At each iteration of this new algorithm,we set up the index mapping of two point sets according to the known transformation,and then compute the closed-form solution of the new transformation according to the known index mapping.Similar to the traditional ICP algorithm,our algorithm converges to a local maximum monotonously for any given initial value.Finally,the robustness and high efficiency of affine ICP algorithm based on correntropy are demonstrated by 2D and 3D point set registration experiments.展开更多
Artificial neural network is a new approach to pattern recognition and classification. The model of multilayer perceptron （MLP） and back-propagation （BP） is used to train the algorithm in the artificial neural net...Artificial neural network is a new approach to pattern recognition and classification. The model of multilayer perceptron （MLP） and back-propagation （BP） is used to train the algorithm in the artificial neural network. An improved fast algorithm of the BP network was presented, which adopts a singular value decomposition （SVD） and a generalized inverse matrix. It not only increases the speed of network learning but also achieves a satisfying precision. The simulation and experiment results show the effect of improvement of BP algorithm on the classification of the surface defects of steel plate.展开更多
Visual method including binocular stereo vision method and monocular vision method of the relative position and pose measurement for space target has become relatively mature, and many researchers focus on the method ...Visual method including binocular stereo vision method and monocular vision method of the relative position and pose measurement for space target has become relatively mature, and many researchers focus on the method based on three-dimension measurement recently. ICP alignment, which is the key of three-dimension pattern measurement method, has the problem of low efficiency in large data sets. Considering this problem, an improved ICP algorithm is proposed in this paper. The improved ICP algorithm is the combination of the original ICP algorithm and KD-TREE. The experimental comparison between the improved ICP algorithm and the traditional ICP algorithm in efficiency has been given in this paper, which shows that the improved ICP algorithm can get much better performance.展开更多
To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root...To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root-min-norm algorithm was described,but it is susceptive to noises with unstable performance in different SNRs.So the modified root-min-norm algorithm based on cross-spectral estimation was proposed,utilizing cross-correlation matrix and independence of different Gaussian noise series.Lots of simulation experiments were carried out to test performance of the algorithm in different conditions,and its statistical characteristics was presented.Simulation results show that the modified algorithm can efficiently suppress influence of the noises,and has high frequency resolution,high precision and high stability,and it is much superior to the classic DFT method.展开更多
In order to obtain and master the surface thermal deformation of paraboloid antennas,a fast iterative closest point( FICP) algorithm based on design coordinate guidance is proposed,which can satisfy the demands of rap...In order to obtain and master the surface thermal deformation of paraboloid antennas,a fast iterative closest point( FICP) algorithm based on design coordinate guidance is proposed,which can satisfy the demands of rapid detection for surface thermal deformation. Firstly,the basic principle of the ICP algorithm for registration of a free surface is given,and the shortcomings of the ICP algorithm in the registration of surface are analysed,such as its complex computation,long calculation time,low efficiency,and relatively strict initial registration position. Then an improved FICP algorithm based on design coordinate guidance is proposed. Finally,the FICP algorithm is applied to the fast registration test for the surface thermal deformation of a paraboloid antenna. Results indicate that the approach offers better performance with regard to fast surface registration and the algorithm is more simple,efficient,and easily realized in practical engineering application.展开更多
This work describes a novel adaptive matrix/vector gradient (AMVG) algorithm for design of IIR filters and ARMA signal models. The AMVG algorithm can track to IIR filters and ARMA systems having poles also outside the...This work describes a novel adaptive matrix/vector gradient (AMVG) algorithm for design of IIR filters and ARMA signal models. The AMVG algorithm can track to IIR filters and ARMA systems having poles also outside the unit circle. The time reversed filtering procedure was used to treat the unstable conditions. The SVD-based null space solution was used for the initialization of the AMVG algorithm. We demonstrate the feasibility of the method by designing a digital phase shifter, which adapts to complex frequency carriers in the presence of noise. We implement the half-sample delay filter and describe the envelope detector based on the Hilbert transform filter.展开更多
The image signal is represented by using the atomic of image signal to train an over complete dictionary and is described as sparse linear combinations of these atoms. Recently, the dictionary algorithm for image sign...The image signal is represented by using the atomic of image signal to train an over complete dictionary and is described as sparse linear combinations of these atoms. Recently, the dictionary algorithm for image signal tracking and decomposition is mainly adopted as the focus of research. An alternate iterative algorithm of sparse encoding, sample dictionary and dictionary based on atomic update process is K-SVD decomposition. A new segmentation algorithm of brain MRI image, which uses the noise reduction method with adaptive dictionary based on genetic algorithm, is presented in this paper, and the experimental results show that the algorithm in brain MRI image segmentation has fast calculation speed and the advantage of accurate segmentation. In a very complicated situation, the results show that the segmentation of brain MRI images can be accomplished successfully by using this algorithm, and it achieves the ideal effect and has good accuracy.展开更多
文摘Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connected single instruction stream-multiple data stream(SIMD) parallel computer. This method is based on a one-sided orthogonalization algorithm due to Hestenes. On the cube connected SIMD parallel computer with o(n) processors, the (M -- N) SVD of a matrix A requires a computation time of o(m3 log m/n).
基金supported in part by the National Natural Science Foundation of China(61627811,61573274,61673126,U1701261)
文摘The iterative closest point(ICP)algorithm has the advantages of high accuracy and fast speed for point set registration,but it performs poorly when the point set has a large number of noisy outliers.To solve this problem,we propose a new affine registration algorithm based on correntropy which works well in the affine registration of point sets with outliers.Firstly,we substitute the traditional measure of least squares with a maximum correntropy criterion to build a new registration model,which can avoid the influence of outliers.To maximize the objective function,we then propose a robust affine ICP algorithm.At each iteration of this new algorithm,we set up the index mapping of two point sets according to the known transformation,and then compute the closed-form solution of the new transformation according to the known index mapping.Similar to the traditional ICP algorithm,our algorithm converges to a local maximum monotonously for any given initial value.Finally,the robustness and high efficiency of affine ICP algorithm based on correntropy are demonstrated by 2D and 3D point set registration experiments.
基金Item Sponsored by National Natural Science Foundation of China (60277029)
文摘Artificial neural network is a new approach to pattern recognition and classification. The model of multilayer perceptron （MLP） and back-propagation （BP） is used to train the algorithm in the artificial neural network. An improved fast algorithm of the BP network was presented, which adopts a singular value decomposition （SVD） and a generalized inverse matrix. It not only increases the speed of network learning but also achieves a satisfying precision. The simulation and experiment results show the effect of improvement of BP algorithm on the classification of the surface defects of steel plate.
文摘Visual method including binocular stereo vision method and monocular vision method of the relative position and pose measurement for space target has become relatively mature, and many researchers focus on the method based on three-dimension measurement recently. ICP alignment, which is the key of three-dimension pattern measurement method, has the problem of low efficiency in large data sets. Considering this problem, an improved ICP algorithm is proposed in this paper. The improved ICP algorithm is the combination of the original ICP algorithm and KD-TREE. The experimental comparison between the improved ICP algorithm and the traditional ICP algorithm in efficiency has been given in this paper, which shows that the improved ICP algorithm can get much better performance.
基金Shandong University of Science and Technology Research Fund(No.2010KYTD101)
文摘To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root-min-norm algorithm was described,but it is susceptive to noises with unstable performance in different SNRs.So the modified root-min-norm algorithm based on cross-spectral estimation was proposed,utilizing cross-correlation matrix and independence of different Gaussian noise series.Lots of simulation experiments were carried out to test performance of the algorithm in different conditions,and its statistical characteristics was presented.Simulation results show that the modified algorithm can efficiently suppress influence of the noises,and has high frequency resolution,high precision and high stability,and it is much superior to the classic DFT method.
基金Supported by the National Natural Science Foundation of China(No.51474217,41501562)the Open Fund Program of Henan Engineering Laboratory of Pollution Control and Coal Chemical Resources Comprehensive Utilization(No.502002-B07,502002-A04)
文摘In order to obtain and master the surface thermal deformation of paraboloid antennas,a fast iterative closest point( FICP) algorithm based on design coordinate guidance is proposed,which can satisfy the demands of rapid detection for surface thermal deformation. Firstly,the basic principle of the ICP algorithm for registration of a free surface is given,and the shortcomings of the ICP algorithm in the registration of surface are analysed,such as its complex computation,long calculation time,low efficiency,and relatively strict initial registration position. Then an improved FICP algorithm based on design coordinate guidance is proposed. Finally,the FICP algorithm is applied to the fast registration test for the surface thermal deformation of a paraboloid antenna. Results indicate that the approach offers better performance with regard to fast surface registration and the algorithm is more simple,efficient,and easily realized in practical engineering application.
文摘This work describes a novel adaptive matrix/vector gradient (AMVG) algorithm for design of IIR filters and ARMA signal models. The AMVG algorithm can track to IIR filters and ARMA systems having poles also outside the unit circle. The time reversed filtering procedure was used to treat the unstable conditions. The SVD-based null space solution was used for the initialization of the AMVG algorithm. We demonstrate the feasibility of the method by designing a digital phase shifter, which adapts to complex frequency carriers in the presence of noise. We implement the half-sample delay filter and describe the envelope detector based on the Hilbert transform filter.
文摘The image signal is represented by using the atomic of image signal to train an over complete dictionary and is described as sparse linear combinations of these atoms. Recently, the dictionary algorithm for image signal tracking and decomposition is mainly adopted as the focus of research. An alternate iterative algorithm of sparse encoding, sample dictionary and dictionary based on atomic update process is K-SVD decomposition. A new segmentation algorithm of brain MRI image, which uses the noise reduction method with adaptive dictionary based on genetic algorithm, is presented in this paper, and the experimental results show that the algorithm in brain MRI image segmentation has fast calculation speed and the advantage of accurate segmentation. In a very complicated situation, the results show that the segmentation of brain MRI images can be accomplished successfully by using this algorithm, and it achieves the ideal effect and has good accuracy.
