Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery...Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery.We rst derive the projection formulas for a vector onto the feasible sets.The centralized circumcentered-reection method is designed to solve the convex feasibility problem.Some numerical experiments demonstrate the feasibility and e ectiveness of the proposed algorithm,showing superior performance compared to conventional alternating projection methods.展开更多
In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Gen...In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Generalized Orthogonal Matching Pursuit(GOMP)algorithms for solving this problem,we propose the Piecewise Generalized Orthogonal Matching Pursuit(PGOMP)algorithm,by considering the mixed-decaying sparse signals as piecewise sparse signals with two components containing nonzero entries with different decay factors.The algorithm incorporates piecewise selection and deletion to retain the most significant entries according to the sparsity of each component.We provide a theoretical analysis based on the mutual coherence of the measurement matrix and the decay factors of the nonzero entries,establishing a sufficient condition for the PGOMP algorithm to select at least two correct indices in each iteration.Numerical simulations and an image decomposition experiment demonstrate that the proposed algorithm significantly improves the support recovery probability by effectively matching piecewise sparsity with decay factors.展开更多
Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such ...Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such as sensitivity enhancement,scanning range extension,and sidelobe level suppression,need to be solved urgently.Here,we propose a sparse optimization scheme based on a genetic algorithm for a 64-array element planar radio antenna array.As optimization targets for the iterative process of the genetic algorithm,we use the maximum sidelobe levels and beamwidth of multiple cross-section patterns that pass through the main beam in three-dimensions,with the maximum sidelobe levels of the patterns at several different scanning angles.Element positions are adjusted for iterations,to select the optimal array configuration.Following sparse layout optimization,the simulated 64-element planar radio antenna array shows that the maximum sidelobe level decreases by 1.79 dB,and the beamwidth narrows by 3°.Within the scan range of±30°,after sparse array optimization,all sidelobe levels decrease,and all beamwidths narrow.This performance improvement can potentially enhance the sensitivity and spatial resolution of radio telescope systems.展开更多
An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorith...An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.展开更多
Considering that the algorithm accuracy of the traditional sparse representation models is not high under the influence of multiple complex environmental factors,this study focuses on the improvement of feature extrac...Considering that the algorithm accuracy of the traditional sparse representation models is not high under the influence of multiple complex environmental factors,this study focuses on the improvement of feature extraction and model construction.Firstly,the convolutional neural network(CNN)features of the face are extracted by the trained deep learning network.Next,the steady-state and dynamic classifiers for face recognition are constructed based on the CNN features and Haar features respectively,with two-stage sparse representation introduced in the process of constructing the steady-state classifier and the feature templates with high reliability are dynamically selected as alternative templates from the sparse representation template dictionary constructed using the CNN features.Finally,the results of face recognition are given based on the classification results of the steady-state classifier and the dynamic classifier together.Based on this,the feature weights of the steady-state classifier template are adjusted in real time and the dictionary set is dynamically updated to reduce the probability of irrelevant features entering the dictionary set.The average recognition accuracy of this method is 94.45%on the CMU PIE face database and 96.58%on the AR face database,which is significantly improved compared with that of the traditional face recognition methods.展开更多
This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D n...This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D nose model tailored for applications in healthcare and cosmetic surgery.The approach leverages advanced image processing techniques,3D Morphable Models(3DMM),and deformation techniques to overcome the limita-tions of deep learning models,particularly addressing the interpretability issues commonly encountered in medical applications.The proposed method estimates the 3D coordinates of landmark points using a 3D structure estimation algorithm.Sub-landmarks are extracted through image processing techniques and interpolation.The initial surface is generated using a 3DMM,though its accuracy remains limited.To enhance precision,deformation techniques are applied,utilizing the coordinates of 76 identified landmarks and sub-landmarks.The resulting 3D nose model is constructed based on algorithmic methods and pre-marked landmarks.Evaluation of the 3D model is conducted by comparing landmark distances and shape similarity with expert-determined ground truth on 30 Vietnamese volunteers aged 18 to 47,all of whom were either preparing for or required nasal surgery.Experimental results demonstrate a strong agreement between the reconstructed 3D model and the ground truth.The method achieved a mean landmark distance error of 0.631 mm and a shape error of 1.738 mm,demonstrating its potential for medical applications.展开更多
An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach....An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.展开更多
A novel sparse matrix technique for the numerical analysis of semiconductor devicesand its algorithms are presented.Storage scheme and calculation procedure of the sparse matrixare described in detail.The sparse matri...A novel sparse matrix technique for the numerical analysis of semiconductor devicesand its algorithms are presented.Storage scheme and calculation procedure of the sparse matrixare described in detail.The sparse matrix technique in the device simulation can decrease storagegreatly with less CPU time and its implementation is very easy.Some algorithms and calculationexamples to show the time and space characteristics of the sparse matrix are given.展开更多
Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design...Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.展开更多
An algorithm, Clustering Algorithm Based On Sparse Feature Vector (CABOSFV),was proposed for the high dimensional clustering of binary sparse data. This algorithm compressesthe data effectively by using a tool 'Sp...An algorithm, Clustering Algorithm Based On Sparse Feature Vector (CABOSFV),was proposed for the high dimensional clustering of binary sparse data. This algorithm compressesthe data effectively by using a tool 'Sparse Feature Vector', thus reduces the data scaleenormously, and can get the clustering result with only one data scan. Both theoretical analysis andempirical tests showed that CABOSFV is of low computational complexity. The algorithm findsclusters in high dimensional large datasets efficiently and handles noise effectively.展开更多
Fluorescence molecular tomography(FMT)is a fast-developing optical imaging modalitythat has great potential in early diagnosis of disease and drugs development.However,recon-struction algorithms have to address a high...Fluorescence molecular tomography(FMT)is a fast-developing optical imaging modalitythat has great potential in early diagnosis of disease and drugs development.However,recon-struction algorithms have to address a highly ill-posed problem to fulfll 3D reconstruction inFMT.In this contribution,we propose an efficient iterative algorithm to solve the large-scalereconstruction problem,in which the sparsity of fluorescent targets is taken as useful a prioriinformation in designing the reconstruction algorithm.In the implementation,a fast sparseapproximation scheme combined with a stage-wise learning strategy enable the algorithm to dealwith the ill-posed inverse problem at reduced computational costs.We validate the proposed fastiterative method with numerical simulation on a digital mouse model.Experimental results demonstrate that our method is robust for different finite element meshes and different Poissonnoise levels.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
In underdetermined blind source separation, more sources are to be estimated from less observed mixtures without knowing source signals and the mixing matrix. This paper presents a robust clustering algorithm for unde...In underdetermined blind source separation, more sources are to be estimated from less observed mixtures without knowing source signals and the mixing matrix. This paper presents a robust clustering algorithm for underdetermined blind separation of sparse sources with unknown number of sources in the presence of noise. It uses the robust competitive agglomeration （RCA） algorithm to estimate the source number and the mixing matrix, and the source signals then are recovered by using the interior point linear programming. Simulation results show good performance of the proposed algorithm for underdetermined blind sources separation （UBSS）.展开更多
During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the ...During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision variables.To tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal solutions.The proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search space.More importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by GPUs.While existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real variables.Furthermore,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.展开更多
Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and pos...Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and poses. Non-sufficient training samples could not effectively express various facial conditions, so the improvement of the face recognition rate under the non-sufficient training samples condition becomes a laborious mission. In our work, the facial pose pre-recognition(FPPR) model and the dualdictionary sparse representation classification(DD-SRC) are proposed for face recognition. The FPPR model is based on the facial geometric characteristic and machine learning, dividing a testing sample into full-face and profile. Different poses in a single dictionary are influenced by each other, which leads to a low face recognition rate. The DD-SRC contains two dictionaries, full-face dictionary and profile dictionary, and is able to reduce the interference. After FPPR, the sample is processed by the DD-SRC to find the most similar one in training samples. The experimental results show the performance of the proposed algorithm on olivetti research laboratory(ORL) and face recognition technology(FERET) databases, and also reflect comparisons with SRC, linear regression classification(LRC), and two-phase test sample sparse representation(TPTSSR).展开更多
Sparse representation has attracted extensive attention and performed well on image super-resolution（SR） in the last decade. However, many current image SR methods face the contradiction of detail recovery and artif...Sparse representation has attracted extensive attention and performed well on image super-resolution（SR） in the last decade. However, many current image SR methods face the contradiction of detail recovery and artifact suppression. We propose a multi-resolution dictionary learning（MRDL） model to solve this contradiction, and give a fast single image SR method based on the MRDL model. To obtain the MRDL model, we first extract multi-scale patches by using our proposed adaptive patch partition method（APPM）. The APPM divides images into patches of different sizes according to their detail richness. Then, the multiresolution dictionary pairs, which contain structural primitives of various resolutions, can be trained from these multi-scale patches.Owing to the MRDL strategy, our SR algorithm not only recovers details well, with less jag and noise, but also significantly improves the computational efficiency. Experimental results validate that our algorithm performs better than other SR methods in evaluation metrics and visual perception.展开更多
Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficien...Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficients are approximately zero or under noise floor. To exploit sparsity of multi-path channels (MPCs), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable;on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems be-cause of computational complexity. In this paper, we introduce a novel channel estimation strategy using smooth L0 (SL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm. We also give various simulations to verify the sensing training signal method.展开更多
In conventional linear spectral mixture analysis model,a class is represented by a single endmember.However,the intra-class spectral variability is usually very large,which makes it difficult to represent a class,and ...In conventional linear spectral mixture analysis model,a class is represented by a single endmember.However,the intra-class spectral variability is usually very large,which makes it difficult to represent a class,and in this case,it leads to incorrect unmixing results. Some proposed algorithms play a positive role in overcoming the endmember variability,but there are shortcomings on computation intensive,unsatisfactory unmixing results and so on. Recently,sparse regression has been applied to unmixing,assuming each mixed pixel can be expressed as a linear combination of only a few spectra in a spectral library. It is essentially the same as multiple endmember spectral unmixing. OMP( orthogonal matching pursuit),a sparse reconstruction algorithm,has advantages of simple structure and high efficiency. However,it does not take into account the constraints of abundance non-negativity and abundance sum-to-one( ANC and ASC),leading to undesirable unmixing results. In order to solve these issues,this paper presents an improved OMP algorithm( fully constraint OMP,FOMP) for multiple endmember hyperspectral sparse unmixing. The proposed algorithm overcomes the shortcomings of OMP,and on the other hand,it solves the problem of endmember variability.The ANC and ASC constraints are firstly added into the OMP algorithm,and then the endmember set is refined by the relative increase in root-mean-square-error( RMSE) to avoid over-fitting,finally pixels are unmixed by their optimal endmember set. The simulated and real hyperspectral data experiments show that FOPM unmixing results are ideally comparable and abundance RMSE reduces much lower than OMP and simple spectral mixture analysis( s SMA),and has a strong anti-noise performance. It proves that multiple endmember spectral mixture analysis is more reasonable.展开更多
Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.I...Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.In this paper,a frequency domain clutter suppression algorithm based on sparse adaptive filtering is proposed.The pulse compression operation between the error signal and the input reference signal is added to the cost function as a sparsity constraint,and the criterion for filter weight updating is improved to obtain a purer echo signal.At the same time,the step size and penalty factor are brought into the adaptive iteration process,and the input data is used to drive the adaptive changes of parameters such as step size.The proposed algorithm has a small amount of calculation,which improves the robustness to parameters such as step size,reduces the weight error of the filter and has a good clutter suppression performance.展开更多
A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex ...A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex optimization. Tests using experimental data show that, compared with the algorithm of Gradient Projection for Sparse Reconstruction (GPSR), the proposed algorithm yields better results with less computation work.展开更多
基金Supported by the Natural Science Foundation of Guangxi Province(Grant Nos.2023GXNSFAA026067,2024GXN SFAA010521)the National Natural Science Foundation of China(Nos.12361079,12201149,12261026).
文摘Convex feasibility problems are widely used in image reconstruction,sparse signal recovery,and other areas.This paper is devoted to considering a class of convex feasibility problem arising from sparse signal recovery.We rst derive the projection formulas for a vector onto the feasible sets.The centralized circumcentered-reection method is designed to solve the convex feasibility problem.Some numerical experiments demonstrate the feasibility and e ectiveness of the proposed algorithm,showing superior performance compared to conventional alternating projection methods.
基金Supported by the National Key R&D Program of China(Grant No.2023YFA1009200)the National Natural Science Foundation of China(Grant Nos.12271079+1 种基金12494552)the Fundamental Research Funds for the Central Universities of China(Grant No.DUT24LAB127)。
文摘In this paper,we focus on the recovery of piecewise sparse signals containing both fast-decaying and slow-decaying nonzero entries.In order to improve the performance of classic Orthogonal Matching Pursuit(OMP)and Generalized Orthogonal Matching Pursuit(GOMP)algorithms for solving this problem,we propose the Piecewise Generalized Orthogonal Matching Pursuit(PGOMP)algorithm,by considering the mixed-decaying sparse signals as piecewise sparse signals with two components containing nonzero entries with different decay factors.The algorithm incorporates piecewise selection and deletion to retain the most significant entries according to the sparsity of each component.We provide a theoretical analysis based on the mutual coherence of the measurement matrix and the decay factors of the nonzero entries,establishing a sufficient condition for the PGOMP algorithm to select at least two correct indices in each iteration.Numerical simulations and an image decomposition experiment demonstrate that the proposed algorithm significantly improves the support recovery probability by effectively matching piecewise sparsity with decay factors.
基金supported by the Ministry of Science and Technology SKA Special Project(2020SKA0110202)the Special Project on Building a Science and Technology Innovation Center for South and Southeast Asia–International Joint Innovation Platform in Yunnan Province:"Yunnan Sino-Malaysian International Joint Laboratory of HF-VHF Advanced Radio Astronomy Technology"(202303AP140003)+4 种基金the National Natural Science Foundation of China (NSFC) Joint Fund for Astronomy (JFA) incubator program (U2031133)the International Partnership Program Project of the International Cooperation Bureau of the Chinese Academy of Sciences:"Belt and Road"Cooperation (114A11KYSB20200001)the Kunming Foreign (International) Cooperation Base Program:"Yunnan Observatory of the Chinese Academy of Sciences-University of Malaya Joint R&D Cooperation Base for Advanced Radio Astronomy Technology"(GHJD-2021022)the China-Malaysia Collaborative Research on Space Remote Sensing and Radio Astronomy Observation of Space Weather at Low and Middle Latitudes under the Key Special Project of the State Key R&D Program of the Ministry of Science and Technology for International Cooperation in Science,Technology and Innovation among Governments (2022YFE0140000)the High-precision calibration method for low-frequency radio interferometric arrays for the SKA project of the Ministry of Science and Technology(2020SKA0110300).
文摘Radio antenna arrays have many advantages for astronomical observations,such as high resolution,high sensitivity,multi-target simultaneous observation,and flexible beam formation.Problems surrounding key indices,such as sensitivity enhancement,scanning range extension,and sidelobe level suppression,need to be solved urgently.Here,we propose a sparse optimization scheme based on a genetic algorithm for a 64-array element planar radio antenna array.As optimization targets for the iterative process of the genetic algorithm,we use the maximum sidelobe levels and beamwidth of multiple cross-section patterns that pass through the main beam in three-dimensions,with the maximum sidelobe levels of the patterns at several different scanning angles.Element positions are adjusted for iterations,to select the optimal array configuration.Following sparse layout optimization,the simulated 64-element planar radio antenna array shows that the maximum sidelobe level decreases by 1.79 dB,and the beamwidth narrows by 3°.Within the scan range of±30°,after sparse array optimization,all sidelobe levels decrease,and all beamwidths narrow.This performance improvement can potentially enhance the sensitivity and spatial resolution of radio telescope systems.
基金Supported by the Tianjin University of Technology Graduate R esearch Innovation Project(YJ2281).
文摘An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.
基金the financial support from Natural Science Foundation of Gansu Province(Nos.22JR5RA217,22JR5RA216)Lanzhou Science and Technology Program(No.2022-2-111)+1 种基金Lanzhou University of Arts and Sciences School Innovation Fund Project(No.XJ2022000103)Lanzhou College of Arts and Sciences 2023 Talent Cultivation Quality Improvement Project(No.2023-ZL-jxzz-03)。
文摘Considering that the algorithm accuracy of the traditional sparse representation models is not high under the influence of multiple complex environmental factors,this study focuses on the improvement of feature extraction and model construction.Firstly,the convolutional neural network(CNN)features of the face are extracted by the trained deep learning network.Next,the steady-state and dynamic classifiers for face recognition are constructed based on the CNN features and Haar features respectively,with two-stage sparse representation introduced in the process of constructing the steady-state classifier and the feature templates with high reliability are dynamically selected as alternative templates from the sparse representation template dictionary constructed using the CNN features.Finally,the results of face recognition are given based on the classification results of the steady-state classifier and the dynamic classifier together.Based on this,the feature weights of the steady-state classifier template are adjusted in real time and the dictionary set is dynamically updated to reduce the probability of irrelevant features entering the dictionary set.The average recognition accuracy of this method is 94.45%on the CMU PIE face database and 96.58%on the AR face database,which is significantly improved compared with that of the traditional face recognition methods.
文摘This paper presents a novel method for reconstructing a highly accurate 3D nose model of the human from 2D images and pre-marked landmarks based on algorithmic methods.The study focuses on the reconstruction of a 3D nose model tailored for applications in healthcare and cosmetic surgery.The approach leverages advanced image processing techniques,3D Morphable Models(3DMM),and deformation techniques to overcome the limita-tions of deep learning models,particularly addressing the interpretability issues commonly encountered in medical applications.The proposed method estimates the 3D coordinates of landmark points using a 3D structure estimation algorithm.Sub-landmarks are extracted through image processing techniques and interpolation.The initial surface is generated using a 3DMM,though its accuracy remains limited.To enhance precision,deformation techniques are applied,utilizing the coordinates of 76 identified landmarks and sub-landmarks.The resulting 3D nose model is constructed based on algorithmic methods and pre-marked landmarks.Evaluation of the 3D model is conducted by comparing landmark distances and shape similarity with expert-determined ground truth on 30 Vietnamese volunteers aged 18 to 47,all of whom were either preparing for or required nasal surgery.Experimental results demonstrate a strong agreement between the reconstructed 3D model and the ground truth.The method achieved a mean landmark distance error of 0.631 mm and a shape error of 1.738 mm,demonstrating its potential for medical applications.
文摘An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.
文摘A novel sparse matrix technique for the numerical analysis of semiconductor devicesand its algorithms are presented.Storage scheme and calculation procedure of the sparse matrixare described in detail.The sparse matrix technique in the device simulation can decrease storagegreatly with less CPU time and its implementation is very easy.Some algorithms and calculationexamples to show the time and space characteristics of the sparse matrix are given.
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.
文摘An algorithm, Clustering Algorithm Based On Sparse Feature Vector (CABOSFV),was proposed for the high dimensional clustering of binary sparse data. This algorithm compressesthe data effectively by using a tool 'Sparse Feature Vector', thus reduces the data scaleenormously, and can get the clustering result with only one data scan. Both theoretical analysis andempirical tests showed that CABOSFV is of low computational complexity. The algorithm findsclusters in high dimensional large datasets efficiently and handles noise effectively.
基金supported by the National Natural Science Foundation of China(Grant No.61372046)the Research Fund for the Doctoral Program ofHigher Education of China(New Teachers)(Grant No.20116101120018)+4 种基金the China Postdoctoral Sci-ence_Foundation_Funded Project(Grant_Nos.2011M501467 and 2012T50814)the Natural Sci-ence Basic Research Plan in Shaanxi Province of China(Grant No.2011JQ1006)the Fund amental Research Funds for the Central Universities(Grant No.GK201302007)Science and Technology Plan Program in Shaanxi Province of China(Grant Nos.2012 KJXX-29 and 2013K12-20-12)the Scienceand Technology Plan Program in Xi'an of China(Grant No.CXY 1348(2)).
文摘Fluorescence molecular tomography(FMT)is a fast-developing optical imaging modalitythat has great potential in early diagnosis of disease and drugs development.However,recon-struction algorithms have to address a highly ill-posed problem to fulfll 3D reconstruction inFMT.In this contribution,we propose an efficient iterative algorithm to solve the large-scalereconstruction problem,in which the sparsity of fluorescent targets is taken as useful a prioriinformation in designing the reconstruction algorithm.In the implementation,a fast sparseapproximation scheme combined with a stage-wise learning strategy enable the algorithm to dealwith the ill-posed inverse problem at reduced computational costs.We validate the proposed fastiterative method with numerical simulation on a digital mouse model.Experimental results demonstrate that our method is robust for different finite element meshes and different Poissonnoise levels.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
基金the Research Foundation for Doctoral Programs of Higher Education of China (Grant No.20060280003)the Shanghai Leading Academic Discipline Project (Grant No.T0102)
文摘In underdetermined blind source separation, more sources are to be estimated from less observed mixtures without knowing source signals and the mixing matrix. This paper presents a robust clustering algorithm for underdetermined blind separation of sparse sources with unknown number of sources in the presence of noise. It uses the robust competitive agglomeration （RCA） algorithm to estimate the source number and the mixing matrix, and the source signals then are recovered by using the interior point linear programming. Simulation results show good performance of the proposed algorithm for underdetermined blind sources separation （UBSS）.
基金This work was supported in part by the National Key Research and Development Program of China(2018AAA0100100)the National Natural Science Foundation of China(61822301,61876123,61906001)+2 种基金the Collaborative Innovation Program of Universities in Anhui Province(GXXT-2020-051)the Hong Kong Scholars Program(XJ2019035)Anhui Provincial Natural Science Foundation(1908085QF271).
文摘During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision variables.To tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal solutions.The proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search space.More importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by GPUs.While existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real variables.Furthermore,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.
基金supported by the National Natural Science Foundation of China(6137901061772421)
文摘Face recognition based on few training samples is a challenging task. In daily applications, sufficient training samples may not be obtained and most of the gained training samples are in various illuminations and poses. Non-sufficient training samples could not effectively express various facial conditions, so the improvement of the face recognition rate under the non-sufficient training samples condition becomes a laborious mission. In our work, the facial pose pre-recognition(FPPR) model and the dualdictionary sparse representation classification(DD-SRC) are proposed for face recognition. The FPPR model is based on the facial geometric characteristic and machine learning, dividing a testing sample into full-face and profile. Different poses in a single dictionary are influenced by each other, which leads to a low face recognition rate. The DD-SRC contains two dictionaries, full-face dictionary and profile dictionary, and is able to reduce the interference. After FPPR, the sample is processed by the DD-SRC to find the most similar one in training samples. The experimental results show the performance of the proposed algorithm on olivetti research laboratory(ORL) and face recognition technology(FERET) databases, and also reflect comparisons with SRC, linear regression classification(LRC), and two-phase test sample sparse representation(TPTSSR).
文摘Sparse representation has attracted extensive attention and performed well on image super-resolution（SR） in the last decade. However, many current image SR methods face the contradiction of detail recovery and artifact suppression. We propose a multi-resolution dictionary learning（MRDL） model to solve this contradiction, and give a fast single image SR method based on the MRDL model. To obtain the MRDL model, we first extract multi-scale patches by using our proposed adaptive patch partition method（APPM）. The APPM divides images into patches of different sizes according to their detail richness. Then, the multiresolution dictionary pairs, which contain structural primitives of various resolutions, can be trained from these multi-scale patches.Owing to the MRDL strategy, our SR algorithm not only recovers details well, with less jag and noise, but also significantly improves the computational efficiency. Experimental results validate that our algorithm performs better than other SR methods in evaluation metrics and visual perception.
文摘Broadband wireless channels are often time dispersive and become strongly frequency selective in delay spread domain. Commonly, these channels are composed of a few dominant coefficients and a large part of coefficients are approximately zero or under noise floor. To exploit sparsity of multi-path channels (MPCs), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable;on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems be-cause of computational complexity. In this paper, we introduce a novel channel estimation strategy using smooth L0 (SL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm. We also give various simulations to verify the sensing training signal method.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61405041,61571145)the Key Program of Heilongjiang Natural Science Foundation(Grant No.ZD201216)+2 种基金the Program Excellent Academic Leaders of Harbin(Grant No.RC2013XK009003)the China Postdoctoral Science Foundation(Grant No.2014M551221)the Heilongjiang Postdoctoral Science Found(Grant No.LBH-Z13057)
文摘In conventional linear spectral mixture analysis model,a class is represented by a single endmember.However,the intra-class spectral variability is usually very large,which makes it difficult to represent a class,and in this case,it leads to incorrect unmixing results. Some proposed algorithms play a positive role in overcoming the endmember variability,but there are shortcomings on computation intensive,unsatisfactory unmixing results and so on. Recently,sparse regression has been applied to unmixing,assuming each mixed pixel can be expressed as a linear combination of only a few spectra in a spectral library. It is essentially the same as multiple endmember spectral unmixing. OMP( orthogonal matching pursuit),a sparse reconstruction algorithm,has advantages of simple structure and high efficiency. However,it does not take into account the constraints of abundance non-negativity and abundance sum-to-one( ANC and ASC),leading to undesirable unmixing results. In order to solve these issues,this paper presents an improved OMP algorithm( fully constraint OMP,FOMP) for multiple endmember hyperspectral sparse unmixing. The proposed algorithm overcomes the shortcomings of OMP,and on the other hand,it solves the problem of endmember variability.The ANC and ASC constraints are firstly added into the OMP algorithm,and then the endmember set is refined by the relative increase in root-mean-square-error( RMSE) to avoid over-fitting,finally pixels are unmixed by their optimal endmember set. The simulated and real hyperspectral data experiments show that FOPM unmixing results are ideally comparable and abundance RMSE reduces much lower than OMP and simple spectral mixture analysis( s SMA),and has a strong anti-noise performance. It proves that multiple endmember spectral mixture analysis is more reasonable.
文摘Passive detection of low-slow-small(LSS)targets is easily interfered by direct signal and multipath clutter,and the traditional clutter suppression method has the contradiction between step size and convergence rate.In this paper,a frequency domain clutter suppression algorithm based on sparse adaptive filtering is proposed.The pulse compression operation between the error signal and the input reference signal is added to the cost function as a sparsity constraint,and the criterion for filter weight updating is improved to obtain a purer echo signal.At the same time,the step size and penalty factor are brought into the adaptive iteration process,and the input data is used to drive the adaptive changes of parameters such as step size.The proposed algorithm has a small amount of calculation,which improves the robustness to parameters such as step size,reduces the weight error of the filter and has a good clutter suppression performance.
基金Supported by the Hi-Tech Research and Development Program of China (No. 2011AA120102)
文摘A fast converging sparse reconstruction algorithm in ghost imaging is presented. It utilizes total variation regularization and its formulation is based on the Karush-Kuhn-Tucker (KKT) theorem in the theory of convex optimization. Tests using experimental data show that, compared with the algorithm of Gradient Projection for Sparse Reconstruction (GPSR), the proposed algorithm yields better results with less computation work.
