Resolution-enhanced radar/SAR imaging: an experiment design framework combined with neural network-adapted variational analysis regularization

The convex optimization-based descriptive experiment design regularization (DEDR) method is aggregated with the neural network (NN)-adapted variational analysis (VA) approach for adaptive high-resolution sensing into a unified DEDR -VA-NN framework that puts in a single optimization frame high-resolution radar/SAR image formation in uncertain operational scenarios, adaptive despeckling and dynamic scene image enhancement for a variety of sensing modes. The DEDR -VA-NN method outperforms the existing adaptive radar imaging techniques both in resolution and convergence rate. The simulation examples are incorporated to illustrate the efficiency of the proposed DEDR-VA-related imaging techniques.


Introduction
In this article, we consider the problem of enhanced remote sensing (RS) imaging stated and treated as an ill-posed nonlinear inverse problem with model uncertainties. The problem at hand is to perform high-resolution reconstruction of the power spatial spectrum pattern (SSP) of the wavefield scattered from the extended remotely sensed scene via space-time adaptive processing of finite recordings of the imaging radar/SAR data distorted in a stochastic uncertain measurement channel. The SSP is defined as a spatial distribution of the power (i.e., the second-order statistics) of the random wavefield backscattered from the remotely sensed scene observed through the integral transform operator [1,2]. Such an operator is explicitly specified by the employed radar/SAR signal modulation and is traditionally referred to as the signal formation operator (SFO) [2,3]. The operational uncertainties are attributed to inevitable random signal perturbations in inhomogeneous propagation medium with unknown statistics, possible imperfect radar calibration, and uncontrolled sensor displacements or carrier trajectory deviations in the SAR case. The classical imaging with an array radar or SAR implies application of the method called "matched spatial filtering (MSF)" to process the recorded data signals [2,3]. A number of approaches had been proposed to design the constrained regularization techniques for improving the resolution in the SSP obtained by ways different from the MSF, e.g., [1][2][3][4][5][6][7][8][9] but without aggregating the minimum risk (MR) descriptive estimation strategies with convex projection regularization. In [7], an approach was proposed to treat the uncertain RS imaging problems that unifies the MR spectral estimation strategy with the worst case statistical performance (WCSP) optimization-based convex regularization resulting in the descriptive experiment design regularization (DEDR) method. Next, the variational analysis (VA) framework has been combined with the DEDR in [2,9] to satisfy the desirable descriptive properties of the reconstructed RS images, namely: (i) convex optimization-based maximization of spatial resolution balanced with noise suppression, (ii) consistency, (iii) positivity, (iv) continuity and agreement with the data. In this study, we extend the developments of the DEDR and VA techniques originated in [2,7,9] by performing the aggregation of the DEDR and VA paradigms and next putting the RS image enhancement/ reconstruction tasks into the unified neural network (NN)-adapted computational frame addressed as a unified DEDR-VA-NN method. We have designed a family of such significantly speeded-up DEDR-VA-related algorithms, and performed the simulations to illustrate the effectiveness of the proposed high-resolution DEDR-VA-NN-based image enhancement/fusion approach.
The rest of the article is organized as follows. In Section 2, we provide the formalism of the radar/SAR inverse imaging problem at hand with necessary experiment design considerations. In Section 3, we adapt the celebrated maximum likelihood (ML) inspired amplitude phase estimation (APES) technique for array sensor/SAR imaging. The unified DEDR-VA framework for highresolution radar/SAR imaging in uncertain scenarios is conceptualized in Section 4, adapted to the NN-oriented sensor systems/methods fusion mode in Section 5, next, is followed by illustrative simulations in Sections 6 and the conclusion in Section 7.

