arXiv subjects

Xiao Yang

Publications and source records attributed to Xiao Yang.

At least 253 records · Page 14Linked to original sources

arXiv2018

Text Extraction and Retrieval from Smartphone Screenshots: Building a Repository for Life in Media

Daily engagement in life experiences is increasingly interwoven with mobile device use. Screen capture at the scale of seconds is being used in behavioral studies and to implement "just-in-time" health interventions. The increasing psychological breadth of digital information will continue to make the actual screens that people view a preferred if not required source of data about life experiences. Effective and efficient Information Extraction and Retrieval from digital screenshots is a crucial prerequisite to successful use of screen data. In this paper, we present the experimental workflow we exploited to: (i) pre-process a unique collection of screen captures, (ii) extract unstructured text embedded in the images, (iii) organize image text and metadata based on a structured schema, (iv) index the resulting document collection, and (v) allow for Image Retrieval through a dedicated vertical search engine application. The adopted procedure integrates different open source libraries for traditional image processing, Optical Character Recognition (OCR), and Image Retrieval. Our aim is to assess whether and how state-of-the-art methodologies can be applied to this novel data set. We show how combining OpenCV-based pre-processing modules with a Long short-term memory (LSTM) based release of Tesseract OCR, without ad hoc training, led to a 74% character-level accuracy of the extracted text. Further, we used the processed repository as baseline for a dedicated Image Retrieval system, for the immediate use and application for behavioral and prevention scientists. We discuss issues of Text Information Extraction and Retrieval that are particular to the screenshot image case and suggest important future work.

cs.IR↗

arXiv2017

Fast Predictive Simple Geodesic Regression

Deformable image registration and regression are important tasks in medical image analysis. However, they are computationally expensive, especially when analyzing large-scale datasets that contain thousands of images. Hence, cluster computing is typically used, making the approaches dependent on such computational infrastructure. Even larger computational resources are required as study sizes increase. This limits the use of deformable image registration and regression for clinical applications and as component algorithms for other image analysis approaches. We therefore propose using a fast predictive approach to perform image registrations. In particular, we employ these fast registration predictions to approximate a simplified geodesic regression model to capture longitudinal brain changes. The resulting method is orders of magnitude faster than the standard optimization-based regression model and hence facilitates large-scale analysis on a single graphics processing unit (GPU). We evaluate our results on 3D brain magnetic resonance images (MRI) from the ADNI datasets.

cs.CV↗

arXiv2017

Prolongation of SMAP to Spatio-temporally Seamless Coverage of Continental US Using a Deep Learning Neural Network

The Soil Moisture Active Passive (SMAP) mission has delivered valuable sensing of surface soil moisture since 2015. However, it has a short time span and irregular revisit schedule. Utilizing a state-of-the-art time-series deep learning neural network, Long Short-Term Memory (LSTM), we created a system that predicts SMAP level-3 soil moisture data with atmospheric forcing, model-simulated moisture, and static physiographic attributes as inputs. The system removes most of the bias with model simulations and improves predicted moisture climatology, achieving small test root-mean-squared error (<0.035) and high correlation coefficient >0.87 for over 75\% of Continental United States, including the forested Southeast. As the first application of LSTM in hydrology, we show the proposed network avoids overfitting and is robust for both temporal and spatial extrapolation tests. LSTM generalizes well across regions with distinct climates and physiography. With high fidelity to SMAP, LSTM shows great potential for hindcasting, data assimilation, and weather forecasting.

stat.ML↗

arXiv2017

Out-of-plane Piezoelectricity and Ferroelectricity in Layered $α$-In2Se3 Nano-flakes

Piezoelectric and ferroelectric properties in the two dimensional (2D) limit are highly desired for nanoelectronic, electromechanical, and optoelectronic applications. Here we report the first experimental evidence of out-of-plane piezoelectricity and ferroelectricity in van der Waals layered $α$-In2Se3 nano-flakes. The non-centrosymmetric R3m symmetry of the $α$-In2Se3 samples is confirmed by scanning transmission electron microscopy, second-harmonic generation, and Raman spectroscopy measurements. Domains with opposite polarizations are visualized by piezo-response force microscopy. Single-point poling experiments suggest that the polarization is potentially switchable for $α$-In2Se3 nano-flakes with thicknesses down to ~ 10 nm. The piezotronic effect is demonstrated in two-terminal devices, where the Schottky barrier can be modulated by the strain-induced piezopotential. Our work on polar $α$-In2Se3, one of the model 2D piezoelectrics and ferroelectrics with simple crystal structures, shows its great potential in electronic and photonic applications.

