Search arXiv⌕ Search

arXiv subjects

Dong Wang

Publications and source records attributed to Dong Wang.

At least 667 records · Page 37Linked to original sources

Why torus-unstable solar filaments experience failed eruption?

To investigate the factors that control the success and/or failure of solar eruptions, we study the magnetic field and 3-Dimensional (3D) configuration of 16 filament eruptions during 2010 July - 2013 February. All these events, i.e., erupted but failed to be ejected to become a coronal mass ejection (CME), are failed eruptions with the filament maximum height exceeding $100 Mm$. The magnetic field of filament source regions is approximated by a potential field extrapolation method. The filament 3D configuration is reconstructed from three vantage points by the observations of STEREO Ahead/Behind and SDO spacecraft. We calculate the decay index at the apex of these failed filaments and find that in 7 cases, their apex decay indexes exceed the theoretical threshold ($n_{crit} = 1.5$) of the torus instability. We further determine the orientation change or rotation angle of each filament top during the eruption. Finally, the distribution of these events in the parameter space of rotation angle versus decay index is established. Four distinct regimes in the parameter space are empirically identified. We find that, all the torus-unstable cases (decay index $n > 1.5$), have a large rotation angles ranging from $50^\circ - 130^\circ$. The possible mechanisms leading to the rotation and failed eruption are discussed. These results imply that, besides the torus instability, the rotation motion during the eruption may also play a significant role in solar eruptions.

astro-ph.SR↗

Memory-Augmented Temporal Dynamic Learning for Action Recognition

Human actions captured in video sequences contain two crucial factors for action recognition, i.e., visual appearance and motion dynamics. To model these two aspects, Convolutional and Recurrent Neural Networks (CNNs and RNNs) are adopted in most existing successful methods for recognizing actions. However, CNN based methods are limited in modeling long-term motion dynamics. RNNs are able to learn temporal motion dynamics but lack effective ways to tackle unsteady dynamics in long-duration motion. In this work, we propose a memory-augmented temporal dynamic learning network, which learns to write the most evident information into an external memory module and ignore irrelevant ones. In particular, we present a differential memory controller to make a discrete decision on whether the external memory module should be updated with current feature. The discrete memory controller takes in the memory history, context embedding and current feature as inputs and controls information flow into the external memory module. Additionally, we train this discrete memory controller using straight-through estimator. We evaluate this end-to-end system on benchmark datasets (UCF101 and HMDB51) of human action recognition. The experimental results show consistent improvements on both datasets over prior works and our baselines.

cs.CV↗

Early Action Prediction with Generative Adversarial Networks

Action Prediction is aimed to determine what action is occurring in a video as early as possible, which is crucial to many online applications, such as predicting a traffic accident before it happens and detecting malicious actions in the monitoring system. In this work, we address this problem by developing an end-to-end architecture that improves the discriminability of features of partially observed videos by assimilating them to features from complete videos. For this purpose, the generative adversarial network is introduced for tackling action prediction problem, which improves the recognition accuracy of partially observed videos though narrowing the feature difference of partially observed videos from complete ones. Specifically, its generator comprises of two networks: a CNN for feature extraction and an LSTM for estimating residual error between features of the partially observed videos and complete ones, and then the features from CNN adds the residual error from LSTM, which is regarded as the enhanced feature to fool a competing discriminator. Meanwhile, the generator is trained with an additional perceptual objective, which forces the enhanced features of partially observed videos are discriminative enough for action prediction. Extensive experimental results on UCF101, BIT and UT-Interaction datasets demonstrate that our approach outperforms the state-of-the-art methods, especially for videos that less than 50% portion of frames is observed.

cs.CV↗

Cross-Modal Message Passing for Two-stream Fusion

Processing and fusing information among multi-modal is a very useful technique for achieving high performance in many computer vision problems. In order to tackle multi-modal information more effectively, we introduce a novel framework for multi-modal fusion: Cross-modal Message Passing (CMMP). Specifically, we propose a cross-modal message passing mechanism to fuse two-stream network for action recognition, which composes of an appearance modal network (RGB image) and a motion modal (optical flow image) network. The objectives of individual networks in this framework are two-fold: a standard classification objective and a competing objective. The classification object ensures that each modal network predicts the true action category while the competing objective encourages each modal network to outperform the other one. We quantitatively show that the proposed CMMP fuses the traditional two-stream network more effectively, and outperforms all existing two-stream fusion method on UCF-101 and HMDB-51 datasets.

