arXiv subjects

Yiming Wang

Publications and source records attributed to Yiming Wang.

At least 235 records · Page 13Linked to original sources

arXiv2021

Cavity Induced Extraordinary Optical Transmission and Active Modulation with Graphene

Extraordinary optical transmission (EOT) is a phenomenon of exceptional light transmission through a metallic film with hole arrays enhanced by surface plasmon (SP) resonance, which stimulates renewed research hotspots in metamaterials, subwavelength optics, and plasmonics. Below the frequency of the first order SP mode, f_pl0, the metallic film typically shows strong reflection and no EOT. Here, we report an unusual EOT phenomenon below fpl0, i.e., beyond the long-held spectral boundary of classic EOTs. It is induced by a novel bound surface state in a Fabry-Perot(F-P) cavity comprising a holey gold film and a silicon-air interface. By tailoring the cavity length, EOT phenomenon has been pushed deep into the sub-wavelength region by a factor of as large as 20%, and EOT frequency comb with cavity function has been achieved. Due to the enhanced slow-wave effect as the frequency approaches fpl0, the cavity induced EOT gradually merges with the first order SP EOT. Distinguishing from the classic EOT phenomenon, no transmission zero is found between these two EOTs, which dramatically broadens the EOT bandwidth by a factor of 10 at terahertz (THz) frequencies. Furthermore, the EOT transmittance is actively modulated with graphene, achieving a large modulation range from 0.5 to 0.25 under a sub-volt bias from -0.3 to 0.5 V at 500 GHz. To the best of the authors' knowledge, both the modulation range and the low bias are among the best for active EOT devices with graphene to date. Such a structure provides a new strategy for miniaturizing sensing devices, high-power sources, and broadband photonics as well as their active control in the THz regime.

physics.optics↗

arXiv2021

Incomplete Multi-view Clustering via Cross-view Relation Transfer

In this paper, we consider the problem of multi-view clustering on incomplete views. Compared with complete multi-view clustering, the view-missing problem increases the difficulty of learning common representations from different views. To address the challenge, we propose a novel incomplete multi-view clustering framework, which incorporates cross-view relation transfer and multi-view fusion learning. Specifically, based on the consistency existing in multi-view data, we devise a cross-view relation transfer-based completion module, which transfers known similar inter-instance relationships to the missing view and recovers the missing data via graph networks based on the transferred relationship graph. Then the view-specific encoders are designed to extract the recovered multi-view data, and an attention-based fusion layer is introduced to obtain the common representation. Moreover, to reduce the impact of the error caused by the inconsistency between views and obtain a better clustering structure, a joint clustering layer is introduced to optimize recovery and clustering simultaneously. Extensive experiments conducted on several real datasets demonstrate the effectiveness of the proposed method.

cs.LG↗

arXiv2021

Sweeping Plasma Frequency of Terahertz Surface Plasmon Polaritons with Graphene

Plasma frequency is the spectral boundary for low-loss propagation and evanescent decay of surface plasmon polariton (SPP) waves, which corresponds to a high cut-off phenomenon and is typically utilized for identifying SPPs. At terahertz (THz) frequencies, a metal line with periodic metallic grooves can mimic the conventional optical SPPs, which is referred to as designer SPPs. Theoretically, the plasma frequency of THz SPPs decreases as the groove depth increases. Here, by replacing the metallic grooves with graphene sheets, dynamically sweeping SPP plasma frequency is demonstrated for the first time. The metal-graphene hybrid structure comprises a metal line with periodic graphene grooves, a thin-layer ion gel for gating graphene, and metallic tips for uniforming gate field. As the chemical potential changes, the average conductivity of graphene is modulated so that the effective depth of the graphene grooves changes, which sweeps the plasma frequency of THz SPPs consequently. Both simulated and experimental data demonstrate a red shift of plasma frequency from 195 to 180 GHz at a low bias from -0.5 to 0.5 V. The proposed structure reveals a novel approach to control the on/off status of SPP propagation in the THz range.

physics.optics↗

arXiv2021

POMP++: Pomcp-based Active Visual Search in unknown indoor environments

In this paper we focus on the problem of learning online an optimal policy for Active Visual Search (AVS) of objects in unknown indoor environments. We propose POMP++, a planning strategy that introduces a novel formulation on top of the classic Partially Observable Monte Carlo Planning (POMCP) framework, to allow training-free online policy learning in unknown environments. We present a new belief reinvigoration strategy which allows to use POMCP with a dynamically growing state space to address the online generation of the floor map. We evaluate our method on two public benchmark datasets, AVD that is acquired by real robotic platforms and Habitat ObjectNav that is rendered from real 3D scene scans, achieving the best success rate with an improvement of >10% over the state-of-the-art methods.

