Search arXiv⌕ Search

arXiv subjects

Jie Chen

Publications and source records attributed to Jie Chen.

At least 667 records · Page 37Linked to original sources

Adaptive Parameters Adjustment for Group Reweighted Zero-Attracting LMS

Group zero-attracting LMS and its reweighted form have been proposed for addressing system identification problems with structural group sparsity in the parameters to estimate. Both algorithms however suffer from a trade-off between sparsity degree and estimation bias and, in addition, between convergence speed and steady-state performance like most adaptive filtering algorithms. It is therefore necessary to properly set their step size and regularization parameter. Based on a model of their transient behavior, we introduce a variable-parameter variant of both algorithms to address this issue. By minimizing their mean-square deviation at each time instant, we obtain closed-form expressions of the optimal step size and regularization parameter. Simulation results illustrate the effectiveness of the proposed algorithms.

eess.SP↗

Robust Video Content Alignment and Compensation for Rain Removal in a CNN Framework

Rain removal is important for improving the robustness of outdoor vision based systems. Current rain removal methods show limitations either for complex dynamic scenes shot from fast moving cameras, or under torrential rain fall with opaque occlusions. We propose a novel derain algorithm, which applies superpixel (SP) segmentation to decompose the scene into depth consistent units. Alignment of scene contents are done at the SP level, which proves to be robust towards rain occlusion and fast camera motion. Two alignment output tensors, i.e., optimal temporal match tensor and sorted spatial-temporal match tensor, provide informative clues for rain streak location and occluded background contents to generate an intermediate derain output. These tensors will be subsequently prepared as input features for a convolutional neural network to restore high frequency details to the intermediate output for compensation of mis-alignment blur. Extensive evaluations show that up to 5 dB reconstruction PSNR advantage is achieved over state-of-the-art methods. Visual inspection shows that much cleaner rain removal is achieved especially for highly dynamic scenes with heavy and opaque rainfall from a fast moving camera.

cs.CV↗

Ultrafast lattice deformations studied by means of time-resolved electron and x-ray diffraction

Ultrafast lattice deformation of tens to hundreds of nanometer thick metallic crystals, after femtosecond laser excitation, was measured directly using 8.04 keV subpicosecond x-ray and 59 keV femtosecond electron pulses. Coherent phonons were generated in both single crystal and polycrystalline films. Lattice compression was observed within the first few picoseconds after laser irradiation in single crystal aluminum, which was attributed to the generation of a blast force and the propagation of elastic waves. The different time scale of lattice heating for tens and hundreds nanometer thick films are clearly distinguished by electron and x-ray pulse diffraction. The electron and lattice heating due to ultrafast deposition of photon energy was numerically simulated using the two-temperature model (TTM) and the results agreed with experimental observations. The ultrafast heating described by TTM was also discussed from an electrical circuit perspective, which may provide new insights on the possible connection between thermal and electrical processes. This study demonstrates that the combination of two complimentary ultrafast time-resolved methods, ultrafast x-ray and electron diffraction will provide a panoramic picture of the transient atomic motions and structure in crystals.

cond-mat.mtrl-sci↗

Thermal Conductivity of Suspended Few-Layer MoS2

Modifying phonon thermal conductivity in nanomaterials is important not only for fundamental research but also for practical applications. However, the experiments on tailoring the thermal conductivity in nanoscale, especially in two-dimensional materials, are rare due to technical challenges. In this work, we demonstrate in-situ thermal conduction measurement of MoS2 and find that its thermal conductivity can be continuously tuned to a required value from crystalline to amorphous limits. The reduction of thermal conductivity is understood from phonon-defects scatterings that decrease the phonon transmission coefficient. Beyond a threshold, a sharp drop in thermal conductivity is observed, which is believed to be a crystalline-amorphous transition. Our method and results provide guidance for potential applications in thermoelectrics, photoelectronics, and energy harvesting where thermal management is critical with further integration and miniaturization.

cond-mat.mes-hall↗

Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications

In this paper, we design and analyze a new zeroth-order online algorithm, namely, the zeroth-order online alternating direction method of multipliers (ZOO-ADMM), which enjoys dual advantages of being gradient-free operation and employing the ADMM to accommodate complex structured regularizers. Compared to the first-order gradient-based online algorithm, we show that ZOO-ADMM requires $\sqrt{m}$ times more iterations, leading to a convergence rate of $O(\sqrt{m}/\sqrt{T})$, where $m$ is the number of optimization variables, and $T$ is the number of iterations. To accelerate ZOO-ADMM, we propose two minibatch strategies: gradient sample averaging and observation averaging, resulting in an improved convergence rate of $O(\sqrt{1+q^{-1}m}/\sqrt{T})$, where $q$ is the minibatch size. In addition to convergence analysis, we also demonstrate ZOO-ADMM to applications in signal processing, statistics, and machine learning.