cs.CV↗

Anomaly Detection in Traffic Scenes via Spatial-aware Motion Reconstruction

Anomaly detection from a driver's perspective when driving is important to autonomous vehicles. As a part of Advanced Driver Assistance Systems (ADAS), it can remind the driver about dangers timely. Compared with traditional studied scenes such as the university campus and market surveillance videos, it is difficult to detect abnormal event from a driver's perspective due to camera waggle, abidingly moving background, drastic change of vehicle velocity, etc. To tackle these specific problems, this paper proposes a spatial localization constrained sparse coding approach for anomaly detection in traffic scenes, which firstly measures the abnormality of motion orientation and magnitude respectively and then fuses these two aspects to obtain a robust detection result. The main contributions are threefold: 1) This work describes the motion orientation and magnitude of the object respectively in a new way, which is demonstrated to be better than the traditional motion descriptors. 2) The spatial localization of object is taken into account of the sparse reconstruction framework, which utilizes the scene's structural information and outperforms the conventional sparse coding methods. 3) Results of motion orientation and magnitude are adaptively weighted and fused by a Bayesian model, which makes the proposed method more robust and handle more kinds of abnormal events. The efficiency and effectiveness of the proposed method are validated by testing on nine difficult video sequences captured by ourselves. Observed from the experimental results, the proposed method is more effective and efficient than the popular competitors, and yields a higher performance.

cs.CV↗

The iterative convolution-thresholding method (ICTM) for image segmentation

In this paper, we propose a novel iterative convolution-thresholding method (ICTM) that is applicable to a range of variational models for image segmentation. A variational model usually minimizes an energy functional consisting of a fidelity term and a regularization term. In the ICTM, the interface between two different segment domains is implicitly represented by their characteristic functions. The fidelity term is then usually written as a linear functional of the characteristic functions and the regularized term is approximated by a functional of characteristic functions in terms of heat kernel convolution. This allows us to design an iterative convolution-thresholding method to minimize the approximate energy. The method is simple, efficient and enjoys the energy-decaying property. Numerical experiments show that the method is easy to implement, robust and applicable to various image segmentation models.

cs.CV↗

Listen to the Image

Visual-to-auditory sensory substitution devices can assist the blind in sensing the visual environment by translating the visual information into a sound pattern. To improve the translation quality, the task performances of the blind are usually employed to evaluate different encoding schemes. In contrast to the toilsome human-based assessment, we argue that machine model can be also developed for evaluation, and more efficient. To this end, we firstly propose two distinct cross-modal perception model w.r.t. the late-blind and congenitally-blind cases, which aim to generate concrete visual contents based on the translated sound. To validate the functionality of proposed models, two novel optimization strategies w.r.t. the primary encoding scheme are presented. Further, we conduct sets of human-based experiments to evaluate and compare them with the conducted machine-based assessments in the cross-modal generation task. Their highly consistent results w.r.t. different encoding schemes indicate that using machine model to accelerate optimization evaluation and reduce experimental cost is feasible to some extent, which could dramatically promote the upgrading of encoding scheme then help the blind to improve their visual perception ability.

cs.CV↗

VAE-based regularization for deep speaker embedding