cond-mat.mtrl-sci↗

arXiv2017

Learning non-parametric Markov networks with mutual information

We propose a method for learning Markov network structures for continuous data without invoking any assumptions about the distribution of the variables. The method makes use of previous work on a non-parametric estimator for mutual information which is used to create a non-parametric test for multivariate conditional independence. This independence test is then combined with an efficient constraint-based algorithm for learning the graph structure. The performance of the method is evaluated on several synthetic data sets and it is shown to learn considerably more accurate structures than competing methods when the dependencies between the variables involve non-linearities.

cs.LG↗

arXiv2017

Optimal Task Scheduling in Communication-Constrained Mobile Edge Computing Systems for Wireless Virtual Reality

Mobile edge computing (MEC) is expected to be an effective solution to deliver 360-degree virtual reality (VR) videos over wireless networks. In contrast to previous computation-constrained MEC framework, which reduces the computation-resource consumption at the mobile VR device by increasing the communication-resource consumption, we develop a communications-constrained MEC framework to reduce communication-resource consumption by increasing the computation-resource consumption and exploiting the caching resources at the mobile VR device in this paper. Specifically, according to the task modularization, the MEC server can only deliver the components which have not been stored in the VR device, and then the VR device uses the received components and the corresponding cached components to construct the task, resulting in low communication-resource consumption but high delay. The MEC server can also compute the task by itself to reduce the delay, however, it consumes more communication-resource due to the delivery of entire task. Therefore, we then propose a task scheduling strategy to decide which computation model should the MEC server operates, in order to minimize the communication-resource consumption under the delay constraint. Finally, we discuss the tradeoffs between communications, computing, and caching in the proposed system.

cs.IT↗

arXiv2017

Quicksilver: Fast Predictive Image Registration - a Deep Learning Approach

This paper introduces Quicksilver, a fast deformable image registration method. Quicksilver registration for image-pairs works by patch-wise prediction of a deformation model based directly on image appearance. A deep encoder-decoder network is used as the prediction model. While the prediction strategy is general, we focus on predictions for the Large Deformation Diffeomorphic Metric Mapping (LDDMM) model. Specifically, we predict the momentum-parameterization of LDDMM, which facilitates a patch-wise prediction strategy while maintaining the theoretical properties of LDDMM, such as guaranteed diffeomorphic mappings for sufficiently strong regularization. We also provide a probabilistic version of our prediction network which can be sampled during the testing time to calculate uncertainties in the predicted deformations. Finally, we introduce a new correction network which greatly increases the prediction accuracy of an already existing prediction network. We show experimental results for uni-modal atlas-to-image as well as uni- / multi- modal image-to-image registrations. These experiments demonstrate that our method accurately predicts registrations obtained by numerical optimization, is very fast, achieves state-of-the-art registration results on four standard validation datasets, and can jointly learn an image similarity measure. Quicksilver is freely available as an open-source software.

cs.CV↗

arXiv2017

Learning to Extract Semantic Structure from Documents Using Multimodal Fully Convolutional Neural Network

We present an end-to-end, multimodal, fully convolutional network for extracting semantic structures from document images. We consider document semantic structure extraction as a pixel-wise segmentation task, and propose a unified model that classifies pixels based not only on their visual appearance, as in the traditional page segmentation task, but also on the content of underlying text. Moreover, we propose an efficient synthetic document generation process that we use to generate pretraining data for our network. Once the network is trained on a large set of synthetic documents, we fine-tune the network on unlabeled real documents using a semi-supervised approach. We systematically study the optimum network architecture and show that both our multimodal approach and the synthetic data pretraining significantly boost the performance.

cs.CV↗

arXiv2017

Fast Predictive Multimodal Image Registration

We introduce a deep encoder-decoder architecture for image deformation prediction from multimodal images. Specifically, we design an image-patch-based deep network that jointly (i) learns an image similarity measure and (ii) the relationship between image patches and deformation parameters. While our method can be applied to general image registration formulations, we focus on the Large Deformation Diffeomorphic Metric Mapping (LDDMM) registration model. By predicting the initial momentum of the shooting formulation of LDDMM, we preserve its mathematical properties and drastically reduce the computation time, compared to optimization-based approaches. Furthermore, we create a Bayesian probabilistic version of the network that allows evaluation of registration uncertainty via sampling of the network at test time. We evaluate our method on a 3D brain MRI dataset using both T1- and T2-weighted images. Our experiments show that our method generates accurate predictions and that learning the similarity measure leads to more consistent registrations than relying on generic multimodal image similarity measures, such as mutual information. Our approach is an order of magnitude faster than optimization-based LDDMM.

