Search Results (42)

Infrared and visible image fusion aims to synergistically combine the thermal target saliency of infrared images with the rich textual details of visible images. To address the limitations of traditional multi-scale methods in terms of target-background contrast and detail preservation, this paper introduces a novel multi-scale pyramid cross-layer fusion framework. The core of this framework lies in a thermal expansion-based target separation mechanism for superior hierarchical decomposition. Source images are first decomposed via a Gaussian–Laplacian pyramid for multi-resolution representation. By exploiting infrared thermal saliency and visible geometric priors, the scene is explicitly segregated into a target layer and a background layer. The target layer employs deep feature extraction based on Iteratively Reweighted Nuclear Norm minimization to sharpen thermal prominences and enhance contrast; concurrently, the background layer undergoes a cross-modal, cross-layer consistency fusion strategy, integrating spatial textures across frequency bands to maintain structural fidelity and detail richness. This dual-layer paradigm, augmented by multi-scale aggregation, ensures seamless, artifact-free fusion. To comprehensively evaluate the proposed method, systematic experiments are conducted on two benchmark datasets: TNO and RoadScene. Evaluations on the dataset demonstrate that our method outperforms state-of-the-art baselines. Extended experiments on the MSRS dataset further confirm the strong generalization capability and robustness of our method. Furthermore, systematic hyperparameter experiments determine the optimal model configuration, and ablation studies substantiate the effective contribution of both the pyramid segregation module and the IRNN optimization module to the final fusion performance. Extensive hyperparameter testing identified the optimal setup, and ablation studies confirmed the contribution of each key module. Overall, our fusion algorithm demonstrates satisfactory performance in the experiments, representing a clear advance. Full article

Physics-informed neural networks (PINNs) solve partial differential equations (PDEs) by embedding physical conditions as soft penalties into the loss function. However, the coexistence of multiple loss components often leads to gradient conflicts, degrading convergence and solution accuracy. To address this issue, we propose a dynamic domain–gradient loss reweighting PINN (DDR-PINN). The proposed method introduces a dual-residual reweighting mechanism based on gradient variations, where adaptive weights are derived from the L2 norm of the dot product between loss gradients and residuals. These weights are further normalized through a nonlinear hyperbolic tangent transformation, enabling dynamic and balanced reweighting of interior, initial, and boundary domain losses throughout training. Extensive numerical experiments on PDEs with both Dirichlet and Neumann boundary conditions demonstrate that the DDR-PINN consistently outperforms the standard PINN, APINN, and VI-PINN with the fewest trainable parameters. Full article

Images captured by vision sensors in outdoor environments often suffer from haze-induced degradations, including blurred details, faded colors, and reduced visibility, which severely impair the performance of sensing and perception systems. To address this issue, we propose a haze-removal algorithm for hazy images using multiple variational constraints. Based on the classic atmospheric scattering model, a mixed variational framework is presented that incorporates three regularization terms for the transmission map and scene radiance. Concretely, an ${\ell }_p$ norm and an ${\ell }_2$ norm were constructed to jointly enforce the transmissions for smoothing the details and preserving the structures, and a weighted ${\ell }_1$ norm was devised to constrain the scene radiance for suppressing the noises. Furthermore, our devised weight function takes into account both the local variances and the gradients of the scene radiance, which adaptively perceives the textures and structures and controls the smoothness in the process of image restoration. To address the mixed variational model, a re-weighted least square strategy was employed to iteratively solve two separated subproblems. Finally, a gamma correction was applied to adjust the overall brightness, yielding the final recovered result. Extensive comparisons with state-of-the-art methods demonstrated that our proposed algorithm produces visually satisfactory results with a superior clarity and vibrant colors. In addition, our proposed algorithm demonstrated a superior generalization to diverse degradation scenarios, including low-light and remote sensing hazy images, and it effectively improved the performance of high-level vision tasks. Full article

This paper proposes a new proximal iteratively reweighted nuclear norm method for a class of nonconvex and nonsmooth optimization problems. The primary contribution of this work is the incorporation of line search technique based on dimensionality reduction and extrapolation. This strategy overcomes parameter constraints by enabling adaptive dynamic adjustment of the extrapolation/proximal parameters (α_k, β_k, μ_k). Under the Kurdyka–Łojasiewicz framework for nonconvex and nonsmooth optimization, we prove the global convergence and linear convergence rate of the proposed algorithm. Additionally, through numerical experiments using synthetic and real data in matrix completion problems, we validate the superior performance of the proposed method over well-known methods. Full article

