Searcharxiv⌕ Search

arXiv subjects

Jun Qin

Publications and source records attributed to Jun Qin.

35 records · Page 2Linked to original sources

Waveguide integrated high performance magneto-optical isolators and circulators on silicon nitride platforms

Optical isolators and circulators are indispensable for photonic integrated circuits (PICs). Despite of significant progress in silicon-on-insulator (SOI) platforms, integrated optical isolators and circulators have been rarely reported on silicon nitride (SiN) platforms. In this paper, we report monolithic integration of magneto-optical (MO) isolators on SiN platforms with record high performances based on standard silicon photonics foundry process and magneto-optical thin film deposition. We successfully grow high quality MO garnet thin films on SiN with large Faraday rotation up to -5900 deg/cm. We show a superior magneto-optical figure of merit (FoM) of MO/SiN waveguides compared to that of MO/SOI in an optimized device design. We demonstrate TM/TE mode broadband and narrow band optical isolators and circulators on SiN with high isolation ratio, low cross talk and low insertion loss. In particular, we observe 1 dB insertion loss and 28 dB isolation ratio in a SiN racetrack resonator-based isolator at 1570.2 nm wavelength. The low thermo-optic coefficient of SiN also ensures excellent temperature stability of the device. Our work paves the way for integration of high performance nonreciprocal photonic devices on SiN platforms.

physics.app-ph↗

Hierarchical Low-rank Structure of Parameterized Distributions

This note shows that the matrix forms of several one-parameter distribution families satisfy a hierarchical low-rank structure. Such families of distributions include binomial, Poisson, and $χ^2$ distributions. The proof is based on a uniform relative bound of a related divergence function. Numerical results are provided to confirm the theoretical findings.

math.NA↗

Switching the Optical Chirality in Magneto-plasmonic Metasurfaces Using Applied Magnetic Fields

Chiral nanophotonic devices are promising candidates for chiral molecules sensing, polarization diverse nanophotonics and display technologies. Active chiral nanophotonic devices, where the optical chirality can be controlled by an external stimulus has triggered great research interest. However, efficient modulation of the optical chirality has been challenging. Here, we demonstrate switching of the extrinsic chirality by applied magnetic fields in a magneto-plasmonic metasurface device based on a magneto-optical oxide material, Ce1Y2Fe5O12 (Ce:YIG). Thanks to the low optical loss and strong magneto-optical effect of Ce:YIG, we experimentally demonstrated a giant and continuous far-field circular dichroism (CD) modulation by applied magnetic fields from -0.65° to +1.9° at 950 nm wavelength under glancing incident conditions. The far field CD modulation is due to both magneto-optical circular dichroism and near-field modulation of the superchiral fields by applied magnetic fields. Finally, we demonstrate magnetic field tunable chiral imaging in millimeter-scale magneto-plasmonic metasurfaces fabricated using self-assembly. Our results provide a new way for achieving planar integrated, large-scale and active chiral metasurfaces for polarization diverse nanophotonics.

physics.optics↗

DeepFeat: A Bottom Up and Top Down Saliency Model Based on Deep Features of Convolutional Neural Nets

A deep feature based saliency model (DeepFeat) is developed to leverage the understanding of the prediction of human fixations. Traditional saliency models often predict the human visual attention relying on few level image cues. Although such models predict fixations on a variety of image complexities, their approaches are limited to the incorporated features. In this study, we aim to provide an intuitive interpretation of convolu- tional neural network deep features by combining low and high level visual factors. We exploit four evaluation metrics to evaluate the correspondence between the proposed framework and the ground-truth fixations. The key findings of the results demon- strate that the DeepFeat algorithm, incorporation of bottom up and top down saliency maps, outperforms the individual bottom up and top down approach. Moreover, in comparison to nine 9 state-of-the-art saliency models, our proposed DeepFeat model achieves satisfactory performance based on all four evaluation metrics.

cs.CV↗

Line Profile Based Segmentation Algorithm for Touching Corn Kernels

Image segmentation of touching objects plays a key role in providing accurate classification for computer vision technologies. A new line profile based imaging segmentation algorithm has been developed to provide a robust and accurate segmentation of a group of touching corns. The performance of the line profile based algorithm has been compared to a watershed based imaging segmentation algorithm. Both algorithms are tested on three different patterns of images, which are isolated corns, single-lines, and random distributed formations. The experimental results show that the algorithm can segment a large number of touching corn kernels efficiently and accurately.

cs.CV↗

Investigations of Auditory Filters Based Excitation Patterns for Assessment of Noise Induced Hearing Loss

