Searcharxiv⌕ Search

arXiv subjects

Yan Wu

Publications and source records attributed to Yan Wu.

At least 127 records · Page 7Linked to original sources

Pixel-Wise PolSAR Image Classification via a Novel Complex-Valued Deep Fully Convolutional Network

Although complex-valued (CV) neural networks have shown better classification results compared to their real-valued (RV) counterparts for polarimetric synthetic aperture radar (PolSAR) classification, the extension of pixel-level RV networks to the complex domain has not yet thoroughly examined. This paper presents a novel complex-valued deep fully convolutional neural network (CV-FCN) designed for PolSAR image classification. Specifically, CV-FCN uses PolSAR CV data that includes the phase information and utilizes the deep FCN architecture that performs pixel-level labeling. It integrates the feature extraction module and the classification module in a united framework. Technically, for the particularity of PolSAR data, a dedicated complex-valued weight initialization scheme is defined to initialize CV-FCN. It considers the distribution of polarization data to conduct CV-FCN training from scratch in an efficient and fast manner. CV-FCN employs a complex downsampling-then-upsampling scheme to extract dense features. To enrich discriminative information, multi-level CV features that retain more polarization information are extracted via the complex downsampling scheme. Then, a complex upsampling scheme is proposed to predict dense CV labeling. It employs complex max-unpooling layers to greatly capture more spatial information for better robustness to speckle noise. In addition, to achieve faster convergence and obtain more precise classification results, a novel average cross-entropy loss function is derived for CV-FCN optimization. Experiments on real PolSAR datasets demonstrate that CV-FCN achieves better classification performance than other state-of-art methods.

eess.IV↗

Real-time Multi-target Path Prediction and Planning for Autonomous Driving aided by FCN

Real-time multi-target path planning is a key issue in the field of autonomous driving. Although multiple paths can be generated in real-time with polynomial curves, the generated paths are not flexible enough to deal with complex road scenes such as S-shaped road and unstructured scenes such as parking lots. Search and sampling-based methods, such as A* and RRT and their derived methods, are flexible in generating paths for these complex road environments. However, the existing algorithms require significant time to plan to multiple targets, which greatly limits their application in autonomous driving. In this paper, a real-time path planning method for multi-targets is proposed. We train a fully convolutional neural network (FCN) to predict a path region for the target at first. By taking the predicted path region as soft constraints, the A* algorithm is then applied to search the exact path to the target. Experiments show that FCN can make multiple predictions in a very short time (50 times in 40ms), and the predicted path region effectively restrict the searching space for the following A* search. Therefore, the A* can search much faster so that the multi-target path planning can be achieved in real-time (3 targets in less than 100ms).

cs.AI↗

U-net super-neural segmentation and similarity calculation to realize vegetation change assessment in satellite imagery

Vegetation is the natural linkage connecting soil, atmosphere and water. It can represent the change of land cover to a certain extent and serve as an indicator for global change research. Methods for measuring coverage can be divided into two types: surface measurement and remote sensing. Because vegetation cover has significant spatial and temporal differentiation characteristics, remote sensing has become an important technical means to estimate vegetation coverage. This paper firstly uses U-net to perform remote sensing image semantic segmentation training, then uses the result of semantic segmentation, and then uses the integral progressive method to calculate the forestland change rate, and finally realizes automated valuation of woodland change rate.

eess.IV↗

Non-trivial topology in a layered Dirac nodal-line semimetal candidate SrZnSb$_2$ with distorted Sb square nets

Dirac states hosted by Sb/Bi square nets are known to exist in the layered antiferromagnetic AMnX$_2$ (A = Ca/Sr/Ba/Eu/Yb, X=Sb/Bi) material family the space group to be P4/nmm or I4/mmm. In this paper, we present a comprehensive study of quantum transport behaviors, angle-resolved photoemission spectroscopy (ARPES) and first-principles calculations on SrZnSb2, a nonmagnetic analogue to AMnX2, which crystallizes in the pnma space group with distorted square nets. From the quantum oscillation measurements up to 35 T, three major frequencies including F$_1$ = 103 T, F$_2$ = 127 T and F$_3$ = 160 T, are identified. The effective masses of the quasiparticles associated with these frequencies are extracted, namely, m*$_1$ = 0.1 m$_e$, m*$_2$ = 0.1 m$_e$ and m*$_3$ = 0.09m$_e$, where m$_e$ is the free electron mass. From the three-band Lifshitz-Kosevich fit, the Berry phases accumulated along the cyclotron orbit of the quasiparticles are 0.06$π$, 1.2$π$ and 0.74$π$ for F$_1$, F$_2$ and F$_3$, respectively. Combined with the ARPES data and the first-principles calculations, we reveal that F2 and F3 are associated with the two nontrivial Fermi pockets at the Brillouin zone edge while F1 is associated with the trivial Fermi pocket at the zone center. In addition, the first-principles calculations further suggest the existence of Dirac nodal line in the band structure of SrZnSb$_2$.

