The signal processing problem has become increasingly complex and demand high acquisition system,this paper proposes a new method to reconstruct the structure phased array structural health monitoring signal.The metho...The signal processing problem has become increasingly complex and demand high acquisition system,this paper proposes a new method to reconstruct the structure phased array structural health monitoring signal.The method is derived from the compressive sensing theory and the signal is reconstructed by using the basis pursuit algorithm to process the ultrasonic phased array signals.According to the principles of the compressive sensing and signal processing method,non-sparse ultrasonic signals are converted to sparse signals by using sparse transform.The sparse coefficients are obtained by sparse decomposition of the original signal,and then the observation matrix is constructed according to the corresponding sparse coefficients.Finally,the original signal is reconstructed by using basis pursuit algorithm,and error analysis is carried on.Experimental research analysis shows that the signal reconstruction method can reduce the signal complexity and required the space efficiently.展开更多
A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. F...A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.展开更多
In the research on spatial hearing and realization of virtual auditory space,it is important to effectively model the head-related transfer functions(HRTFs)or head-related impulse responses(HRIRs).In our study,we mana...In the research on spatial hearing and realization of virtual auditory space,it is important to effectively model the head-related transfer functions(HRTFs)or head-related impulse responses(HRIRs).In our study,we managed to carry out adaptive non-linear approximation in the field of wavelet transformation.The results show that the HRIRs’adaptive non-linear approximation model is a more effective data reduction model,is faster,and is 5 dB on average better than the traditional principal component analysis(PCA)(Karhunen-Loève transform)model based on relative mean square error(MSE)criterion.Furthermore,we also discussed the best bases’choice for the time-frequency representation of HRIRs,and the results show that local cosine bases are more propitious to HRIRs’adaptive approximation than wavelet and wavelet packet base.However,the improved effect of local cosine bases is not distinct.Here,for the sake of modeling the HRIRs more truthfully,we consider choosing optimal time-frequency atoms from redundant dictionary to decompose this kind of signals of HRIRs and achieve better results than all the previous models.展开更多
In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms accordin...In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms according to the correlation between received signals and hyper planes, which are composed by column vectors of the mixing matrix, and uses these atoms to recover source signals. Simulation results demonstrate that the PP algorithm has low complexity and higher accuracy as compared with basic pursuit(BP), orthogonal matching pursuit(OMP), and adaptive sparsity matching pursuit(ASMP) algorithms.展开更多
The research shows that projection pursuit cluster (PPC) model is able to form a suitable index for overcom-ing the difficulties in comprehensive evaluation, which can be used to analyze complex multivariate prob-lems...The research shows that projection pursuit cluster (PPC) model is able to form a suitable index for overcom-ing the difficulties in comprehensive evaluation, which can be used to analyze complex multivariate prob-lems. The PPC model is widely used in multifactor cluster and evaluation analysis, but there are a few prob-lems needed to be solved in practice, such as cutoff radius parameter calibration. In this study, a new model-projection pursuit dynamic cluster (PPDC) model-based on projection pursuit principle is developed and used in water resources carrying capacity evaluation in China for the first time. In the PPDC model, there are two improvements compared with the PPC model, 1) a new projection index is constructed based on dynamic cluster principle, which avoids the problem of parameter calibration in the PPC model success-fully;2) the cluster results can be outputted directly according to the PPDC model, but the cluster results can be got based on the scatter points of projected characteristic values or the re-analysis for projected character-istic values in the PPC model. The results show that the PPDC model is a very effective and powerful tool in multifactor data exploratory analysis. It is a new method for water resources carrying capacity evaluation. The PPDC model and its application to water resources carrying capacity evaluation are introduced in detail in this paper.展开更多
Weighted geometric evaluation approach based on Projection pursuit (PP) model is presented in this paper to optimize the choice of schemes. By using PP model, the multi-dimension evaluation index values of schemes can...Weighted geometric evaluation approach based on Projection pursuit (PP) model is presented in this paper to optimize the choice of schemes. By using PP model, the multi-dimension evaluation index values of schemes can be synthesized into projection value with one dimension. The scheme with a bigger projection value is much better, so the schemes sample can be an optimized choice according to the projection value of each scheme. The modeling of PP based on accelerating genetic algorithm can predigest the realized process of projection pursuit technique, can overcome the shortcomings of large computation amount and the difficulty of computer programming in traditional projection pursuit methods, and can give a new method for application of projection pursuit technique to optimize choice of schemes by using weighted geometric evaluation. The analysis of an applied sample shows that applying PP model driven directly by samples data to optimize choice of schemes is both simple and feasible, that its projection values are relatively decentralized and profit decision-making, that its applicability and maneuverability are high. It can avoid the shortcoming of subjective weighing method, and its results are scientific and objective.展开更多
A projection pursuit model is presented in this paper for comprehensive evaluation of benefits of small watershed control.By using the model,small watershed control samples with many benefit evaluation indexes can be ...A projection pursuit model is presented in this paper for comprehensive evaluation of benefits of small watershed control.By using the model,small watershed control samples with many benefit evaluation indexes can be synthesized projective values with one dimension.The samples can be naturally evaluated according to the projective values.The parameters of the model is optimized by using real coding beased accelerating genetic aglrothm,which overcomes the shortcomings of large computation amount and difficulty of computer programming in traditional projection prusuit methods,and provides a new way for wide applications of projection pursuit technique to different evaluation problems in agricultural systems engineering.展开更多
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.展开更多
The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with...The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm (ICSA-PP) is proposed in this paper. Projection pursuit strategy can maintain consistent Euclidean distances between points in the low-dimensional embeddings where the ICSA is used to search optimizing projection direction. The proposed algorithm can converge quickly with less iteration to reduce dimension of some high-dimensional datasets, and in which space, K-mean clustering algorithm is used to partition the reduced data. The experiment results on UCI data show that the presented method can search quicker to optimize projection direction than Genetic Algorithm (GA) and it has better clustering results compared with traditional linear dimension reduction method for Principle Component Analysis (PCA).展开更多
基金This project is supported by the National Natural Science Foundation of China(Grant No.51305211)Natural Science Foundation of Jiangsu(Grant No.BK20160955)Jiangsu Government Scholarship for Overseas Studies,College students practice and innovation training project of Jiangsu province(Grant No.201710300218),and the PAPD。
文摘The signal processing problem has become increasingly complex and demand high acquisition system,this paper proposes a new method to reconstruct the structure phased array structural health monitoring signal.The method is derived from the compressive sensing theory and the signal is reconstructed by using the basis pursuit algorithm to process the ultrasonic phased array signals.According to the principles of the compressive sensing and signal processing method,non-sparse ultrasonic signals are converted to sparse signals by using sparse transform.The sparse coefficients are obtained by sparse decomposition of the original signal,and then the observation matrix is constructed according to the corresponding sparse coefficients.Finally,the original signal is reconstructed by using basis pursuit algorithm,and error analysis is carried on.Experimental research analysis shows that the signal reconstruction method can reduce the signal complexity and required the space efficiently.
文摘A simple and effective greedy algorithm for image approximation is proposed. Based on the matching pursuit approach, it is characterized by a reduced computational complexity benefiting from two major modifications. First, it iteratively finds an approximation by selecting M atoms instead of one at a time. Second, the inner product computations are confined within only a fraction of dictionary atoms at each iteration. The modifications are implemented very efficiently due to the spatial incoherence of the dictionary. Experimental results show that compared with full search matching pursuit, the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality.
基金supported by the National Basic Research of China(No.2002CB312102).
文摘In the research on spatial hearing and realization of virtual auditory space,it is important to effectively model the head-related transfer functions(HRTFs)or head-related impulse responses(HRIRs).In our study,we managed to carry out adaptive non-linear approximation in the field of wavelet transformation.The results show that the HRIRs’adaptive non-linear approximation model is a more effective data reduction model,is faster,and is 5 dB on average better than the traditional principal component analysis(PCA)(Karhunen-Loève transform)model based on relative mean square error(MSE)criterion.Furthermore,we also discussed the best bases’choice for the time-frequency representation of HRIRs,and the results show that local cosine bases are more propitious to HRIRs’adaptive approximation than wavelet and wavelet packet base.However,the improved effect of local cosine bases is not distinct.Here,for the sake of modeling the HRIRs more truthfully,we consider choosing optimal time-frequency atoms from redundant dictionary to decompose this kind of signals of HRIRs and achieve better results than all the previous models.
基金supported by the National Natural Science Foundation of China(61201134)the 111 Project(B08038)
文摘In order to achieve accurate recovery signals under the underdetermined circumstance in a comparatively short time,an algorithm based on plane pursuit(PP) is proposed. The proposed algorithm selects the atoms according to the correlation between received signals and hyper planes, which are composed by column vectors of the mixing matrix, and uses these atoms to recover source signals. Simulation results demonstrate that the PP algorithm has low complexity and higher accuracy as compared with basic pursuit(BP), orthogonal matching pursuit(OMP), and adaptive sparsity matching pursuit(ASMP) algorithms.
文摘The research shows that projection pursuit cluster (PPC) model is able to form a suitable index for overcom-ing the difficulties in comprehensive evaluation, which can be used to analyze complex multivariate prob-lems. The PPC model is widely used in multifactor cluster and evaluation analysis, but there are a few prob-lems needed to be solved in practice, such as cutoff radius parameter calibration. In this study, a new model-projection pursuit dynamic cluster (PPDC) model-based on projection pursuit principle is developed and used in water resources carrying capacity evaluation in China for the first time. In the PPDC model, there are two improvements compared with the PPC model, 1) a new projection index is constructed based on dynamic cluster principle, which avoids the problem of parameter calibration in the PPC model success-fully;2) the cluster results can be outputted directly according to the PPDC model, but the cluster results can be got based on the scatter points of projected characteristic values or the re-analysis for projected character-istic values in the PPC model. The results show that the PPDC model is a very effective and powerful tool in multifactor data exploratory analysis. It is a new method for water resources carrying capacity evaluation. The PPDC model and its application to water resources carrying capacity evaluation are introduced in detail in this paper.
文摘Weighted geometric evaluation approach based on Projection pursuit (PP) model is presented in this paper to optimize the choice of schemes. By using PP model, the multi-dimension evaluation index values of schemes can be synthesized into projection value with one dimension. The scheme with a bigger projection value is much better, so the schemes sample can be an optimized choice according to the projection value of each scheme. The modeling of PP based on accelerating genetic algorithm can predigest the realized process of projection pursuit technique, can overcome the shortcomings of large computation amount and the difficulty of computer programming in traditional projection pursuit methods, and can give a new method for application of projection pursuit technique to optimize choice of schemes by using weighted geometric evaluation. The analysis of an applied sample shows that applying PP model driven directly by samples data to optimize choice of schemes is both simple and feasible, that its projection values are relatively decentralized and profit decision-making, that its applicability and maneuverability are high. It can avoid the shortcoming of subjective weighing method, and its results are scientific and objective.
基金Foundation Item:Chinese N ational Natural Science Fund and Yantze Water Resouces Comm ission U nion Project(N o.5 0 0 996 2 0 ) Chinese National N atural Science Fund Project(No.4 98710 18)
文摘A projection pursuit model is presented in this paper for comprehensive evaluation of benefits of small watershed control.By using the model,small watershed control samples with many benefit evaluation indexes can be synthesized projective values with one dimension.The samples can be naturally evaluated according to the projective values.The parameters of the model is optimized by using real coding beased accelerating genetic aglrothm,which overcomes the shortcomings of large computation amount and difficulty of computer programming in traditional projection prusuit methods,and provides a new way for wide applications of projection pursuit technique to different evaluation problems in agricultural systems engineering.
文摘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.
基金Supported by the National Natural Science Foundation of China (No. 61003198, 60703108, 60703109, 60702062,60803098)the National High Technology Development 863 Program of China (No. 2008AA01Z125, 2009AA12Z210)+1 种基金the China Postdoctoral Science Foundation funded project (No. 20090460093)the Provincial Natural Science Foundation of Shaanxi, China (No. 2009JQ8016)
文摘The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm (ICSA-PP) is proposed in this paper. Projection pursuit strategy can maintain consistent Euclidean distances between points in the low-dimensional embeddings where the ICSA is used to search optimizing projection direction. The proposed algorithm can converge quickly with less iteration to reduce dimension of some high-dimensional datasets, and in which space, K-mean clustering algorithm is used to partition the reduced data. The experiment results on UCI data show that the presented method can search quicker to optimize projection direction than Genetic Algorithm (GA) and it has better clustering results compared with traditional linear dimension reduction method for Principle Component Analysis (PCA).