cs.CV↗

arXiv2017

Efficient Registration of Pathological Images: A Joint PCA/Image-Reconstruction Approach

Registration involving one or more images containing pathologies is challenging, as standard image similarity measures and spatial transforms cannot account for common changes due to pathologies. Low-rank/Sparse (LRS) decomposition removes pathologies prior to registration; however, LRS is memory-demanding and slow, which limits its use on larger data sets. Additionally, LRS blurs normal tissue regions, which may degrade registration performance. This paper proposes an efficient alternative to LRS: (1) normal tissue appearance is captured by principal component analysis (PCA) and (2) blurring is avoided by an integrated model for pathology removal and image reconstruction. Results on synthetic and BRATS 2015 data demonstrate its utility.

cs.CV↗

arXiv2017

Using Word Embeddings in Twitter Election Classification

Word embeddings and convolutional neural networks (CNN) have attracted extensive attention in various classification tasks for Twitter, e.g. sentiment classification. However, the effect of the configuration used to train and generate the word embeddings on the classification performance has not been studied in the existing literature. In this paper, using a Twitter election classification task that aims to detect election-related tweets, we investigate the impact of the background dataset used to train the embedding models, the context window size and the dimensionality of word embeddings on the classification performance. By comparing the classification results of two word embedding models, which are trained using different background corpora (e.g. Wikipedia articles and Twitter microposts), we show that the background data type should align with the Twitter classification dataset to achieve a better performance. Moreover, by evaluating the results of word embeddings models trained using various context window sizes and dimensionalities, we found that large context window and dimension sizes are preferable to improve the performance. Our experimental results also show that using word embeddings and CNN leads to statistically significant improvements over various baselines such as random, SVM with TF-IDF and SVM with word embeddings.

cs.IR↗

arXiv2016

Smart Library: Identifying Books in a Library using Richly Supervised Deep Scene Text Reading

Physical library collections are valuable and long standing resources for knowledge and learning. However, managing books in a large bookshelf and finding books on it often leads to tedious manual work, especially for large book collections where books might be missing or misplaced. Recently, deep neural models, such as Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN) have achieved great success for scene text detection and recognition. Motivated by these recent successes, we aim to investigate their viability in facilitating book management, a task that introduces further challenges including large amounts of cluttered scene text, distortion, and varied lighting conditions. In this paper, we present a library inventory building and retrieval system based on scene text reading methods. We specifically design our scene text recognition model using rich supervision to accelerate training and achieve state-of-the-art performance on several benchmark datasets. Our proposed system has the potential to greatly reduce the amount of human labor required in managing book inventories as well as the space needed to store book information.

cs.CV↗

arXiv2016

Fast Predictive Image Registration

We present a method to predict image deformations based on patch-wise image appearance. Specifically, we design a patch-based deep encoder-decoder network which learns the pixel/voxel-wise mapping between image appearance and registration parameters. Our approach can predict general deformation parameterizations, however, we focus on the large deformation diffeomorphic metric mapping (LDDMM) registration model. By predicting the LDDMM momentum-parameterization we retain the desirable theoretical properties of LDDMM, while reducing computation time by orders of magnitude: combined with patch pruning, we achieve a 1500x/66x speed up compared to GPU-based optimization for 2D/3D image registration. Our approach has better prediction accuracy than predicting deformation or velocity fields and results in diffeomorphic transformations. Additionally, we create a Bayesian probabilistic version of our network, which allows evaluation of deformation field uncertainty through Monte Carlo sampling using dropout at test time. We show that deformation uncertainty highlights areas of ambiguous deformations. We test our method on the OASIS brain image dataset in 2D and 3D.

cs.CV↗

arXiv2016

Automatic Recognition of Sunspots in HSOS Full-Disk Solar Images

A procedure is introduced to recognise sunspots automatically in solar full-disk photosphere images obtained from Huairou Solar Observing Station, National Astronomical Observatories of China. The images are first pre-processed through Gaussian algorithm. Sunspots are then recognised by the morphological Bot-hat operation and Otsu threshold. Wrong selection of sunspots is eliminated by a criterion of sunspot properties. Besides, in order to calculate the sunspots areas and the solar centre, the solar limb is extracted by a procedure using morphological closing and erosion operations and setting an adaptive threshold. Results of sunspot recognition reveal that the number of the sunspots detected by our procedure has a quite good agreement with the manual method. The sunspot recognition rate is 95% and error rate is 1.2%. The sunspot areas calculated by our method have high correlation (95%) with the area data from USAF/NOAA.