Problem formalism
The general mathematical formalism of the problem at hand is similar in notation and structural framework to that described in [2,7,9] and some crucial elements are repeated for convenience to the reader. Following [1,2,9], we define the model of the observation RS wavefield u by specifying the stochastic equation of observation (EO) of an operator form u = Se + n, where e = e(r), represents the complex scattering function over the probing surface R ∋ r, n is the additive noise, u = u(p), is the observation field, p = (t, r) defines the time (t)-space(r) points in the temporalspatial observation domain p P = T × P (t T, r P) (in the SAR case, r = r(t) specifies the carrier trajectory [7]), and the kernel-type integral SFO S : E(R) → U(P) defines a mapping of the source signal space E(R) onto the observation signal space U(P). The metrics structures in the corresponding Hilbert signal spaces U(P), E(R) are imposed by scalar products, [u, u ] U = P u(p)u * (p)dp, [e, e ] E = R e(r)e * (r)dr, respectively [1]. The functional kernel S(p, r) of the SFO S is referred to as the unit signal [2] determined by the time-space modulation employed in a particular RS system. In the case of uncertain operational scenarios, the SFO is randomly perturbed [7], i.e.S = S+ S where S pertains to the random uncontrolled perturbations, usually with unknown statistics. The fields e, n, u. are assumed to be zero-mean complex valued Gaussian random fields [1,7]. Next, since in all RS applications the regions of high correlation of e(r) are always small in comparison with the resolution element on the probing scene [1][2][3], the signals e(r) scattered from different directions r, r' R of the remotely sensed scene R are assumed to be uncorrelated with the correlation function R e (r, r') = 〈e(r)e*(r') 〉 = b(r) δ(r-r');r,r' R where b (r) = 〈e(r)e*(r) 〉 = 〈|e(r)| 2 〉; r R represents the power SSP of the scattered field [1]. The problem of highresolution RS imaging is to develop a framework and related method(s) that perform optimal estimation of the SSP (referred to as a scene image) from the available radar/SAR data measurements. It is noted that in this study we are going to develop and follow the unified DEDR-VA-NN framework.
The RS radar/SAR system-oriented finite-dimensional (i. e., discrete-form) approximation of the EO is given by [7] u =Se + n = Se + e + n, (1) in which the disturbed M×K SFO matrixS = S + Δ is the discrete-form approximation of the integral SFO for the uncertain operational scenario, and e, n, u represent zero-mean vectors composed of the sample (decomposition) coefficients {e k , n m , u m ; k = 1,...,K; m = 1,...,M}, respectively [1][2][3]. These vectors are characterized by the correlation matrices: R e = D = D(b) = diag(b) (a diagonal matrix with vector b at its principal diagonal), R n , and R u = <S R eS + > p(Δ) + R n , respectively, where <·> p(Δ) defines the averaging performed over the randomness of Δ characterized by the usually unknown probability density function p (Δ), and superscript "+" stands for Hermitian conjugate. Vector b composed of the elements, {b k = B{e k } = <e k e k *> = <|e k | 2 >; k = 1,...,K} is referred to as a K-D vector-form approximation of the SSP, where B represents the secondorder statistical ensemble averaging operator [1,2]. The SSP vector b is associated with the lexicographically ordered pixel-framed image [1,7]. The corresponding conventional K y ×K x rectangular frame-ordered scene image B = {b(k x , k y ); k x , = 1,...,K x ; k v , = 1,...,K y } relates to its lexicographically ordered vector-form representation b = L {B} = {b(k); k = 1,...,K = K y ×K x } via the standard row-by-row concatenation (i.e., lexicographical reordering) procedure, . It is noted that in the simple case of certain operational scenario [2,3], the discrete-form (i.e., matrix-form) SFO S is assumed to be deterministic, i.e., the random perturbation term in (3) is irrelevant, Δ = 0. The enhanced RS imaging problem is stated generally as follows: to map the scene pixel-framed imageB via lexicographical reorderingB = L −1 {b} of the SSP vector estimateb reconstructed from whatever available measurements of independent realizations of the recorded data (1). The reconstructed SSP vectorb is an estimate of the second-order statistics of the scattering vector e observed through the perturbed SFO and contaminated with noise; hence, the imaging problem at hand must be qualified and treated as a statistical nonlinear uncertain inverse problem [1,7,9]. The enhanced high-resolution imaging implies solution of such inverse problem in some optimal way. We know that in this article we intend to develop and follow the unified DEDR-VA framework, next adapted to NN-based computational implementation.