Xishuangbanna cucumber (Cucumis sativus L. var. xishuangbannanesis), as a rare and endangered cucumber germplasm resource, possesses certain irreplaceable characteristics that make it difficult to reacquire once lost. To ensure long-term preservation of this germplasm, immediate propagation and regeneration are required after successful collection. Current germplasm management relying on conventional viability testing methods often leads to seed loss. Therefore, there is an urgent need to develop a rapid and non-destructive testing technology for assessing the seed viability of Xishuangbanna cucumber. This study integrated hyperspectral imaging technology with various data preprocessing methods, feature wavelength selection algorithms, and classification models to achieve rapid and non-destructive detection of Xishuangbanna cucumber seed viability. Hyperspectral imaging was employed to acquire spectral data from the seeds. Preprocessing methods including MSC (Multivariate Scattering Correction), SNV (Standard Normal Variety), FD (First Derivative), SD (Second Derivative), and L2NN (L2 Norm Normalization) were applied to enhance spectral data quality. Feature selection algorithms such as UVE (Uninformative Variables Elimination), SPA (Successive Projections Algorithm), and CARS (Competitive Adaptive Reweighted Sampling) were utilized to identify optimal spectral bands. Combined with KNN (K-Nearest Neighbor) and LogitBoost algorithms, predictive models for seed viability were established. The results demonstrated that the L2NN-KNN model outperformed other models, achieving an accuracy of 83.33%, precision of 86.99%, and an F1-score of 0.83. This study confirms that hyperspectral imaging combined with machine learning can effectively predict the viability of Xishuangbanna cucumber seeds, providing a novel technical approach for the conservation of rare and endangered cucumber germplasm resources. The findings hold significant implications for promoting long-term preservation and sustainable utilization of this valuable genetic material. Full article

Compared to conventional single-aperture infrared cameras, the bio-inspired infrared compound eye camera integrates the advantages of infrared imaging technology with the benefits of multi-aperture systems, enabling simultaneous information acquisition from multiple perspectives. This enhanced detection capability demonstrates unique performance in applications such as autonomous driving, surveillance, and unmanned aerial vehicle reconnaissance. Current single-aperture small target detection algorithms fail to exploit the spatial relationships among compound eye apertures, thereby underutilizing the inherent advantages of compound eye imaging systems. This paper proposes a low-rank and sparse decomposition method based on bio-inspired infrared compound eye image features for small target detection. Initially, a compound eye structural weighting operator is designed according to image characteristics, which enhances the sparsity of target points when combined with the reweighted $l_1$-norm. Furthermore, to improve detection speed, the structural tensor of the effective imaging region in infrared compound eye images is reconstructed, and the Representative Coefficient Total Variation method is employed to avoid complex singular value decomposition and regularization optimization computations. Our model is efficiently solved using the Alternating Direction Method of Multipliers (ADMM). Experimental results demonstrate that the proposed model can rapidly and accurately detect small infrared targets in bio-inspired compound eye image sequences, outperforming other comparative algorithms. Full article

Accurate and efficient white-spot defects detection for the surface of galvanized strip steel is one of the most important guarantees for the quality of steel production. It is a fundamental but “hard” small target detection problem due to its small pixel occupation in low-contrast images. By fully exploiting the low-rank and sparse prior information of a surface defect image, a Schatten-p norm-based low-rank tensor decomposition (SLRTD) method is proposed to decompose the defect image into low-rank background, sparse defect, and random noise. Firstly, the original defect images are transformed into a new patch-based tensor mode through data reconstruction for mining valuable information of the defect image. Then, considering the over-shrinkage problem in the low-rank component estimation caused by a vanilla nuclear norm and a weighted nuclear norm, a nonlinear reweighting strategy based on a Schatten $p$-norm is incorporated to improve the decomposition performance. Finally, a solution framework is proposed via a well-designed alternating direction method of multipliers to obtain the white-spot defect target image by a simple segmenting algorithm. The white-spot defect dataset from a real-world galvanized strip steel production line is constructed, and the experimental results demonstrate that the proposed SLRTD method outperforms existing state-of-the-art methods qualitatively and quantitatively. Full article

