Search Results (461)

Semantic segmentation of three-dimensional (3D) plant point clouds at the stem-leaf level is foundational and indispensable for high-throughput tomato phenotyping systems. However, existing semantic segmentation methods often suffer from issues such as low precision and slow inference speed. To address these challenges, we propose an innovative encoding-decoding structure, incorporating voxel sparse convolution (SpConv) and attention-based feature fusion (VSCAFF) to enhance semantic segmentation of the point clouds of high-resolution tomato seedling images. Tomato seedling point clouds from the Pheno4D dataset labeled into semantic classes of ‘leaf’, ‘stem’, and ‘soil’ are applied for the semantic segmentation. In order to reduce the number of parameters so as to further improve the inference speed, the SpConv module is designed to function through the residual concatenation of the skeleton convolution kernel and the regular convolution kernel. The feature fusion module based on the attention mechanism is designed by giving the corresponding attention weights to the voxel diffusion features and the point features in order to avoid the ambiguity of points with different semantics having the same characteristics caused by the diffusion module, in addition to suppressing noise. Finally, to solve model training class bias caused by the uneven distribution of point cloud classes, the composite loss function of Lovász-Softmax and weighted cross-entropy is introduced to supervise the model training and improve its performance. The results show that mIoU of VSCAFF is 86.96%, which outperformed the performance of PointNet, PointNet++, and DGCNN, respectively. IoU of VSCAFF achieves 99.63% in the soil class, 64.47% in the stem class, and 96.72% in the leaf class. The time delay of 35ms in inference speed is better than PointNet++ and DGCNN. The results demonstrate that VSCAFF has high performance and inference speed for semantic segmentation of high-resolution tomato point clouds, and can provide technical support for the high-throughput automatic phenotypic analysis of tomato plants. Full article

Seismic inversion is a process of imaging or predicting the spatial and physical properties of underground strata. The most commonly used one is sparse-spike seismic inversion with sparse regularization. There are many effective methods to solve sparse regularization, such as L0-norm, L1-norm, weighted L1-norm, etc. This paper studies the sparse-spike inversion with L0-norm. It is usually solved by the iterative hard thresholding algorithm (IHTA) or its faster variants. However, hard thresholding algorithms often lead to a sharp increase or numerical oscillation of the residual, which will affect the inversion results. In order to deal with this issue, this paper attempts the idea of the relaxed optimal thresholding algorithm (ROTA). In the solution process, due to the particularity of the sparse constraints in this convex relaxation model, this model can be considered as a L1-norm problem when dealt with the location of non-zero elements. We use a modified iterative soft thresholding algorithm (MISTA) to solve it. Hence, it forms a new algorithm called the iterative hybrid thresholding algorithm (IHyTA), which combines IHTA and MISTA. The synthetic and real seismic data tests show that, compared with IHTA, the results of IHyTA are more accurate with the same SNR. IHyTA improves the noise resistance. Full article

Atrial fibrillation (AF) is the most common sustained arrhythmia, linked with a significantly heightened risk of stroke. While moderate exercise reduces AF risk, high-level endurance athletes paradoxically exhibit a higher incidence. However, their stroke risk remains uncertain due to their younger age, higher cardiovascular fitness, and lower rate of comorbidities. Several key studies highlight that AF may increase the risk of stroke in endurance athletes, particularly those over 65. However, the overall risk within this population remains relatively low. Notably, older male athletes show a higher AF incidence but experience lower stroke risk than their non-athletic counterparts. Regular physical activity prior to a first stroke appears to reduce mortality, though recurrent stroke risk in athletes with AF mirrors that of non-athletes, despite an elevated AF incidence. Management of AF in athletes is complex, with limited evidence guiding anti-thrombotic strategies. In this setting, specific recommendations are sparse, particularly in sports where bleeding risk is heightened. Individualized management, emphasizing shared decision-making, is critical to balance stroke prevention with athletic performance. Rhythm control strategies, such as catheter ablation, may be a reasonable first-line treatment option for athletes, particularly in those desiring to avoid long-term medication. This review synthesizes the current literature on the incidence, predictors, and management of stroke in athletes with AF. Full article

In the context of hybrid twins, a data-driven enrichment is added to the physics-based solution to represent with higher accuracy the reference solution assumed to be known at different points in the physical domain. Such an approach enables better predictions. However, the data-driven enrichment is usually represented by a regression, whose main drawbacks are (i) the difficulty of understanding the subjacent physics and (ii) the risks induced by the data-driven model extrapolation. This paper proposes a procedure enabling the extraction of a differential operator associated with the enrichment provided by the data-driven regression. For that purpose, a sparse Singular Value Decomposition, SVD, is introduced. It is then employed, first, in a full operator representation regularized optimization problem, where sparsity is promoted, leading to a linear programming problem, and then in a tensor decomposition of the operator’s identification procedure. The results show the ability of the method to identify the exact missing operators from the model. The regularized optimization problem was also able to identify the weights of the missing terms with a relative error of about 10% on average, depending on the selected use case. Full article