Noise induced hearing loss (NIHL) as one of major avoidable occupational related health issues has been studied for decades. To assess NIHL, the excitation pattern (EP) has been considered as one of mechanisms to estimate movements of basilar membrane (BM) in cochlea. In this study, two auditory filters, dual resonance nonlinear (DRNL) filter and rounded-exponential (ROEX) filter, have been applied to create two EPs, referring as the velocity EP and the loudness EP, respectively. Two noise hazard metrics are also proposed based on the developed EPs to evaluate hazardous levels caused by different types of noise. Moreover, Gaussian noise and pure-tone noise have been simulated to evaluate performances of the developed EPs and noise metrics. The results show that both developed EPs can reflect the responses of BM to different types of noise. For Gaussian noise, there is a frequency shift between the velocity EP and the loudness EP. For pure-tone noise, both EPs can reflect the frequencies of input noise accurately. The results suggest that both EPs can be potentially used for assessment of NIHL.

physics.bio-ph↗

Enhanced Factored Three-Way Restricted Boltzmann Machines for Speech Detection

In this letter, we propose enhanced factored three way restricted Boltzmann machines (EFTW-RBMs) for speech detection. The proposed model incorporates conditional feature learning by multiplying the dynamical state of the third unit, which allows a modulation over the visible-hidden node pairs. Instead of stacking previous frames of speech as the third unit in a recursive manner, the correlation related weighting coefficients are assigned to the contextual neighboring frames. Specifically, a threshold function is designed to capture the long-term features and blend the globally stored speech structure. A factored low rank approximation is introduced to reduce the parameters of the three-dimensional interaction tensor, on which non-negative constraint is imposed to address the sparsity characteristic. The validations through the area-under-ROC-curve (AUC) and signal distortion ratio (SDR) show that our approach outperforms several existing 1D and 2D (i.e., time and time-frequency domain) speech detection algorithms in various noisy environments.

cs.SD↗

Neural networks based EEG-Speech Models

In this paper, we propose an end-to-end neural network (NN) based EEG-speech (NES) modeling framework, in which three network structures are developed to map imagined EEG signals to phonemes. The proposed NES models incorporate a language model based EEG feature extraction layer, an acoustic feature mapping layer, and a restricted Boltzmann machine (RBM) based the feature learning layer. The NES models can jointly realize the representation of multichannel EEG signals and the projection of acoustic speech signals. Among three proposed NES models, two augmented networks utilize spoken EEG signals as either bias or gate information to strengthen the feature learning and translation of imagined EEG signals. Experimental results show that all three proposed NES models outperform the baseline support vector machine (SVM) method on EEG-speech classification. With respect to binary classification, our approach achieves comparable results relative to deep believe network approach.

cs.SD↗

Semi-supervised Speech Enhancement in Envelop and Details Subspaces

In this study, we propose a modulation decoupling based single channel speech enhancement subspace framework, in which the spectrogram of noisy speech is decoupled as the product of a spectral envelop subspace and a spectral details subspace. This decoupling approach provides a method to specifically work on elimination of those noises that greatly affect the intelligibility. Two supervised low-rank and sparse decomposition schemes are developed in the spectral envelop subspace to obtain a robust recovery of speech components. A Bayesian formulation of non-negative factorization is used to learn the speech dictionary from the spectral envelop subspace of clean speech samples. In the spectral details subspace, a standard robust principal component analysis is implemented to extract the speech components. The validation results show that compared with four speech enhancement algorithms, including MMSE-SPP, NMF-RPCA, RPCA, and LARC, the proposed MS based algorithms achieve satisfactory performance on improving perceptual quality, and especially speech intelligibility.

cs.SD↗

Speech Enhancement via Two-Stage Dual Tree Complex Wavelet Packet Transform with a Speech Presence Probability Estimator

In this paper, a two-stage dual tree complex wavelet packet transform (DTCWPT) based speech enhancement algorithm has been proposed, in which a speech presence probability (SPP) estimator and a generalized minimum mean squared error (MMSE) estimator are developed. To overcome the drawback of signal distortions caused by down sampling of WPT, a two-stage analytic decomposition concatenating undecimated WPT (UWPT) and decimated WPT is employed. An SPP estimator in the DTCWPT domain is derived based on a generalized Gamma distribution of speech, and Gaussian noise assumption. The validation results show that the proposed algorithm can obtain enhanced perceptual evaluation of speech quality (PESQ), and segmental signal-to-noise ratio (SegSNR) at low SNR nonstationary noise, compared with other four state-of-the-art speech enhancement algorithms, including optimally modified LSA (OM-LSA), soft masking using a posteriori SNR uncertainty (SMPO), a posteriori SPP based MMSE estimation (MMSE-SPP), and adaptive Bayesian wavelet thresholding (BWT).