cs.RO↗

arXiv2021

Improving Noise Robustness of Contrastive Speech Representation Learning with Speech Reconstruction

Noise robustness is essential for deploying automatic speech recognition (ASR) systems in real-world environments. One way to reduce the effect of noise interference is to employ a preprocessing module that conducts speech enhancement, and then feed the enhanced speech to an ASR backend. In this work, instead of suppressing background noise with a conventional cascaded pipeline, we employ a noise-robust representation learned by a refined self-supervised framework for noisy speech recognition. We propose to combine a reconstruction module with contrastive learning and perform multi-task continual pre-training on noisy data. The reconstruction module is used for auxiliary learning to improve the noise robustness of the learned representation and thus is not required during inference. Experiments demonstrate the effectiveness of our proposed method. Our model substantially reduces the word error rate (WER) for the synthesized noisy LibriSpeech test sets, and yields around 4.1/7.5% WER reduction on noisy clean/other test sets compared to data augmentation. For the real-world noisy speech from the CHiME-4 challenge (1-channel track), we have obtained the state of the art ASR performance without any denoising front-end. Moreover, we achieve comparable performance to the best supervised approach reported with only 16% of labeled data.

cs.SD↗

arXiv2021

Seeing All From a Few: Nodes Selection Using Graph Pooling for Graph Clustering

Recently, there has been considerable research interest in graph clustering aimed at data partition using the graph information. However, one limitation of the most of graph-based methods is that they assume the graph structure to operate is fixed and reliable. And there are inevitably some edges in the graph that are not conducive to graph clustering, which we call spurious edges. This paper is the first attempt to employ graph pooling technique for node clustering and we propose a novel dual graph embedding network (DGEN), which is designed as a two-step graph encoder connected by a graph pooling layer to learn the graph embedding. In our model, it is assumed that if a node and its nearest neighboring node are close to the same clustering center, this node is an informative node and this edge can be considered as a cluster-friendly edge. Based on this assumption, the neighbor cluster pooling (NCPool) is devised to select the most informative subset of nodes and the corresponding edges based on the distance of nodes and their nearest neighbors to the cluster centers. This can effectively alleviate the impact of the spurious edges on the clustering. Finally, to obtain the clustering assignment of all nodes, a classifier is trained using the clustering results of the selected nodes. Experiments on five benchmark graph datasets demonstrate the superiority of the proposed method over state-of-the-art algorithms.

cs.SI↗

arXiv2021

Auto-weighted low-rank representation for clustering

In this paper, a novel unsupervised low-rank representation model, i.e., Auto-weighted Low-Rank Representation (ALRR), is proposed to construct a more favorable similarity graph (SG) for clustering. In particular, ALRR enhances the discriminability of SG by capturing the multi-subspace structure and extracting the salient features simultaneously. Specifically, an auto-weighted penalty is introduced to learn a similarity graph by highlighting the effective features, and meanwhile, overshadowing the disturbed features. Consequently, ALRR obtains a similarity graph that can preserve the intrinsic geometrical structures within the data by enforcing a smaller similarity on two dissimilar samples. Moreover, we employ a block-diagonal regularizer to guarantee the learned graph contains $k$ diagonal blocks. This can facilitate a more discriminative representation learning for clustering tasks. Extensive experimental results on synthetic and real databases demonstrate the superiority of ALRR over other state-of-the-art methods with a margin of 1.8\%$\sim$10.8\%.

cs.LG↗

arXiv2021

Explicit forms of zero modes in symmetric interacting Kitaev chain without and with dimerization

The fermionic and bosonic zero modes of the 1D interacting Kitaev chain at the symmetric point are unveiled. The many-body structures of the Majorana zero modes in the topological region are given explicitly by carrying out perturbation expansion up to infinite order. We also give the analytic expressions of the bosonic zero modes in the topologically trivial phase. Our results are generalized to the hybrid fermion system comprised of the interacting Kitaev model and the Su-Schrieffer-Heeger model, in which we show that these two types of zero modes can coexist in certain region of its phase diagram.

cond-mat.str-el↗

arXiv2021

Wake Word Detection with Streaming Transformers