As a non-invasive imaging method, electrical impedance tomography (EIT) technology has become a research focus for grounding grid corrosion diagnosis. However, the existing algorithms have not produced ideal image reconstruction results. This article proposes an electrical impedance imaging method based on sparse representation, which can improve the accuracy of reconstructed images obviously. First, the basic principles of EIT are outlined, and the limitations of existing reconstruction methods are analyzed. Then, an EIT reconstruction algorithm based on sparse representation is proposed to address these limitations. It constructs constraints using the sparsity of conductivity distribution under a certain sparse basis and utilizes the accelerated Fast Iterative Shrinkage Threshold Algorithm (FISTA) for iterative solutions, aiming to improve the imaging quality and reconstruction accuracy. Finally, the grounding grid model is established by COMSOL simulation software to obtain voltage data, and the reconstruction effects of the Tikhonov regularization algorithm, the total variation regularization algorithm (TV), the one-step Newton algorithm (NOSER), and the sparse reconstruction algorithm proposed in this article are compared in MATLAB. The voltage relative error is introduced to evaluate the reconstructed image. The results show that the reconstruction algorithm based on sparse representation is superior to other methods in terms of reconstruction error and image quality. The relative error of the grounding grid reconstructed image is reduced by an average of 12.54%. Full article

Federated learning (FL) strikes a balance between privacy preservation and collaborative model training. However, the periodic transmission of model updates or parameters from each client to the federated server incurs substantial communication overhead, especially for participants with limited network bandwidth. This overhead significantly hampers the practical applicability of FL in real-world scenarios. To address this challenge, we propose FedSparse, an innovative sparse communication framework designed to enhance communication efficiency. The core idea behind FedSparse is to introduce a communication overhead regularization term into the client’s objective function, thereby reducing the number of parameters that need to be transmitted. FedSparse incorporates a Resource Optimization Proximal (ROP) term and an Importance-based Regularization Weighting (IRW) mechanism into the client update objective function. The local update process optimizes both the empirical risk and communication overhead by applying a sparse regularization weighted by update importance. By making minimal modifications to traditional FL approaches, FedSparse effectively reduces the number of parameters transmitted, thereby decreasing the communication overhead. We evaluate the effectiveness of FedSparse through experiments on various datasets under non-independent and identically distributed (non-IID) conditions, demonstrating its flexibility in resource-constrained environments. On the MNIST, Fashion-MNIST, and CIFAR datasets, FedSparse reduces the communication overhead by 24%, 17%, and 5%, respectively, compared to the baseline algorithm, while maintaining similar model performance. Additionally, on simulated non-IID datasets, FedSparse achieves a 6% to 8% reduction in communication resource consumption. By adjusting the sparsity intensity hyperparameter, we demonstrate that FedSparse can be tailored to different FL applications with varying communication resource constraints. Finally, ablation studies highlight the individual contributions of the ROP and IRW modules to the overall improvement in communication efficiency. Full article

Hyperspectral compressed imaging is a novel imaging detection technology based on compressed sensing theory that can quickly acquire spectral information of terrestrial objects in a single exposure. It combines reconstruction algorithms to recover hyperspectral data from low-dimensional measurement images. However, hyperspectral images from different scenes often exhibit high-frequency data sparsity and existing deep reconstruction algorithms struggle to establish accurate mapping models, leading to issues with detail loss in the reconstruction results. To address this issue, we propose a hyperspectral reconstruction method based on global gradient information and local low-rank priors. First, to improve the prior model’s efficiency in utilizing information of different frequencies, we design a gradient sampling strategy and training framework based on decision trees, leveraging changes in the loss function gradient information to enhance the model’s predictive capability for data of varying frequencies. Second, utilizing the local low-rank prior characteristics of the representative coefficient matrix, we develop a sparse sensing denoising module to effectively improve the local smoothness of point predictions. Finally, by establishing a regularization term for the reconstruction process based on the semantic similarity between the denoised results and prior spectral data, we ensure spatial consistency and spectral fidelity in the reconstruction results. Experimental results indicate that the proposed method achieves better detail recovery across different scenes, demonstrates improved generalization performance for reconstructing information of various frequencies, and yields higher reconstruction quality. Full article

