Searcharxiv⌕ Search

arXiv subjects

Yi Yang

Publications and source records attributed to Yi Yang.

At least 1,027 records · Page 57Linked to original sources

The First Release of the AST3-1 Point Source Catalogue from Dome A, Antarctica

The three Antarctic Survey Telescopes (AST3) aim to carry out time domain imaging survey at Dome A, Antarctica. The first of the three telescopes (AST3-1) was successfully deployed on January 2012. AST3-1 is a 500\,mm aperture modified Schmidt telescope with a 680\,mm diameter primary mirror. AST3-1 is equipped with a SDSS $i$ filter and a 10k $\times$ 10k frame transfer CCD camera, reduced to 5k $\times$ 10k by electronic shuttering, resulting in a 4.3 deg$^2$ field-of-view. To verify the capability of AST3-1 for a variety of science goals, extensive commissioning was carried out between March and May 2012. The commissioning included a survey covering 2000 deg$^2$ as well as the entire Large and Small Magellanic Clouds. Frequent repeated images were made of the center of the Large Magellanic Cloud, a selected exoplanet transit field, and fields including some Wolf-Rayet stars. Here we present the data reduction and photometric measurements of the point sources observed by AST3-1. We have achieved a survey depth of 19.3\,mag in 60 s exposures with 5\,mmag precision in the light curves of bright stars. The facility achieves sub-mmag photometric precision under stable survey conditions, approaching its photon noise limit. These results demonstrate that AST3-1 at Dome A is extraordinarily competitive in time-domain astronomy, including both quick searches for faint transients and the detection of tiny transit signals.

astro-ph.IM↗

Collective Entity Disambiguation with Structured Gradient Tree Boosting

We present a gradient-tree-boosting-based structured learning model for jointly disambiguating named entities in a document. Gradient tree boosting is a widely used machine learning algorithm that underlies many top-performing natural language processing systems. Surprisingly, most works limit the use of gradient tree boosting as a tool for regular classification or regression problems, despite the structured nature of language. To the best of our knowledge, our work is the first one that employs the structured gradient tree boosting (SGTB) algorithm for collective entity disambiguation. By defining global features over previous disambiguation decisions and jointly modeling them with local features, our system is able to produce globally optimized entity assignments for mentions in a document. Exact inference is prohibitively expensive for our globally normalized model. To solve this problem, we propose Bidirectional Beam Search with Gold path (BiBSG), an approximate inference algorithm that is a variant of the standard beam search algorithm. BiBSG makes use of global information from both past and future to perform better local search. Experiments on standard benchmark datasets show that SGTB significantly improves upon published results. Specifically, SGTB outperforms the previous state-of-the-art neural system by near 1\% absolute accuracy on the popular AIDA-CoNLL dataset.

cs.CL↗

Adversarial Complementary Learning for Weakly Supervised Object Localization

In this work, we propose Adversarial Complementary Learning (ACoL) to automatically localize integral objects of semantic interest with weak supervision. We first mathematically prove that class localization maps can be obtained by directly selecting the class-specific feature maps of the last convolutional layer, which paves a simple way to identify object regions. We then present a simple network architecture including two parallel-classifiers for object localization. Specifically, we leverage one classification branch to dynamically localize some discriminative object regions during the forward pass. Although it is usually responsive to sparse parts of the target objects, this classifier can drive the counterpart classifier to discover new and complementary object regions by erasing its discovered regions from the feature maps. With such an adversarial learning, the two parallel-classifiers are forced to leverage complementary object regions for classification and can finally generate integral object localization together. The merits of ACoL are mainly two-fold: 1) it can be trained in an end-to-end manner; 2) dynamically erasing enables the counterpart classifier to discover complementary object regions more effectively. We demonstrate the superiority of our ACoL approach in a variety of experiments. In particular, the Top-1 localization error rate on the ILSVRC dataset is 45.14%, which is the new state-of-the-art.

cs.CV↗

Camera Style Adaptation for Person Re-identification

