Searcharxiv⌕ Search

arXiv subjects

Chen Sun

Publications and source records attributed to Chen Sun.

At least 235 records · Page 13Linked to original sources

DiscrimNet: Semi-Supervised Action Recognition from Videos using Generative Adversarial Networks

We propose an action recognition framework using Gen- erative Adversarial Networks. Our model involves train- ing a deep convolutional generative adversarial network (DCGAN) using a large video activity dataset without la- bel information. Then we use the trained discriminator from the GAN model as an unsupervised pre-training step and fine-tune the trained discriminator model on a labeled dataset to recognize human activities. We determine good network architectural and hyperparameter settings for us- ing the discriminator from DCGAN as a trained model to learn useful representations for action recognition. Our semi-supervised framework using only appearance infor- mation achieves superior or comparable performance to the current state-of-the-art semi-supervised action recog- nition methods on two challenging video activity datasets: UCF101 and HMDB51.

cs.CV↗

Integrable time-dependent quantum Hamiltonians

We formulate a set of conditions under which dynamics of a time-dependent quantum Hamiltonian are integrable. The main requirement is the existence of a nonabelian gauge field with zero curvature in the space of system parameters. Known solvable multistate Landau-Zener models satisfy these conditions. Our method provides a strategy to incorporate time-dependence into various quantum integrable models, so that the resulting non-stationary Schrodinger equation is exactly solvable. We also validate some prior conjectures, including the solution of the driven generalized Tavis-Cummings model.

quant-ph↗

Long-wave magnons in a ferromagnetic film

An asymptotically exact theory of spectrum and transverse distribution of magnetization in long-wave magnons is presented. It is based on exact analytical solution of linearized Landau-Lifshitz equation in a film. The quantization of the transverse wave parameters and wave vectors is studied.

cond-mat.mes-hall↗

VQS: Linking Segmentations to Questions and Answers for Supervised Attention in VQA and Question-Focused Semantic Segmentation

Rich and dense human labeled datasets are among the main enabling factors for the recent advance on vision-language understanding. Many seemingly distant annotations (e.g., semantic segmentation and visual question answering (VQA)) are inherently connected in that they reveal different levels and perspectives of human understandings about the same visual scenes --- and even the same set of images (e.g., of COCO). The popularity of COCO correlates those annotations and tasks. Explicitly linking them up may significantly benefit both individual tasks and the unified vision and language modeling. We present the preliminary work of linking the instance segmentations provided by COCO to the questions and answers (QAs) in the VQA dataset, and name the collected links visual questions and segmentation answers (VQS). They transfer human supervision between the previously separate tasks, offer more effective leverage to existing problems, and also open the door for new research problems and models. We study two applications of the VQS data in this paper: supervised attention for VQA and a novel question-focused semantic segmentation task. For the former, we obtain state-of-the-art results on the VQA real multiple-choice task by simply augmenting the multilayer perceptrons with some attention features that are learned using the segmentation-QA links as explicit supervision. To put the latter in perspective, we study two plausible methods and compare them to an oracle method assuming that the instance segmentations are given at the test stage.

cs.CV↗

TURN TAP: Temporal Unit Regression Network for Temporal Action Proposals

Temporal Action Proposal (TAP) generation is an important problem, as fast and accurate extraction of semantically important (e.g. human actions) segments from untrimmed videos is an important step for large-scale video analysis. We propose a novel Temporal Unit Regression Network (TURN) model. There are two salient aspects of TURN: (1) TURN jointly predicts action proposals and refines the temporal boundaries by temporal coordinate regression; (2) Fast computation is enabled by unit feature reuse: a long untrimmed video is decomposed into video units, which are reused as basic building blocks of temporal proposals. TURN outperforms the state-of-the-art methods under average recall (AR) by a large margin on THUMOS-14 and ActivityNet datasets, and runs at over 880 frames per second (FPS) on a TITAN X GPU. We further apply TURN as a proposal generation stage for existing temporal action localization pipelines, it outperforms state-of-the-art performance on THUMOS-14 and ActivityNet.

cs.CV↗

Revisiting Unreasonable Effectiveness of Data in Deep Learning Era