stat.ML↗

A Posteriori Error Estimate for Computing $\mathrm{tr}(f(A))$ by Using the Lanczos Method

An outstanding problem when computing a function of a matrix, $f(A)$, by using a Krylov method is to accurately estimate errors when convergence is slow. Apart from the case of the exponential function which has been extensively studied in the past, there are no well-established solutions to the problem. Often the quantity of interest in applications is not the matrix $f(A)$ itself, but rather, matrix-vector products or bilinear forms. When the computation related to $f(A)$ is a building block of a larger problem (e.g., approximately computing its trace), a consequence of the lack of reliable error estimates is that the accuracy of the computed result is unknown. In this paper, we consider the problem of computing $\mathrm{tr}(f(A))$ for a symmetric positive-definite matrix $A$ by using the Lanczos method and make two contributions: (i) we propose an error estimate for the bilinear form associated with $f(A)$, and (ii) an error estimate for the trace of $f(A)$. We demonstrate the practical usefulness of these estimates for large matrices and in particular, show that the trace error estimate is indicative of the number of accurate digits. As an application, we compute the log-determinant of a covariance matrix in Gaussian process analysis and underline the importance of error tolerance as a stopping criterion, as a means of bounding the number of Lanczos steps to achieve a desired accuracy.

math.NA↗

Texture Classification in Extreme Scale Variations using GANet

Research in texture recognition often concentrates on recognizing textures with intraclass variations such as illumination, rotation, viewpoint and small scale changes. In contrast, in real-world applications a change in scale can have a dramatic impact on texture appearance, to the point of changing completely from one texture category to another. As a result, texture variations due to changes in scale are amongst the hardest to handle. In this work we conduct the first study of classifying textures with extreme variations in scale. To address this issue, we first propose and then reduce scale proposals on the basis of dominant texture patterns. Motivated by the challenges posed by this problem, we propose a new GANet network where we use a Genetic Algorithm to change the units in the hidden layers during network training, in order to promote the learning of more informative semantic texture patterns. Finally, we adopt a FVCNN (Fisher Vector pooling of a Convolutional Neural Network filter bank) feature encoder for global texture representation. Because extreme scale variations are not necessarily present in most standard texture databases, to support the proposed extreme-scale aspects of texture understanding we are developing a new dataset, the Extreme Scale Variation Textures (ESVaT), to test the performance of our framework. It is demonstrated that the proposed framework significantly outperforms gold-standard texture features by more than 10% on ESVaT. We also test the performance of our proposed approach on the KTHTIPS2b and OS datasets and a further dataset synthetically derived from Forrest, showing superior performance compared to the state of the art.

cs.CV↗

Unsupervised Anomaly Detection via Variational Auto-Encoder for Seasonal KPIs in Web Applications

To ensure undisrupted business, large Internet companies need to closely monitor various KPIs (e.g., Page Views, number of online users, and number of orders) of its Web applications, to accurately detect anomalies and trigger timely troubleshooting/mitigation. However, anomaly detection for these seasonal KPIs with various patterns and data quality has been a great challenge, especially without labels. In this paper, we proposed Donut, an unsupervised anomaly detection algorithm based on VAE. Thanks to a few of our key techniques, Donut greatly outperforms a state-of-arts supervised ensemble approach and a baseline VAE approach, and its best F-scores range from 0.75 to 0.9 for the studied KPIs from a top global Internet company. We come up with a novel KDE interpretation of reconstruction for Donut, making it the first VAE-based anomaly detection algorithm with solid theoretical explanation.

cs.LG↗

FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling

The graph convolutional networks (GCN) recently proposed by Kipf and Welling are an effective graph model for semi-supervised learning. This model, however, was originally designed to be learned with the presence of both training and test data. Moreover, the recursive neighborhood expansion across layers poses time and memory challenges for training with large, dense graphs. To relax the requirement of simultaneous availability of test data, we interpret graph convolutions as integral transforms of embedding functions under probability measures. Such an interpretation allows for the use of Monte Carlo approaches to consistently estimate the integrals, which in turn leads to a batched training scheme as we propose in this work---FastGCN. Enhanced with importance sampling, FastGCN not only is efficient for training but also generalizes well for inference. We show a comprehensive set of experiments to demonstrate its effectiveness compared with GCN and related models. In particular, training is orders of magnitude more efficient while predictions remain comparably accurate.

cs.LG↗

Compressive Phase Retrieval via Reweighted Amplitude Flow

