Convolutional neural networks can efficiently exploit sophisticated hierarchical features which have different properties for visual tracking problem. In this paper, by using multilayer convolutional features jointly and constructing a scale pyramid, we propose an online scale adaptive tracking method. We construct two separate correlation filters for translation and scale estimations. The translation filters improve the accuracy of target localization by a weighted fusion of multiple convolutional layers. Meanwhile, the separate scale filters achieve the optimal and fast scale estimation by a scale pyramid. This design decreases the mutual errors of translation and scale estimations, and reduces computational complexity efficiently. Moreover, in order to solve the problem of tracking drifts due to the severe occlusion or serious appearance changes of the target, we present a new adaptive and selective update mechanism to update the translation filters effectively. Extensive experimental results show that our proposed method achieves the excellent overall performance compared with the state-of-the-art methods.

Recently, convolutional neural networks (CNNs) have been successfully developed and used in the classification of polarimetric synthetic aperture radar (PolSAR) images. However, they often suffer from some problems, such as time-consuming, unsatisfactory detail-preservation, and bad effectiveness given limited training samples. Focusing on these problems, we propose a complex-valued CNN (CV-CNN)-based algorithm for PolSAR image classification in this article. On the one hand, a superpixel-oriented (SPO) scheme is employed to reduce the computational cost of the algorithm and preserve image details simultaneously, which takes superpixels instead of single pixels as classification units. In particular, to meet the input requirement of CV-CNN, three alternative methods of superpixel regularization are designed and compared. On the other hand, considering that both measured data (MD) and manually designed polarimetric features (PFs) have their own advantages, the hybrid data (HD) combining them is employed to drive CV-CNN, which is helpful to improve the effectiveness of the algorithm. We perform experiments on three actual PolSAR image data sets acquired by AIRSAR and Radarsat-2 systems as well as a semisimulated data set. The experimental results demonstrate that, compared to conventional pixel-oriented methods, the proposed SPO scheme is much more time-efficient and is also beneficial to detail preservation. Moreover, the CV-CNN driven by HD generally obtains consistently better classification results than that driven by pure MD or manually designed PFs.

Summary: The robust receding horizon control (RHC) synthesis approach is developed in this paper, for the simultaneous tracking and regulation problem (STRP) of wheeled vehicles with bounded disturbances. Considering the bounded disturbances, we firstly provide a robust positively invariant (RPI) set and associated feedback controller for the perturbed vehicles, which contribute to the foundation of the robust RHC synthesis approach. Then, by extending the tube‐based approach introduced in the article of Mayne et al (robust model predictive control of constrained linear systems with bounded disturbances in Automatica, 2005, vol. 41) to the STRP of wheeled vehicles, we employ the designed RPI set to determine the robust tube and terminal state region, and further construct a nominal optimal control problem. The actual control input is implemented by correcting the solved nominal input with the designed feedback controller. Following the contributed properties of the developed RPI set and extended tube‐based approach, a robust RHC algorithm is finally proposed with the guarantees of recursive feasibility and robust convergence, which can also be adapted for real‐time implementation. Additionally, due to the elaborate control design, the effect of disturbances can be completely nullified to achieve better tracking performance. The effectiveness and advantage of the proposed approach are illustrated by two simulation examples.

Recently, convolutional neural networks (CNNs) have shown significant advantages in the tasks of image classification; however, these usually require a large number of labeled samples for training. In practice, it is difficult and costly to obtain sufficient labeled samples of polarimetric synthetic aperture radar (PolSAR) images. To address this problem, we propose a novel semi-supervised classification method for PolSAR images in this paper, using the co-training of CNN and a support vector machine (SVM). In our co-training method, an eight-layer CNN with residual network (ResNet) architecture is designed as the primary classifier, and an SVM is used as the auxiliary classifier. In particular, the SVM is used to enhance the performance of our algorithm in the case of limited labeled samples. In our method, more and more pseudo-labeled samples are iteratively yielded for training through a two-stage co-training of CNN and SVM, which gradually improves the performance of the two classifiers. The trained CNN is employed as the final classifier due to its strong classification capability with enough samples. We carried out experiments on two C-band airborne PolSAR images acquired by the AIRSAR systems and an L-band spaceborne PolSAR image acquired by the GaoFen-3 system. The experimental results demonstrate that the proposed method can effectively integrate the complementary advantages of SVM and CNN, providing overall classification accuracy of more than 97%, 96% and 93% with limited labeled samples (10 samples per class) for the above three images, respectively, which is superior to the state-of-the-art semi-supervised methods for PolSAR image classification.

Distance measure plays a critical role in various applications of polarimetric synthetic aperture radar (PolSAR) image data. In recent decades, plenty of distance measures have been developed for PolSAR image data from different perspectives, which, however, have not been well analyzed and summarized. In order to make better use of these distance measures in algorithm design, this paper provides a systematic survey of them and analyzes their relations in detail. We divide these distance measures into five main categories (i.e., the norm distances, geodesic distances, maximum likelihood (ML) distances, generalized likelihood ratio test (GLRT) distances, stochastics distances) and two other categories (i.e., the inter-patch distances and those based on metric learning). Furthermore, we analyze the relations between different distance measures and visualize them with graphs to make them clearer. Moreover, some properties of the main distance measures are discussed, and some advice for choosing distances in algorithm design is also provided. This survey can serve as a reference for researchers in PolSAR image processing, analysis, and related fields.