Adaptation of APES technique for array sensor/ SAR imaging
In this section, we perform an extension of the recently proposed high-resolution ML inspired APES, i.e., the ML-APES method [6], for solving the SSP reconstruction inverse problem via its modification adapted to radar imaging of distributed RS scenes. In the considered low snapshot sample case (e.g., one recorded SAR trajectory data signal in a single look SAR sensing mode [7]), the sample data covariance matrix Y = is rank deficient (rank-1 in the single radar snapshot and single look SAR sensing modes, J = 1). The convex optimization problem of minimization of the negative likelihood function lndet{ R u } + tr{R −1 u Y} with respect to the SSP vector b subject to the convexity guaranteed non-negativity constraint results in the celebrated APES estimator [6] In the APES terminology (as well as in the minimum variance distortionless response (MVDR) and other MLrelated approaches [1,4,6] etc.), s k represents the socalled steering vector in the kth look direction, which in our notational conventions is essentially the kth column vector of the regular SFO matrix S. The numerical implementation of the APES algorithm (2) assumes application of an iterative fixed point technique by building the model-based estimateR u = R u (b [i] ) of the unknown covariance R u from the latest (ith) iterative SSP estimateb [i] with the zero step initialization b [0] =b MSF computed applying the conventional MSF estimator [2].
In the vector form, the algorithm (2) can be expressed asb Where · defines the Schur-Hadamar [1] (element wise) vector/matrix product, where operator {·} diag returns the vector of a principal diagonal of the embraced matrix. The algorithmic structure of the vector-form nonlinear (i.e., solution-dependent) APES estimator (3) guarantees positivity but does not guarantee the consistency. In the real-world uncertain (rank deficient) RS operational scenarios, the inconsistency inevitably results in speckle corrupted images unacceptable for further processing and interpretation. To overcome these limitations, in the next section we extend the unified DEDR-VA framework of [2,9] for the considered here uncertain operational scenarios to guarantee consistency and significantly speed-up convergence.

DEDR-VA approach
The DEDR-VA-optimal SSP estimateb is to be found as the regularized solution to the nonlinear equation [7] b DEDR where F DEDR represents the adaptive (i.e., dependent on the SSP estimateb) matrix-form DEDR SO and P is the VA inspired regularizing projector onto convex solution sets (POCS). Two fundamental issues constitute the benchmarks of the modified DEDR-VA estimator (5) that distinguish it from the previously developed kernel SSP reconstruction algorithm [2], the DEDR method [7,9] and the detailed above APES estimator (3). First, we reformulate the strategy for determining the DEDR SO F DEDR in (5) in the MR-inspired WCSP convex optimization setting [1,7], i.e., as the MR-WCSP constrained DEDR convex optimization problem (specified by [7,Equations 8 and 11]) to provide robustness of the SSP vector estimates against possible model uncertainties. The second issue relates to the VA inspired problemoriented codesign of the POCS regularization operator P in (5) aimed at satisfying intrinsic and desirable properties of the solution such as positivity, consistency, model agreement (e.g., adaptive despeckling with edge preservation), and rapid convergence [1,8]. The solution to the MR-WCSP conditioned optimization problem [7,Equation 43] yields the DEDR-optimal SO where K = (S + R −1 S + αA −1 ) −1 defines the so-called reconstruction operator (with the regularization parameter α and stabilizer A -1 ), and R −1 is the inverse of the diagonal loaded noise correlation matrix [7]R Σ = N Σ I with the composite noise power N Σ = N 0 +β, the additive observation noise power N 0 augmented by the loading factor β = γη/α ≥ 0 adjusted to the regularization parameter α, the Loewner ordering factor γ > 0 of the SFO S [1] and the uncertainty bound η imposed by the MR-WCSP conditional maximization (see [7,8] for details).
It is noted that other feasible adjustments of the processing-level degrees of freedom {α, N Σ , A} summarized in [7,8] specify the family of relevant POCS-regularized DEDR-related (DEDR-POCS) techniques that we unify here in the following general form where Q = S + YS defines the MSF measurement statistics matrix independent on the solutionb, and different (say P) reconstruction operators {K (p) ; p = 1,...,P} specified for P different feasible assignments to the processing degrees of freedom {α, N Σ , A} define the corresponding DEDR-POCS estimators (7) with the relevant SO's {F (p) = K (p) S + ; p = 1,...,P}.

