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.展开更多
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.展开更多
Sparse identification of nonlinear dynamics(SINDy)has made significant progress in data-driven dynamics modeling.However,determining appropriate hyperparameters and addressing the time-consuming symbolic regression pr...Sparse identification of nonlinear dynamics(SINDy)has made significant progress in data-driven dynamics modeling.However,determining appropriate hyperparameters and addressing the time-consuming symbolic regression process remain substantial challenges.This study proposes the adaptive backward stepwise selection of fast SINDy(ABSS-FSINDy),which integrates statistical learning-based estimation and technical advancements to significantly reduce simulation time.This approach not only provides insights into the conditions under which SINDy performs optimally but also highlights potential failure points,particularly in the context of backward stepwise selection(BSS).By decoding predefined features into textual expressions,ABSS-FSINDy significantly reduces the simulation time compared with conventional symbolic regression methods.We validate the proposed method through a series of numerical experiments involving both planar/spatial dynamics and high-dimensional chaotic systems,including Lotka-Volterra,hyperchaotic Rossler,coupled Lorenz,and Lorenz 96 benchmark systems.The experimental results demonstrate that ABSS-FSINDy autonomously determines optimal hyperparameters within the SINDy framework,overcoming the curse of dimensionality in high-dimensional simulations.This improvement is substantial across both lowand high-dimensional systems,yielding efficiency gains of one to three orders of magnitude.For instance,in a 20D dynamical system,the simulation time is reduced from 107.63 s to just 0.093 s,resulting in a 3-order-of-magnitude improvement in simulation efficiency.This advancement broadens the applicability of SINDy for the identification and reconstruction of high-dimensional dynamical systems.展开更多
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.展开更多
Drive-by techniques for bridge health monitoring have drawn increasing attention from researchers and practitioners,in the attempt to make bridge condition-based monitoring more cost-efficient.In this work,the authors...Drive-by techniques for bridge health monitoring have drawn increasing attention from researchers and practitioners,in the attempt to make bridge condition-based monitoring more cost-efficient.In this work,the authors propose a drive-by approach that takes advantage from bogie vertical accelerations to assess bridge health status.To do so,continuous wavelet transform is combined with multiple sparse autoencoders that allow for damage detection and localization across bridge span.According to authors’best knowledge,this is the first case in which an unsupervised technique,which relies on the use of sparse autoencoders,is used to localize damages.The bridge considered in this work is a Warren steel truss bridge,whose finite element model is referred to an actual structure,belonging to the Italian railway line.To investigate damage detection and localization performances,different operational variables are accounted for:train weight,forward speed and track irregularity evolution in time.Two configurations for the virtual measuring channels were investigated:as a result,better performances were obtained by exploiting the vertical accelerations of both the bogies of the leading coach instead of using only one single acceleration signal.展开更多
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.展开更多
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.展开更多
Sparse representation has been highly successful in various tasks related to image processing and computer vision.For ancient mural image inpainting,traditional group sparse representation models usually lead to struc...Sparse representation has been highly successful in various tasks related to image processing and computer vision.For ancient mural image inpainting,traditional group sparse representation models usually lead to structure blur and line discontinuity due to the construction of similarity group solely based on the Euclidean distance and the randomness of dictionary initialization.To address the aforementioned issues,an improved curvature Gabor transform and group sparse representation(CGabor-GSR)model for ancient Dunhuang mural inpainting is proposed.To begin with,mutual information is introduced to weight the Euclidean distance,and then the weighted Euclidean distance acts as a new standard of similarity group.Subsequently,to mitigate the randomness of dictionary initialization,a curvature Gabor wavelet transform is proposed to extract the features and initialize the feature dictionary with dimension reduction based on principal component analysis(PCA).Ultimately,singular value decomposition(SVD)and split Bregman iteration(SBI)can be used to resolve the CGabor-GSR model to reconstruct the mural images.Experimental results on Dunhuang mural inpainting demonstrate tha the proposed CGabor-GSR achieves a better performance than compared algorithms in both objective and visual evaluation.展开更多
Efficient three-dimensional(3D)building reconstruction from drone imagery often faces data acquisition,storage,and computational challenges because of its reliance on dense point clouds.In this study,we introduced a n...Efficient three-dimensional(3D)building reconstruction from drone imagery often faces data acquisition,storage,and computational challenges because of its reliance on dense point clouds.In this study,we introduced a novel method for efficient and lightweight 3D building reconstruction from drone imagery using line clouds and sparse point clouds.Our approach eliminates the need to generate dense point clouds,and thus significantly reduces the computational burden by reconstructing 3D models directly from sparse data.We addressed the limitations of line clouds for plane detection and reconstruction by using a new algorithm.This algorithm projects 3D line clouds onto a 2D plane,clusters the projections to identify potential planes,and refines them using sparse point clouds to ensure an accurate and efficient model reconstruction.Extensive qualitative and quantitative experiments demonstrated the effectiveness of our method,demonstrating its superiority over existing techniques in terms of simplicity and efficiency.展开更多
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.展开更多
In recent years,deeps learning has been widely applied in synthetic aperture radar(SAR)image processing.However,the collection of large-scale labeled SAR images is challenging and costly,and the classification accurac...In recent years,deeps learning has been widely applied in synthetic aperture radar(SAR)image processing.However,the collection of large-scale labeled SAR images is challenging and costly,and the classification accuracy is often poor when only limited SAR images are available.To address this issue,we propose a novel framework for sparse SAR target classification under few-shot cases,termed the transfer learning-based interpretable lightweight convolutional neural network(TL-IL-CNN).Additionally,we employ enhanced gradient-weighted class activation mapping(Grad-CAM)to mitigate the“black box”effect often associated with deep learning models and to explore the mechanisms by which a CNN classifies various sparse SAR targets.Initially,we apply a novel bidirectional iterative soft thresholding(BiIST)algorithm to generate sparse images of superior quality compared to those produced by traditional matched filtering(MF)techniques.Subsequently,we pretrain multiple shallow CNNs on a simulated SAR image dataset.Using the sparse SAR dataset as input for the CNNs,we assess the efficacy of transfer learning in sparse SAR target classification and suggest the integration of TL-IL-CNN to enhance the classification accuracy further.Finally,Grad-CAM is utilized to provide visual explanations for the predictions made by the classification framework.The experimental results on the MSTAR dataset reveal that the proposed TL-IL-CNN achieves nearly 90%classification accuracy with only 20%of the training data required under standard operating conditions(SOC),surpassing typical deep learning methods such as vision Transformer(ViT)in the context of small samples.Remarkably,it even presents better performance under extended operating conditions(EOC).Furthermore,the application of Grad-CAM elucidates the CNN’s differentiation process among various sparse SAR targets.The experiments indicate that the model focuses on the target and the background can differ among target classes.The study contributes to an enhanced understanding of the interpretability of such results and enables us to infer the classification outcomes for each category more accurately.展开更多
基金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.
文摘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.
基金Project supported by the National Natural Science Foundation of China(Nos.12172291,12472357,and 12232015)the Shaanxi Province Outstanding Youth Fund Project(No.2024JC-JCQN-05)the 111 Project(No.BP0719007)。
文摘Sparse identification of nonlinear dynamics(SINDy)has made significant progress in data-driven dynamics modeling.However,determining appropriate hyperparameters and addressing the time-consuming symbolic regression process remain substantial challenges.This study proposes the adaptive backward stepwise selection of fast SINDy(ABSS-FSINDy),which integrates statistical learning-based estimation and technical advancements to significantly reduce simulation time.This approach not only provides insights into the conditions under which SINDy performs optimally but also highlights potential failure points,particularly in the context of backward stepwise selection(BSS).By decoding predefined features into textual expressions,ABSS-FSINDy significantly reduces the simulation time compared with conventional symbolic regression methods.We validate the proposed method through a series of numerical experiments involving both planar/spatial dynamics and high-dimensional chaotic systems,including Lotka-Volterra,hyperchaotic Rossler,coupled Lorenz,and Lorenz 96 benchmark systems.The experimental results demonstrate that ABSS-FSINDy autonomously determines optimal hyperparameters within the SINDy framework,overcoming the curse of dimensionality in high-dimensional simulations.This improvement is substantial across both lowand high-dimensional systems,yielding efficiency gains of one to three orders of magnitude.For instance,in a 20D dynamical system,the simulation time is reduced from 107.63 s to just 0.093 s,resulting in a 3-order-of-magnitude improvement in simulation efficiency.This advancement broadens the applicability of SINDy for the identification and reconstruction of high-dimensional dynamical systems.
文摘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.
文摘Drive-by techniques for bridge health monitoring have drawn increasing attention from researchers and practitioners,in the attempt to make bridge condition-based monitoring more cost-efficient.In this work,the authors propose a drive-by approach that takes advantage from bogie vertical accelerations to assess bridge health status.To do so,continuous wavelet transform is combined with multiple sparse autoencoders that allow for damage detection and localization across bridge span.According to authors’best knowledge,this is the first case in which an unsupervised technique,which relies on the use of sparse autoencoders,is used to localize damages.The bridge considered in this work is a Warren steel truss bridge,whose finite element model is referred to an actual structure,belonging to the Italian railway line.To investigate damage detection and localization performances,different operational variables are accounted for:train weight,forward speed and track irregularity evolution in time.Two configurations for the virtual measuring channels were investigated:as a result,better performances were obtained by exploiting the vertical accelerations of both the bogies of the leading coach instead of using only one single acceleration signal.
基金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.
基金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.
基金supported by National Natural Science Foundation of China(No.61963023)Humanities and Social Sciences Youth Foundation of Ministry of Education(No.19YJC760012)Lanzhou Jiaotong University Basic Top-Notch Personnel Project(No.2022JC36).
文摘Sparse representation has been highly successful in various tasks related to image processing and computer vision.For ancient mural image inpainting,traditional group sparse representation models usually lead to structure blur and line discontinuity due to the construction of similarity group solely based on the Euclidean distance and the randomness of dictionary initialization.To address the aforementioned issues,an improved curvature Gabor transform and group sparse representation(CGabor-GSR)model for ancient Dunhuang mural inpainting is proposed.To begin with,mutual information is introduced to weight the Euclidean distance,and then the weighted Euclidean distance acts as a new standard of similarity group.Subsequently,to mitigate the randomness of dictionary initialization,a curvature Gabor wavelet transform is proposed to extract the features and initialize the feature dictionary with dimension reduction based on principal component analysis(PCA).Ultimately,singular value decomposition(SVD)and split Bregman iteration(SBI)can be used to resolve the CGabor-GSR model to reconstruct the mural images.Experimental results on Dunhuang mural inpainting demonstrate tha the proposed CGabor-GSR achieves a better performance than compared algorithms in both objective and visual evaluation.
基金Supported by the Guangdong Major Project of Basic and Applied Basic Research (2023B0303000016)the National Natural Science Foundation of China (U21A20515)。
文摘Efficient three-dimensional(3D)building reconstruction from drone imagery often faces data acquisition,storage,and computational challenges because of its reliance on dense point clouds.In this study,we introduced a novel method for efficient and lightweight 3D building reconstruction from drone imagery using line clouds and sparse point clouds.Our approach eliminates the need to generate dense point clouds,and thus significantly reduces the computational burden by reconstructing 3D models directly from sparse data.We addressed the limitations of line clouds for plane detection and reconstruction by using a new algorithm.This algorithm projects 3D line clouds onto a 2D plane,clusters the projections to identify potential planes,and refines them using sparse point clouds to ensure an accurate and efficient model reconstruction.Extensive qualitative and quantitative experiments demonstrated the effectiveness of our method,demonstrating its superiority over existing techniques in terms of simplicity and efficiency.
基金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 in part by the National Natural Science Foundation(Nos.62271248,62401256)in part by the Natural Science Foundation of Ji-angsu Province(Nos.BK20230090,BK20241384)in part by the Key Laboratory of Land Satellite Remote Sens-ing Application,Ministry of Natural Resources of China(No.KLSMNR-K202303)。
文摘In recent years,deeps learning has been widely applied in synthetic aperture radar(SAR)image processing.However,the collection of large-scale labeled SAR images is challenging and costly,and the classification accuracy is often poor when only limited SAR images are available.To address this issue,we propose a novel framework for sparse SAR target classification under few-shot cases,termed the transfer learning-based interpretable lightweight convolutional neural network(TL-IL-CNN).Additionally,we employ enhanced gradient-weighted class activation mapping(Grad-CAM)to mitigate the“black box”effect often associated with deep learning models and to explore the mechanisms by which a CNN classifies various sparse SAR targets.Initially,we apply a novel bidirectional iterative soft thresholding(BiIST)algorithm to generate sparse images of superior quality compared to those produced by traditional matched filtering(MF)techniques.Subsequently,we pretrain multiple shallow CNNs on a simulated SAR image dataset.Using the sparse SAR dataset as input for the CNNs,we assess the efficacy of transfer learning in sparse SAR target classification and suggest the integration of TL-IL-CNN to enhance the classification accuracy further.Finally,Grad-CAM is utilized to provide visual explanations for the predictions made by the classification framework.The experimental results on the MSTAR dataset reveal that the proposed TL-IL-CNN achieves nearly 90%classification accuracy with only 20%of the training data required under standard operating conditions(SOC),surpassing typical deep learning methods such as vision Transformer(ViT)in the context of small samples.Remarkably,it even presents better performance under extended operating conditions(EOC).Furthermore,the application of Grad-CAM elucidates the CNN’s differentiation process among various sparse SAR targets.The experiments indicate that the model focuses on the target and the background can differ among target classes.The study contributes to an enhanced understanding of the interpretability of such results and enables us to infer the classification outcomes for each category more accurately.