Being a cross-camera retrieval task, person re-identification suffers from image style variations caused by different cameras. The art implicitly addresses this problem by learning a camera-invariant descriptor subspace. In this paper, we explicitly consider this challenge by introducing camera style (CamStyle) adaptation. CamStyle can serve as a data augmentation approach that smooths the camera style disparities. Specifically, with CycleGAN, labeled training images can be style-transferred to each camera, and, along with the original training samples, form the augmented training set. This method, while increasing data diversity against over-fitting, also incurs a considerable level of noise. In the effort to alleviate the impact of noise, the label smooth regularization (LSR) is adopted. The vanilla version of our method (without LSR) performs reasonably well on few-camera systems in which over-fitting often occurs. With LSR, we demonstrate consistent improvement in all systems regardless of the extent of over-fitting. We also report competitive accuracy compared with the state of the art.

cs.CV↗

Occlusion Aware Unsupervised Learning of Optical Flow

It has been recently shown that a convolutional neural network can learn optical flow estimation with unsupervised learning. However, the performance of the unsupervised methods still has a relatively large gap compared to its supervised counterpart. Occlusion and large motion are some of the major factors that limit the current unsupervised learning of optical flow methods. In this work we introduce a new method which models occlusion explicitly and a new warping way that facilitates the learning of large motion. Our method shows promising results on Flying Chairs, MPI-Sintel and KITTI benchmark datasets. Especially on KITTI dataset where abundant unlabeled samples exist, our unsupervised method outperforms its counterpart trained with supervised learning.

cs.CV↗

Differences in the gas and dust distribution in the transitional disk of a sun-like young star, PDS 70

We present ALMA 0.87 mm continuum, HCO+ J=4--3 emission line, and CO J=3--2 emission line data of the disk of material around the young, Sun-like star PDS 70. These data reveal the existence of a possible two component transitional disk system with a radial dust gap of 0."2 +/- 0."05, an azimuthal gap in the HCO+ J=4--3 moment zero map, as well as two bridge-like features in the gas data. Interestingly these features in the gas disk have no analogue in the dust disk making them of particular interest. We modeled the dust disk using the Monte Carlo radiative transfer code HOCHUNK3D (Whitney et al. 2013) using a two disk components. We find that there is a radial gap that extends from 15-60 au in all grain sizes which differs from previous work.

astro-ph.EP↗

Peano Model for Planar Compacta and a Lemma by Beardon

It is known that, among all the monotone decompositions of a planar compact set K with Peano hyperspaces, there exists a unique one that is finer than all the others. We call it the "core decomposition" of K with Peano hyperspace. The resulted hyperspace under quotient topology will be referred to as the "Peano model" for K. We show that the core decomposition is independent of the embedding of K into the plane. Given a rational function f with degree at least 2 that is independent of K. A well known result by Beardon says that the pre-image for any element d of the core decomposition has finitely many components, each of which is mapped by f onto d. We show that those components belong to the core decomposition of L, the pre-image of K under the above mentioned rational map f. This provides an affirmative answer to Question 5.4 proposed by Curry (MR2642461) and extends earlier partial results by Blokh-Curry-Oversteegen (MR2737795 and MR3008890), when K is assumed to be unshielded and the rational map f is assumed to be a polynomial, under which K is completely invariant. The previous result is also connected with a well known Factor Theorem developed by Whyburn. We also introduce a lambda function from K to the set of non-negative integers, such that this function is constantly zero if and only if K is a Peano space. This function and its maximum are topologically invariant, while its level set at zero is of particular interest. For instance, when K is the Mandelbrot set we find close relations between the level set at zero and the hyperbolic components. Further discussions on the lambda function can be expected.

math.DS↗

Style Aggregated Network for Facial Landmark Detection