Image formation in radio astronomy is often posed as a problem of constructing a nonnegative function from sparse samples of its Fourier transform. We explore an alternative approach that reformulates the problem in terms of estimating the entries of a diagonal covariance matrix from Gaussian data. Maximum-likelihood estimates of the covariance cannot be readily computed analytically; hence, we investigate an iterative algorithm originally proposed by Snyder, O’Sullivan, and Miller in the context of radar imaging. The resulting maximum-likelihood estimates tend to be unacceptably rough due to the ill-posed nature of the maximum-likelihood estimation of functions from limited data, so some kind of regularization is needed. We explore penalized likelihoods based on entropy functionals, a roughness penalty proposed by Silverman, and an information-theoretic formulation of Good’s roughness penalty crafted by O’Sullivan. We also investigate algorithm variations that perform a generic smoothing step at each iteration. The results illustrate that tuning parameters allow for a tradeoff between the noise and blurriness of the reconstruction. Full article

The cost of indoor mapping methods based on three-dimensional (3D) LiDAR can be relatively high, and they lack environmental color information, thereby limiting their application scenarios. This study presents an innovative, low-cost, omnidirectional 3D color LiDAR mapping system for indoor environments. The system consists of two two-dimensional (2D) LiDARs, six monocular cameras, and a servo motor. The point clouds are fused with imagery using a pixel-spatial dual-constrained depth gradient adaptive regularization (PS-DGAR) algorithm to produce dense 3D color point clouds. During fusion, the point cloud is reconstructed inversely based on the predicted pixel depth values, compensating for areas of sparse spatial features. For indoor scene reconstruction, a globally consistent alignment algorithm based on particle filter and iterative closest point (PF-ICP) is proposed, which incorporates adjacent frame registration and global pose optimization to reduce mapping errors. Experimental results demonstrate that the proposed density enhancement method achieves an average error of 1.5 cm, significantly improving the density and geometric integrity of sparse point clouds. The registration algorithm achieves a root mean square error (RMSE) of 0.0217 and a runtime of less than 4 s, both of which outperform traditional iterative closest point (ICP) variants. Furthermore, the proposed low-cost omnidirectional 3D color LiDAR mapping system demonstrates superior measurement accuracy in indoor environments. Full article

The problem of blind image deblurring remains a challenging inverse problem, due to the ill-posed nature of estimating unknown blur kernels and latent images within the Maximum A Posteriori (MAP) framework. To address this challenge, traditional methods often rely on sparse regularization priors to mitigate the uncertainty inherent in the problem. In this paper, we propose a novel blind deblurring model based on the MAP framework that leverages Composite-Gradient Feature (CGF) variations in edge regions after image blurring. This prior term is specifically designed to exploit the high sparsity of sharp edge regions in clear images, thereby effectively alleviating the ill-posedness of the problem. Unlike existing methods that focus on local gradient information, our approach focuses on the aggregation of edge regions, enabling better detection of both sharp and smoothed edges in blurred images. In the blur kernel estimation process, we enhance the accuracy of the kernel by assigning effective edge information from the blurred image to the smoothed intermediate latent image, preserving critical structural details lost during the blurring process. To further improve the edge-preserving restoration, we introduce an adaptive regularizer that outperforms traditional total variation regularization by better maintaining edge integrity in both clear and blurred images. The proposed variational model is efficiently implemented using alternating iterative techniques. Extensive numerical experiments and comparisons with state-of-the-art methods demonstrate the superior performance of our approach, highlighting its effectiveness and real-world applicability in diverse image-restoration tasks. Full article

Time–frequency distributions (TFDs) are crucial for analyzing non-stationary signals. Compressive sensing (CS) in the ambiguity domain offers an approach for TFD reconstruction with high performance, but selecting the optimal regularization parameter for various signals remains challenging. Traditional methods for parameter selection, including manual and experimental approaches, as well as existing optimization procedures, can be imprecise and time-consuming. This study introduces a novel approach using deep neural networks (DNNs) to predict regularization parameters based on Wigner–Ville distributions (WVDs). The proposed DNN is trained on a comprehensive dataset of synthetic signals featuring multiple linear and quadratic frequency-modulated components, with variations in component amplitudes and random positions, ensuring wide applicability and robustness. By utilizing DNNs, end-users need only provide the signal’s WVD, eliminating the need for manual parameter selection and lengthy optimization procedures. Comparisons between the reconstructed TFDs using the proposed DNN-based approach and existing optimization methods highlight significant improvements in both reconstruction performance and execution time. The effectiveness of this methodology is validated on noisy synthetic and real-world signals, emphasizing the potential of DNNs to automate regularization parameter determination for CS-based TFD reconstruction in diverse signal environments. Full article

This paper introduces a novel capped separable difference of two norms (CSDTN) method for sparse signal recovery, which generalizes the well-known minimax concave penalty (MCP) method. The CSDTN method incorporates two shape parameters and one scale parameter, with their appropriate selection being crucial for ensuring robustness and achieving superior reconstruction performance. We provide a detailed theoretical analysis of the method and propose an efficient iteratively reweighted ${\ell }_1$ (IRL1)-based algorithm for solving the corresponding optimization problem. Extensive numerical experiments, including electrocardiogram (ECG) and synthetic signal recovery tasks, demonstrate the effectiveness of the proposed CSDTN method. Our method outperforms existing methods in terms of recovery accuracy and robustness. These results highlight the potential of CSDTN in various signal-processing applications. Full article