The success of deep learning in vision can be attributed to: (a) models with high capacity; (b) increased computational power; and (c) availability of large-scale labeled data. Since 2012, there have been significant advances in representation capabilities of the models and computational capabilities of GPUs. But the size of the biggest dataset has surprisingly remained constant. What will happen if we increase the dataset size by 10x or 100x? This paper takes a step towards clearing the clouds of mystery surrounding the relationship between `enormous data' and visual deep learning. By exploiting the JFT-300M dataset which has more than 375M noisy labels for 300M images, we investigate how the performance of current vision tasks would change if this data was used for representation learning. Our paper delivers some surprising (and some expected) findings. First, we find that the performance on vision tasks increases logarithmically based on volume of training data size. Second, we show that representation learning (or pre-training) still holds a lot of promise. One can improve performance on many vision tasks by just training a better base model. Finally, as expected, we present new state-of-the-art results for different vision tasks including image classification, object detection, semantic segmentation and human pose estimation. Our sincere hope is that this inspires vision community to not undervalue the data and develop collective efforts in building larger datasets.

cs.CV↗

TALL: Temporal Activity Localization via Language Query

This paper focuses on temporal localization of actions in untrimmed videos. Existing methods typically train classifiers for a pre-defined list of actions and apply them in a sliding window fashion. However, activities in the wild consist of a wide combination of actors, actions and objects; it is difficult to design a proper activity list that meets users' needs. We propose to localize activities by natural language queries. Temporal Activity Localization via Language (TALL) is challenging as it requires: (1) suitable design of text and video representations to allow cross-modal matching of actions and language queries; (2) ability to locate actions accurately given features from sliding windows of limited granularity. We propose a novel Cross-modal Temporal Regression Localizer (CTRL) to jointly model text query and video clips, output alignment scores and action boundary regression results for candidate clips. For evaluation, we adopt TaCoS dataset, and build a new dataset for this task on top of Charades by adding sentence temporal annotations, called Charades-STA. We also build complex sentence queries in Charades-STA for test. Experimental results show that CTRL outperforms previous methods significantly on both datasets.

cs.CV↗

Multistate Landau-Zener models with all levels crossing at one point

We discuss common properties and reasons for integrability in the class of multistate Landau-Zener (MLZ) models with all diabatic levels crossing at one point. Exploring the Stokes phenomenon, we show that each previously solved model has a dual one, whose scattering matrix can be also obtained analytically. For applications, we demonstrate how our results can be used to study conversion of molecular into atomic Bose condensates during passage through the Feshbach resonance, and provide purely algebraic solutions of the bowtie and special cases of the driven Tavis-Cummings model (DTCM).

quant-ph↗

"Synchronize" to VR Body: Full Body Illusion in VR Space

Virtual Reality (VR) becomes accessible to mimic a "real-like" world now. People who have a VR experience usually can be impressed by the immersive feeling, they might consider themselves are actually existed in the VR space. Self-consciousness is important for people to identify their own characters in VR space, and illusory ownership can help people to "build" their "bodies". The rubber hand illusion can convince us a fake hand made by rubber is a part of our bodies under certain circumstances. Researches about autoscopic phenomena extend this illusory to the so-called full body illusion. We conducted 3 type of experiments to study the illusory ownership in VR space as it shows in Figure 1, and we learned: Human body must receive the synchronized visual signal and somatosensory stimulus at the same time; The visual signal must be the first person perceptive; the subject and the virtual body needs to be the same height as much as possible. All these illusory ownerships accompanied by the body temperature decreases, where the body is stimulated.

cs.HC↗

Landau-Zener extension of the Tavis-Cummings model: structure of the solution

We explore the recently discovered solution of the driven Tavis-Cummings model (DTCM). It describes interaction of arbitrary number of two-level systems with a bosonic mode that has linearly time-dependent frequency. We derive compact and tractable expressions for transition probabilities in terms of the well known special functions. In the new form, our formulas are suitable for fast numerical calculations and analytical approximations. As an application, we obtain the semiclassical limit of the exact solution and compare it to prior approximations. We also reveal connection between DTCM and $q$-deformed binomial statistics.

quant-ph↗

Speed/accuracy trade-offs for modern convolutional object detectors

The goal of this paper is to serve as a guide for selecting a detection architecture that achieves the right speed/memory/accuracy balance for a given application and platform. To this end, we investigate various ways to trade accuracy for speed and memory usage in modern convolutional object detection systems. A number of successful systems have been proposed in recent years, but apples-to-apples comparisons are difficult due to different base feature extractors (e.g., VGG, Residual Networks), different default image resolutions, as well as different hardware and software platforms. We present a unified implementation of the Faster R-CNN [Ren et al., 2015], R-FCN [Dai et al., 2016] and SSD [Liu et al., 2015] systems, which we view as "meta-architectures" and trace out the speed/accuracy trade-off curve created by using alternative feature extractors and varying other critical parameters such as image size within each of these meta-architectures. On one extreme end of this spectrum where speed and memory are critical, we present a detector that achieves real time speeds and can be deployed on a mobile device. On the opposite end in which accuracy is critical, we present a detector that achieves state-of-the-art performance measured on the COCO detection task.

cs.CV↗

Nearly-optimal quantum control: analytical approach

We propose nearly-optimal control strategies for changing states of a quantum system. We argue that quantum control optimization can be studied analytically within some protocol families that depend on a small set of parameters for optimization. This optimization strategy can be preferred in practice because it is physically transparent and does not lead to combinatorial complexity in multistate problems. For demonstration, we design optimized control protocols that achieve switching between orthogonal states of a naturally biased quantum two-level system.

quant-ph↗

Complex Event Recognition from Images with Few Training Examples

We propose to leverage concept-level representations for complex event recognition in photographs given limited training examples. We introduce a novel framework to discover event concept attributes from the web and use that to extract semantic features from images and classify them into social event categories with few training examples. Discovered concepts include a variety of objects, scenes, actions and event sub-types, leading to a discriminative and compact representation for event images. Web images are obtained for each discovered event concept and we use (pretrained) CNN features to train concept classifiers. Extensive experiments on challenging event datasets demonstrate that our proposed method outperforms several baselines using deep CNN features directly in classifying images into events with limited training examples. We also demonstrate that our method achieves the best overall accuracy on a dataset with unseen event categories using a single training example.

cs.CV↗

The 750 GeV diphoton excess in unified $SU(2)_L\times SU(2)_R\times SU(4)$ models from noncommutative geometry

We discuss a possible interpretation of the $750$ GeV diphoton resonance, recently reported at the LHC, within a class of $SU(2)_L\times SU(2)_R\times SU(4)$ models with gauge coupling unification. The unification is imposed by the underlying non-commutative geometry (NCG), which in these models is extended to a left-right symmetric completion of the Standard Model (SM). Within such \textit{unified} $SU(2)_L\times SU(2)_R\times SU(4)$ models the Higgs content is restrictively determined from the underlying NCG, instead of being arbitrarily selected. We show that the observed cross sections involving the $750$ GeV diphoton resonance could be realized through a SM singlet scalar field accompanied by colored scalars, present in these unified models. In view of this result we discuss the underlying rigidity of these models in the NCG framework and the wider implications of the NCG approach for physics beyond the SM.

hep-ph↗

Observable Effects of Quantum Gravity

We discuss the generic phenomenology of quantum gravity and, in particular, argue that the observable effects of quantum gravity, associated with new, extended, non-local, non-particle-like quanta, and accompanied by a dynamical energy-momentum space, are not necessarily Planckian and that they could be observed at much lower and experimentally accessible energy scales.

gr-qc↗

ACD: Action Concept Discovery from Image-Sentence Corpora

Action classification in still images is an important task in computer vision. It is challenging as the appearances of ac- tions may vary depending on their context (e.g. associated objects). Manually labeling of context information would be time consuming and difficult to scale up. To address this challenge, we propose a method to automatically discover and cluster action concepts, and learn their classifiers from weakly supervised image-sentence corpora. It obtains candidate action concepts by extracting verb-object pairs from sentences and verifies their visualness with the associated images. Candidate action concepts are then clustered by using a multi-modal representation with image embeddings from deep convolutional networks and text embeddings from word2vec. More than one hundred human action concept classifiers are learned from the Flickr 30k dataset with no additional human effort and promising classification results are obtained. We further apply the AdaBoost algorithm to automatically select and combine relevant action concepts given an action query. Promising results have been shown on the PASCAL VOC 2012 action classification benchmark, which has zero overlap with Flickr30k.

cs.CV↗

ProNet: Learning to Propose Object-specific Boxes for Cascaded Neural Networks

This paper aims to classify and locate objects accurately and efficiently, without using bounding box annotations. It is challenging as objects in the wild could appear at arbitrary locations and in different scales. In this paper, we propose a novel classification architecture ProNet based on convolutional neural networks. It uses computationally efficient neural networks to propose image regions that are likely to contain objects, and applies more powerful but slower networks on the proposed regions. The basic building block is a multi-scale fully-convolutional network which assigns object confidence scores to boxes at different locations and scales. We show that such networks can be trained effectively using image-level annotations, and can be connected into cascades or trees for efficient object classification. ProNet outperforms previous state-of-the-art significantly on PASCAL VOC 2012 and MS COCO datasets for object classification and point-based localization.

cs.CV↗