cs.SD↗

Low Rank and Sparsity Analysis Applied to Speech Enhancement via Online Estimated Dictionary

We propose an online estimated dictionary based single channel speech enhancement algorithm, which focuses on low rank and sparse matrix decomposition. In this proposed algorithm, a noisy speech spectral matrix is considered as the summation of low rank background noise components and an activation of the online speech dictionary, on which both low rank and sparsity constraints are imposed. This decomposition takes the advantage of local estimated dictionary high expressiveness on speech components. The local dictionary can be obtained through estimating the speech presence probability by applying Expectation Maximal algorithm, in which a generalized Gamma prior for speech magnitude spectrum is used. The evaluation results show that the proposed algorithm achieves significant improvements when compared to four other speech enhancement algorithms.

cs.SD↗

A simple model clarifies the complicated relationships of complex networks

Real-world networks such as the Internet and WWW have many common traits. Until now, hundreds of models were proposed to characterize these traits for understanding the networks. Because different models used very different mechanisms, it is widely believed that these traits origin from different causes. However, we find that a simple model based on optimisation can produce many traits, including scale-free, small-world, ultra small-world, Delta-distribution, compact, fractal, regular and random networks. Moreover, by revising the proposed model, the community-structure networks are generated. By this model and the revised versions, the complicated relationships of complex networks are illustrated. The model brings a new universal perspective to the understanding of complex networks and provide a universal method to model complex networks from the viewpoint of optimisation.

cs.SI↗

Some Results on Ethnic Conflicts Based on Evolutionary Game Simulation

The force of the ethnic separatism, essentially origining from negative effect of ethnic identity, is damaging the stability and harmony of multiethnic countries. In order to eliminate the foundation of the ethnic separatism and set up a harmonious ethnic relationship, some scholars have proposed a viewpoint: ethnic harmony could be promoted by popularizing civic identity. However, this viewpoint is discussed only from a philosophical prospective and still lack supports of scientific evidences. Because ethic group and ethnic identity are products of evolution and ethnic identity is the parochialism strategy under the perspective of game theory, this paper proposes an evolutionary game simulation model to study the relationship between civic identity and ethnic conflict based on evolutionary game theory. The simulation results indicate that: 1) the ratio of individuals with civic identity has a positive association with the frequency of ethnic conflicts; 2) ethnic conflict will not die out by killing all ethnic members once for all, and it also cannot be reduced by a forcible pressure, i.e., increasing the ratio of individuals with civic identity; 3) the average frequencies of conflicts can stay in a low level by promoting civic identity periodically and persistently.

physics.soc-ph↗

A quantitative method for determining the robustness of complex networks

Most current studies estimate the invulnerability of complex networks using a qualitative method that analyzes the inaccurate decay rate of network efficiency. This method results in confusion over the invulnerability of various types of complex networks. By normalizing network efficiency and defining a baseline, this paper defines the invulnerability index as the integral of the difference between the normalized network efficiency curve and the baseline. This quantitative method seeks to establish a benchmark for the robustness and fragility of networks and to measure network invulnerability under both edge and node attacks. To validate the reliability of the proposed method, three small-world networks were selected as test beds. The simulation results indicate that the proposed invulnerability index can effectively and accurately quantify network resilience. The index should provide a valuable reference for determining network invulnerability in future research.

cs.SI↗

Modelling Multi-Trait Scale-free Networks by Optimization

Recently, one paper in Nature(Papadopoulos, 2012) raised an old debate on the origin of the scale-free property of complex networks, which focuses on whether the scale-free property origins from the optimization or not. Because the real-world complex networks often have multiple traits, any explanation on the scale-free property of complex networks should be capable of explaining the other traits as well. This paper proposed a framework which can model multi-trait scale-free networks based on optimization, and used three examples to demonstrate its effectiveness. The results suggested that the optimization is a more generalized explanation because it can not only explain the origin of the scale-free property, but also the origin of the other traits in a uniform way. This paper provides a universal method to get ideal networks for the researches such as epidemic spreading and synchronization on complex networks.

cs.SI↗

The Robustness of Scale-free Networks Under Edge Attacks with the Quantitative Analysis

Previous studies on the invulnerability of scale-free networks under edge attacks supported the conclusion that scale-free networks would be fragile under selective attacks. However, these studies are based on qualitative methods with obscure definitions on the robustness. This paper therefore employs a quantitative method to analyze the invulnerability of the scale-free networks, and uses four scale-free networks as the experimental group and four random networks as the control group. The experimental results show that some scale-free networks are robust under selective edge attacks, different to previous studies. Thus, this paper analyzes the difference between the experimental results and previous studies, and suggests reasonable explanations.

cs.SI↗