Search

Sparse superresolution algorithms have been applied in scanning radar imaging to improve its azimuth resolution. However, the inverse matrix in each iteration is usually diagonal loading by the updating result, which leads to huge computational complexity for 2-D echo data. In this letter, a batch-processing superresolution framework is proposed to process the echo data in parallel. On the one hand, the optimization problem for sparse target recovery is modified as matrix form, which presents the batch-processing potential for 2-D echo data. On the other hand, the optimization problem is solved by the proposed alternating direction method of multipliers (ADMM)-based batch-processing framework, which can avoid high-dimensional matrix inversion along different range bins. Compared with traditional sparse superresolution methods, the proposed batch-processing framework is more suitable for 2-D echo data superresolution. [ABSTRACT FROM AUTHOR]

Recently, a variety of super-resolution (SR) methods have been devoted to enhancing the angular resolution of real beam mapping (RBM) imagery in modern microwave remote sensing applications. When addressing large-scale datasets, however, they suffer from notably high computational complexity due to high-dimensional matrix inversion, multiplication, or singular value decomposition (SVD). To overcome this limitation, this article presents a low-complexity SR strategy based on adaptive low-rank approximation (LRA). Our underlying idea is first to construct a random matrix sketching to sample the raw echo measurements and restore the surface map of reflectivity in a low-dimensional linear space. The resulting low-complexity strategy enables substantial computational complexity reduction for a group of SR methods, at the cost of introducing a manually adjusted LRA parameter. Using the Fourier transform-based antenna analysis method, we further reveal that the LRA parameter that ensures support resolution improvement can be determined by a closed-form function of the aperture length, the wavelength, and the field of view, allowing for adaptively and efficiently selecting the optimal LRA parameter that well balances the tradeoff between LRA error and computational efficiency. We use both simulated and real datasets to demonstrate that the proposed LRA-based SR strategy can provide significant speedup without performance loss. [ABSTRACT FROM AUTHOR]

To realize high azimuth resolution for sea-surface targets, this article proposes a superresolution imaging method that relies on the Weibull distribution. The proposed method introduces the generalized Gaussian distribution and Weibull distribution to represent the statistical distribution function of the target prior information and sea clutter, respectively. The corresponding objective function was derived under the maximum a posteriori (MAP) criterion. To address the nonlinearity of the objective function, this article adopts the Newton–Raphson iterative method to resolve it. Simulations and experimental data assessment indicate that the proposed method has superior superresolution imaging performance compared with other traditional superresolution methods for sea-surface target imaging. [ABSTRACT FROM AUTHOR]

Superresolution methods can be applied to real aperture radar (RAR) to improve its angular resolution by solving an inverse problem. However, traditional superresolution methods are achieved after batch data collection, which requires extensive operational complexity and storage space. To solve this problem for RAR, an online detect-before-reconstruct (DBR) framework is proposed in this article based on the sparse property of targets. First, along the range direction, each sample of the echo data is detected to reduce the computational complexity by reducing the dimension of the effective data. Second, along the azimuth direction, a data-adaptive online processing structure is proposed to reduce the storage requirement for the angular superresolution problem. Finally, within the online processing structure, a target data-adaptive updating strategy is proposed to reduce the number of iterations for each target grid. The online DBR-based framework can effectively reduce the operational complexity caused by the noise values of the echo data. Based on the proposed online processing structure, the storage requirement and the operational complexity of the angular superresolution for an RAR system can be greatly reduced without significant reconstruction performance loss. The results of simulations and experimental data verify the proposed framework. [ABSTRACT FROM AUTHOR]

In radar forward-looking super-resolution imaging, improving the azimuth resolution while acquiring the contour information of the target has significant research value. In this letter, an approach based on the balanced Tikhonov and total variation (TV) deconvolution is proposed for radar forward-looking super-resolution imaging. We combine the Tikhonov regularization and TV regularization to construct the objective function and resolve the respective cost function using the alternating direction method of multipliers (ADMM). In each iteration, the gradient function of the target scattering coefficient is used as the adaptive weighted parameter to control automatically the weighting between the penalty terms from TV and the Tikhonov regularization. For the target with a sharper outline, the proportion of TV regularization penalty terms is increased; for the target with a smoother outline, the proportion of penalty term from the Tikhonov regularization is enhanced. The simulation and experimental results are considered to show the effectiveness of the proposed method. Compared with traditional super-resolution imaging methods, the proposed approach has superior outline retention capacity. [ABSTRACT FROM AUTHOR]