Chinese dialogue generation faces multiple challenges, such as semantic understanding, information matching, and response fluency. Generative dialogue systems for Chinese conversation are somehow difficult to construct because of the flexible word order, the great impact of word replacement on semantics, and the complex implicit context. Existing methods still have limitations in addressing these issues. To tackle these problems, this paper proposes an improved Chinese dialogue generation model based on transformer architecture. The model uses a multi-layer transformer decoder as the backbone and introduces two key techniques, namely incorporating pre-trained language model word embeddings and optimizing the sparse Softmax loss function. For word-embedding fusion, we concatenate the word vectors from the pre-trained model with character-based embeddings to enhance the semantic information of word representations. The sparse Softmax optimization effectively mitigates the overfitting issue by introducing a sparsity regularization term. Experimental results on the Chinese short text conversation (STC) dataset demonstrate that our proposed model significantly outperforms the baseline models on automatic evaluation metrics, such as BLEU and Distinct, with an average improvement of 3.5 percentage points. Human evaluations also validate the superiority of our model in generating fluent and relevant responses. This work provides new insights and solutions for building more intelligent and human-like Chinese dialogue systems. Full article

As an extension of non-negative matrix factorization (NMF), graph-regularized non-negative matrix factorization (GNMF) has been widely applied in data mining and machine learning, particularly for tasks such as clustering and feature selection. Traditional GNMF methods typically rely on predefined graph structures to guide the decomposition process, using fixed data graphs and feature graphs to capture relationships between data points and features. However, these fixed graphs may limit the model’s expressiveness. Additionally, many NMF variants face challenges when dealing with complex data distributions and are vulnerable to noise and outliers. To overcome these challenges, we propose a novel method called sparse feature-weighted double Laplacian rank constraint non-negative matrix factorization (SFLRNMF), along with its extended version, SFLRNMTF. These methods adaptively construct more accurate data similarity and feature similarity graphs, while imposing rank constraints on the Laplacian matrices of these graphs. This rank constraint ensures that the resulting matrix ranks reflect the true number of clusters, thereby improving clustering performance. Moreover, we introduce a feature weighting matrix into the original data matrix to reduce the influence of irrelevant features and apply an $L_{\mathrm{2,1}/2}$ norm sparsity constraint in the basis matrix to encourage sparse representations. An orthogonal constraint is also enforced on the coefficient matrix to ensure interpretability of the dimensionality reduction results. In the extended model (SFLRNMTF), we introduce a double orthogonal constraint on the basis matrix and coefficient matrix to enhance the uniqueness and interpretability of the decomposition, thereby facilitating clearer clustering results for both rows and columns. However, enforcing double orthogonal constraints can reduce approximation accuracy, especially with low-rank matrices, as it restricts the model’s flexibility. To address this limitation, we introduce an additional factor matrix R, which acts as an adaptive component that balances the trade-off between constraint enforcement and approximation accuracy. This adjustment allows the model to achieve greater representational flexibility, improving reconstruction accuracy while preserving the interpretability and clustering clarity provided by the double orthogonality constraints. Consequently, the SFLRNMTF approach becomes more robust in capturing data patterns and achieving high-quality clustering results in complex datasets. We also propose an efficient alternating iterative update algorithm to optimize the proposed model and provide a theoretical analysis of its performance. Clustering results on four benchmark datasets demonstrate that our method outperforms competing approaches. Full article

Non-destructive testing (NDT) enables the determination of internal defects and flaws in concrete structures without damaging them, making it a common application in current bridge concrete inspections. However, due to the complexity of the internal structure of this type of concrete, limitations regarding measurement point placement, and the extensive detection area, accurate defect detection cannot be guaranteed. This paper proposes a method that combines the Simultaneous Algebraic Reconstruction Technique with Group Sparsity Regularization (SART-GSR) to achieve tomographic imaging of bridge concrete under sparse measurement conditions. Firstly, a mathematical model is established based on the principles of the tomographic imaging of bridge concrete; secondly, the SART algorithm is used to solve for its velocity values; thirdly, on the basis of the SART results, GSR is applied for optimized solution processing; finally, simulation experiments are conducted to verify the reconstruction effects of the SART-GSR algorithm compared with those of the SART and ART algorithms. The results show that the SART-GSR algorithm reduced the relative error to 1.5% and the root mean square error to 89.76 m/s compared to the SART and ART algorithms. This improvement in accuracy makes it valuable for the tomographic imaging of bridge concrete and provides a reference for defect detection in bridge concrete. Full article