Data acquisition and high-dimensional signal processing often require the recovery of sparse representations of signals to minimize the resources needed for data collection. ${\ell }_p$ quasi-norm minimization excels in exactly reconstructing sparse signals from fewer measurements, but it is NP-hard and challenging to solve. In this paper, we propose two distinct Iteratively Re-weighted ${\ell }_1$ Minimization (IR${\ell }_1$) formulations for solving this non-convex sparse recovery problem by introducing two novel reweighting strategies. These strategies ensure that the $ϵ$-regularizations adjust dynamically based on the magnitudes of the solution components, leading to more effective approximations of the non-convex sparsity penalty. The resulting IR${\ell }_1$ formulations provide first-order approximations of tighter surrogates for the original ${\ell }_p$ quasi-norm objective. We prove that both algorithms converge to the true sparse solution under appropriate conditions on the sensing matrix. Our numerical experiments demonstrate that the proposed IR${\ell }_1$ algorithms outperform the conventional approach in enhancing recovery success rate and computational efficiency, especially in cases with small values of p. Full article

Least-squares reverse time migration (LSRTM) is an advanced seismic imaging technique that reconstructs subsurface models by minimizing the residuals between simulated and observed data. Mathematically, the LSRTM inversion of the sub-surface reflectivity is a large-scale, highly ill-posed sparse inverse problem, where conventional inversion methods typically lead to poor imaging quality. In this study, we propose a regularized LSRTM method based on the flexible Krylov subspace inversion framework. Through the strategy of the Krylov subspace projection, a basis set for the projection solution is generated, and then the inversion of a large ill-posed problem is expressed as the small matrix optimization problem. With flexible preconditioning, the proposed method could solve the sparse regularization LSRTM, like with the Tikhonov regularization style. Sparse penalization solution is implemented by decomposing it into a set of Tikhonov penalization problems with iterative reweighted norm, and then the flexible Golub–Kahan process is employed to solve the regularization problem in a low-dimensional subspace, thereby finally obtaining a sparse projection solution. Numerical tests on the Valley model and the Salt model validate that the LSRTM based on Krylov subspace method can effectively address the sparse inversion problem of subsurface reflectivity and produce higher-quality imaging results. Full article

Water quality in aquaculture has a direct impact on the growth and development of the aquatic organisms being cultivated. The rapid, accurate and comprehensive control of water quality in aquaculture ponds is crucial for the management of aquaculture water environments. Traditional water quality monitoring methods often use manual sampling, which is not only time-consuming but also reflects only small areas of water bodies. In this study, unmanned aerial vehicles (UAV) equipped with high-spectral cameras were used to take remote sensing images of experimental aquaculture ponds. Concurrently, we manually collected water samples to analyze critical water quality parameters, including total nitrogen (TN), ammonia nitrogen (NH₄⁺-N), total phosphorus (TP), and chemical oxygen demand (COD). Regression models were developed to assess the accuracy of predicting these parameters based on five preprocessing techniques for hyperspectral image data (L2 norm, Savitzky–Golay, first derivative, wavelet transform, and standard normal variate), two spectral feature selection methods were utilized (successive projections algorithm and competitive adaptive reweighted sampling), and three machine learning algorithms (extreme learning machine, support vector regression, and eXtreme gradient boosting). Additionally, a deep learning model incorporating the full spectrum was constructed for comparative analysis. Ultimately, according to the determination coefficient (R²) of the model, the optimal prediction model was selected for each water quality parameter, with R² values of 0.756, 0.603, 0.94, and 0.858, respectively. These optimal models were then utilized to visualize the spatial concentration distribution of each water quality parameter within the aquaculture district, and evaluate the rationality of the model prediction by combining manual detection data. The results show that UAV hyperspectral technology can rapidly reverse the spatial distribution map of water quality of aquaculture ponds, realizing rapid and accurate acquisition for the quality of aquaculture water, and providing an effective method for monitoring aquaculture water 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

