Search Results (894)

Introduction: Radiomics is the extraction of non-invasive and reproducible quantitative imaging features, which may yield mineable information for clinical practice implementation. Quantification of lung function through radiomics could play a role in the management of patients with pulmonary lesions. The aim of this study is to test the capability of radiomic features to predict pulmonary function parameters, focusing on the diffusing capacity of lungs to carbon monoxide (DL_CO). Methods: Retrospective data were retrieved from electronical medical records of patients treated with Stereotactic Body Radiation Therapy (SBRT) at a single institution. Inclusion criteria were as follows: (1) SBRT treatment performed for primary early-stage non-small cell lung cancer (ES-NSCLC) or oligometastatic lung nodules, (2) availability of simulation four-dimensional computed tomography (4DCT) scan, (3) baseline spirometry data availability, (4) availability of baseline clinical data, and (5) written informed consent for the anonymized use of data. The gross tumor volume (GTV) was segmented on 4DCT reconstructed phases representing the moment of maximum inhalation and maximum exhalation (Phase 0 and Phase 50, respectively), and radiomic features were extracted from the lung parenchyma subtracting the lesion/s. An iterative algorithm was clustered based on correlation, while keeping only those most associated with baseline and post-treatment DL_CO. Three models were built to predict DL_CO abnormality: the clinical model—containing clinical information; the radiomic model—containing the radiomic score; the clinical-radiomic model—containing clinical information and the radiomic score. For the models just described, the following were constructed: Model 1 based on the features in Phase 0; Model 2 based on the features in Phase 50; Model 3 based on the difference between the two phases. The AUC was used to compare their performances. Results: A total of 98 patients met the inclusion criteria. The Charlson Comorbidity Index (CCI) scored as the clinical variable most associated with baseline DL_CO (p = 0.014), while the most associated features were mainly texture features and similar among the two phases. Clinical-radiomic models were the best at predicting both baseline and post-treatment abnormal DL_CO. In particular, the performances for the three clinical-radiomic models at predicting baseline abnormal DL_CO were AUC₁ = 0.72, AUC₂ = 0.72, and AUC₃ = 0.75, for Model 1, Model 2, and Model 3, respectively. Regarding the prediction of post-treatment abnormal DL_CO, the performances of the three clinical-radiomic models were AUC₁ = 0.91, AUC₂ = 0.91, and AUC₃ = 0.95, for Model 1, Model 2, and Model 3, respectively. Conclusions: This study demonstrates that radiomic features extracted from healthy lung parenchyma on a 4DCT scan are associated with baseline pulmonary function parameters, showing that radiomics can add a layer of information in surrogate models for lung function assessment. Preliminary results suggest the potential applicability of these models for predicting post-SBRT lung function, warranting validation in larger, prospective cohorts. Full article

Nanoimprint lithography (NIL) has emerged as a promising sub-10 nm patterning at low cost; yet, robust process control remains difficult because of time-consuming physics-based simulators and labeled SEM data scarcity. We propose a data-efficient, two-stage deep-learning framework here that directly reconstructs post-imprint SEM images from binary design layouts and delivers calibrated pixel-by-pixel uncertainty simultaneously. First, a shallow U-Net is trained on conformalized quantile regression (CQR) to output 90% prediction intervals with statistically guaranteed coverage. Moreover, per-level errors on a small calibration dataset are designed to drive an outlier-weighted and encoder-frozen transfer fine-tuning phase that refines only the decoder, with its capacity explicitly focused on regions of spatial uncertainty. On independent test layouts, our proposed fine-tuned model significantly reduces the mean absolute error (MAE) from 0.0365 to 0.0255 and raises the coverage from 0.904 to 0.926, while cutting the labeled data and GPU time by 80% and 72%, respectively. The resultant uncertainty maps highlight spatial regions associated with error hotspots and support defect-aware optical proximity correction (OPC) with fewer guard-band iterations. Extending the current perspective beyond OPC, the innovatively model-agnostic and modular design of the pipeline here allows flexible integration into other critical stages of the semiconductor manufacturing workflow, such as imprinting, etching, and inspection. In these stages, such predictions are critical for achieving higher precision, efficiency, and overall process robustness in semiconductor manufacturing, which is the ultimate motivation of this study. Full article