Convergence guarantees
Following the VA regularization formalism [1,7,9], the POCS regularization operator P in (7) could be constructed as a composition of projectors P n onto convex sets C n ; n = 1,...,N with non-empty intersection, in which case the (7) is guaranteed to converge to a point in the intersection of the sets {C n } regardless of the initializationb [0] that is a direct sequence of the fundamental theorem of POCS (see [7, Part I, Appendix B]). Also, any operator that acts in the same convex set, e.g., kernel-type windowing operator (WO) can be incorporated into such composite regularization operator P to guarantee the consistency [1]. The RS system-oriented experiment design task is to make the use of the POCS regularization paradigm (5) employing the practical imaging radar/SAR-motivated considerations that we perform in the next section.

VA-motivated POCS regularization
To approach the superresolution performances in the resulting SSP estimates (5), (7), we propose to follow the VA inspired approach [2,7,9] to specify the composite POCS regularizing operator The P 2 in (8) represents the convergence-guaranteed projector onto the nonnegative convex solution set (the POCS operator) specified as the positivity operator, P 2 = P + , that has an effect of clipping off all the negative values [1], and P 1 is an anisotropic WO that we construct here following the VA formalism [2,9] as a metrics inducing operator that specifies the metrics structure in the K-D solution/image space B (K) b defined by the squared norm [2,9] The second sum on the right-hand side of (10) is recognized to be a 4-nearest-neighbors difference-form approximation of the Laplacian operator ∇ 2 r over the spatial coordinate r, while m (0) and m (1) represent the nonnegative real-valued scalars that control the balance between two metrics measures defined by the first and the second sums at the right-hand side of (10). In the equibalanced case, m (0) = m (1) = 1, the same importance is assigned to the both metrics measures, in which case (9) specifies the discrete-form approximation to the Sobolev metrics inducing operator M = m (0) I + m (1) ∇ 2 r in the relevant continuous-form solution space B(R) b(r), where I defines the identity operator [2]. Incorporating in (9) P 1 = M for the continuous model and P 1 = M for the discrete-form image model, respectively, specifies the consistency-guaranteed anisotropic kernel-type windowing [2,9] because it controls not only the SSP (image) discrepancy measure but also its gradient flow over the scene.

DEDR-VA-optimal dynamic SSP reconstruction
The transformation of (5) into the contractive iterative mapping format yieldŝ (11) initialized by the conventional low-resolution MSF imagê with the relaxation parameter τ and the solutiondepended point spread function (PSF) matrix operator Associating in (11) the iterations i+ 1 t +Δt;i t; τ Δt, with "evolution time", (Δt dt; t +Δt t +dt) and considering the continuous 2-D rectangular scene frame R ∋ r= (x, y) with the corresponding initial MSF scene image q(r) =b (r; 0) and the "evolutionary"enhanced SSP estimateb (r; t) , respectively, we proceed from (11) to the equivalent asymptotic dynamic scheme [2] ∂b(r; t) ∂t where b r, r'; t represents the kernel PSF in evolution time t corresponding to the continuous-form dynamic generalization of the PSF matrix D[i] specified by (13), and M defines the metrics inducing operator. For the adopted M = m (0) I + m (1) ∇ 2 r , the (14) is transformed into the VA dynamic process defined by the partial differential equation (PDE) For the purpose of generality, instead of relaxation parameter τ and balancing coefficients m (0) and m (1) we incorporated into the PDE (15) three regularizing factors c 0 , c 1 , and c 2 , respectively, to compete between noise smoothing and edge enhancement [2,9]. These are viewed as additional VA-level user-controlled degrees of freedom.