In recent years, one-bit quantization has attracted widespread attention in the field of direction-of-arrival (DOA) estimation as a low-cost and low-power solution. Many researchers have proposed various estimation algorithms for one-bit DOA estimation, among which atomic norm minimization algorithms exhibit particularly attractive performance as gridless estimation algorithms. However, current one-bit DOA algorithms with atomic norm minimization typically rely on approximating the trace function, which is not the optimal approximation and introduces errors, along with resolution limitations. To date, there have been few studies on how to enhance resolution under the framework of one-bit DOA estimation. This paper aims to improve the resolution constraints of one-bit DOA estimation. The log-det heuristic is applied to approximate and solve the atomic norm minimization problem. In particular, a reweighted binary atomic norm minimization with noise assumption constraints is proposed to achieve high-resolution and robust one-bit DOA estimation. Finally, the alternating direction method of multipliers algorithm is employed to solve the established optimization problem. Simulations are conducted to demonstrate that the proposed algorithm can effectively enhance the resolution. Full article

The harvest year of maize seeds has a significant impact on seed vitality and maize yield. Therefore, it is vital to identify new seeds. In this study, an on-line near-infrared (NIR) spectra collection device (899–1715 nm) was designed and employed for distinguishing maize seeds harvested in different years. Compared with least squares support vector machine (LS-SVM), k-nearest neighbor (KNN), and extreme learning machine (ELM), the partial least squares discriminant analysis (PLS-DA) model has the optimal recognition performance for maize seed harvest years. Six different preprocessing methods, including Savitzky–Golay smoothing (SGS), standard normal variate transformation (SNV), multiplicative scatter correction (MSC), Savitzky–Golay 1 derivative (SG-D1), Savitzky–Golay 2 derivative (SG-D2), and normalization (Norm), were used to improve the quality of the spectra. The Monte Carlo cross-validation uninformative variable elimination (MC-UVE), competitive adaptive reweighted sampling (CARS), bootstrapping soft shrinkage (BOSS), successive projections algorithm (SPA), and their combinations were used to obtain effective wavelengths and decrease spectral dimensionality. The MC-UVE-BOSS-PLS-DA model achieved the classification with an accuracy of 88.75% using 93 features based on Norm preprocessed spectral data. This study showed that the self-designed NIR collection system could be used to identify the harvested years of maize seed. Full article

Sub-Nyquist synthetic aperture radar (SAR) based on pseudo-random time–space modulation has been proposed to increase the swath width while preserving the azimuthal resolution. Due to the sub-Nyquist sampling, the scene can be recovered by an optimization-based algorithm. However, these methods suffer from some issues, e.g., manually tuning difficulty and the pre-definition of optimization parameters, and a low signal–noise ratio (SNR) resistance. To address these issues, a reweighted optimization algorithm, named pseudo-ℒ₀-norm optimization algorithm, is proposed for the sub-Nyquist SAR system in this paper. A modified regularization model is first built by applying the scene prior information to nearly acquire the number of nonzero elements based on Bayesian estimation, and then this model is solved by the Cauchy–Newton method. Additionally, an error correction method combined with our proposed pseudo-ℒ₀-norm optimization algorithm is also present to eliminate defocusing in the motion-induced model. Finally, experiments with simulated signals and strip-map TerraSAR-X images are carried out to demonstrate the effectiveness and superiority of our proposed algorithm. Full article

Multiband antenna arrays have the capability of effectively working in multiple frequency bands and thus significantly simplify the antenna system. To further reduce the system overhead, this paper discusses the joint design of antenna selection and adaptive beamforming for multiband antenna arrays, where the sidelobe level is also controlled so as to alleviate the effect of unknown sporadic interference. Based on the maximum signal-to-interference-plus-noise ratio (SINR) criterion and sidelobe level constraints, the proposed multiband sparse array design is formulated into a nonconvex constrained nonlinear optimization problem with an $l_{0,2}$-mixed norm regularization. This problem ensures that the same antenna positions are selected at all operating frequencies while the beamformer weights of each frequency are optimized independently. By exploiting the semi-definite relaxation and the reweighted $l_{1,\infty }$-norm approximation, the problem is converted into a series of convex subproblems and is then effectively solved by the proposed iterative reweighted method. Numerical results show that the proposed multiband sparse array significantly reduces the sidelobe levels in all operating frequencies while maintaining the maximum SINR, so it provides superior performance of interference suppression. Full article