Medical image registration is an indispensable preprocessing step to align medical images to a common coordinate system before in-depth analysis. The registration precision is critical to the following analysis. In addition to representative image features, the initial pose settings and multiple poses in images will significantly affect the registration precision, which is largely neglected in state-of-the-art works. To address this, the paper proposes a dual-pose medical image registration algorithm based on improved differential evolution. More specifically, the proposed algorithm defines a composite similarity measurement based on contour points and utilizes this measurement to calculate the similarity between frontal–lateral positional DRR (Digitally Reconstructed Radiograph) images and X-ray images. In order to ensure the accuracy of the registration algorithm in particular dimensions, the algorithm implements a dual-pose registration strategy. A PDE (Phased Differential Evolution) algorithm is proposed for iterative optimization, enhancing the optimization algorithm’s ability to globally search in low-dimensional space, aiding in the discovery of global optimal solutions. Extensive experimental results demonstrate that the proposed algorithm provides more accurate similarity metrics compared to conventional registration algorithms; the dual-pose registration strategy largely reduces errors in specific dimensions, resulting in reductions of 67.04% and 71.84%, respectively, in rotation and translation errors. Additionally, the algorithm is more suitable for clinical applications due to its lower complexity. Full article

An iterative fractional Doppler shift and channel joint estimation algorithm is proposed for orthogonal time frequency space (OTFS) satellite communication systems. In the algorithm, we search the strongest path and estimate its fractional Doppler offset, and compensate the Doppler shift to the nearest integer to estimate the coefficient of the path. Then signal of the path and its inter-Doppler interference are reconstructed and canceled from the received data with these two estimated parameters. The estimation and cancel process are iteratively conducted until the strongest path in the remained paths is less than the predetermined threshold. The channel information can be reconstructed by the estimated parameters of the paths. The normalized mean squared error (NMSE) of the proposed channel estimation algorithm is less than 1/5 of the available algorithms at a high signal-to-noise ratio (SNR) region, and its BER has about 4dB SNR gain compared with those of the available algorithms when the bit error rate (BER) is ${10}^{-3}$. Full article

To address the challenges of image inpainting in scenarios with extensive or irregular missing regions—particularly detail oversmoothing, structural ambiguity, and textural incoherence—this paper proposes an Image Structure-Guided (ISG) framework that hierarchically integrates structural priors with semantic-aware texture synthesis. The proposed methodology advances a two-stage restoration paradigm: (1) Structural Prior Extraction, where adaptive edge detection algorithms identify residual contours in corrupted regions, and a transformer-enhanced network reconstructs globally consistent structural maps through contextual feature propagation; (2) Structure-Constrained Texture Synthesis, wherein a multi-scale generator with hybrid dilated convolutions and channel attention mechanisms iteratively refines high-fidelity textures under explicit structural guidance. The framework introduces three innovations: (1) a hierarchical feature fusion architecture that synergizes multi-scale receptive fields with spatial-channel attention to preserve long-range dependencies and local details simultaneously; (2) spectral-normalized Markovian discriminator with gradient-penalty regularization, enabling adversarial training stability while enforcing patch-level structural consistency; and (3) dual-branch loss formulation combining perceptual similarity metrics with edge-aware constraints to align synthesized content with both semantic coherence and geometric fidelity. Our experiments on the two benchmark datasets (Places2 and CelebA) have demonstrated that our framework achieves more unified textures and structures, bringing the restored images closer to their original semantic content. Full article