Family of numerical DEDR-VA-related techniques for SSP reconstruction
The discrete-form approximation of the PDE (15) in "iterative time" {i = 0, 1, 2,...} yields the contractive mapping iterative numerical procedure [2] b .. with the same MSF initialization (12). Different feasible assignments to the user-controlled degrees of freedom (i.e., balancing factors c 0 , c 1 , c 2 ) in (16) specify the family of corresponding DEDR-VArelated SSP reconstruction techniques that produce the relevant RS images. Extending the previous studies on the DEDR-VA topic [2,9] herebeneath we exemplify the following ones.
(ii) The previous assignments but with the anisotropic conduction factor, -c 2 = c(r; t) ≥ 0 specified as a monotonically decreasing function of the magnitude of the image gradient distribution [4], i.e., a function c r, | ∇ rb (r; t) | ≥ 0, transforms the (15) into the aniso- ∂b(r; t) ∂t = c(r; | ∇ rb (r; t) |)∇ 2 rb (r; t), which specifies the celebrated Perona-Malik AD method [4] that sharpens the edge map on the low-resolution MSF images.
(iii) For the Lebesgue metrics specification c 0 = 1 with c 1 = c 2 = 0, the PDE (15) involves only the first term at the right-hand side resulting in the locally selective robust adaptive spatial filtering (RASF) approach investigated in details in our previous studies [7,9].
(iv) The alternative assignments c 0 = 0 with c 1 = c 2 = 1 combine the isotropic diffusion with the anisotropic gain controlled by the Laplacian edge map. This approach is addressed as a selective information fusion method [5] that manifests almost the same performances as the DEDR-related RASF method [7].
(v) The aggregated approach that we address here as the unified DEDR-VA method involves all the three terms at the right-hand side of the PDE (15) with the equibalanced c 0 = c 1 = c 2 = const (one for simplicity), hence, it combines the isotropic diffusion (specified by the second term at the right-hand side of (16)) with the composite anisotropic gain dependent both on the evolution of the synthesized SSP frame and its Laplacian edge map [2]. This produces a balanced compromise between the anisotropic reconstruction-fusion and locally selective image despeckling with adaptive anisotropic kernel windowing that preserves and even sharpen the image edge map [2].
All exemplified above techniques with different feasible specifications of the user-controllable degrees of freedom compose a family of the DEDR-VA-related iterative techniques for SSP reconstruction/enhancement. The general-form DEDR-VA framework is shown in Figure 1. It is noted that the progressive contractive mapping procedure (16) can be performed separately along the range (y) and azimuth (x) directions in a parallel fashion making an optimal use of the PSF sparseness properties of the real-world RS imaging systems. These features of the POCS-regularized DEDR-VArelated algorithms generalized by (16) result in the drastically decreased algorithmic computational complexity (e.g., up to~10 3 times for the typical large-scale 10 3 × 10 3 SAR pixel image formats [8]).
Next, several RS images formed by different sensor systems or applying different image formation techniques can be aggregated into an enhanced fused RS image employing the NN computational framework [10]. We are now ready to proceed with construction of such NN-adapted DEDR-VA-related techniques.

Fusion problem formulation
Consider the set of equations which model the data {q (p) } acquired by P RS imaging systems that employ the image formation methods from the DEDR-VA-related family specified in the previous section. In (17), b represents the original K-D image vector, {F (p) } are the RS image formation operators referred to as the PSF operators of the corresponding DEDR-VA-related imaging systems (or methods) where we have omitted the sub index D for notational simplicity, and {ν (p) } represent the system noise with further assumption that these are uncorrelated from system to system.
Define the discrepancies between the actually formed images {q (p) } and the true original image b as the l 2 squired norms, J p (b) = ||q (p) -F (p) b|| 2 ; p = 1,...,P. Let us next adopt the VA inspired proposition [10] that the smoothness properties of the desired image are controlled by the second-order Tikhonov stabilizer, J P+1 (b) = b T P 1 b , where P 1 = M = m (0) I + m (1) ∇ 2 is the VAbased metrics inducing (regularizing) operator specified previously by (9). We further define the image entropy as Then, the contrivance for aggregating the imaging systems (methods), when solving the fusion problem, is the formation of the augmented objective (or augmented ME cost) function and seeking for a fused restored imageb that minimizes the objective function (19), in which l = (l 1 ...l P , l P+1 ) T represents the vector of weight parameters, commonly referred to as the fusion regularization parameters [10]. Hence, in the frame of the aggregate regularization approach to decentralized fusion [2,6], the restored image is to be found as a solution of the convex optimization problem for the assigned values of the regularization parameters l. A proper selection of l is next associated with parametrical optimization [10] of such the aggregated fusion process.

