Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal...Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
Velocity incorporates user dynamic characteristics,facilitating more precise predictions about the positioning.However,the positioning,velocity,and timing services derived from Global Navigation Satellite System(GNSS)...Velocity incorporates user dynamic characteristics,facilitating more precise predictions about the positioning.However,the positioning,velocity,and timing services derived from Global Navigation Satellite System(GNSS)undergo accuracy degradation in urban environments due to multipath/Non-Line of Sight(NLOS)effects.Fault detection and exclusion(FDE)methods can mitigate these effects.However,the existing methods,such as the multi-hypothesis separation solution(MHSS),exhibit high computational burdens and cannot perform accurate exclusion due to the excessive fault modes.In response,a fault detection and correction(FDC)method is developed to address outliers arising from multipath/NLOS in the Doppler measurements.To alleviate computational demands while simultaneously improving velocity estimation accuracy,multipath/NLOS sparsity assumptions and grouping constraints are introduced.Specifically,the grouping-sparsity enforcing Least Absolute Shrinkage and Selection Operator(GS-LASSO)is introduced to jointly detect and correct multipath/NLOS-induced outliers.A grouping strategy based on sky-map and carrier-to-noise ratio is introduced,which is coupled with a new cost function to improve sparsity estimation.To facilitate the implementation,a solver and parameter-tuning method incorporating false alarm rates are developed.The performance of GS-LASSO is compared with that of MHSS.The results show that GS-LASSO reduces greater velocity errors in the urban environment,while requiring limited computational load.展开更多
Volumetric additive manufacturing(VAM) transforms traditional 2D light pattern projection into spatial light field energy superposition,maximizing the utilization of radiated light and allowing for ultra-fast,support-...Volumetric additive manufacturing(VAM) transforms traditional 2D light pattern projection into spatial light field energy superposition,maximizing the utilization of radiated light and allowing for ultra-fast,support-free printing,which has specific applications in fields such as life sciences and optics.However,traditional VAM processes require numerous projections and extensive computational preparation,limiting practical applications due to low projection efficiency and prolonged calculation times.In this study,we developed sparse-view irradiation processing VAM(SVIP-VAM),employing an optimized odd-even(OE) irradiation strategy inspired by sparse-view computed tomography.Theoretically,we demonstrated structural contour reconstruction feasibility with as few as 8 projections.Using this sparse-view approach,we achieved high-quality fabrication with only 15 projections,enhancing each projection efficiency by over 60 times and reducing projection set computational time by nearly 10-fold.Ultimately,this efficient sparse-view method significantly expands VAM applications into fields requiring rapid manufacturing,such as tissue engineering,medical implants,and aerospace manufacturing.展开更多
3D sparse convolution has emerged as a pivotal technique for efficient voxel-based perception in autonomous systems,enabling selective feature extraction from non-empty voxels while suppressing computational waste.Des...3D sparse convolution has emerged as a pivotal technique for efficient voxel-based perception in autonomous systems,enabling selective feature extraction from non-empty voxels while suppressing computational waste.Despite its theoretical efficiency advantages,practical implementations face under-explored limitations:the fixed geometric patterns of conventional sparse convolutional kernels inevitably process non-contributory positions during sliding-window operations,particularly in regions with uneven point cloud density.To address this,we propose Hierarchical Shape Pruning for 3D Sparse Convolution(HSP-S),which dynamically eliminates redundant kernel stripes through layer-adaptive thresholding.Unlike static soft pruning methods,HSP-S maintains trainable sparsity patterns by progressively adjusting pruning thresholds during optimization,enlarging original parameter search space while removing redundant operations.Extensive experiments validate effectiveness of HSP-S acrossmajor autonomous driving benchmarks.On KITTI’s 3D object detection task,our method reduces 93.47%redundant kernel computations whilemaintaining comparable accuracy(1.56%mAP drop).Remarkably,on themore complexNuScenes benchmark,HSP-S achieves simultaneous computation reduction(21.94%sparsity)and accuracy gains(1.02%mAP(mean Average Precision)and 0.47%NDS(nuScenes detection score)improvement),demonstrating its scalability to diverse perception scenarios.This work establishes the first learnable shape pruning framework that simultaneously enhances computational efficiency and preserves detection accuracy in 3D perception systems.展开更多
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.展开更多
文摘Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.
文摘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 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.
文摘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.
基金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 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.
基金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 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.
基金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 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 the National Key R&D Program of China(No.2022YFB3904401)。
文摘Velocity incorporates user dynamic characteristics,facilitating more precise predictions about the positioning.However,the positioning,velocity,and timing services derived from Global Navigation Satellite System(GNSS)undergo accuracy degradation in urban environments due to multipath/Non-Line of Sight(NLOS)effects.Fault detection and exclusion(FDE)methods can mitigate these effects.However,the existing methods,such as the multi-hypothesis separation solution(MHSS),exhibit high computational burdens and cannot perform accurate exclusion due to the excessive fault modes.In response,a fault detection and correction(FDC)method is developed to address outliers arising from multipath/NLOS in the Doppler measurements.To alleviate computational demands while simultaneously improving velocity estimation accuracy,multipath/NLOS sparsity assumptions and grouping constraints are introduced.Specifically,the grouping-sparsity enforcing Least Absolute Shrinkage and Selection Operator(GS-LASSO)is introduced to jointly detect and correct multipath/NLOS-induced outliers.A grouping strategy based on sky-map and carrier-to-noise ratio is introduced,which is coupled with a new cost function to improve sparsity estimation.To facilitate the implementation,a solver and parameter-tuning method incorporating false alarm rates are developed.The performance of GS-LASSO is compared with that of MHSS.The results show that GS-LASSO reduces greater velocity errors in the urban environment,while requiring limited computational load.
基金supported financially by the Beijing Municipal Natural Science Foundation (L232109)National Natural Science Foundation of China (22073003)Fundamental Research Funds for the Central Universities (YWF-22-K-101)。
文摘Volumetric additive manufacturing(VAM) transforms traditional 2D light pattern projection into spatial light field energy superposition,maximizing the utilization of radiated light and allowing for ultra-fast,support-free printing,which has specific applications in fields such as life sciences and optics.However,traditional VAM processes require numerous projections and extensive computational preparation,limiting practical applications due to low projection efficiency and prolonged calculation times.In this study,we developed sparse-view irradiation processing VAM(SVIP-VAM),employing an optimized odd-even(OE) irradiation strategy inspired by sparse-view computed tomography.Theoretically,we demonstrated structural contour reconstruction feasibility with as few as 8 projections.Using this sparse-view approach,we achieved high-quality fabrication with only 15 projections,enhancing each projection efficiency by over 60 times and reducing projection set computational time by nearly 10-fold.Ultimately,this efficient sparse-view method significantly expands VAM applications into fields requiring rapid manufacturing,such as tissue engineering,medical implants,and aerospace manufacturing.
文摘3D sparse convolution has emerged as a pivotal technique for efficient voxel-based perception in autonomous systems,enabling selective feature extraction from non-empty voxels while suppressing computational waste.Despite its theoretical efficiency advantages,practical implementations face under-explored limitations:the fixed geometric patterns of conventional sparse convolutional kernels inevitably process non-contributory positions during sliding-window operations,particularly in regions with uneven point cloud density.To address this,we propose Hierarchical Shape Pruning for 3D Sparse Convolution(HSP-S),which dynamically eliminates redundant kernel stripes through layer-adaptive thresholding.Unlike static soft pruning methods,HSP-S maintains trainable sparsity patterns by progressively adjusting pruning thresholds during optimization,enlarging original parameter search space while removing redundant operations.Extensive experiments validate effectiveness of HSP-S acrossmajor autonomous driving benchmarks.On KITTI’s 3D object detection task,our method reduces 93.47%redundant kernel computations whilemaintaining comparable accuracy(1.56%mAP drop).Remarkably,on themore complexNuScenes benchmark,HSP-S achieves simultaneous computation reduction(21.94%sparsity)and accuracy gains(1.02%mAP(mean Average Precision)and 0.47%NDS(nuScenes detection score)improvement),demonstrating its scalability to diverse perception scenarios.This work establishes the first learnable shape pruning framework that simultaneously enhances computational efficiency and preserves detection accuracy in 3D perception systems.
基金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.