The problem of reconstructing a sparse signal vector from magnitude-only measurements (a.k.a., compressive phase retrieval), emerges naturally in diverse applications, but it is NP-hard in general. Building on recent advances in nonconvex optimization, this paper puts forth a new algorithm that is termed compressive reweighted amplitude flow and abbreviated as CRAF, for compressive phase retrieval. Specifically, CRAF operates in two stages. The first stage seeks a sparse initial guess via a new spectral procedure. In the second stage, CRAF implements a few hard thresholding based iterations using reweighted gradients. When there are sufficient measurements, CRAF provably recovers the underlying signal vector exactly with high probability under suitable conditions. Moreover, its sample complexity coincides with that of the state-of-the-art procedures. Finally, substantial simulated tests showcase remarkable performance of the new spectral initialization, as well as improved exact recovery relative to competing alternatives.

cs.IT↗

Observations of Running Penumbral Waves emerging in a Sunspot

We present results from the investigation of 5-min umbral oscillations in a single-polarity sunspot of active region NOAA 12132. The spectra of TiO, H$α$, and 304 Å are used for corresponding atmospheric heights from the photosphere to lower corona. Power spectrum analysis at the formation height of H$α$ - 0.6 Å to H$α$ center resulted in the detection of 5-min oscillation signals in intensity interpreted as running waves outside the umbral center, mostly with vertical magnetic field inclination $>15°$. A phase-speed filter is used to extract the running wave signals with speed $v_{ph}> 4$ km s$^{-1}$, from the time series of H$α$ - 0.4 Å images, and found twenty-four 3-min umbral oscillatory events in a duration of one hour. Interestingly, the initial emergence of the 3-min umbral oscillatory events are noticed closer to or at umbral boundaries. These 3-min umbral oscillatory events are observed for the first time as propagating from a fraction of preceding Running Penumbral Waves (RPWs). These fractional wavefronts rapidly separates from RPWs and move towards umbral center, wherein they expand radially outwards suggesting the beginning of a new umbral oscillatory event. We found that most of these umbral oscillatory events develop further into RPWs. We speculate that the waveguides of running waves are twisted in spiral structures and hence the wavefronts are first seen at high latitudes of umbral boundaries and later at lower latitudes of the umbral center.

astro-ph.SR↗

Statistical analysis on Dynamic Fibrils observed from NST/BBSO observations

We present the results obtained from the analysis of dynamic fibrils in NOAA active region (AR) 12132, using high resolution H$α$ observations from New Solar Telescope operating at BBSO. The dynamic fibrils are seen to be moving up and down, and most of these dynamic fibrils are periodic and have jet like appearance. We found from our observations that the fibrils follows perfect parabolic paths at the most in many cases. A statistical measure on the properties of the parabolic paths showing an analysis on deceleration, maximum velocity, duration and kinetic energy of these fibrils is presented here. We found the average maximum velocity to be around 15 km s$^{-1}$ and mean deceleration to be around 100 m s$^{-2}$. The deceleration observed appears to be a fraction of gravity of sun and is not compatible with the path of ballistic at the gravity of sun. We found positive correlation between the deceleration and the maximum velocity. This correlation is consistent with the simulations done earlier on magnetoacoustic shock waves propagating upward.

astro-ph.SR↗

Strong Exciton-Photon Coupling and lasing behavior in All-Inorganic CsPbBr3 Micro/nanowire Fabry-Perot cavity

Macroscopic spontaneous coherence of exciton-polariton in semiconductor cavity is one important research field in condensed matter physics. All-inorganic micro/nanowire Fabry-Pérot cavity with excellent optical performance makes it possible to realize strong coupling and lasing of exciton-photon at room temperature. In this work, we demonstrated strong coupling of exciton-photon and polariton lasing in CsPbBr3 micro/nanowires synthesized by CVD method. By exploring spatial resolved PL spectra of CsPbBr3 cavity, we observed mode volume dependent coupling strength , as well as significant increase in group index. Moreover, low threshold polariton lasing was achieved at room temperature within strong coupling regime; the polariton characteristic is confirmed by comparing lasing spectra with waveguided output spectra and the dramatically reduced lasing threshold. Our present results provide new avenues to achieve high coupling strengths potentially enabling application of exciting phenomena such as Bose-Einstein condensation of polaritons, efficient light-emitting diodes and lasers.

cond-mat.mes-hall↗

Surface Plasmon Enhanced Strong Exciton-Photon Coupling in Hybrid Inorganic-Organic Perovskites Nanowires

Manipulating strong light-matter interaction in semiconductor microcavities is crucial for developing high-performance exciton polariton devices with great potentials in next-generation all-solid state quantum technologies. In this work, we report surface plasmon enhanced strong exciton-photon interaction in CH3NH3PbBr3 perovskite nanowires. Characteristic anti-crossing behaviors, indicating Rabi splitting energy up to ~ 560 meV, are observed near exciton resonance in hybrid semiconductor-insulator-metallic waveguide cavity at room temperature. An exciton-photon coupling strength enhancement factor of ~ 1.4 times is evaluated, which is mainly attributed to surface plasmon induced localized excitation field redistribution. Further, systematic studies on nanowires and insulator dimension dependence of exciton-photon interaction are presented. These results provide new avenues to achieve extremely high coupling strengths and push forward the development of electrically pumped and ultra-low threshold small lasers.