Recent advances in facial landmark detection achieve success by learning discriminative features from rich deformation of face shapes and poses. Besides the variance of faces themselves, the intrinsic variance of image styles, e.g., grayscale vs. color images, light vs. dark, intense vs. dull, and so on, has constantly been overlooked. This issue becomes inevitable as increasing web images are collected from various sources for training neural networks. In this work, we propose a style-aggregated approach to deal with the large intrinsic variance of image styles for facial landmark detection. Our method transforms original face images to style-aggregated images by a generative adversarial module. The proposed scheme uses the style-aggregated image to maintain face images that are more robust to environmental changes. Then the original face images accompanying with style-aggregated ones play a duet to train a landmark detector which is complementary to each other. In this way, for each face, our method takes two images as input, i.e., one in its original style and the other in the aggregated style. In experiments, we observe that the large variance of image styles would degenerate the performance of facial landmark detectors. Moreover, we show the robustness of our method to the large variance of image styles by comparing to a variant of our approach, in which the generative adversarial module is removed, and no style-aggregated images are used. Our approach is demonstrated to perform well when compared with state-of-the-art algorithms on benchmark datasets AFLW and 300-W. Code is publicly available on GitHub: https://github.com/D-X-Y/SAN

cs.CV↗

Strong light illumination on gain-switched semiconductor lasers helps the eavesdropper in practical quantum key distribution systems

The temperature of the semiconductor diode increases under strong light illumination whether thermoelectric cooler is installed or not, which changes the output wavelength of the laser (Lee M. S. et al., 2017). However, other characteristics also vary as temperature increases. These variations may help the eavesdropper in practical quantum key distribution systems. We study the effects of temperature increase on gain-switched semiconductor lasers by simulating temperature dependent rate equations. The results show that temperature increase may cause large intensity fluctuation, decrease the output intensity and lead the signal state and decoy state distinguishable. We also propose a modified photon number splitting attack by exploiting the effects of temperature increase. Countermeasures are also proposed.

quant-ph↗

Multifrequency superscattering from subwavelength hyperbolic structures

Superscattering, i.e., a phenomenon of the scattering cross section from a subwavelength object exceeding the single-channel limit, has important prospects in enhanced sensing/spectroscopy, solar cells, and biomedical imaging. Superscattering can be typically constructed only at a single frequency regime, and depends critically on the inescapable material losses. Under such realistic conditions, superscattering has not been predicted nor observed to exist simultaneously at multiple frequency regimes. Here we introduce multifrequency superscattering in a subwavelength hyperbolic structure, which can be made from artificial metamaterials or from naturally-existing materials, such as hexagonal boron nitride (BN), and show the advantage of such hyperbolic materials for reducing structural complexity. The underlying mechanism is revealed to be the multimode resonances at multiple frequency regimes as appear in BN due to the peculiar dispersion of phonon-polaritons. Importantly, the multifrequency superscattering has a high tolerance to material losses and some structural variations, bringing the concept of multifrequency superscattering closer to useful and realistic conditions.

physics.optics↗

Indexing of CNN Features for Large Scale Image Search

The convolutional neural network (CNN) features can give a good description of image content, which usually represent images with unique global vectors. Although they are compact compared to local descriptors, they still cannot efficiently deal with large-scale image retrieval due to the cost of the linear incremental computation and storage. To address this issue, we build a simple but effective indexing framework based on inverted table, which significantly decreases both the search time and memory usage. In addition, several strategies are fully investigated under an indexing framework to adapt it to CNN features and compensate for quantization errors. First, we use multiple assignment for the query and database images to increase the probability of relevant images' co-existing in the same Voronoi cells obtained via the clustering algorithm. Then, we introduce embedding codes to further improve precision by removing false matches during a search. We demonstrate that by using hashing schemes to calculate the embedding codes and by changing the ranking rule, indexing framework speeds can be greatly improved. Extensive experiments conducted on several unsupervised and supervised benchmarks support these results and the superiority of the proposed indexing framework. We also provide a fair comparison between the popular CNN features.

cs.CV↗

Diagnose like a Radiologist: Attention Guided Convolutional Neural Network for Thorax Disease Classification

