Search

Radio frequency interference (RFI) suppression is a hot topic in synthetic aperture radar (SAR) imaging. Mathematically, the RFI suppression problem can be considered as an underdetermined signal separation problem to extract the signal of interest (SOI) from the RFI contaminated raw data. The regularization-based method can exploit both the prior knowledge of RFI and SOI and, therefore, has the advantage of solving the underdetermined problem and preserving the information of SOI. Current regularization methods make use of the RFI prior well by exploiting low-rank representation (LRR) or sparse representation (SR), but the prior knowledge of SOI has not been sufficiently studied and used. In some literature, the sparsity of the raw data or range profile was exploited to formulate the regularization term, which we found to be inadequate in describing the SOI property. In this article, we explore the features of SAR images and propose an RFI suppression model with a combination of multiple image domain regularizations to preserve different types of targets. An efficient solution to the optimization problem is proposed based on the alternating direction multiplier method (ADMM). The proposed method can accurately recover both the sparse strong targets, and the nonsparse regions in the illuminated area and its performance is validated by measured data. [ABSTRACT FROM AUTHOR]

Deep learning-based methods have achieved remarkable success in image restoration and enhancement, but are they still competitive when there is a lack of paired training data? As one such example, this paper explores the low-light image enhancement problem, where in practice it is extremely challenging to simultaneously take a low-light and a normal-light photo of the same visual scene. We propose a highly effective unsupervised generative adversarial network, dubbed EnlightenGAN, that can be trained without low/normal-light image pairs, yet proves to generalize very well on various real-world test images. Instead of supervising the learning using ground truth data, we propose to regularize the unpaired training using the information extracted from the input itself, and benchmark a series of innovations for the low-light image enhancement problem, including a global-local discriminator structure, a self-regularized perceptual loss fusion, and the attention mechanism. Through extensive experiments, our proposed approach outperforms recent methods under a variety of metrics in terms of visual quality and subjective user study. Thanks to the great flexibility brought by unpaired training, EnlightenGAN is demonstrated to be easily adaptable to enhancing real-world images from various domains. Our codes and pre-trained models are available at: https://github.com/VITA-Group/EnlightenGAN. [ABSTRACT FROM AUTHOR]

The performance of synthetic aperture radar is vulnerable to radio frequency interference (RFI). In many situations, the RFI has a low-rank property, since the frequency bands occupied by RFI usually remain stable during a short slow time period. Therefore, low-rank representation (LRR)-based methods can be applied to separate RFI and signal of interest (SOI), by minimizing the rank of RFI components with a regularization constraint to protect SOI. However, traditional methods use the sparsity of the raw data or range profile to formulate the regularization term, which fails to describe the properties of SOI accurately. In addition to the sparse property of range profiles, this article explores the common patterns hidden in the range profiles and proposes two new LRR-based RFI suppression optimization models with a well-designed regularization term to describe such common sparsity to protect the SOI. Four methods are proposed to solve the optimization problems based on the alternating direction multiplier (ADM) method, which provides tradeoff between efficiency and accuracy. Compared with traditional LRR-based RFI suppression methods, the proposed methods make a more precise description of the features of SOI, therefore can better protect the information of SOI during the RFI suppression process and improves the imaging quality. The superior performance of the proposed method is validated by measured data in both sparse and nonsparse scenes. [ABSTRACT FROM AUTHOR]

Deceptive jamming can severely degrade synthetic aperture radar (SAR) image quality by introducing high-fidelity false targets. In this letter, a simultaneous deceptive jamming suppression and target reconstruction method for a single-channel SAR system is proposed. The signal model is formulated by constructing a joint dictionary based on different time–frequency distributions of the actual targets and false targets. Then, an efficient algorithm is proposed based on the alternating direction method of multipliers (ADMMs) to simultaneously recover the actual and false targets. Several strategies are also proposed to accelerate the computation. Compared with other existing single-channel SAR deceptive jamming suppression methods, the proposed method has lower reconstruction error and computational load. Simulation results demonstrate the superior performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Action recognition with 3D skeleton sequences became popular due to its speed and robustness. The recently proposed convolutional neural networks (CNNs)-based methods show a good performance in learning spatio–temporal representations for skeleton sequences. Despite the good recognition accuracy achieved by previous CNN-based methods, there existed two problems that potentially limit the performance. First, previous skeleton representations were generated by chaining joints with a fixed order. The corresponding semantic meaning was unclear and the structural information among the joints was lost. Second, previous models did not have an ability to focus on informative joints. The attention mechanism was important for skeleton-based action recognition because different joints contributed unequally toward the correct recognition. To solve these two problems, we proposed a novel CNN-based method for skeleton-based action recognition. We first redesigned the skeleton representations with a depth-first tree traversal order, which enhanced the semantic meaning of skeleton images and better preserved the associated structural information. We then proposed the general two-branch attention architecture that automatically focused on spatio–temporal key stages and filtered out unreliable joint predictions. Based on the proposed general architecture, we designed a global long-sequence attention network with refined branch structures. Furthermore, in order to adjust the kernel’s spatio–temporal aspect ratios and better capture long-term dependencies, we proposed a sub-sequence attention network (SSAN) that took sub-image sequences as inputs. We showed that the two-branch attention architecture could be combined with the SSAN to further improve the performance. Our experiment results on the NTU RGB+D data set and the SBU kinetic interaction data set outperformed the state of the art. The model was further validated on noisy estimated poses from the subsets of the UCF101 data set and the kinetics data set. [ABSTRACT FROM AUTHOR]