NN-adapted fusion algorithm
The Hopfield-type dynamical NN, which we propose to employ to solve the fusion problem (20), is an expansion of the maximum entropy NN (MENN) proposed in our previous study [10]. We consider the multistate Hopfield-type (i.e., dynamic) NN [10,11] with the K-D state vector x and K-D output vector z = sgn(Wx + θ), where W and θ are the matrix of synaptic weights and the vector of the corresponding bias inputs of the NN, respectively. The energy function of such the NN is expressed as [10] The proposed idea for solving the RS system/method fusion problem (20) using the dynamical NN is based on extension of the following cognitive processing proposition invoked from [10]. If the energy function of the NN represents the function of a mathematical minimization problem over a parameter space, then the state of the NN would represent the parameters and the stationary point of the network would represent a local minimum of the original minimization problem. Hence, utilizing the concept of the dynamical net, we may translate our image reconstruction/enhancement problem with RS system/method fusion to the correspondent problem of minimization of the energy function (21) of the related MENN. Therefore, we define the parameters of the MENN in such a fashion that to aggregate the corresponding parameters of the RS systems/methods to be fused, i.e., ∀k, i = 1,...,K, where we redefined {x k = b k } and ignored the constant term E const in E(x) that does not involve the state vector x. The regularization parameters {l p } in (22), (23) should be specified by an observer o pre-estimated invoking, for example, the VA inspired resolution-over-noise-suppression balancing method developed in [10,Section 3]. In the latter case, the result of the enhancement-fusion becomes a balanced tradeoff between the gained spatial resolution and noise suppression in the resulting fused enhanced image with the POCS-based regularizing stabilizer.
Next, we propose to find a minimum of the energy function (21) as follows. The states of the network should be updated as x'' = x' + Δx using the properly designed update rule ℜ(z) for computing a change Δx of the state vector x, where the superscripts ' and '' correspond to the state values before and after network state updating (at each iteration), respectively. To simplify the design of such the state update rule, we assume that all x k > > 1, which enables us to approximate the change of the energy function due to neuron k updating as [10] We now redefine the outputs of neurons as {z k = sgn W ki x i + θ k -1) ∀k = 1,...,K}. Using these definitions, and adopting the equibalanced fusion regularization weights, l p = 1 ∀p = 1,...,P, we next, design the desired state update rule ℜ(z) which guarantees nonpositive values of the energy changes ΔE at each updating step as follows, where Δ is the pre-assigned step-size parameter. If no changes of ΔE(Δx) are examined while approaching to the stationary point of the network, then the step-size parameter Δ may be decreased, which enables us to monitor the updating process as it progresses setting a compromise between the desired accuracy of finding the NN's stationary point and computational complexity [10]. To satisfy the condition x k > > 1 some constant x 0 may be added to the gray level of every original image pixel and after restoration the same constant should be deducted from the gray level of every restored image pixel, hence, the selection of a particular value of x 0 is not critical [10]. Consequently, the restored imageb corresponds to the state vectorx of the NN in its stationary pointx as,b=xx 0 1, where 1 = (1 1...1) T R K is the K×1 vector composed with units. The computational structures of such the MENN and its single neuron are presented in Figures 2 and 3, respectively.

Simulations
We simulated fractional side-looking imaging SAR operating in uncertain scenario [7]. We adopted a triangular shape of such imaging SAR range ambiguity function (AF) and a Gaussian shape of the corresponding azimuth AF [2,12]. Simulation results are presented in Figures 4 and 5. The figure captions specify each particular simulated image formation/enhancement method (p = 1,...,P = 5). Aggregation of the locally selective robust spatial filtering (RSF) technique [5] with the DEDR-VAoptimal algorithm (16) was considered in the simulations of the NN-based fused enhancement mode. Next, Figure 6 reports the convergence rates for three most prominent VA-related enhanced RS imaging approaches: the APES [6], the DEDR, and the developed NN-adapted DEDR-VA-optimal method (16) implemented via the MENN technique (20-25).
We employ two quality metrics for performance assessment of the reconstructive methods developed in this article. The traditional quantitative quality metric [7] for RS images is the so-called improvement in the output signal-to-noise ratio (IOSNR), which provides the metrics for performance gains attained with different employed estimators in dB scale where b k represents the value of the kth element (pixel) of the original SSP,b (MSF) k represents the value of the kth element (pixel) of the rough SSP estimate formed applying the conventional low-resolution MSF technique (12), andb (p) k represents the value of the kth element (pixel) of the enhanced SSP estimate formed applying the pth enhanced imaging method (p = 1,...,P), correspondingly. We consider and compare here five (i. e., P = 5) RS image enhancement/reconstruction methods, in which case p = 1 corresponds to the Lee's local statistics-based adaptive despeckling technique [2], p = 2 corresponds to the Perona-Malik AD method [5], p = 3 corresponds to the DEDR-related locally selective RASF technique [7], p = 4 corresponds to the APES method [6], and p = 5 corresponds to the NN-fused RSF and DEDR-VA methods, respectively.
The second employed quality metric is the l 1 total mean absolute error (MAE) metric [13] The quality metrics specified by (26) and (27) allow us to quantify the performance of the developed DEDR-VA-related high-resolution reconstructive methods   (enumerated above by p = 1,...,P = 5) and, also, the NN fusion quality. The quantitative measures of the image enhancement/ reconstruction performance gains achieved with the particular employed DEDR-RSF method [7], the APES algorithm [6], and DEDR-VA-NN technique (16) for different SNRs evaluated with two different quality metrics (26), (27) are reported in Tables 1 and 2, respectively. The numerical simulations verify that the MENN implemented DEDR-VA method outperforms the most prominent existing competing high-resolution RS imaging techniques [1][2][3][4][5][6][7] (both without fusion and in the fused version) in the attainable resolution enhancement as well as in the convergence rates.