Modern wake word detection systems usually rely on neural networks for acoustic modeling. Transformers has recently shown superior performance over LSTM and convolutional networks in various sequence modeling tasks with their better temporal modeling power. However it is not clear whether this advantage still holds for short-range temporal modeling like wake word detection. Besides, the vanilla Transformer is not directly applicable to the task due to its non-streaming nature and the quadratic time and space complexity. In this paper we explore the performance of several variants of chunk-wise streaming Transformers tailored for wake word detection in a recently proposed LF-MMI system, including looking-ahead to the next chunk, gradient stopping, different positional embedding methods and adding same-layer dependency between chunks. Our experiments on the Mobvoi wake word dataset demonstrate that our proposed Transformer model outperforms the baseline convolution network by 25% on average in false rejection rate at the same false alarm rate with a comparable model size, while still maintaining linear complexity w.r.t. the sequence length.

cs.CL↗

arXiv2020

From Point to Space: 3D Moving Human Pose Estimation Using Commodity WiFi

In this paper, we present Wi-Mose, the first 3D moving human pose estimation system using commodity WiFi. Previous WiFi-based works have achieved 2D and 3D pose estimation. These solutions either capture poses from one perspective or construct poses of people who are at a fixed point, preventing their wide adoption in daily scenarios. To reconstruct 3D poses of people who move throughout the space rather than a fixed point, we fuse the amplitude and phase into Channel State Information (CSI) images which can provide both pose and position information. Besides, we design a neural network to extract features that are only associated with poses from CSI images and then convert the features into key-point coordinates. Experimental results show that Wi-Mose can localize key-point with 29.7mm and 37.8mm Procrustes analysis Mean Per Joint Position Error (P-MPJPE) in the Line of Sight (LoS) and Non-Line of Sight (NLoS) scenarios, respectively, achieving higher performance than the state-of-the-art method. The results indicate that Wi-Mose can capture high-precision 3D human poses throughout the space.

cs.CV↗

arXiv2020

Subject-independent Human Pose Image Construction with Commodity Wi-Fi

Recently, commodity Wi-Fi devices have been shown to be able to construct human pose images, i.e., human skeletons, as fine-grained as cameras. Existing papers achieve good results when constructing the images of subjects who are in the prior training samples. However, the performance drops when it comes to new subjects, i.e., the subjects who are not in the training samples. This paper focuses on solving the subject-generalization problem in human pose image construction. To this end, we define the subject as the domain. Then we design a Domain-Independent Neural Network (DINN) to extract subject-independent features and convert them into fine-grained human pose images. We also propose a novel training method to train the DINN and it has no re-training overhead comparing with the domain-adversarial approach. We build a prototype system and experimental results demonstrate that our system can construct fine-grained human pose images of new subjects with commodity Wi-Fi in both the visible and through-wall scenarios, which shows the effectiveness and the subject-generalization ability of our model.

cs.CV↗

arXiv2020

Where to Explore Next? ExHistCNN for History-aware Autonomous 3D Exploration

In this work we address the problem of autonomous 3D exploration of an unknown indoor environment using a depth camera. We cast the problem as the estimation of the Next Best View (NBV) that maximises the coverage of the unknown area. We do this by re-formulating NBV estimation as a classification problem and we propose a novel learning-based metric that encodes both, the current 3D observation (a depth frame) and the history of the ongoing reconstruction. One of the major contributions of this work is about introducing a new representation for the 3D reconstruction history as an auxiliary utility map which is efficiently coupled with the current depth observation. With both pieces of information, we train a light-weight CNN, named ExHistCNN, that estimates the NBV as a set of directions towards which the depth sensor finds most unexplored areas. We perform extensive evaluation on both synthetic and real room scans demonstrating that the proposed ExHistCNN is able to approach the exploration performance of an oracle using the complete knowledge of the 3D environment.

cs.CV↗

arXiv2020

Single Image Human Proxemics Estimation for Visual Social Distancing

In this work, we address the problem of estimating the so-called "Social Distancing" given a single uncalibrated image in unconstrained scenarios. Our approach proposes a semi-automatic solution to approximate the homography matrix between the scene ground and image plane. With the estimated homography, we then leverage an off-the-shelf pose detector to detect body poses on the image and to reason upon their inter-personal distances using the length of their body-parts. Inter-personal distances are further locally inspected to detect possible violations of the social distancing rules. We validate our proposed method quantitatively and qualitatively against baselines on public domain datasets for which we provided groundtruth on inter-personal distances. Besides, we demonstrate the application of our method deployed in a real testing scenario where statistics on the inter-personal distances are currently used to improve the safety in a critical environment.

cs.CV↗

arXiv2020

POMP: Pomcp-based Online Motion Planning for active visual search in indoor environments