cond-mat.mes-hall↗

Sparse Phase Retrieval via Truncated Amplitude Flow

This paper develops a novel algorithm, termed \emph{SPARse Truncated Amplitude flow} (SPARTA), to reconstruct a sparse signal from a small number of magnitude-only measurements. It deals with what is also known as sparse phase retrieval (PR), which is \emph{NP-hard} in general and emerges in many science and engineering applications. Upon formulating sparse PR as an amplitude-based nonconvex optimization task, SPARTA works iteratively in two stages: In stage one, the support of the underlying sparse signal is recovered using an analytically well-justified rule, and subsequently, a sparse orthogonality-promoting initialization is obtained via power iterations restricted on the support; and, in the second stage, the initialization is successively refined by means of hard thresholding based gradient-type iterations. SPARTA is a simple yet effective, scalable, and fast sparse PR solver. On the theoretical side, for any $n$-dimensional $k$-sparse ($k\ll n$) signal $\bm{x}$ with minimum (in modulus) nonzero entries on the order of $(1/\sqrt{k})\|\bm{x}\|_2$, SPARTA recovers the signal exactly (up to a global unimodular constant) from about $k^2\log n$ random Gaussian measurements with high probability. Furthermore, SPARTA incurs computational complexity on the order of $k^2n\log n$ with total runtime proportional to the time required to read the data, which improves upon the state-of-the-art by at least a factor of $k$. Finally, SPARTA is robust against additive noise of bounded support. Extensive numerical tests corroborate markedly improved recovery performance and speedups of SPARTA relative to existing alternatives.

cs.IT↗

Optimization of the $H_\infty$-norm of Dynamic Flow Networks

In this paper, we study the $H_\infty$-norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the $H_\infty$-norm subject to allocation of the weights on the edges. The optimization problem is formulated with LMI (Linear-Matrix-Inequality) constraints. For distribution networks with one port, i.e., SISO systems, we show that the $H_\infty$-norm coincides with the effective resistance between the nodes in the port. Moreover, we derive an upper bound of the $H_\infty$-norm, which is in terms of the algebraic connectivity of the graph on which the distribution network is defined.

math.OC↗

Hierarchically Compositional Kernels for Scalable Nonparametric Learning

We propose a novel class of kernels to alleviate the high computational cost of large-scale nonparametric learning with kernel methods. The proposed kernel is defined based on a hierarchical partitioning of the underlying data domain, where the Nyström method (a globally low-rank approximation) is married with a locally lossless approximation in a hierarchical fashion. The kernel maintains (strict) positive-definiteness. The corresponding kernel matrix admits a recursively off-diagonal low-rank structure, which allows for fast linear algebra computations. Suppressing the factor of data dimension, the memory and arithmetic complexities for training a regression or a classifier are reduced from $O(n^2)$ and $O(n^3)$ to $O(nr)$ and $O(nr^2)$, respectively, where $n$ is the number of training examples and $r$ is the rank on each level of the hierarchy. Although other randomized approximate kernels entail a similar complexity, empirical results show that the proposed kernel achieves a matching performance with a smaller $r$. We demonstrate comprehensive experiments to show the effective use of the proposed kernel on data sizes up to the order of millions.

cs.LG↗

Exciton-Polaritons in Hybrid Inorganic-organic Perovskite Fabry-Pérot Microcavity

Exciton-polaritons in semiconductor microcavities generate fascinating effects such as long-range spatial coherence and Bose-Einstein Condensation (BEC), which are attractive for their potential use in low threshold lasers, vortices and slowing light, etc. However, currently most of exciton-polariton effects either occur at cryogenic temperature or rely on expensive cavity fabrication procedures. Further exploring new semiconductor microcavities with stronger exciton photon interaction strength is extensively needed. Herein, we demonstrate room temperature photon exciton strong coupling in hybrid inorganic-organic CH3NH3PbBr3 Fabry-Pérot microcavities for the first time. The vacuum Rabi splitting energy is up to ~390 meV, which is ascribed to large oscillator strength and photon confinement in reduced dimension of optical microcavities. With increasing pumping energy, exciton-photon coupling strength is weakened due to carrier screening effect, leading to occurrence of photonic lasing instead of polartion lasing. The demonstrated strong coupling between photons and excitons in perovskite microcavities would be helpful for development of high performance polariton-based incoherent and coherent light sources, nonlinear optics, and slow light applications.

cond-mat.mes-hall↗