In this paper, a novel Magnetic Resonance (MR) reconstruction framework which combines image-wise and patch-wise sparse prior is proposed. For addressing, a truncated beta-Bernoulli process is firstly employed to enfo...In this paper, a novel Magnetic Resonance (MR) reconstruction framework which combines image-wise and patch-wise sparse prior is proposed. For addressing, a truncated beta-Bernoulli process is firstly employed to enforce sparsity on overlapping image patches emphasizing local structures. Due to its properties, beta-Bernoulli process can adaptive infer the sparsity (number of non-zero coefficients) of each patch, an appropriate dictionary, and the noise variance simultaneously, which are prerequisite for iterative image reconstruction. Secondly, a General Gaussian Distribution (GGD) prior is introduced to engage image-wise sparsity for wavelet coefficients, which can be then estimated by a threshold denoising algorithm. Finally, MR image is reconstructed by patch-wise estimation, image-wise estimation and under-sampled k-space data with least square data fitting. Experimental results have demonstrated that proposed approach exhibits excellent reconstruction performance. Moreover, if the image is full of similar low-dimensional-structures, proposed algorithm has dramatically improved Peak Signal to Noise Ratio (PSNR) 7～9 dB, with comparisons to other state-of-art compressive sampling methods.展开更多
With the application of integrated sensing and communication,radiated source localization has gradually become a popular research direction.Radiation source localization has more applications in reality,for example,in...With the application of integrated sensing and communication,radiated source localization has gradually become a popular research direction.Radiation source localization has more applications in reality,for example,in earthquake disaster scenarios,entrapped individuals can be found by using terminal devices.The traditional methods suffer from degradation of performance under low signal-to-noise ratio(SNR)conditions and cannot effectively deal with complex propagation environments.A signal direction of arrival(DOA)localization method based on convolutional neural networks is proposed to achieve high resolution localization of single or multiple radio frequency(RF)radiation sources in scenarios with low SNR and adjacent sources.The experiment shows that the proposed method has good performance in single target and multi-target localization.In addition,the proposed method still has good estimation performance in environments with small signal source angle intervals and varying SNR.展开更多
By studying the traditional spectral reflectance reconstruction method, spectral reflectance and the relative spectral power distribution of a lighting source are sparsely decomposed, and the orthogonal property of th...By studying the traditional spectral reflectance reconstruction method, spectral reflectance and the relative spectral power distribution of a lighting source are sparsely decomposed, and the orthogonal property of the principal component orthogonal basis is used to eliminate basis; then spectral reflectance data are obtained by solving a sparse coefficient. After theoretical analysis, the spectral reflectance reconstruction based on sparse prior knowledge of the principal component orthogonal basis by a single-pixel detector is carried out by software simulation and experiment. It can reduce the complexity and cost of the system, and has certain significance for the improvement of multispectral image acquisition technology.展开更多
Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate ...Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.展开更多
Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Anal...Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Analysis (RPCA) addresses these limitations by decomposing data into a low-rank matrix capturing the underlying structure and a sparse matrix identifying outliers, enhancing robustness against noise and outliers. This paper introduces a novel RPCA variant, Robust PCA Integrating Sparse and Low-rank Priors (RPCA-SL). Each prior targets a specific aspect of the data’s underlying structure and their combination allows for a more nuanced and accurate separation of the main data components from outliers and noise. Then RPCA-SL is solved by employing a proximal gradient algorithm for improved anomaly detection and data decomposition. Experimental results on simulation and real data demonstrate significant advancements.展开更多
Finite rate of innovation sampling is a novel sub-Nyquist sampling method that can reconstruct a signal from sparse sampling data.The application of this method in ultrasonic testing greatly reduces the signal samplin...Finite rate of innovation sampling is a novel sub-Nyquist sampling method that can reconstruct a signal from sparse sampling data.The application of this method in ultrasonic testing greatly reduces the signal sampling rate and the quantity of sampling data.However,the pulse number of the signal must be known beforehand for the signal reconstruction procedure.The accuracy of this prior information directly affects the accuracy of the estimated parameters of the signal and influences the assessment of flaws,leading to a lower defect detection ratio.Although the pulse number can be pre-given by theoretical analysis,the process is still unable to assess actual complex random orientation defects.Therefore,this paper proposes a new method that uses singular value decomposition(SVD) for estimating the pulse number from sparse sampling data and avoids the shortcoming of providing the pulse number in advance for signal reconstruction.When the sparse sampling data have been acquired from the ultrasonic signal,these data are transformed to discrete Fourier coefficients.A Hankel matrix is then constructed from these coefficients,and SVD is performed on the matrix.The decomposition coefficients reserve the information of the pulse number.When the decomposition coefficients generated by noise according to noise level are removed,the number of the remaining decomposition coefficients is the signal pulse number.The feasibility of the proposed method was verified through simulation experiments.The applicability was tested in ultrasonic experiments by using sample flawed pipelines.Results from simulations and real experiments demonstrated the efficiency of this method.展开更多
LetΩbe homogeneous of degree zero,integrable on S^(d−1) and have vanishing moment of order one,a be a function on R^(d) such that ∇a∈L^(∞)(R^(d)).Let T*_(Ω,a) be the maximaloperator associated with the d-dimensional...LetΩbe homogeneous of degree zero,integrable on S^(d−1) and have vanishing moment of order one,a be a function on R^(d) such that ∇a∈L^(∞)(R^(d)).Let T*_(Ω,a) be the maximaloperator associated with the d-dimensional Calder´on commutator defined by T*_(Ωa)f(x):=sup_(ε>0)|∫_(|x-y|>ε)^Ω(x-y)/|x-y|^(d+1)(a(x)-a(y))f(y)dy.In this paper,the authors establish bilinear sparse domination for T*_(Ω,a) under the assumption Ω∈L∞(Sd−1).As applications,some quantitative weighted bounds for T*_(Ω,a) are obtained.展开更多
To realize effective co-phasing adjustment in large-aperture sparse-aperture telescopes,a multichannel stripe tracking approach is employed,allowing simultaneous interferometric measurements of multiple optical paths ...To realize effective co-phasing adjustment in large-aperture sparse-aperture telescopes,a multichannel stripe tracking approach is employed,allowing simultaneous interferometric measurements of multiple optical paths and circumventing the need for pairwise measurements along the mirror boundaries in traditional interferometric methods.This approach enhances detection efficiency and reduces system complexity.Here,the principles of the multibeam interference process and construction of a co-phasing detection module based on direct optical fiber connections were analyzed using wavefront optics theory.Error analysis was conducted on the system surface obtained through multipath interference.Potential applications of the interferometric method were explored.Finally,the principle was verified by experiment,an interferometric fringe contrast better than 0.4 is achieved through flat field calibration and incoherent digital synthesis.The dynamic range of the measurement exceeds 10 times of the center wavelength of the working band(1550 nm).Moreover,a resolution better than one-tenth of the working center wavelength(1550 nm)was achieved.Simultaneous three-beam interference can be achieved,leading to a 50%improvement in detection efficiency.This method can effectively enhance the efficiency of sparse aperture telescope co-phasing,meeting the requirements for observations of 8-10 m telescopes.This study provides a technological foundation for observing distant and faint celestial objects.展开更多
This paper explores the recovery of block sparse signals in frame-based settings using the l_(2)/l_(q)-synthesis technique(0<q≤1).We propose a new null space property,referred to as block D-NSP_(q),which is based ...This paper explores the recovery of block sparse signals in frame-based settings using the l_(2)/l_(q)-synthesis technique(0<q≤1).We propose a new null space property,referred to as block D-NSP_(q),which is based on the dictionary D.We establish that matrices adhering to the block D-NSP_(q)condition are both necessary and sufficient for the exact recovery of block sparse signals via l_(2)/l_(q)-synthesis.Additionally,this condition is essential for the stable recovery of signals that are block-compressible with respect to D.This D-NSP_(q)property is identified as the first complete condition for successful signal recovery using l_(2)/l_(q)-synthesis.Furthermore,we assess the theoretical efficacy of the l2/lq-synthesis method under conditions of measurement noise.展开更多
In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the e...In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.展开更多
Piezo actuators are widely used in ultra-precision fields because of their high response and nano-scale step length.However,their hysteresis characteristics seriously affect the accuracy and stability of piezo actuato...Piezo actuators are widely used in ultra-precision fields because of their high response and nano-scale step length.However,their hysteresis characteristics seriously affect the accuracy and stability of piezo actuators.Existing methods for fitting hysteresis loops include operator class,differential equation class,and machine learning class.The modeling cost of operator class and differential equation class methods is high,the model complexity is high,and the process of machine learning,such as neural network calculation,is opaque.The physical model framework cannot be directly extracted.Therefore,the sparse identification of nonlinear dynamics(SINDy)algorithm is proposed to fit hysteresis loops.Furthermore,the SINDy algorithm is improved.While the SINDy algorithm builds an orthogonal candidate database for modeling,the sparse regression model is simplified,and the Relay operator is introduced for piecewise fitting to solve the distortion problem of the SINDy algorithm fitting singularities.The Relay-SINDy algorithm proposed in this paper is applied to fitting hysteresis loops.Good performance is obtained with the experimental results of open and closed loops.Compared with the existing methods,the modeling cost and model complexity are reduced,and the modeling accuracy of the hysteresis loop is improved.展开更多
3D medical image reconstruction has significantly enhanced diagnostic accuracy,yet the reliance on densely sampled projection data remains a major limitation in clinical practice.Sparse-angle X-ray imaging,though safe...3D medical image reconstruction has significantly enhanced diagnostic accuracy,yet the reliance on densely sampled projection data remains a major limitation in clinical practice.Sparse-angle X-ray imaging,though safer and faster,poses challenges for accurate volumetric reconstruction due to limited spatial information.This study proposes a 3D reconstruction neural network based on adaptive weight fusion(AdapFusionNet)to achieve high-quality 3D medical image reconstruction from sparse-angle X-ray images.To address the issue of spatial inconsistency in multi-angle image reconstruction,an innovative adaptive fusion module was designed to score initial reconstruction results during the inference stage and perform weighted fusion,thereby improving the final reconstruction quality.The reconstruction network is built on an autoencoder(AE)framework and uses orthogonal-angle X-ray images(frontal and lateral projections)as inputs.The encoder extracts 2D features,which the decoder maps into 3D space.This study utilizes a lung CT dataset to obtain complete three-dimensional volumetric data,from which digitally reconstructed radiographs(DRR)are generated at various angles to simulate X-ray images.Since real-world clinical X-ray images rarely come with perfectly corresponding 3D“ground truth,”using CT scans as the three-dimensional reference effectively supports the training and evaluation of deep networks for sparse-angle X-ray 3D reconstruction.Experiments conducted on the LIDC-IDRI dataset with simulated X-ray images(DRR images)as training data demonstrate the superior performance of AdapFusionNet compared to other fusion methods.Quantitative results show that AdapFusionNet achieves SSIM,PSNR,and MAE values of 0.332,13.404,and 0.163,respectively,outperforming other methods(SingleViewNet:0.289,12.363,0.182;AvgFusionNet:0.306,13.384,0.159).Qualitative analysis further confirms that AdapFusionNet significantly enhances the reconstruction of lung and chest contours while effectively reducing noise during the reconstruction process.The findings demonstrate that AdapFusionNet offers significant advantages in 3D reconstruction of sparse-angle X-ray images.展开更多
Deblending is a data processing procedure used to separate the source interferences of blended seismic data,which are obtained by simultaneous sources with random time delays to reduce the cost of seismic acquisition....Deblending is a data processing procedure used to separate the source interferences of blended seismic data,which are obtained by simultaneous sources with random time delays to reduce the cost of seismic acquisition.There are three types of deblending algorithms,i.e.,filtering-type noise suppression algorithm,inversion-based algorithm and deep-learning based algorithm.We review the merits of these techniques,and propose to use a sparse inversion method for seismic data deblending.Filtering-based deblending approach is applicable to blended data with a low blending fold and simple geometry.Otherwise,it can suffer from signal distortion and noise leakage.At present,the deep learning based deblending methods are still under development and field data applications are limited due to the lack of high-quality training labels.In contrast,the inversion-based deblending approaches have gained industrial acceptance.Our used inversion approach transforms the pseudo-deblended data into the frequency-wavenumber-wavenumher(FKK)domain,and a sparse constraint is imposed for the coherent signal estimation.The estimated signal is used to predict the interference noise for subtraction from the original pseudo-deblended data.Via minimizing the data misfit,the signal can be iteratively updated with a shrinking threshold until the signal and interference are fully separated.The used FKK sparse inversion algorithm is very accurate and efficient compared with other sparse inversion methods,and it is widely applied in field cases.Synthetic example shows that the deblending error is less than 1%in average amplitudes and less than-40 dB in amplitude spectra.We present three field data examples of land,marine OBN(Ocean Bottom Nodes)and streamer acquisitions to demonstrate its successful applications in separating the source interferences efficiently and accurately.展开更多
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.展开更多
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.展开更多
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.展开更多
Range-azimuth imaging of ground targets via frequency-modulated continuous wave(FMCW)radar is crucial for effective target detection.However,when the pitch of the moving array constructed during motion exceeds the phy...Range-azimuth imaging of ground targets via frequency-modulated continuous wave(FMCW)radar is crucial for effective target detection.However,when the pitch of the moving array constructed during motion exceeds the physical array aperture,azimuth ambiguity occurs,making range-azimuth imaging on a moving platform challenging.To address this issue,we theoretically analyze azimuth ambiguity generation in sparse motion arrays and propose a dual-aperture adaptive processing(DAAP)method for suppressing azimuth ambiguity.This method combines spatial multiple-input multiple-output(MIMO)arrays with sparse motion arrays to achieve high-resolution range-azimuth imaging.In addition,an adaptive QR decomposition denoising method for sparse array signals based on iterative low-rank matrix approximation(LRMA)and regularized QR is proposed to preprocess sparse motion array signals.Simulations and experiments show that on a two-transmitter-four-receiver array,the signal-to-noise ratio(SNR)of the sparse motion array signal after noise suppression via adaptive QR decomposition can exceed 0 dB,and the azimuth ambiguity signal ratio(AASR)can be reduced to below-20 dB.展开更多
Difficulty in extracting nonlinear sparse impulse features due to variable speed conditions and redundant noise interference leads to challenges in diagnosing variable speed faults.Therefore,an improved spectral amplit...Difficulty in extracting nonlinear sparse impulse features due to variable speed conditions and redundant noise interference leads to challenges in diagnosing variable speed faults.Therefore,an improved spectral amplitude modulation(ISAM)based on sparse feature adaptive convolution(SFAC)is proposed to enhance the fault features under variable speed conditions.First,an optimal bi-damped wavelet construction method is proposed to learn signal impulse features,which selects the optimal bi-damped wavelet parameters with correlation criterion and particle swarm optimization.Second,a convolutional basis pursuit denoising model based on an optimal bi-damped wavelet is proposed for resolving sparse impulses.A model regularization parameter selection method based on weighted fault characteristic amplitude ratio assistance is proposed.Then,an ISAM method based on kurtosis threshold is proposed to further enhance the fault information of sparse signal.Finally,the type of variable speed faults is determined by order spectrum analysis.Various experimental results,such as spectral amplitude modulation and Morlet wavelet matching,verify the effectiveness and advantages of the ISAM-SFAC method.展开更多
Recent research has shown a burgeoning interest in exploring sparse models for massively Multilingual Neural Machine Translation(MNMT).In this paper,we present a comprehensive survey of this emerging topic.Massively M...Recent research has shown a burgeoning interest in exploring sparse models for massively Multilingual Neural Machine Translation(MNMT).In this paper,we present a comprehensive survey of this emerging topic.Massively MNMT,when based on sparse models,offers significant improvements in parameter efficiency and reduces interference compared to its dense model counterparts.Various methods have been proposed to leverage sparse models for enhancing translation quality.However,the lack of a thorough survey has hindered the identification and further investigation of the most promising approaches.To address this gap,we provide an exhaustive examination of the current research landscape in massively MNMT,with a special emphasis on sparse models.Initially,we categorize the various sparse model-based approaches into distinct classifications.We then delve into each category in detail,elucidating their fundamental modeling principles,core issues,and the challenges they face.Wherever possible,we conduct comparative analyses to assess the strengths and weaknesses of different methodologies.Moreover,we explore potential future research avenues for MNMT based on sparse models.This survey serves as a valuable resource for both newcomers and established experts in the field of MNMT,particularly those interested in sparse model applications.展开更多
This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-...This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-oped using the material point method.To reduce the computational cost of Monte Carlo simulations,response surface models are created as surrogate models for the material point system to approximate its dynamic behavior.An adaptive randomized greedy algorithm is employed to construct a sparse polynomial chaos expansion model with a fixed order,effectively balancing the accuracy and computational efficiency of the surrogate model.Based on the sparse polynomial chaos expansion,sensitivity analysis is conducted using the global finite difference and Sobol methods.Several examples of structural dynamics are provided to demonstrate the effectiveness of the proposed method in addressing structural dynamics problems.展开更多
基金Supported by the National Natural Science Foundation of China (No. 30900328, 61172179)the Fundamental Research Funds for the Central Universities (No.2011121051)the Natural Science Foundation of Fujian Province of China (No. 2012J05160)
文摘In this paper, a novel Magnetic Resonance (MR) reconstruction framework which combines image-wise and patch-wise sparse prior is proposed. For addressing, a truncated beta-Bernoulli process is firstly employed to enforce sparsity on overlapping image patches emphasizing local structures. Due to its properties, beta-Bernoulli process can adaptive infer the sparsity (number of non-zero coefficients) of each patch, an appropriate dictionary, and the noise variance simultaneously, which are prerequisite for iterative image reconstruction. Secondly, a General Gaussian Distribution (GGD) prior is introduced to engage image-wise sparsity for wavelet coefficients, which can be then estimated by a threshold denoising algorithm. Finally, MR image is reconstructed by patch-wise estimation, image-wise estimation and under-sampled k-space data with least square data fitting. Experimental results have demonstrated that proposed approach exhibits excellent reconstruction performance. Moreover, if the image is full of similar low-dimensional-structures, proposed algorithm has dramatically improved Peak Signal to Noise Ratio (PSNR) 7～9 dB, with comparisons to other state-of-art compressive sampling methods.
基金funded by the National Key Research and Development Program of China under Grants 2023YFC3011500 and 2024YFC3016000.
文摘With the application of integrated sensing and communication,radiated source localization has gradually become a popular research direction.Radiation source localization has more applications in reality,for example,in earthquake disaster scenarios,entrapped individuals can be found by using terminal devices.The traditional methods suffer from degradation of performance under low signal-to-noise ratio(SNR)conditions and cannot effectively deal with complex propagation environments.A signal direction of arrival(DOA)localization method based on convolutional neural networks is proposed to achieve high resolution localization of single or multiple radio frequency(RF)radiation sources in scenarios with low SNR and adjacent sources.The experiment shows that the proposed method has good performance in single target and multi-target localization.In addition,the proposed method still has good estimation performance in environments with small signal source angle intervals and varying SNR.
基金supported by the National Natural Science Foundation of China (Grant No.61405115)the Natural Science Foundation of Shanghai (Grant No.14ZR1428400)+1 种基金the Innovation Project of Shanghai Municipal Education Commission (Grant No.14YZ099)National Basic Research Program of China (973 Program) (Grant No.2015CB352004)
文摘By studying the traditional spectral reflectance reconstruction method, spectral reflectance and the relative spectral power distribution of a lighting source are sparsely decomposed, and the orthogonal property of the principal component orthogonal basis is used to eliminate basis; then spectral reflectance data are obtained by solving a sparse coefficient. After theoretical analysis, the spectral reflectance reconstruction based on sparse prior knowledge of the principal component orthogonal basis by a single-pixel detector is carried out by software simulation and experiment. It can reduce the complexity and cost of the system, and has certain significance for the improvement of multispectral image acquisition technology.
基金supported by NSFC projects(61960206005,61803211,61871111,62101275,62171127,61971136,and 62001056)Jiangsu NSF project(BK20200820)+1 种基金Postgraduate Research&Practice Innovation Program of Jiangsu Province(KYCX210106)Research Fund of National Mobile Communications Research Laboratory.
文摘Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.
文摘Principal Component Analysis (PCA) is a widely used technique for data analysis and dimensionality reduction, but its sensitivity to feature scale and outliers limits its applicability. Robust Principal Component Analysis (RPCA) addresses these limitations by decomposing data into a low-rank matrix capturing the underlying structure and a sparse matrix identifying outliers, enhancing robustness against noise and outliers. This paper introduces a novel RPCA variant, Robust PCA Integrating Sparse and Low-rank Priors (RPCA-SL). Each prior targets a specific aspect of the data’s underlying structure and their combination allows for a more nuanced and accurate separation of the main data components from outliers and noise. Then RPCA-SL is solved by employing a proximal gradient algorithm for improved anomaly detection and data decomposition. Experimental results on simulation and real data demonstrate significant advancements.
基金Supported by the National Natural Science Foundation of China(Grant No.51375217)
文摘Finite rate of innovation sampling is a novel sub-Nyquist sampling method that can reconstruct a signal from sparse sampling data.The application of this method in ultrasonic testing greatly reduces the signal sampling rate and the quantity of sampling data.However,the pulse number of the signal must be known beforehand for the signal reconstruction procedure.The accuracy of this prior information directly affects the accuracy of the estimated parameters of the signal and influences the assessment of flaws,leading to a lower defect detection ratio.Although the pulse number can be pre-given by theoretical analysis,the process is still unable to assess actual complex random orientation defects.Therefore,this paper proposes a new method that uses singular value decomposition(SVD) for estimating the pulse number from sparse sampling data and avoids the shortcoming of providing the pulse number in advance for signal reconstruction.When the sparse sampling data have been acquired from the ultrasonic signal,these data are transformed to discrete Fourier coefficients.A Hankel matrix is then constructed from these coefficients,and SVD is performed on the matrix.The decomposition coefficients reserve the information of the pulse number.When the decomposition coefficients generated by noise according to noise level are removed,the number of the remaining decomposition coefficients is the signal pulse number.The feasibility of the proposed method was verified through simulation experiments.The applicability was tested in ultrasonic experiments by using sample flawed pipelines.Results from simulations and real experiments demonstrated the efficiency of this method.
文摘LetΩbe homogeneous of degree zero,integrable on S^(d−1) and have vanishing moment of order one,a be a function on R^(d) such that ∇a∈L^(∞)(R^(d)).Let T*_(Ω,a) be the maximaloperator associated with the d-dimensional Calder´on commutator defined by T*_(Ωa)f(x):=sup_(ε>0)|∫_(|x-y|>ε)^Ω(x-y)/|x-y|^(d+1)(a(x)-a(y))f(y)dy.In this paper,the authors establish bilinear sparse domination for T*_(Ω,a) under the assumption Ω∈L∞(Sd−1).As applications,some quantitative weighted bounds for T*_(Ω,a) are obtained.
文摘To realize effective co-phasing adjustment in large-aperture sparse-aperture telescopes,a multichannel stripe tracking approach is employed,allowing simultaneous interferometric measurements of multiple optical paths and circumventing the need for pairwise measurements along the mirror boundaries in traditional interferometric methods.This approach enhances detection efficiency and reduces system complexity.Here,the principles of the multibeam interference process and construction of a co-phasing detection module based on direct optical fiber connections were analyzed using wavefront optics theory.Error analysis was conducted on the system surface obtained through multipath interference.Potential applications of the interferometric method were explored.Finally,the principle was verified by experiment,an interferometric fringe contrast better than 0.4 is achieved through flat field calibration and incoherent digital synthesis.The dynamic range of the measurement exceeds 10 times of the center wavelength of the working band(1550 nm).Moreover,a resolution better than one-tenth of the working center wavelength(1550 nm)was achieved.Simultaneous three-beam interference can be achieved,leading to a 50%improvement in detection efficiency.This method can effectively enhance the efficiency of sparse aperture telescope co-phasing,meeting the requirements for observations of 8-10 m telescopes.This study provides a technological foundation for observing distant and faint celestial objects.
基金Supported by The Featured Innovation Projects of the General University of Guangdong Province(2023KTSCX096)The Special Projects in Key Areas of Guangdong Province(ZDZX1088)Research Team Project of Guangdong University of Education(2024KYCXTD018)。
文摘This paper explores the recovery of block sparse signals in frame-based settings using the l_(2)/l_(q)-synthesis technique(0<q≤1).We propose a new null space property,referred to as block D-NSP_(q),which is based on the dictionary D.We establish that matrices adhering to the block D-NSP_(q)condition are both necessary and sufficient for the exact recovery of block sparse signals via l_(2)/l_(q)-synthesis.Additionally,this condition is essential for the stable recovery of signals that are block-compressible with respect to D.This D-NSP_(q)property is identified as the first complete condition for successful signal recovery using l_(2)/l_(q)-synthesis.Furthermore,we assess the theoretical efficacy of the l2/lq-synthesis method under conditions of measurement noise.
文摘In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.
基金National Natural Science Foundation of China(62203118)。
文摘Piezo actuators are widely used in ultra-precision fields because of their high response and nano-scale step length.However,their hysteresis characteristics seriously affect the accuracy and stability of piezo actuators.Existing methods for fitting hysteresis loops include operator class,differential equation class,and machine learning class.The modeling cost of operator class and differential equation class methods is high,the model complexity is high,and the process of machine learning,such as neural network calculation,is opaque.The physical model framework cannot be directly extracted.Therefore,the sparse identification of nonlinear dynamics(SINDy)algorithm is proposed to fit hysteresis loops.Furthermore,the SINDy algorithm is improved.While the SINDy algorithm builds an orthogonal candidate database for modeling,the sparse regression model is simplified,and the Relay operator is introduced for piecewise fitting to solve the distortion problem of the SINDy algorithm fitting singularities.The Relay-SINDy algorithm proposed in this paper is applied to fitting hysteresis loops.Good performance is obtained with the experimental results of open and closed loops.Compared with the existing methods,the modeling cost and model complexity are reduced,and the modeling accuracy of the hysteresis loop is improved.
基金Supported by Sichuan Science and Technology Program(2023YFSY0026,2023YFH0004).
文摘3D medical image reconstruction has significantly enhanced diagnostic accuracy,yet the reliance on densely sampled projection data remains a major limitation in clinical practice.Sparse-angle X-ray imaging,though safer and faster,poses challenges for accurate volumetric reconstruction due to limited spatial information.This study proposes a 3D reconstruction neural network based on adaptive weight fusion(AdapFusionNet)to achieve high-quality 3D medical image reconstruction from sparse-angle X-ray images.To address the issue of spatial inconsistency in multi-angle image reconstruction,an innovative adaptive fusion module was designed to score initial reconstruction results during the inference stage and perform weighted fusion,thereby improving the final reconstruction quality.The reconstruction network is built on an autoencoder(AE)framework and uses orthogonal-angle X-ray images(frontal and lateral projections)as inputs.The encoder extracts 2D features,which the decoder maps into 3D space.This study utilizes a lung CT dataset to obtain complete three-dimensional volumetric data,from which digitally reconstructed radiographs(DRR)are generated at various angles to simulate X-ray images.Since real-world clinical X-ray images rarely come with perfectly corresponding 3D“ground truth,”using CT scans as the three-dimensional reference effectively supports the training and evaluation of deep networks for sparse-angle X-ray 3D reconstruction.Experiments conducted on the LIDC-IDRI dataset with simulated X-ray images(DRR images)as training data demonstrate the superior performance of AdapFusionNet compared to other fusion methods.Quantitative results show that AdapFusionNet achieves SSIM,PSNR,and MAE values of 0.332,13.404,and 0.163,respectively,outperforming other methods(SingleViewNet:0.289,12.363,0.182;AvgFusionNet:0.306,13.384,0.159).Qualitative analysis further confirms that AdapFusionNet significantly enhances the reconstruction of lung and chest contours while effectively reducing noise during the reconstruction process.The findings demonstrate that AdapFusionNet offers significant advantages in 3D reconstruction of sparse-angle X-ray images.
基金supported by National Science and Technology Major Project(Grant No.2017ZX05018-001)。
文摘Deblending is a data processing procedure used to separate the source interferences of blended seismic data,which are obtained by simultaneous sources with random time delays to reduce the cost of seismic acquisition.There are three types of deblending algorithms,i.e.,filtering-type noise suppression algorithm,inversion-based algorithm and deep-learning based algorithm.We review the merits of these techniques,and propose to use a sparse inversion method for seismic data deblending.Filtering-based deblending approach is applicable to blended data with a low blending fold and simple geometry.Otherwise,it can suffer from signal distortion and noise leakage.At present,the deep learning based deblending methods are still under development and field data applications are limited due to the lack of high-quality training labels.In contrast,the inversion-based deblending approaches have gained industrial acceptance.Our used inversion approach transforms the pseudo-deblended data into the frequency-wavenumber-wavenumher(FKK)domain,and a sparse constraint is imposed for the coherent signal estimation.The estimated signal is used to predict the interference noise for subtraction from the original pseudo-deblended data.Via minimizing the data misfit,the signal can be iteratively updated with a shrinking threshold until the signal and interference are fully separated.The used FKK sparse inversion algorithm is very accurate and efficient compared with other sparse inversion methods,and it is widely applied in field cases.Synthetic example shows that the deblending error is less than 1%in average amplitudes and less than-40 dB in amplitude spectra.We present three field data examples of land,marine OBN(Ocean Bottom Nodes)and streamer acquisitions to demonstrate its successful applications in separating the source interferences efficiently and accurately.
基金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.
基金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.
基金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.
基金supported by the National Natural Science Foundation of China under Grant 62301051.
文摘Range-azimuth imaging of ground targets via frequency-modulated continuous wave(FMCW)radar is crucial for effective target detection.However,when the pitch of the moving array constructed during motion exceeds the physical array aperture,azimuth ambiguity occurs,making range-azimuth imaging on a moving platform challenging.To address this issue,we theoretically analyze azimuth ambiguity generation in sparse motion arrays and propose a dual-aperture adaptive processing(DAAP)method for suppressing azimuth ambiguity.This method combines spatial multiple-input multiple-output(MIMO)arrays with sparse motion arrays to achieve high-resolution range-azimuth imaging.In addition,an adaptive QR decomposition denoising method for sparse array signals based on iterative low-rank matrix approximation(LRMA)and regularized QR is proposed to preprocess sparse motion array signals.Simulations and experiments show that on a two-transmitter-four-receiver array,the signal-to-noise ratio(SNR)of the sparse motion array signal after noise suppression via adaptive QR decomposition can exceed 0 dB,and the azimuth ambiguity signal ratio(AASR)can be reduced to below-20 dB.
基金funded by the National Natural Science Foundation of China(grant nos.52475084 and 52375076)the Postdoctoral Fellowship Program of CPSF(grant no.GZC20230202).
文摘Difficulty in extracting nonlinear sparse impulse features due to variable speed conditions and redundant noise interference leads to challenges in diagnosing variable speed faults.Therefore,an improved spectral amplitude modulation(ISAM)based on sparse feature adaptive convolution(SFAC)is proposed to enhance the fault features under variable speed conditions.First,an optimal bi-damped wavelet construction method is proposed to learn signal impulse features,which selects the optimal bi-damped wavelet parameters with correlation criterion and particle swarm optimization.Second,a convolutional basis pursuit denoising model based on an optimal bi-damped wavelet is proposed for resolving sparse impulses.A model regularization parameter selection method based on weighted fault characteristic amplitude ratio assistance is proposed.Then,an ISAM method based on kurtosis threshold is proposed to further enhance the fault information of sparse signal.Finally,the type of variable speed faults is determined by order spectrum analysis.Various experimental results,such as spectral amplitude modulation and Morlet wavelet matching,verify the effectiveness and advantages of the ISAM-SFAC method.
基金supported by the Key Research and Development Program of Yunnan Province(No.202203AA080004)the National Natural Science Foundation of China Youth Found(No.62306210).
文摘Recent research has shown a burgeoning interest in exploring sparse models for massively Multilingual Neural Machine Translation(MNMT).In this paper,we present a comprehensive survey of this emerging topic.Massively MNMT,when based on sparse models,offers significant improvements in parameter efficiency and reduces interference compared to its dense model counterparts.Various methods have been proposed to leverage sparse models for enhancing translation quality.However,the lack of a thorough survey has hindered the identification and further investigation of the most promising approaches.To address this gap,we provide an exhaustive examination of the current research landscape in massively MNMT,with a special emphasis on sparse models.Initially,we categorize the various sparse model-based approaches into distinct classifications.We then delve into each category in detail,elucidating their fundamental modeling principles,core issues,and the challenges they face.Wherever possible,we conduct comparative analyses to assess the strengths and weaknesses of different methodologies.Moreover,we explore potential future research avenues for MNMT based on sparse models.This survey serves as a valuable resource for both newcomers and established experts in the field of MNMT,particularly those interested in sparse model applications.
基金support from the National Natural Science Foundation of China(Grant Nos.52174123&52274222).
文摘This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-oped using the material point method.To reduce the computational cost of Monte Carlo simulations,response surface models are created as surrogate models for the material point system to approximate its dynamic behavior.An adaptive randomized greedy algorithm is employed to construct a sparse polynomial chaos expansion model with a fixed order,effectively balancing the accuracy and computational efficiency of the surrogate model.Based on the sparse polynomial chaos expansion,sensitivity analysis is conducted using the global finite difference and Sobol methods.Several examples of structural dynamics are provided to demonstrate the effectiveness of the proposed method in addressing structural dynamics problems.
