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]

In recent years, sparse direction-of-arrival (DOA) estimation for multiple-input multiple-output (MIMO) radar has attracted extensive attention and been extensively studied, especially the method based on the classic least absolute shrinkage and selection operator (LASSO) estimator. The alternating-direction method of multipliers (ADMM) is an effective method for solving this problem at the cost of introducing an additional user parameter. To avoid introducing an additional user parameter, this paper adopts an equivalent transformation in the form of the generalized SParse Iterative Covariance-based Estimation (qSPICE) cost function to obtain a mean squared minimized form of the cost function. Then, the problem is transformed into a sparse optimization problem in the form of a weighted LASSO. Next, this unconstrained optimization problem is decomposed into three subproblems, which are solved separately to reduce the dimension of each problem and thus reduce the overall computational complexity based on ADMM. Simulation results and measured data indicate that the proposed method significantly outperforms the traditional super-resolution DOA estimation method and ADMM-LASSO method and slightly outperforms qSPICE in terms of resolution and sidelobe suppression capability. In addition, the proposed method has a much lower computational complexity and substantially fewer iterations than qSPICE. [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]

The least absolute shrinkage and selection operator (LASSO) algorithm is a promising method for sparse source location in time–division multiplexing (TDM) multiple–input, multiple–output (MIMO) radar systems, with notable performance gains in regard to resolution enhancement and side lobe suppression. However, the current batch LASSO algorithm suffers from high–computational complexity when dealing with massive TDM–MIMO observations, due to high–dimensional matrix operations and the large number of iterations. In this paper, an online LASSO method is proposed for efficient direction–of–arrival (DOA) estimation of the TDM–MIMO radar based on the receiving features of the sub–aperture data blocks. This method recursively refines the location parameters for each receive (RX) block observation that becomes available sequentially in time. Compared with the conventional batch LASSO method, the proposed online DOA method makes full use of the TDM–MIMO reception time to improve the real–time performance. Additionally, it allows for much less iterations, avoiding high–dimensional matrix operations, allowing the computational complexity to be reduced from O K 3 to O K 2 . Simulated and real–data results demonstrate the superiority and effectiveness of the proposed method. [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]

Cross-resolution enhancement for airborne high-squint radar (AHSR) imagery is mathematically equivalent to the ill-conditioned problem of inverse-scattering reconstruction. Although a variety of inversion methods with regularization can be introduced to advance the field of AHSR imagery, they turn out to be computationally intensive when extended to 2-D (range and cross-range dimension) image formulation due to the range-by-range calculation for the space-variant inversion operators over the full range swath. To tackle the problem of efficiency, this article presents a low-complexity inverse-scattering strategy. Our underlying idea is to equalize the space-variant Doppler centroid embedded in an inversion operator for a reference range cell using Doppler centroid compensation. With the proposed strategy, the necessary computational complexity required for 2-D AHSR inverse-scattering reconstruction can be significantly reduced by requiring only the calculation of the inversion operator, independently of the number of range cells. Our experimental assessment, conducted using both the simulation and real data, demonstrates that our proposed inverse-scattering strategy offers preferable computational reduction in the task of inverse-scattering reconstruction for 2-D AHSR imagery without resolution loss. [ABSTRACT FROM AUTHOR]

Marine radar plays a significant role in ship navigation. However, when contending with interference among cosailing navigation radars, the echo data may be unintentionally corrupted, and it becomes challenging to obtain high-quality imagery using current radar imaging methods. To overcome this problem, an efficient anti-interference imaging framework is presented in this article based on the theory of nonuniform sampling. First, a beam-recursive anti-interference method based on the signal-to-interference-plus-noise ratio (SINR) estimation is proposed to compensate for the shortcoming of the traditional interference rejection method. Second, a nonuniform sampling model is established to well model the echo data with missing samples, which facilitates reconstructing the marine radar imagery from the missing echo data. Finally, a fast super-resolution method based on the dimension-reduction iterative adaptive approach (DRIAA) is proposed to reconstruct the distribution of sea-surface targets at a much lower computational complexity. Simulated and experimental results demonstrate that our anti-interference imaging framework can provide radar imagery with higher quality and lower computational complexity than the existing radar imaging methods in the presence of unintentional interference. [ABSTRACT FROM AUTHOR]

The generalized sparse iterative covariance-based estimation ($q$ -SPICE) algorithm was recently introduced for scanning radar applications, resulting in substantial improvements in the angular resolution and quality of the processed images. Regrettably, the computational complexity and storage cost are high and quickly increase with growing data size, limiting the applicability of the estimator. In this letter, we strive to alleviate this problem, deriving a beam-updating $q$ -SPICE algorithm, allowing for efficiently updating of the sparse reconstruction result for each online radar measurement along the scanned beam. The resulting method is a regularized extension of the current online $q$ -SPICE implementation, which not only offers constant computational and storage cost, independent of the data size, but also provides enhanced robustness over the current online $q$ -SPICE. Our experimental assessment, conducted using both simulated and real data, demonstrates the advantage of the beam-updating $q$ -SPICE method in the task of sparse reconstruction for scanning radar. [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]

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]

Recently, the generalized sparse iterative covariance-based estimation algorithm was extended to allow for varying norm constraints in scanning radar applications. In this paper, further to this development, we introduce a wideband dictionary framework which can provide a computationally efficient estimation of sparse signals. The technique is formed by initially introducing a coarse grid dictionary constructed from integrating elements, spanning bands of the considered parameter space. After forming estimates of the initially activated bands, these are retained and refined, whereas nonactivated bands are discarded from the further optimization, resulting in a smaller and zoomed dictionary with a finer grid. Implementing this scheme allows for reliable sparse signal reconstruction, at a much lower computational cost as compared to directly forming a larger dictionary spanning the whole parameter space. Simulation and real data processing results demonstrate that the proposed wideband estimator offers significant computational savings, without noticeable loss of performance. [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]

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]

The super-resolution method has been widely used for improving azimuth resolution for radar forward-looking imaging. Typically, it can be achieved by solving an undifferentiable L 1 regularization problem. The split Bregman algorithm (SBA) is a great tool for solving this undifferentiable problem. However, its real-time imaging ability is limited to matrix inversion and iterations. Although previous studies have used the special structure of the coefficient matrix to reduce the computational complexity of each iteration, the real-time performance is still limited due to the need for hundreds of iterations. In this paper, a superfast SBA (SFSBA) is proposed to overcome this shortcoming. Firstly, the super-resolution problem is transmitted into an L 1 regularization problem in the framework of regularization. Then, the proposed SFSBA is used to solve the nondifferentiable L 1 regularization problem. Different from the traditional SBA, the proposed SFSBA utilizes the low displacement rank features of Toplitz matrix, along with the Gohberg-Semencul (GS) representation to realize fast inversion of the coefficient matrix, reducing the computational complexity of each iteration from O (N 3) to O (N 2) . It uses a two-order vector extrapolation strategy to reduce the number of iterations. The convergence speed is increased by about 8 times. Finally, the simulation and real data processing results demonstrate that the proposed SFSBA can effectively improve the azimuth resolution of radar forward-looking imaging, and its performance is only slightly lower compared to traditional SBA. The hardware test shows that the computational efficiency of the proposed SFSBA is much higher than that of other traditional super-resolution methods, which would meet the real-time requirements in practice. [ABSTRACT FROM AUTHOR]