cond-mat.mtrl-sci↗

Shaping Belief States with Generative Environment Models for RL

When agents interact with a complex environment, they must form and maintain beliefs about the relevant aspects of that environment. We propose a way to efficiently train expressive generative models in complex environments. We show that a predictive algorithm with an expressive generative model can form stable belief-states in visually rich and dynamic 3D environments. More precisely, we show that the learned representation captures the layout of the environment as well as the position and orientation of the agent. Our experiments show that the model substantially improves data-efficiency on a number of reinforcement learning (RL) tasks compared with strong model-free baseline agents. We find that predicting multiple steps into the future (overshooting), in combination with an expressive generative model, is critical for stable representations to emerge. In practice, using expressive generative models in RL is computationally expensive and we propose a scheme to reduce this computational burden, allowing us to build agents that are competitive with model-free baselines.

cs.LG↗

Automatic target positioning and tracking for image-guided radiotherapy without implanted fiducials

Current image-guided prostate radiotherapy often relies on the use of implanted fiducials or transducers for target localization. Fiducial or transducer insertion requires an invasive procedure that adds cost and risks for bleeding, infection, and discomfort to some patients. We are developing a novel markerless prostate localization strategy using a pre-trained deep learning model to interpret routine projection kV X-ray images without the need for daily cone-beam computed tomography (CBCT). A deep learning model was first trained by using several thousand annotated projection X-ray images. The trained model is capable of identifying the location of the prostate target for a given input X-ray projection image. To assess the accuracy of the approach, three patients with prostate cancer received volumetric modulated arc therapy (VMAT) were retrospectively studied. The results obtained by using the deep learning model and the actual position of the prostate were compared quantitatively. The deviations between the target positions obtained by the deep learning model and the corresponding annotations ranged from 1.66 mm to 2.77 mm for anterior-posterior (AP) direction, and from 1.15 mm to 2.88 mm for lateral direction. Target position provided by deep learning model for the kV images acquired using OBI is found to be consistent that derived from the fiducials. This study demonstrates, for the first time, that highly accurate markerless prostate localization based on deep learning is achievable. The strategy provides a clinically valuable solution to daily patient positioning and real-time target tracking for image-guided radiotherapy (IGRT) and interventions.

physics.med-ph↗

Deep Compressed Sensing

Compressed sensing (CS) provides an elegant framework for recovering sparse signals from compressed measurements. For example, CS can exploit the structure of natural images and recover an image from only a few random measurements. CS is flexible and data efficient, but its application has been restricted by the strong assumption of sparsity and costly reconstruction process. A recent approach that combines CS with neural network generators has removed the constraint of sparsity, but reconstruction remains slow. Here we propose a novel framework that significantly improves both the performance and speed of signal recovery by jointly training a generator and the optimisation process for reconstruction via meta-learning. We explore training the measurements with different objectives, and derive a family of models based on minimising measurement errors. We show that Generative Adversarial Nets (GANs) can be viewed as a special case in this family of models. Borrowing insights from the CS perspective, we develop a novel way of improving GANs using gradient information from the discriminator.

cs.LG↗

Observation of a mesoscopic magnetic modulation in chiral Mn1/3NbS2

We have investigated the structural, magnetic, thermodynamic, and charge transport properties of Mn1/3NbS2 single crystals through x-ray and neutron diffraction, magnetization, specific heat, magnetoresistance, and Hall effect measurements. Mn1/3NbS2 displays a magnetic transition at TC ~ 45 K with highly anisotropic behavior expected for a hexagonal structured material. Below TC, neutron diffraction reveals increased scattering near the structural Bragg peaks having a wider Q-dependence along the c-axis than the nuclear Bragg peaks. This indicates helimagnetism with a long pitch length of ~250 nm (or a wavevector q~0.0025 Å-1) along the c-axis. This q is substantially smaller than that found for the helimagnetic state in isostructural Cr1/3NbS2 (0.015 Å-1). Specific heat capacity measurements confirm a second-order magnetic phase transition with a substantial magnetic contribution that persists to low temperature. The large low-temperature specific heat capacity is consistent with a large density of low-lying magnetic excitations that are likely associated with topologically interesting magnetic modes. Changes to the magnetoresistance, the magnetization, and the magnetic neutron diffraction, which become more apparent below 20 K, imply a modification in the character of the magnetic ordering corresponding to the magnetic contribution to the specific heat capacity. These observations signify a more complex magnetic structure both at zero and finite fields for Mn1/3NbS2 than for the well-investigated Cr1/3NbS2.