Concluding remarks
The extended DEDR method combined with the dynamic VA regularization has been adapted to the NN computational framework for perceptually enhanced and considerably speeded up reconstruction of the RS imagery acquired with imaging array radar and/or fractional SAR imaging systems operating in an uncertain RS Figure 5 Simulation results for the second uncertain fractional SAR imaging scenario for the large-scale (1024 × 1024 pixels) test scene and 5% random Gaussian perturbations in the SFO, < ||Δ|| 2 >/||S|| 2 = 5 × 10 -2 . (a) degraded scene image formed applying the MSF method corrupted by composite noise (fractional SAR parameters: range PSF width (at 1/2 from the peak value) r = 7 pixels, azimuth PSF width (at 1/2 from the peak value) a = 20 pixels, composite SNR μ SAR = 15 dB); (b) adaptively despeckled MSF image [8]; (c) image enhanced using the AD technique [4] after 30 performed iterations; (d) image reconstructed applying the locally selective RSF method [5] after 30 performed iterations; (e) image reconstructed applying the POCS-regularized RASF technique [7] after seven performed iterations and (f) image reconstructed applying the NN-fused RSF [5] and the DEDR-VA technique (16) after 7 performed iterations.

Figure 6
Convergence rates evaluated via the IOSNR metric (26) versus the number of iterations evaluated for three most prominent high-resolution iterative enhanced RS imaging methods: DEDR-RASF method [7], APES-ML-optimal APES method [6], and the developed unified DEDR-VA-NN technique (16). environment. Connections have been drawn between different types of enhanced RS imaging approaches, and it has been established that the convex optimizationbased unified DEDR-VA-NN framework provides an indispensable toolbox for high-resolution RS imaging system design offering to observer a possibility to control the order, the type, and the amount of the employed two-level regularization (at the DEDR level and at the VA level, correspondingly). Algorithmically, this task is performed via construction of the proper POCS operators that unify the desirable image metrics properties in the convex image/solution sets with the employed radar/SAR motivated data processing considerations. The addressed family of the efficient contractive progressive mapping iterative DEDR-VA-related techniques has particularly been adapted for the NN computing mode with sensor systems/method fusion. The efficiency of the proposed fusion-based enhancement of the fractional SAR imagery has been verified for the two method fusion example in the reported simulation experiments. Our algorithmic developments and the simulations revealed that with the NN-adapted POCS-regularized DEDR-VA techniques, the overall RS imaging performances are improved if compared with those obtained using separately the most prominent in the literature despeckling, AD or locally selective RS image reconstruction methods that do not unify the DEDR, the VA and the NN-adapted method fusion considerations. Therefore, the developed unified DEDR-VA-NN framework puts in a single optimization frame, radar/SAR image formation, speckle reduction, and adaptive dynamic scene image enhancement/fusion performed in the rapidly convergent NN-adapted computational fashion.  (3) DEDR-RSF method [7]; (4) APES method [6]; (5) DEDR-VA-NN technique (16). The results are reported for the both simulated scenarios.