Total variation-sparse (TV-sparse)-based multiconstraint devonvolution method has been used to realize superresolution imaging and preserve target contour information simultaneously of radar forward-looking imaging. However, due to the existence of matrix inversion, it suffers from high computational complexity, which restricts the ability of radar real-time imaging. In this article, an Gohberg–Semencul (GS) decomposition-based fast TV-sparse (FTV-sparse) method is proposed to reduce the computational complexity of TV-sparse method. The acceleration strategy utilizes the low displacement rank features of Toeplitz matrix, realizing fast matrix inversion by using a GS representation. It reduces the computational complexity of traditional TV-sparse method from $O(N^3)$ to $O(N^2)$ , benefiting for improvement of the computing efficiency. The simulation and experimental data processing results show that the proposed FTV-sparse method has almost no resolution loss compared with the traditional TV sparse method. Hardware test results show that the proposed FTV-sparse method significantly improves the computational efficiency of TV-sparse method. [ABSTRACT FROM AUTHOR]

Real-aperture radar can be utilized to realize forward-looking imaging by antenna scanning the imaging region. However, low azimuth resolution seriously affects its practical application. Although traditional super-resolution methods could enhance azimuth resolution to a certain extent, effective preservation of contour information for important targets still remains to be a problem. In this article, a method of total variation-sparse (TV-sparse) multiconstraint deconvolution is proposed to improve azimuth resolution of forward-looking imaging as well as preserve contour information of important targets. Since our interested targets usually appear to be sparse, the sparse constraint of the target is introduced first to achieve high resolution of forward-looking images, which may cause the loss of target contour information in the meantime. Second, total variation (TV) constraint is introduced based on the sparse constraint, converting traditional single-constraint super-resolution problem to a multiconstraint problem. We then use the split Bregman algorithm (SBA) to solve the multiconstraint problem, whose solution is the super-resolution image of radar forward-looking region. Compared with traditional super-resolution methods, the proposed method can improve the azimuth resolution of radar forward-looking imaging as well as better restore target contour information by adjusting respective weights of sparse constraint and TV constraint. Finally, the performance of the proposed method is validated with the simulation and measured data. [ABSTRACT FROM AUTHOR]

Airborne forward-looking radar (AFLR) imaging has raised many concerns in fields of Earth observation, independent of weather and daytime. Constrained by imaging principles, conventional high-resolution radar imaging techniques such as synthetic aperture radar (SAR) and Doppler beam sharpening (DBS) are incapable of AFLR imaging. The real aperture radar (RAR) can obtain AFLR images using a scanning antenna, but suffers from coarse cross-range resolution. Recently, there has been much attention paid to the iterative adaptive approach (IAA), which draws from the benefits of RAR imaging and provides improved cross-range resolution. However, earlier work on the IAA imposed a convolution model on the received azimuth echo, neglecting the effect of the Doppler phase. This model mismatch degrades the imaging performance for moving platforms. To settle this problem, this paper first establishes a Doppler-convolution model of AFLR imaging, where both Doppler phase and antenna convolution effects are considered, allowing more accurate reconstruction when applying the IAA to formulate a super-resolution image. Then, a data-depended approach for Doppler centroid estimation is proposed to circumvent the problem of low estimation precision using platform motion parameters delivered by navigational devices mounted on the radar platform. Simulation results demonstrate that the proposed implementation of the IAA based on the Doppler-convolution model and Doppler centroid estimation can overcome the deficiencies of the SAR and DBS techniques in the forward-looking imaging direction, and present a noticeably superior performance as compared with conventional AFLR imaging methods. [ABSTRACT FROM AUTHOR]

Forward-looking radar plays an important role in many military and civilian fields. However, the problem of low azimuth resolution has restricted its applications seriously. Although many methods have been used to achieve azimuth superresolution, the traditional methods suffer from noise amplification or limited resolution under low signal-to-noise (SNR) condition. In this paper, we proposed a Bayesian deconvolution method which relies on linearized Bregman to achieve azimuth superresolution of forward-looking radar imaging. We first used the complex Gaussian distribution and Laplace distribution to describe the distribution of noise and targets, respectively, and transformed the superresolution problem into a convex optimization problem by maximum a posteriori estimation in the Bayesian framework. Second, linearized Bregman algorithm was used to solve the convex optimization problem. The proposed method introduces the prior information of noise and target, and overcomes the ill-posedness of deconvolution. As a result, the azimuth resolution is remarkably enhanced. Besides, the proposed method has high computational efficiency by linearizing objection function, so it can take both time cost and resolution improvement into consideration. Finally, the superior performance was verified by simulation and experimental data. [ABSTRACT FROM AUTHOR]

Recently, the iterative adaptive approach (IAA) was adopted to allow for the estimation of high-resolution scanning radar images. In this letter, we further develop this approach by introducing a range-recursive IAA (IAA-RR) formulation allowing for a computationally efficient updating of the resulting estimates along range. Besides exploiting the rich matrix structure to mitigate the computational complexity for each iteration, the correlation between adjacent range cells is exploited to accelerate the convergence of the IAA iterations. When an additional range measurement becomes available, further acceleration is available by exploiting the estimates already formed for the adjacent range cells. Compared with the existing fast IAA implementation, the proposed IAA-RR is shown to offer significant computational savings, without noticeable loss in performance. Numerical results illustrate the superior performance of the proposed IAA-RR algorithm. [ABSTRACT FROM PUBLISHER]