astro-ph.SR↗

arXiv2014

Large Alphabet Compression and Predictive Distributions through Poissonization and Tilting

This paper introduces a convenient strategy for coding and predicting sequences of independent, identically distributed random variables generated from a large alphabet of size $m$. In particular, the size of the sample is allowed to be variable. The employment of a Poisson model and tilting method simplifies the implementation and analysis through independence. The resulting strategy is optimal within the class of distributions satisfying a moment condition, and is close to optimal for the class of all i.i.d distributions on strings of a given length. Moreover, the method can be used to code and predict strings with a condition on the tail of the ordered counts. It can also be applied to distributions in an envelope class.

cs.IT↗

arXiv2013

Magnetic Nonpotentiality in Photospheric Active Regions as a Predictor of Solar Flares

Based on several magnetic nonpotentiality parameters obtained from the vector photospheric active region magnetograms obtained with the Solar Magnetic Field Telescope at the Huairou Solar Observing Station over two solar cycles, a machine learning model has been constructed to predict the occurrence of flares in the corresponding active region within a certain time window. The Support Vector Classifier, a widely used general classifier, is applied to build and test the prediction models. Several classical verification measures are adopted to assess the quality of the predictions. We investigate different flare levels within various time windows, and thus it is possible to estimate the rough classes and erupting times of flares for particular active regions. Several combinations of predictors have been tested in the experiments. The True Skill Statistics are higher than 0.36 in 97% of cases and the Heidke Skill Scores range from 0.23 to 0.48. The predictors derived from longitudinal magnetic fields do perform well, however they are less sensitive in predicting large flares. Employing the nonpotentiality predictors from vector fields improves the performance of predicting large flares of magnitude $\geq$M5.0 and $\geq$X1.0.

astro-ph.SR↗

arXiv2012

A Statistical Study on Photospheric Magnetic Nonpotentiality of Active Regions and Its Relationship with Flares during Solar Cycles 22-23

A statistical study is carried out on the photospheric magnetic nonpotentiality in solar active regions and its relationship with associated flares. We select 2173 photospheric vector magnetograms from 1106 active regions observed by the Solar Magnetic Field Telescope at Huairou Solar Observing Station, National Astronomical Observatories of China, in the period of 1988-2008, which covers most of the 22nd and 23rd solar cycles. We have computed the mean planar magnetic shear angle (\bar{Δϕ}), mean shear angle of the vector magnetic field (\bar{Δψ}), mean absolute vertical current density (\bar{|J_{z}|}), mean absolute current helicity density (\bar{|h_{c}|}), absolute twist parameter (|α_{av}|), mean free magnetic energy density (\bar{ρ_{free}}), effective distance of the longitudinal magnetic field (d_{E}), and modified effective distance (d_{Em}) of each photospheric vector magnetogram. Parameters \bar{|h_{c}|}, \bar{ρ_{free}}, and d_{Em} show higher correlation with the evolution of the solar cycle. The Pearson linear correlation coefficients between these three parameters and the yearly mean sunspot number are all larger than 0.59. Parameters \bar{Δϕ}, \bar{Δψ}, \bar{|J_{z}|}, |α_{av}|, and d_{E} show only weak correlations with the solar cycle, though the nonpotentiality and the complexity of active regions are greater in the activity maximum periods than in the minimum periods. All of the eight parameters show positive correlations with the flare productivity of active regions, and the combination of different nonpotentiality parameters may be effective in predicting the flaring probability of active regions.

astro-ph.SR↗

arXiv2005

Ferromagnetism of Weakly-Interacting Electrons in Disordered Systems

It was realized two decades ago that the two-dimensional diffusive Fermi liquid phase is unstable against arbitrarily weak electron-electron interactions. Recently, using the nonlinear sigma model developed by Finkelstein, several authors have shown that the instability leads to a ferromagnetic state. In this paper, we consider diffusing electrons interacting through a ferromagnetic exchange interaction. Using the Hartree-Fock approximation to directly calculate the electron self energy, we find that the total energy is minimized by a finite ferromagnetic moment for arbitrarily weak interactions in two dimensions and for interaction strengths exceeding a critical proportional to the conductivity in three dimensions. We discuss the relation between our results and previous ones.

cond-mat.dis-nn↗