Compressed sensing is widely used in modern resource-constrained sensor networks. However, achieving high-quality and robust signal reconstruction under low sampling rates and noise interference remains challenging. Traditional CS methods have limited performance, so many deep learning-based CS models have been proposed. Although these models show strong fitting capabilities, they often lack the ability to handle complex noise in sensor networks, which affects their performance stability. To address these challenges, this paper proposes SBCS-Net. This framework innovatively expands the iterative process of sparse Bayesian compressed sensing using convolutional neural networks and Transformer. The core of SBCS-Net is to optimize key SBL parameters through end-to-end learning. This can adaptively improve signal sparsity and probabilistically process measurement noise, while fully leveraging the powerful feature extraction and global context modeling capabilities of deep learning modules. To comprehensively evaluate its performance, we conduct systematic experiments on multiple public benchmark datasets. These studies include comparisons with various advanced and traditional compressed sensing methods, comprehensive noise robustness tests, ablation studies of key components, computational complexity analysis, and rigorous statistical significance tests. Extensive experimental results consistently show that SBCS-Net outperforms many mainstream methods in both reconstruction accuracy and visual quality. In particular, it exhibits excellent robustness under challenging conditions such as extremely low sampling rates and strong noise. Therefore, SBCS-Net provides an effective solution for high-fidelity, robust signal recovery in sensor networks and related fields. Full article

The sparse iterative covariance-based estimation (SPICE) method has recently gained significant attraction in the field of scanning radar super-resolution imaging because of its angular resolution enhancement capability. However, it is unable to preserve the target profile, and the estimator is constrained by high computational complexity and memory consumption. In this paper, a grid-updating split SPICE-TV algorithm is presented. The method allows for the efficient updating of reconstruction results with both contour and resolution, and a recursive grid-updating implementation framework of the split SPICE-TV has the capability to reduce the computational complexity. First, the scanning radar angular super-resolution problem is transformed into a constrained optimization problem by simultaneously employing sparse covariance fitting criteria and TV regularization constraints. Then, the split Bregman method is employed to derive an efficient closed-form solution to the problem. Ultimately, the matrix inversion problem is transformed into an online iterative equation to reduce the computational complexity and memory consumption. The superiority of the proposed method is verified by simulation and experimental data. Full article

Spectral computed tomography (SCT) enables material decomposition, artifact reduction, and contrast enhancement, leveraging symmetry principles across its technical framework to enhance material differentiation and image quality. However, its nonlinear data acquisition process involving noise and scatter leads to a highly ill-posed inverse problem. To address this, we propose a dual-domain iterative reconstruction network that combines joint learning reconstruction with physical process modeling, which also uses the symmetric complementary properties of the two domains for optimization. A dedicated physical module models the SCT forward process to ensure stability and accuracy, while a residual-to-residual strategy reduces the computational burden of model-based iterative reconstruction (MBIR). Our method, which won the AAPM DL-Spectral CT Challenge, achieves high-accuracy material decomposition. Extensive evaluations also demonstrate its robustness under varying noise levels, confirming the method’s generalizability. This integrated approach effectively combines the strengths of physical modeling, MBIR, and deep learning. Full article

The segmentation of individual trees holds considerable significance in the investigation and management of forest resources. Utilizing smartphone-captured imagery combined with image-based 3D reconstruction techniques to generate corresponding point cloud data can serve as a more accessible and potentially cost-efficient alternative for data acquisition compared to conventional LiDAR methods. In this study, we present a Sparse 3D U-Net framework for single-tree segmentation which is predicated on a multi-head attention mechanism. The mechanism functions by projecting the input data into multiple subspaces—referred to as “heads”—followed by independent attention computation within each subspace. Subsequently, the outputs are aggregated to form a comprehensive representation. As a result, multi-head attention facilitates the model’s ability to capture diverse contextual information, thereby enhancing performance across a wide range of applications. This framework enables efficient, intelligent, and end-to-end instance segmentation of forest point cloud data through the integration of multi-scale features and global contextual information. The introduction of an iterative mechanism at the attention layer allows the model to learn more compact feature representations, thereby significantly enhancing its convergence speed. In this study, Dongsheng Bajia Country Park and Jiufeng National Forest Park, situated in Haidian District, Beijing, China, were selected as the designated test sites. Eight representative sample plots within these areas were systematically sampled. Forest stand sequential photographs were captured using an iPhone, and these images were processed to generate corresponding point cloud data for the respective sample plots. This methodology was employed to comprehensively assess the model’s capability for single-tree segmentation. Furthermore, the generalization performance of the proposed model was validated using the publicly available dataset TreeLearn. The model’s advantages were demonstrated across multiple aspects, including data processing efficiency, training robustness, and single-tree segmentation speed. The proposed method achieved an F1 score of 91.58% on the customized dataset. On the TreeLearn dataset, the method attained an F1 score of 97.12%. Full article