In this letter, an improved regularized iterative adaptive approach (IAA) is proposed for scanning radar angular superresolution. Because the IAA requires matrix inversion, the increasing condition number of the covariance matrix leads to the ill-posed problem of the IAA. Based on this reality, the diagonal loading method is introduced to solve the ill-posed problem. Because the loading value controls the tradeoff between the azimuth resolution and noise amplification, we use the radiometer uncertainty principle to determine the optimum loading value. When compared with the existing angular superresolution approaches, the proposed regularized IAA is shown to provide significant resolution improvement. Numerical results illustrate the superior performance of the proposed regularized IAA. [ABSTRACT FROM PUBLISHER]

Angular superresolution technique is of great significance in enhancing the azimuth resolution when the real aperture is constrained. Recently, based on weighted least squares (WLS), the iterative adaptive approach (IAA) has been applied to scanning radar angular superresolution. The resulting estimates present noticeably superior performance compared with the existing approaches. However, the improved performance of IAA comes at the cost of high computational complexity. In this paper, a scheme of fast IAA (IAA-F) is proposed for mitigating the computational burden. First, based on the circulant structure of the steering matrix, the covariance matrix and WLS estimates are rewritten by fast convolution. Second, according to the similar block tridiagonal property between the covariance matrix and Schur complement of its submatrix, the fast matrix inversion works in an improved divide and conquer (D&C) approach, by recursively breaking down the problem of fast inversion into the same subproblem. Numerical results illustrate that the proposed IAA-F offers a time complexity reduction without loss of performance. [ABSTRACT FROM PUBLISHER]

Scanning radar enables wide-range imaging through antenna scanning and is widely used for radar warning. The Rayleigh criterion indicates that narrow beams of radar are required to improve the azimuth resolution. However, a narrower beam means a larger antenna aperture. In practical applications, due to platform limitations, the antenna aperture is limited, resulting in a low azimuth resolution. The conventional sparse super-resolution method (SSM) has been proposed for improving the azimuth resolution of scanning radar imaging and achieving superior performance. This method uses the L 1 norm to represent the sparse prior of the target and solves the L 1 regularization problem to achieve super-resolution imaging under the regularization framework. The resolution of strong-point targets is improved efficiently. However, for some targets with typical shapes, the strong sparsity of the L 1 norm treats them as strong-point targets, resulting in the loss of shape characteristics. Thus, we can only see the strong points in its processing results. However, in some applications that need to identify targets in detail, SSM can lead to false judgments. In this paper, a sparse denoising-based super-resolution method (SDBSM) is proposed to compensate for the deficiency of traditional SSM. The proposed SDBSM uses a sparse minimization scheme for denoising, which helps to reduce the influence of noise. Then, the super-resolution imaging is achieved by alternating iterative denoising and deconvolution. As the proposed SDBSM uses the L 1 norm for denoising rather than deconvolution, the strong sparsity constraint of the L 1 norm is reduced. Therefore, it can effectively preserve the shape of the target while improving the azimuth resolution. The performance of the proposed SDBSM was demonstrated via simulation and real data processing results. [ABSTRACT FROM AUTHOR]

Deconvolution methods can be used to improve the azimuth resolution in airborne radar imaging. Due to the sparsity of targets in airborne radar imaging, an L 1 regularization problem usually needs to be solved. Recently, the Split Bregman algorithm (SBA) has been widely used to solve L 1 regularization problems. However, due to the high computational complexity of matrix inversion, the efficiency of the traditional SBA is low, which seriously restricts its real-time performance in airborne radar imaging. To overcome this disadvantage, a fast split Bregman algorithm (FSBA) is proposed in this paper to achieve real-time imaging with an airborne radar. Firstly, under the regularization framework, the problem of azimuth resolution improvement can be converted into an L 1 regularization problem. Then, the L 1 regularization problem can be solved with the proposed FSBA. By utilizing the low displacement rank features of Toeplitz matrix, the proposed FSBA is able to realize fast matrix inversion by using a Gohberg–Semencul (GS) representation. Through simulated and real data processing experiments, we prove that the proposed FSBA significantly improves the resolution, compared with the Wiener filtering (WF), truncated singular value decomposition (TSVD), Tikhonov regularization (REGU), Richardson–Lucy (RL), iterative adaptive approach (IAA) algorithms. The computational advantage of FSBA increases with the increase of echo dimension. Its computational efficiency is 51 times and 77 times of the traditional SBA, respectively, for echoes with dimensions of 218 × 400 and 400 × 400 , optimizing both the image quality and computing time. In addition, for a specific hardware platform, the proposed FSBA can process echo of greater dimensions than traditional SBA. Furthermore, the proposed FSBA causes little performance degradation, when compared with the traditional SBA. [ABSTRACT FROM AUTHOR]