This paper considers the task of thorax disease classification on chest X-ray images. Existing methods generally use the global image as input for network learning. Such a strategy is limited in two aspects. 1) A thorax disease usually happens in (small) localized areas which are disease specific. Training CNNs using global image may be affected by the (excessive) irrelevant noisy areas. 2) Due to the poor alignment of some CXR images, the existence of irregular borders hinders the network performance. In this paper, we address the above problems by proposing a three-branch attention guided convolution neural network (AG-CNN). AG-CNN 1) learns from disease-specific regions to avoid noise and improve alignment, 2) also integrates a global branch to compensate the lost discriminative cues by local branch. Specifically, we first learn a global CNN branch using global images. Then, guided by the attention heat map generated from the global branch, we inference a mask to crop a discriminative region from the global image. The local region is used for training a local CNN branch. Lastly, we concatenate the last pooling layers of both the global and local branches for fine-tuning the fusion branch. The Comprehensive experiment is conducted on the ChestX-ray14 dataset. We first report a strong global baseline producing an average AUC of 0.841 with ResNet-50 as backbone. After combining the local cues with the global information, AG-CNN improves the average AUC to 0.868. While DenseNet-121 is used, the average AUC achieves 0.871, which is a new state of the art in the community.

cs.CV↗

Mapping Circumstellar Matter with Polarized Light - The Case of Supernova 2014J in M82

Optical polarimetry is an effective way of probing the environment of supernova for dust. We acquired linear HST ACS/WFC polarimetry in bands $F475W$, $F606W$, and $F775W$ of the supernova (SN) 2014J in M82 at six epochs from $\sim$277 days to $\sim$1181 days after the $B$-band maximum. The polarization measured at day 277 shows conspicuous deviations from other epochs. These differences can be attributed to at least $\sim$ 10$^{-6} M_{\odot}$ of circumstellar dust located at a distance of $\sim5\times10^{17}$ cm from the SN. The scattering dust grains revealed by these observations seem to be aligned with the dust in the interstellar medium that is responsible for the large reddening towards the supernova. The presence of this circumstellar dust sets strong constraints on the progenitor system that led to the explosion of SN\,2014J; however, it cannot discriminate between single- and double-degenerate models.

astro-ph.HE↗

Beyond Part Models: Person Retrieval with Refined Part Pooling (and a Strong Convolutional Baseline)

Employing part-level features for pedestrian image description offers fine-grained information and has been verified as beneficial for person retrieval in very recent literature. A prerequisite of part discovery is that each part should be well located. Instead of using external cues, e.g., pose estimation, to directly locate parts, this paper lays emphasis on the content consistency within each part. Specifically, we target at learning discriminative part-informed features for person retrieval and make two contributions. (i) A network named Part-based Convolutional Baseline (PCB). Given an image input, it outputs a convolutional descriptor consisting of several part-level features. With a uniform partition strategy, PCB achieves competitive results with the state-of-the-art methods, proving itself as a strong convolutional baseline for person retrieval. (ii) A refined part pooling (RPP) method. Uniform partition inevitably incurs outliers in each part, which are in fact more similar to other parts. RPP re-assigns these outliers to the parts they are closest to, resulting in refined parts with enhanced within-part consistency. Experiment confirms that RPP allows PCB to gain another round of performance boost. For instance, on the Market-1501 dataset, we achieve (77.4+4.2)% mAP and (92.3+1.5)% rank-1 accuracy, surpassing the state of the art by a large margin.

cs.CV↗

On Runge-Kutta methods for the water wave equation and its simplified nonlocal hyperbolic model

There is a growing interest in investigating numerical approximations of the water wave equation in recent years, whereas the lack of rigorous analysis of its time discretization inhibits the design of more efficient algorithms. In this work, we focus on a nonlocal hyperbolic model, which essentially inherits the features of the water wave equation, and is simplified from the latter. For the constant coefficient case, we carry out systematical stability studies of the fully discrete approximation of such systems with the Fourier spectral approximation in space and general Runge-Kutta method in time. In particular, we discover the optimal time step constraints, in the form of a modified CFL condition, when certain explicit Runge-Kutta method are applied. Besides, the convergence of the semi-discrete approximation of variable coefficient case is shown, which naturally connects to the water wave equation. Extensive numerical tests have been performed to verify the stability conditions and simulations of the simplified hyperbolic model in the high frequency regime and the water wave equation are also provided.