Deep speaker embedding has achieved state-of-the-art performance in speaker recognition. A potential problem of these embedded vectors (called `x-vectors') are not Gaussian, causing performance degradation with the famous PLDA back-end scoring. In this paper, we propose a regularization approach based on Variational Auto-Encoder (VAE). This model transforms x-vectors to a latent space where mapped latent codes are more Gaussian, hence more suitable for PLDA scoring.

cs.SD↗

Universal trade-off relation between coherence and intrinsic concurrence for two-qubit states

Entanglement and coherence are two essential quantum resources for quantum information processing. A natural question arises of whether there are direct link between them. And by thinking about this question, we propose a new measure for quantum state that contains concurrence and is called intrinsic concurrence. Interestingly, we discover that the intrinsic concurrence is always complementary to coherence. Note that the intrinsic concurrence is related to the concurrence of a special pure state ensemble. In order to explain the trade-off relation more intuitively, we apply it in some composite systems composed by a single-qubit state coupling four typical noise channels with the aim at illustrating their mutual transformation relationship between their coherence and intrinsic concurrence. This unified trade-off relation will provide more flexibility in exploiting one resource to perform quantum tasks and also provide credible theoretical basis for the interconversion of the two important quantum resources.

quant-ph↗

Timing and characterization of shaped pulses with MHz ADCs in a detector system: a comparative study and deep learning approach

Timing systems based on Analog-to-Digital Converters are widely used in the design of previous high energy physics detectors. In this paper, we propose a new method based on deep learning to extract the time information from a finite set of ADC samples. Firstly, a quantitative analysis of the traditional curve fitting method regarding three kinds of variations (long-term drift, short-term change and random noise) is presented with simulation illustrations. Next, a comparative study between curve fitting and the neural networks is made to demonstrate the potential of deep learning in this problem. Simulations show that the dedicated network architecture can greatly suppress the noise RMS and improve timing resolution in non-ideal conditions. Finally, experiments are performed with the ALICE PHOS FEE card. The performance of our method is more than 20% better than curve fitting in the experimental condition.

physics.data-an↗

Non-rigid Object Tracking via Deep Multi-scale Spatial-temporal Discriminative Saliency Maps

In this paper, we propose a novel effective non-rigid object tracking framework based on the spatial-temporal consistent saliency detection. In contrast to most existing trackers that utilize a bounding box to specify the tracked target, the proposed framework can extract accurate regions of the target as tracking outputs. It achieves a better description of the non-rigid objects and reduces the background pollution for the tracking model. Furthermore, our model has several unique features. First, a tailored fully convolutional neural network (TFCN) is developed to model the local saliency prior for a given image region, which not only provides the pixel-wise outputs but also integrates the semantic information. Second, a novel multi-scale multi-region mechanism is proposed to generate local saliency maps that effectively consider visual perceptions with different spatial layouts and scale variations. Subsequently, local saliency maps are fused via a weighted entropy method, resulting in a final discriminative saliency map. Finally, we present a non-rigid object tracking algorithm based on the predicted saliency maps. By utilizing a spatial-temporal consistent saliency map (STCSM), we conduct target-background classification and use a simple fine-tuning scheme for online updating. Extensive experiments demonstrate that the proposed algorithm achieves competitive performance in both saliency detection and visual tracking, especially outperforming other related trackers on the non-rigid object tracking datasets.

cs.CV↗

Enlightening force chains: a review of photoelasticimetry in granular matter

A photoelastic material will reveal its internal stresses when observed through polarizing filters. This eye-catching property has enlightened our understanding of granular materials for over half a century, whether in the service of art, education, or scientific research. In this review article in honor of Robert Behringer, we highlight both his pioneering use of the method in physics research, and its reach into the public sphere through museum exhibits and outreach programs. We aim to provide clear protocols for artists, exhibit-designers, educators, and scientists to use in their own endeavors. It is our hope that this will build awareness about the ubiquitous presence of granular matter in our lives, enlighten its puzzling behavior, and promote conversations about its importance in environmental and industrial contexts. To aid in this endeavor, this paper also serves as a front door to a detailed wiki containing open, community-curated guidance on putting these methods into practice.

cond-mat.soft↗

Gaussian-Constrained training for speaker verification

Neural models, in particular the d-vector and x-vector architectures, have produced state-of-the-art performance on many speaker verification tasks. However, two potential problems of these neural models deserve more investigation. Firstly, both models suffer from `information leak', which means that some parameters participating in model training will be discarded during inference, i.e, the layers that are used as the classifier. Secondly, these models do not regulate the distribution of the derived speaker vectors. This `unconstrained distribution' may degrade the performance of the subsequent scoring component, e.g., PLDA. This paper proposes a Gaussian-constrained training approach that (1) discards the parametric classifier, and (2) enforces the distribution of the derived speaker vectors to be Gaussian. Our experiments on the VoxCeleb and SITW databases demonstrated that this new training approach produced more representative and regular speaker embeddings, leading to consistent performance improvement.

eess.AS↗

Neural IR Meets Graph Embedding: A Ranking Model for Product Search

Recently, neural models for information retrieval are becoming increasingly popular. They provide effective approaches for product search due to their competitive advantages in semantic matching. However, it is challenging to use graph-based features, though proved very useful in IR literature, in these neural approaches. In this paper, we leverage the recent advances in graph embedding techniques to enable neural retrieval models to exploit graph-structured data for automatic feature extraction. The proposed approach can not only help to overcome the long-tail problem of click-through data, but also incorporate external heterogeneous information to improve search results. Extensive experiments on a real-world e-commerce dataset demonstrate significant improvement achieved by our proposed approach over multiple strong baselines both as an individual retrieval model and as a feature used in learning-to-rank frameworks.

cs.IR↗

A Survey of Optimization Approaches for Wireless Physical Layer Security

Due to the malicious attacks in wireless networks, physical layer security has attracted increasing concerns from both academia and industry. The research on physical layer security mainly focuses either on the secrecy capacity/achievable secrecy rate/capacity-equivocation region from the perspective of information theory, or on the security designs from the viewpoints of optimization and signal processing. Because of its importance in security designs, the latter research direction is surveyed in a comprehensive way in this paper. The survey begins with typical wiretap channel models to cover common scenarios and systems. The topics on physical-layer security designs are then summarized from resource allocation, beamforming/precoding, and antenna/node selection and cooperation. Based on the aforementioned schemes, the performance metrics and fundamental optimization problems are discussed, which are generally adopted in security designs. Thereafter, the state of the art of optimization approaches on each research topic of physical layer security is reviewed from four categories of optimization problems, such as secrecy rate maximization, secrecy outrage probability minimization, power consumption minimization, and secure energy efficiency maximization. Furthermore, the impacts of channel state information on optimization and design are discussed. Finally, the survey concludes with the observations on potential future directions and open challenges.

cs.IT↗

CONet: A Cognitive Ocean Network

The scientific and technological revolution of the Internet of Things has begun in the area of oceanography. Historically, humans have observed the ocean from an external viewpoint in order to study it. In recent years, however, changes have occurred in the ocean, and laboratories have been built on the seafloor. Approximately 70.8% of the Earth's surface is covered by oceans and rivers. The Ocean of Things is expected to be important for disaster prevention, ocean-resource exploration, and underwater environmental monitoring. Unlike traditional wireless sensor networks, the Ocean Network has its own unique features, such as low reliability and narrow bandwidth. These features will be great challenges for the Ocean Network. Furthermore, the integration of the Ocean Network with artificial intelligence has become a topic of increasing interest for oceanology researchers. The Cognitive Ocean Network (CONet) will become the mainstream of future ocean science and engineering developments. In this article, we define the CONet. The contributions of the paper are as follows: (1) a CONet architecture is proposed and described in detail; (2) important and useful demonstration applications of the CONet are proposed; and (3) future trends in CONet research are presented.

cs.CY↗

An efficient threshold dynamics method for topology optimization for fluids

We propose an efficient threshold dynamics method for topology optimization for fluids modeled with the Stokes equation. The proposed algorithm is based on minimization of an objective energy function that consists of the dissipation power in the fluid and the perimeter approximated by nonlocal energy, subject to a fluid volume constraint and the incompressibility condition. We show that the minimization problem can be solved with an iterative scheme in which the Stokes equation is approximated by a Brinkman equation. The indicator functions of the fluid-solid regions are then updated according to simple convolutions followed by a thresholding step. We demonstrate mathematically that the iterative algorithm has the total energy decaying property. The proposed algorithm is simple and easy to implement. A simple adaptive time strategy is also used to accelerate the convergence of the iteration. Extensive numerical experiments in both two and three dimensions show that the proposed iteration algorithm converges in much fewer iterations and is more efficient than many existing methods. In addition, the numerical results show that the algorithm is very robust and insensitive to the initial guess and the parameters in the model.

math.OC↗

Generalized superconductors from the coupling of a scalar field to the Einstein tensor and their refractive index in massive gravity

We construct the generalized superconductors from the coupling of a scalar field to the Einstein tensor in the massive gravity and investigate their negative refraction in the probe limit. We observe that the larger graviton mass and Einstein tensor coupling parameters both hinder the formation of the condensation, but the larger graviton mass or smaller coupling parameter makes it easier for the emergence of the Cave of Winds. Furthermore, we see that the larger graviton mass but smaller coupling parameter make the range of frequencies or the range of temperatures larger for which a negative Depine-Lakhtakia index occurs, which indicates that the graviton mass and Einstein tensor have completely different effects on the negative refraction. In addition, we find that the larger graviton mass and coupling parameters both can reduce the dissipation and improve the propagation in the holographic setup.

hep-th↗