Instance-level object segmentation is an important yet under-explored task. Most of state-of-the-art methods rely on region proposal methods to extract candidate segments and then utilize object classification to produce final results. Nonetheless, generating reliable region proposals itself is a quite challenging and unsolved task. In this work, we propose a Proposal-Free Network (PFN) to address the instance-level object segmentation problem, which outputs the numbers of instances of different categories and the pixel-level information on i) the coordinates of the instance bounding box each pixel belongs to, and ii) the confidences of different categories for each pixel, based on pixel-to-pixel deep convolutional neural network. All the outputs together, by using any off-the-shelf clustering method for simple post-processing, can naturally generate the ultimate instance-level object segmentation results. The whole PFN can be easily trained without the requirement of a proposal generation stage. Extensive evaluations on the challenging PASCAL VOC 2012 semantic segmentation benchmark demonstrate the effectiveness of the proposed PFN solution without relying on any proposal generation methods. [ABSTRACT FROM AUTHOR]

Radio frequency interference (RFI) can severely degrade the image quality for synthetic aperture radar (SAR). Traditional sparse recovery-based RFI suppression methods construct a joint dictionary to represent both the time-domain RFI and the useful target echo (UTE), thus, transforming the task of RFI suppression into a signal recovery problem. However, these methods generally have poor performance when the one-dimensional (1-D) range profiles are nonsparse. To overcome this problem, two RFI suppression algorithms are proposed based on a modified block sparse Bayesian learning (BSBL). In the first algorithm, the vector to be recovered is divided into several blocks of identical size. The Bayesian hyper-parameters corresponding to the RFI and UTE are learned separately by exploiting the temporal intrablock correlation, and then the nonsparse vector can be successfully recovered. In the second algorithm, the dictionary is adaptively tuned during the iteration process of BSBL, thus reducing the computational load. After recovering the UTE, a well-focused 2-D image can be obtained by traditional SAR imaging algorithms. With the use of properties of both the RFI and UTE, and by exploiting the intrablock correlation, the proposed RFI suppression methods outperform other sparse recovery methods, especially when the range profile is nonsparse. Simulation results demonstrate the superior performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]

An intuition on human segmentation is that when a human is moving in a video, the video-context (e.g., appearance and motion clues) may potentially infer reasonable mask information for the whole human body. Inspired by this, based on popular deep convolutional neural networks (CNN), we explore a very-weakly supervised learning framework for human segmentation task, where only an imperfect human detector is available along with massive weakly-labeled YouTube videos. In our solution, the video-context guided human mask inference and CNN based segmentation network learning iterate to mutually enhance each other until no further improvement gains. In the first step, each video is decomposed into supervoxels by the unsupervised video segmentation. The superpixels within the supervoxels are then classified as human or non-human by graph optimization with unary energies from the imperfect human detection results and the predicted confidence maps by the CNN trained in the previous iteration. In the second step, the video-context derived human masks are used as direct labels to train CNN. Extensive experiments on the challenging PASCAL VOC 2012 semantic segmentation benchmark demonstrate that the proposed framework has already achieved superior results than all previous weakly-supervised methods with object class or bounding box annotations. In addition, by augmenting with the annotated masks from PASCAL VOC 2012, our method reaches a new state-of-the-art performance on the human segmentation task. [ABSTRACT FROM AUTHOR]

In this work, we address the human parsing task with a novel Contextualized Convolutional Neural Network (Co-CNN) architecture, which well integrates the cross-layer context, global image-level context, semantic edge context, within-super-pixel context and cross-super-pixel neighborhood context into a unified network. Given an input human image, Co-CNN produces the pixel-wise categorization in an end-to-end way. First, the cross-layer context is captured by our basic local-to-global-to-local structure, which hierarchically combines the global semantic information and the local fine details across different convolutional layers. Second, the global image-level label prediction is used as an auxiliary objective in the intermediate layer of the Co-CNN, and its outputs are further used for guiding the feature learning in subsequent convolutional layers to leverage the global image-level context. Third, semantic edge context is further incorporated into Co-CNN, where the high-level semantic boundaries are leveraged to guide pixel-wise labeling. Finally, to further utilize the local super-pixel contexts, the within-super-pixel smoothing and cross-super-pixel neighbourhood voting are formulated as natural sub-components of the Co-CNN to achieve the local label consistency in both training and testing process. Comprehensive evaluations on two public datasets well demonstrate the significant superiority of our Co-CNN over other state-of-the-arts for human parsing. In particular, the F-1 score on the large dataset [1] reaches 81.72\,\textpercent by Co-CNN, significantly higher than 62.81\,\textpercent and 64.38\,\textpercent by the state-of-the-art algorithms, M-CNN [2] and ATR [1] , respectively. By utilizing our newly collected large dataset for training, our Co-CNN can achieve 85.36\,\textpercent in F-1 score. [ABSTRACT FROM AUTHOR]