Shape-sensing optical fibers have become increasingly important in applications requiring flexible navigation, spatial awareness, and deformation monitoring. Fiber Bragg Grating (FBG) sensors inscribed in multi-core optical fibers have been democratized over the years and nowadays offer a compact and robust platform for shape reconstruction. In this work, we propose a novel, computationally efficient method for determining the 3D tip position of a bent multi-core FBG-based optical fiber using a second-order polynomial approximation of the fiber’s shape. The method begins with a calibration procedure, where polynomial coefficients are fitted for known bend configurations and subsequently modeled as a function of curvature using exponential decay functions. This allows for real-time estimation of the fiber tip position from curvature measurements alone, with no need for iterative numerical solutions or high processing power. The method was validated using miniaturized test structures and achieved sub-millimeter accuracy (<0.1 mm) over a 4.5 mm displacement range. Its simplicity and accuracy make it suitable for embedded or edge-computing applications in confined navigation, structural inspection, and medical robotics. Full article

We propose a novel approach for clustering problem, which refers to as Graph Regularized Orthogonal Subspace Non Negative Matrix Factorization (GNMFOS). This type of model introduces both graph regularization and orthogonality as penalty terms into the objective function. It not only obtains the uniqueness of matrix decomposition but also improves the sparsity of decomposition and reduces computational complexity. Most importantly, using the idea of iteration under weak orthogonality, we construct an auxiliary function for the algorithm and obtain convergence proof to compensate for the lack of convergence proof in similar models. The experimental results show that compared with classical models such as GNMF and NMFOS, our algorithm significantly improves clustering performance and the quality of reconstructed images. Full article

In order to solve the problem of mainlobe interference in small hydroacoustic array signal processing, this paper proposes a beamforming method based on the high-resolution direction of arrival (DOA) estimation and interference coherence matrix (ICM) reconstruction. The DOA estimation is first performed using an improved sparse iterative covariance-based (SPICE) method, unaffected by the coherent signal, and it can provide highly accurate DOA estimation for multiple targets. The fitted signal energy distribution obtained from the SPICE is then utilized for the reconstruction of the signal coherence matrix. The reconstructed ICM matrix is used to construct a blocking masking matrix and an eigen-projection matrix to suppress the mainlobe interference signal. Compared with existing methods, the method in this paper possesses better mainlobe interference suppression ability. Within the mainlobe interference interval angle of 3° to 13.5° from the signal of interest (SOI) based on eight-element uniform linear arrays, the method in this paper can enhance the signal-to-interference ratio (SIR) by about 15.59 dB on average compared with the interference-free suppression of conventional beamforming (CBF) and outperforms the other interference suppression methods simultaneously. Simulations and experiments demonstrate the effectiveness of this method in mainlobe interference scenarios. Full article

