New Noise-Tolerant ZNN Models With Predefined-Time Convergence for Time-Variant Sylvester Equation Solving

Sylvester equation is often applied to various fields, such as mathematics and control systems due to its importance. Zeroing neural network (ZNN), as a systematic design method for time-variant problems, has been proved to be effective on solving Sylvester equation in the ideal conditions. In this paper, in order to realize the predefined-time convergence of the ZNN model and modify its robustness, two new noise-tolerant ZNNs (NNTZNNs) are established by devising two novelly constructed nonlinear activation functions (AFs) to find the accurate solution of the time-variant Sylvester equation in the presence of various noises. Unlike the original ZNN models activated by known AFs, the proposed two NNTZNN models are activated by two novel AFs, therefore, possessing the excellent predefined-time convergence and strong robustness even in the presence of various noises. Besides, the detailed theoretical analyses of the predefined-time convergence and robustness ability for the NNTZNN models are given by considering different kinds of noises. Simulation comparative results further verify the excellent performance of the proposed NNTZNN models, when applied to online solution of the time-variant Sylvester equation

Design and Comprehensive Analysis of a Noise-Tolerant ZNN Model With Limited-Time Convergence for Time-Dependent Nonlinear Minimization

Zeroing neural network (ZNN) is a powerful tool to address the mathematical and optimization problems broadly arisen in the science and engineering areas. The convergence and robustness are always co-pursued in ZNN. However, there exists no related work on the ZNN for time-dependent nonlinear minimization that achieves simultaneously limited-time convergence and inherently noise suppression. In this article, for the purpose of satisfying such two requirements, a limited-time robust neural network (LTRNN) is devised and presented to solve time-dependent nonlinear minimization under various external disturbances. Different from the previous ZNN model for this problem either with limited-time convergence or with noise suppression, the proposed LTRNN model simultaneously possesses such two characteristics. Besides, rigorous theoretical analyses are given to prove the superior performance of the LTRNN model when adopted to solve time-dependent nonlinear minimization under external disturbances. Comparative results also substantiate the effectiveness and advantages of LTRNN via solving a time-dependent nonlinear minimization problem

Proposing, developing and verification of a novel discrete-time zeroing neural network for solving future augmented Sylvester matrix equation

In this paper, a novel discrete-time advance zeroing neural network (DT-AZNN) model is proposed, developed and investigated for solving future augmented Sylvester matrix equation (F-ASME). First of all, based on the advance zeroing neural network (AZNN) design formula, a novel continuous-time advance zeroing neural network (CT-AZNN) model is shown for solving continuous-time augmented Sylvester matrix equation (CT-ASME). Secondly, a recently published discretization formula is further investigated with the optimal sampling gap of the discretization formula proposed. Then, for solving F-ASME, a novel DT-AZNN model is proposed based on the discretization formula. Theoretical analyses on the convergence property and the perturbation suppression performance of the DT-AZNN model are provided. Moreover, comparative numerical experimental results are conducted to prove the effectiveness and robustness of the proposed DT-AZNN model for solving F-ASME

SciTech News Volume 71, No. 1 (2017)

Columns and Reports From the Editor 3 Division News Science-Technology Division 5 Chemistry Division 8 Engineering Division Aerospace Section of the Engineering Division 9 Architecture, Building Engineering, Construction and Design Section of the Engineering Division 11 Reviews Sci-Tech Book News Reviews 12 Advertisements IEEE

Advanced Techniques for Ground Penetrating Radar Imaging

Ground penetrating radar (GPR) has become one of the key technologies in subsurface sensing and, in general, in non-destructive testing (NDT), since it is able to detect both metallic and nonmetallic targets. GPR for NDT has been successfully introduced in a wide range of sectors, such as mining and geology, glaciology, civil engineering and civil works, archaeology, and security and defense. In recent decades, improvements in georeferencing and positioning systems have enabled the introduction of synthetic aperture radar (SAR) techniques in GPR systems, yielding GPR–SAR systems capable of providing high-resolution microwave images. In parallel, the radiofrequency front-end of GPR systems has been optimized in terms of compactness (e.g., smaller Tx/Rx antennas) and cost. These advances, combined with improvements in autonomous platforms, such as unmanned terrestrial and aerial vehicles, have fostered new fields of application for GPR, where fast and reliable detection capabilities are demanded. In addition, processing techniques have been improved, taking advantage of the research conducted in related fields like inverse scattering and imaging. As a result, novel and robust algorithms have been developed for clutter reduction, automatic target recognition, and efficient processing of large sets of measurements to enable real-time imaging, among others. This Special Issue provides an overview of the state of the art in GPR imaging, focusing on the latest advances from both hardware and software perspectives

Interpretable Hyperspectral AI: When Non-Convex Modeling meets Hyperspectral Remote Sensing

Hyperspectral imaging, also known as image spectrometry, is a landmark technique in geoscience and remote sensing (RS). In the past decade, enormous efforts have been made to process and analyze these hyperspectral (HS) products mainly by means of seasoned experts. However, with the ever-growing volume of data, the bulk of costs in manpower and material resources poses new challenges on reducing the burden of manual labor and improving efficiency. For this reason, it is, therefore, urgent to develop more intelligent and automatic approaches for various HS RS applications. Machine learning (ML) tools with convex optimization have successfully undertaken the tasks of numerous artificial intelligence (AI)-related applications. However, their ability in handling complex practical problems remains limited, particularly for HS data, due to the effects of various spectral variabilities in the process of HS imaging and the complexity and redundancy of higher dimensional HS signals. Compared to the convex models, non-convex modeling, which is capable of characterizing more complex real scenes and providing the model interpretability technically and theoretically, has been proven to be a feasible solution to reduce the gap between challenging HS vision tasks and currently advanced intelligent data processing models