In this paper, we study the ratio of the $L_1 $ and $L_2 $ norms, denoted as $L_1/L_2$, to promote sparsity. Due to the nonconvexity and nonlinearity, there has been little attention to this scale-...
6 April 2020 in IEEE Transactions on Signal Processing
In this paper, we consider the $L_1/L_2$ minimization for sparse recovery and study its relationship with the $L_1- \alpha L_2$ model. Based on this relationship, we propose three numerical algorithms to minimize this ratio model, two of which work as adaptive schemes and greatly reduce the computation time. Focusing on two adaptive schemes, we discuss their connection to existing approaches and analyze their convergence. The experimental results demonstrate the proposed approaches are comparable to the state-of-the-art methods in sparse recovery and work particularly well when the ground-truth signal has a high dynamic range. Lastly, we reveal some empirical evidence on the exact $L_1$ recovery under various combinations of sparsity, coherence, and dynamic ranges, which calls for theoretical justification in the future.
1 January 2021 in SIAM Journal on Imaging Sciences
In this paper, we consider minimizing the $L_1/L_2$ term on the gradient for a limited-angle scanning problem in computed tomography (CT) reconstruction. We design a specific splitting framework fo...
In this paper, we study the L1 / L2 minimization on the gradient for imaging applications. Several recent works have demonstrated that L1 / L2 is better than the L1 norm when approximating the L0 norm to promote sparsity. Consequently, we postulate that applying L1 / L2 on the gradient is better than the classic total variation (the L1 norm on the gradient) to enforce the sparsity of the image gradient. Numerically, we design a specific splitting scheme, under which we can prove subsequential and global convergence for the alternating direction method of multipliers (ADMM) under certain conditions. Experimentally, we demonstrate visible improvements of L1 / L2 over L1 and other nonconvex regularizations for image recovery from low-frequency measurements and two medical applications of magnetic resonance imaging and computed tomography reconstruction. Finally, we reveal some empirical evidence on the superiority of L1 / L2 over L1 when recovering piecewise constant signals from low-frequency measurements to shed light on future works.
1 January 2019 in SIAM Journal on Imaging Sciences
We consider the high-resolution imaging problem of 3-dimensional (3D) point source image recovery from 2-dimensional data using a method based on point spread function (PSF) engineering. The method involves a new technique, recently proposed by Prasad, based on the use of a rotating PSF with a single lobe to obtain depth from defocus. The amount of rotation of the PSF encodes the depth position of the point source. Applications include high-resolution single molecule localization microscopy as well as the problem addressed in this paper on localization of space debris using a space-based telescope. The localization problem is discretized on a cubical lattice where the coordinates of nonzero entries represent the 3D locations and the values of these entries the fluxes of the point sources. Finding the locations and fluxes of the point sources is a large-scale sparse 3D inverse problem. A new non-convex regularization method with a data-fitting term based on Kullback--Leibler (KL) divergence is proposed for 3D localization for the Poisson noise model. In addition, we propose a new scheme of estimation of the source fluxes from the KL data-fitting term. Numerical experiments illustrate the efficiency and stability of the algorithms that are trained on a random subset of image data before being applied to other images. Our 3D localization algorithms can readily be applied to other kinds of depth-encoding PSFs as well.
28 August 2023 in IEEE Transactions on Geoscience and Remote Sensing
Integrating a low-resolution hyperspectral image and a high-resolution multispectral image is widely acknowledged as an effective approach for generating a high-resolution hyperspectral image. Recent studies have highlighted the nuclear norm as an efficient method for this problem through the utilization of low-rankness. However, the standard nuclear norm has a limitation due to treating singular values equally. To address this issue, we have incorporated the concept of the weighted nuclear norm from the image denoising problem into hyperspectral image fusion, ensuring the retention of crucial data components. Furthermore, we propose a unified framework which integrates the weighted nuclear norm, a sparse prior, and total variation regularization. This framework utilizes the ℓ 1 norm of coefficients to promote spatial-spectral sparsity in the fused images, while total variation is employed to preserve the spatial piecewise smooth structure. To efficiently solve the proposed model, we have designed an alternating direction method of multipliers. The experimental results show that our proposed approach surpasses the state-of-the-art methods.