In the realm of 3D curve reconstruction, Non-Uniform Rational B-Splines (NURBSs) offer a versatile mathematical tool due to their ability to precisely represent complex geometries. However, achieving high fitting accuracy in stereo-based applications remains challenging, primarily due to the nonlinear nature of weight optimization. This study introduces an enhanced iterative strategy that leverages the geometric significance of NURBS weights to incrementally refine curve fitting. By formulating an inverse optimization problem guided by model deformation principles, the proposed method progressively adjusts weights to minimize reprojection error. Experimental evaluations confirm the method’s convergence and demonstrate its superiority in fitting accuracy when compared to conventional optimization techniques. Full article

Wearable laser Doppler devices are susceptible to complex noise interferences, such as Gaussian white noise, baseline drift, and motion artifacts, with motion artifacts significantly impacting clinical diagnostic accuracy. Addressing the limitations of existing denoising methods—including traditional adaptive filtering that relies on prior noise information, modal decomposition techniques that depend on empirical parameter optimization and are prone to modal aliasing, wavelet threshold functions that struggle to balance signal preservation with smoothness, and the high computational complexity of deep learning approaches—this paper proposes an ISSA-VMD-AWPTD denoising algorithm. This innovative approach integrates an improved sparrow search algorithm (ISSA), variational mode decomposition (VMD), and adaptive wavelet packet threshold denoising (AWPTD). The ISSA is enhanced through cubic chaotic mapping, butterfly optimization, and sine–cosine search strategies, targeting the minimization of the envelope entropy of modal components for adaptive optimization of VMD’s decomposition levels and penalty factors. A correlation coefficient-based selection mechanism is employed to separate target and mixed modes effectively, allowing for the efficient removal of noise components. Additionally, an exponential adaptive threshold function is introduced, combining wavelet packet node energy proportion analysis to achieve efficient signal reconstruction. By leveraging the rapid convergence property of ISSA (completing parameter optimization within five iterations), the computational load of traditional VMD is reduced while maintaining the denoising accuracy. Experimental results demonstrate that for a 200 Hz test signal, the proposed algorithm achieves a signal-to-noise ratio (SNR) of 24.47 dB, an improvement of 18.8% over the VMD method (20.63 dB), and a root-mean-square-error (RMSE) of 0.0023, a reduction of 69.3% compared to the VMD method (0.0075). The processing results for measured human blood flow signals achieve an SNR of 24.11 dB, a RMSE of 0.0023, and a correlation coefficient (R) of 0.92, all outperforming other algorithms, such as VMD and WPTD. This study effectively addresses issues related to parameter sensitivity and incomplete noise separation in traditional methods, providing a high-precision and low-complexity real-time signal processing solution for wearable devices. However, the parameter optimization still needs improvement when dealing with large datasets. Full article

Millimeter-wave (mmWave) MIMO systems have emerged as a key enabling technology for next-generation wireless networks, addressing the growing demand for ultra-high data rates through the utilization of wide bandwidths and large-scale antenna configurations. Beyond communication capabilities, these systems offer inherent advantages for integrated sensing applications, particularly in scenarios requiring precise object detection and localization. The sparse mmWave channel in the beamspace domain allows fewer radio-frequency (RF) chains by selecting dominant beams, boosting both communication efficiency and sensing resolution. However, existing channel estimation methods, such as learned approximate message passing (LAMP) networks, rely on computationally intensive iterations. This becomes particularly problematic in large-scale system deployments, where estimation inaccuracies can severely degrade sensing performance. To address these limitations, we propose a low-complexity channel estimator using a non-iterative reconstruction network (NIRNet) with a learning-based selection matrix (LSM). NIRNet employs a convolutional layer for efficient, non-iterative beamspace channel reconstruction, significantly reducing computational overhead compared to LAMP-based methods, which is vital for real-time sensing. The LSM generates a signal-aware Gaussian measurement matrix, outperforming traditional Bernoulli matrices, while a denoising network enhances accuracy under low SNR conditions, improving sensing resolution. Simulations show the NIRNet-based algorithm achieves a superior normalized mean squared error (NMSE) and an achievable sum rate (ASR) with lower complexity and reduced training overhead. Full article