math.NA↗

Semi-Transparent Solar Cell enabled by Frequency Selective Light Trapping

We propose a frequency selective light trapping scheme that enables the creation of more visually-transparent and yet simultaneously more efficient semitransparent solar cells. A nanoparticle scattering layer and photonic stack back reflector create a selective trapping effect by total internal reflection within a medium, increasing absorption of IR light. We propose a strong frequency selective scattering layer using spherical TiO2 nanoparticles with radius of 255 nm and area density of 1.1% in a medium with index of refraction of 1.5. Using detailed numerical simulations for this configuration, we find that it is possible to create a semitransparent silicon solar cell that has a Shockley Queisser efficiency of 12.0%\pm0.4% with a visible transparency of 60.2%\pm1.3%, 13.3%\pm1.3 more visibly-transparent than a bare silicon cell at the same efficiency.

physics.app-ph↗

Late-time Flattening of Type Ia Supernova Light Curves: Constraints From SN 2014J in M82

The very nearby Type Ia supernova 2014J in M82 offers a rare opportunity to study the physics of thermonuclear supernovae at extremely late phases ($\gtrsim$800 days). Using the Hubble Space Telescope (HST), we obtained six epochs of high precision photometry for SN 2014J from 277 days to 1181 days past the $B-$band maximum light. The reprocessing of electrons and X-rays emitted by the radioactive decay chain $^{57}$Co$\rightarrow ^{57}$Fe are needed to explain the significant flattening of both the $F606W$-band and the pseudo-bolometric light curves. The flattening confirms previous predictions that the late-time evolution of type Ia supernova luminosities requires additional energy input from the decay of $^{57}$Co (Seitenzahl et al. 2009). By assuming the $F606W$-band luminosity scales with the bolometric luminosity at $\sim$500 days after the $B-$band maximum light, a mass ratio $^{57}$Ni/$^{56}$Ni$\sim$0.065$_{-0.004}^{+0.005}$ is required. This mass ratio is roughly $\sim$3 times the solar ratio and favors a progenitor white dwarf with a mass near the Chandrasekhar limit. A similar fit using the constructed pseudo-bolometric luminosity gives a mass ratio $^{57}$Ni/$^{56}$Ni$\sim$0.066$_{-0.008}^{+0.009}$. Astrometric tests based on the multi-epoch HST ACS/WFC images reveal no significant circumstellar light echoes in between 0.3 pc and 100 pc (Yang et al. 2017) from the supernova.

astro-ph.SR↗

EraseReLU: A Simple Way to Ease the Training of Deep Convolution Neural Networks

For most state-of-the-art architectures, Rectified Linear Unit (ReLU) becomes a standard component accompanied with each layer. Although ReLU can ease the network training to an extent, the character of blocking negative values may suppress the propagation of useful information and leads to the difficulty of optimizing very deep Convolutional Neural Networks (CNNs). Moreover, stacking layers with nonlinear activations is hard to approximate the intrinsic linear transformations between feature representations. In this paper, we investigate the effect of erasing ReLUs of certain layers and apply it to various representative architectures following deterministic rules. It can ease the optimization and improve the generalization performance for very deep CNN models. We find two key factors being essential to the performance improvement: 1) the location where ReLU should be erased inside the basic module; 2) the proportion of basic modules to erase ReLU; We show that erasing the last ReLU layer of all basic modules in a network usually yields improved performance. In experiments, our approach successfully improves the performance of various representative architectures, and we report the improved results on SVHN, CIFAR-10/100, and ImageNet. Moreover, we achieve competitive single-model performance on CIFAR-100 with 16.53% error rate compared to state-of-the-art.

cs.CV↗