cond-mat.mtrl-sci↗

Gaussian Random Number Generator: Implemented in FPGA for Quantum Key Distribution

Quantum Key Distribution is the process of using quantum communication to establish a shared key between two parties. It has been demonstrated the unconditional security and effective communication of quantum communication system can be guaranteed by an excellent Gaussian random number generator with high speed and an extended random period. In this paper, we propose to construct the Gaussian random number generator using Field-Programmable Gate Array (FPGA) which is able to process large data in high speed. We also compare three algorithms ofGRNgeneration: Box-Muller algorithm, polarization decision algorithm, and central limit algorithm. We demonstrate that the polarization decision algorithm implemented inFPGArequires less computing resources and also produces a high-quality Gaussian random number, through the null hypothesis test.

eess.SP↗

Optimizing Agent Behavior over Long Time Scales by Transporting Value

Humans spend a remarkable fraction of waking life engaged in acts of "mental time travel". We dwell on our actions in the past and experience satisfaction or regret. More than merely autobiographical storytelling, we use these event recollections to change how we will act in similar scenarios in the future. This process endows us with a computationally important ability to link actions and consequences across long spans of time, which figures prominently in addressing the problem of long-term temporal credit assignment; in artificial intelligence (AI) this is the question of how to evaluate the utility of the actions within a long-duration behavioral sequence leading to success or failure in a task. Existing approaches to shorter-term credit assignment in AI cannot solve tasks with long delays between actions and consequences. Here, we introduce a new paradigm for reinforcement learning where agents use recall of specific memories to credit actions from the past, allowing them to solve problems that are intractable for existing algorithms. This paradigm broadens the scope of problems that can be investigated in AI and offers a mechanistic account of behaviors that may inspire computational models in neuroscience, psychology, and behavioral economics.

cs.AI↗

The distance sum rule from strong lensing systems and quasars - test of cosmic curvature and beyond

Testing the distance-sum-rule in strong lensing systems provides an interesting method to determine the curvature parameter $Ω_k$ using more local objects. In this paper, we apply this method to a quite recent data set of strong lensing systems in combination with intermediate-luminosity quasars calibrated as standard rulers. In the framework of three types of lens models extensively used in strong lensing studies (SIS model, power-law spherical model, and extended power-law lens model), we show that the assumed lens model has a considerable impact on the cosmic curvature constraint, which is found to be compatible or marginally compatible with the flat case (depending on the lens model adopted). Analysis of low, intermediate and high-mass sub-samples defined according to the lens velocity dispersion demonstrates that, although it is not reasonable to characterize all lenses with a uniform model, such division has little impact on cosmic curvature inferred. Finally, thinking about future when massive surveys will provide their yields, we simulated a mock catalog of strong lensing systems expected to be seen by the LSST, together with a realistic catalog of quasars. We found that with about 16000 such systems, combined with the distance information provided by 500 compact milliarcsecond radio sources seen in future radio astronomical surveys, one would be able to constrain the cosmic curvature with an accuracy of $ΔΩ_k\simeq 10^{-3}$, which is comparable to the precision of \textit{Planck} 2015 results.

astro-ph.CO↗

Learning Attractor Dynamics for Generative Memory

A central challenge faced by memory systems is the robust retrieval of a stored pattern in the presence of interference due to other stored patterns and noise. A theoretically well-founded solution to robust retrieval is given by attractor dynamics, which iteratively clean up patterns during recall. However, incorporating attractor dynamics into modern deep learning systems poses difficulties: attractor basins are characterised by vanishing gradients, which are known to make training neural networks difficult. In this work, we avoid the vanishing gradient problem by training a generative distributed memory without simulating the attractor dynamics. Based on the idea of memory writing as inference, as proposed in the Kanerva Machine, we show that a likelihood-based Lyapunov function emerges from maximising the variational lower-bound of a generative memory. Experiments shows it converges to correct patterns upon iterative retrieval and achieves competitive performance as both a memory model and a generative model.