In this paper we focus on the problem of learning an optimal policy for Active Visual Search (AVS) of objects in known indoor environments with an online setup. Our POMP method uses as input the current pose of an agent (e.g. a robot) and a RGB-D frame. The task is to plan the next move that brings the agent closer to the target object. We model this problem as a Partially Observable Markov Decision Process solved by a Monte-Carlo planning approach. This allows us to make decisions on the next moves by iterating over the known scenario at hand, exploring the environment and searching for the object at the same time. Differently from the current state of the art in Reinforcement Learning, POMP does not require extensive and expensive (in time and computation) labelled data so being very agile in solving AVS in small and medium real scenarios. We only require the information of the floormap of the environment, an information usually available or that can be easily extracted from an a priori single exploration run. We validate our method on the publicly available AVD benchmark, achieving an average success rate of 0.76 with an average path length of 17.1, performing close to the state of the art but without any training needed. Additionally, we show experimentally the robustness of our method when the quality of the object detection goes from ideal to faulty.

cs.RO↗

arXiv2020

Wake Word Detection with Alignment-Free Lattice-Free MMI

Always-on spoken language interfaces, e.g. personal digital assistants, rely on a wake word to start processing spoken input. We present novel methods to train a hybrid DNN/HMM wake word detection system from partially labeled training data, and to use it in on-line applications: (i) we remove the prerequisite of frame-level alignments in the LF-MMI training algorithm, permitting the use of un-transcribed training examples that are annotated only for the presence/absence of the wake word; (ii) we show that the classical keyword/filler model must be supplemented with an explicit non-speech (silence) model for good performance; (iii) we present an FST-based decoder to perform online detection. We evaluate our methods on two real data sets, showing 50%--90% reduction in false rejection rates at pre-specified false alarm rates over the best previously published figures, and re-validate them on a third (large) data set.

eess.AS↗

arXiv2020

PyChain: A Fully Parallelized PyTorch Implementation of LF-MMI for End-to-End ASR

We present PyChain, a fully parallelized PyTorch implementation of end-to-end lattice-free maximum mutual information (LF-MMI) training for the so-called \emph{chain models} in the Kaldi automatic speech recognition (ASR) toolkit. Unlike other PyTorch and Kaldi based ASR toolkits, PyChain is designed to be as flexible and light-weight as possible so that it can be easily plugged into new ASR projects, or other existing PyTorch-based ASR tools, as exemplified respectively by a new project PyChain-example, and Espresso, an existing end-to-end ASR toolkit. PyChain's efficiency and flexibility is demonstrated through such novel features as full GPU training on numerator/denominator graphs, and support for unequal length sequences. Experiments on the WSJ dataset show that with simple neural networks and commonly used machine learning techniques, PyChain can achieve competitive results that are comparable to Kaldi and better than other end-to-end ASR systems.

eess.AS↗

arXiv2019

Espresso: A Fast End-to-end Neural Speech Recognition Toolkit

We present Espresso, an open-source, modular, extensible end-to-end neural automatic speech recognition (ASR) toolkit based on the deep learning library PyTorch and the popular neural machine translation toolkit fairseq. Espresso supports distributed training across GPUs and computing nodes, and features various decoding approaches commonly employed in ASR, including look-ahead word-based language model fusion, for which a fast, parallelized decoder is implemented. Espresso achieves state-of-the-art ASR performance on the WSJ, LibriSpeech, and Switchboard data sets among other end-to-end systems without data augmentation, and is 4--11x faster for decoding than similar systems (e.g. ESPnet).

cs.CL↗

arXiv2019

Broken mirror symmetry, incommensurate spin correlations, and $B_{2g}$ nematic order in iron pnictides

Motivated by growing indications for a distinct form of nematic correlations in the extremely hole doped iron pnictide compounds $A$Fe$_2$As$_2$ ($A$=K,Rb,Cs), we consider spin-driven nematic order in the general case of incommensurate magnetic fluctuations. We classify the nematic order parameters by broken mirror symmetries of the tetragonal $D_{4h}$ point group, and use this scheme to construct a general Ginzburg-Landau theory that links the nematic order to spatial pattern of magnetic fluctuations. Our analysis points to incommensurate magnetic fluctuations of wavevector $(q,q)$ as underlying a $B_{2g}$ nematic order in $A$Fe$_2$As$_2$. We substantiate this idea by microscopic calculations of the nematic order based on 3-sublattice $(2π/3,2π/3)$ spin correlations in an extended bilinear-biquadratic Heisenberg model. We summarize the existing evidence in support of the proposed mechanism, suggest ways to further test it in future experiments, and discuss the implications of our results for iron-based high temperature superconductivity.

cond-mat.supr-con↗