cs.LG↗

Mechanical control of crystal symmetry and superconductivity in Weyl semimetal MoTe$_2$

The non-centrosymmetric Weyl semimetal candidate, MoTe$_2$ was investigated through neutron diffraction and transport measurements at pressures up to 1.5 GPa and at temperatures down to 40 mK. Centrosymmetric and non-centrosymmetric structural phases were found to coexist in the superconducting state. Density Functional Theory (DFT) calculations reveal that the strength of the electron-phonon coupling is similar for both crystal structures. Furthermore, it was found that by controlling non-hydrostatic components of stress, it is possible to mechanically control the ground state crystal structure. This allows for the tuning of crystal symmetry in the superconducting phase from centrosymmetric to non-centrosymmetric. DFT calculations support this strain control of crystal structure. This mechanical control of crystal symmetry gives a route to tuning the band topology of MoTe$_2$ and possibly the topology of the superconducting state.

cond-mat.str-el↗

The Kanerva Machine: A Generative Distributed Memory

We present an end-to-end trained memory system that quickly adapts to new data and generates samples like them. Inspired by Kanerva's sparse distributed memory, it has a robust distributed reading and writing mechanism. The memory is analytically tractable, which enables optimal on-line compression via a Bayesian update-rule. We formulate it as a hierarchical conditional generative model, where memory provides a rich data-dependent prior distribution. Consequently, the top-down memory and bottom-up perception are combined to produce the code representing an observation. Empirically, we demonstrate that the adaptive memory significantly improves generative models trained on both the Omniglot and CIFAR datasets. Compared with the Differentiable Neural Computer (DNC) and its variants, our memory model has greater capacity and is significantly easier to train.

stat.ML↗

DFNet: Semantic Segmentation on Panoramic Images with Dynamic Loss Weights and Residual Fusion Block

For the self-driving and automatic parking, perception is the basic and critical technique, moreover, the detection of lane markings and parking slots is an important part of visual perception. In this paper, we use the semantic segmentation method to segment the area and classify the class of lane makings and parking slots on panoramic surround view (PSV) dataset. We propose the DFNet and make two main contributions, one is dynamic loss weights, and the other is residual fusion block (RFB). Dynamic loss weights are varying from classes, calculated according to the pixel number of each class in a batch. RFB is composed of two convolutional layers, one pooling layer, and a fusion layer to combine the feature maps by pixel multiplication. We evaluate our method on PSV dataset, and achieve an advanced result.

cs.CV↗

TiEV: The Tongji Intelligent Electric Vehicle in the Intelligent Vehicle Future Challenge of China

TiEV is an autonomous driving platform implemented by Tongji University of China. The vehicle is drive-by-wire and is fully powered by electricity. We devised the software system of TiEV from scratch, which is capable of driving the vehicle autonomously in urban paths as well as on fast express roads. We describe our whole system, especially novel modules of probabilistic perception fusion, incremental mapping, the 1st and the 2nd planning and the overall safety concern. TiEV finished 2016 and 2017 Intelligent Vehicle Future Challenge of China held at Changshu. We show our experiences on the development of autonomous vehicles and future trends.

cs.RO↗

VH-HFCN based Parking Slot and Lane Markings Segmentation on Panoramic Surround View

The automatic parking is being massively developed by car manufacturers and providers. Until now, there are two problems with the automatic parking. First, there is no openly-available segmentation labels of parking slot on panoramic surround view (PSV) dataset. Second, how to detect parking slot and road structure robustly. Therefore, in this paper, we build up a public PSV dataset. At the same time, we proposed a highly fused convolutional network (HFCN) based segmentation method for parking slot and lane markings based on the PSV dataset. A surround-view image is made of four calibrated images captured from four fisheye cameras. We collect and label more than 4,200 surround view images for this task, which contain various illuminated scenes of different types of parking slots. A VH-HFCN network is proposed, which adopts an HFCN as the base, with an extra efficient VH-stage for better segmenting various markings. The VH-stage consists of two independent linear convolution paths with vertical and horizontal convolution kernels respectively. This modification enables the network to robustly and precisely extract linear features. We evaluated our model on the PSV dataset and the results showed outstanding performance in ground markings segmentation. Based on the segmented markings, parking slots and lanes are acquired by skeletonization, hough line transform and line arrangement.

cs.CV↗