arXiv subjects

Miao Qi

Publications and source records attributed to Miao Qi.

11 recordsLinked to original sources

arXiv2026

Room-temperature tuning and probing of Fermi polarons in atomically thin semiconductors on a plasmonic metasurface

The Fermi polaron, arising from interactions between a mobile impurity and a degenerate Fermi sea, is a many-body quasiparticle that provides a sensitive probe of strongly correlated electronic phases in atomically thin semiconductors. In doped transition-metal dichalcogenides, the attractive and repulsive polaron branches are well established in monolayers. However, extending active control and quantitative, branch-resolved probing to stacked geometries has remained elusive because spectral quenching and weak optical contrast restrict access to Fermi polaron signatures. Here, we integrate electron-doped WS$_2$ flakes from monolayer to quadrilayer with a strain-tunable plasmonic metasurface, enabling high-contrast scattering readout at room temperature through coupling between Fermi polaron resonances and surface plasmons. This platform enables quantitative extraction of polaron branch spectral weights and coupling strengths across different layer numbers. We uncover a systematic thickness dependence of the spectral-weight distribution and demonstrate continuous and fully reversible spectral-weight transfer between attractive and repulsive branches in bilayers and quadrilayers, with near-complete transfer achieved in bilayers. By identifying layer number and strain as complementary control parameters for Fermi polarons, our results establish metasurface-enabled scattering spectroscopy as a practical route to resolve and manipulate many-body resonances in stacked van der Waals semiconductors, bridging idealized monolayer polaron physics and device-relevant architectures.

cond-mat.mes-hall↗

arXiv2026

Microscopic Optical Potential from Brueckner-Hartree-Fock Theory

Modern Brueckner-Hartree-Fock (BHF) calculations are very successful in describing various properties of symmetric and asymmetric nuclear matter. Within BHF theory a microscopic optical potential (MOP) for nucleon-nucleus scattering is developed. First, we parametrize the energy and density dependence of complex optical potentials in nuclear matter based on BHF calculations and then we construct the MOP for finite nuclei with the local density approximation extended to include the finite-range effects. The density distribution and the spin-orbit contribution are calculated from the Hartree-Fock (HF) approximation with LNS5 Skyrme interaction, the latter being constrained by the BHF results. The central real and imaginary potentials turn out to be quantitatively consistent with the phenomenological global Koning-Delaroche (KD) potentials. The performance of MOP is evaluated by considering neutron/proton scattering on $^{40,48}$Ca. The elastic scattering differential cross sections, analyzing powers and total/reaction cross sections are analyzed in the energy below 200 MeV. A good agreement between the theoretical results and the measurements is achieved. Since our results are presented in the analytic forms, they can thus be used easily in the analysis of the experimental data of the nucleon scattering on exotic nuclei.

nucl-th↗

arXiv2024

HDNet: Physics-Inspired Neural Network for Flow Estimation based on Helmholtz Decomposition

Flow estimation problems are ubiquitous in scientific imaging. Often, the underlying flows are subject to physical constraints that can be exploited in the flow estimation; for example, incompressible (divergence-free) flows are expected for many fluid experiments, while irrotational (curl-free) flows arise in the analysis of optical distortions and wavefront sensing. In this work, we propose a Physics- Inspired Neural Network (PINN) named HDNet, which performs a Helmholtz decomposition of an arbitrary flow field, i.e., it decomposes the input flow into a divergence-only and a curl-only component. HDNet can be trained exclusively on synthetic data generated by reverse Helmholtz decomposition, which we call Helmholtz synthesis. As a PINN, HDNet is fully differentiable and can easily be integrated into arbitrary flow estimation problems.

cs.LG↗

arXiv2022

Multi-scale frequency separation network for image deblurring

Image deblurring aims to restore the detailed texture information or structures from blurry images, which has become an indispensable step in many computer vision tasks. Although various methods have been proposed to deal with the image deblurring problem, most of them treated the blurry image as a whole and neglected the characteristics of different image frequencies. In this paper, we present a new method called multi-scale frequency separation network (MSFS-Net) for image deblurring. MSFS-Net introduces the frequency separation module (FSM) into an encoder-decoder network architecture to capture the low- and high-frequency information of image at multiple scales. Then, a cycle-consistency strategy and a contrastive learning module (CLM) are respectively designed to retain the low-frequency information and recover the high-frequency information during deblurring. At last, the features of different scales are fused by a cross-scale feature fusion module (CSFFM). Extensive experiments on benchmark datasets show that the proposed network achieves state-of-the-art performance.

cs.CV↗

arXiv2022

Shape and Reflectance Reconstruction in Uncontrolled Environments by Differentiable Rendering

Simultaneous reconstruction of geometry and reflectance properties in uncontrolled environments remains a challenging problem. In this paper, we propose an efficient method to reconstruct the scene's 3D geometry and reflectance from multi-view photography using conventional hand-held cameras. Our method automatically builds a virtual scene in a differentiable rendering system that roughly matches the real world's scene parameters, optimized by minimizing photometric objectives alternatingly and stochastically. With the optimal scene parameters evaluated, photo-realistic novel views for various viewing angles and distances can then be generated by our approach. We present the results of captured scenes with complex geometry and various reflection types. Our method also shows superior performance compared to state-of-the-art alternatives in novel view synthesis visually and quantitatively.

cs.CV↗

arXiv2021

ISP-Agnostic Image Reconstruction for Under-Display Cameras

Under-display cameras have been proposed in recent years as a way to reduce the form factor of mobile devices while maximizing the screen area. Unfortunately, placing the camera behind the screen results in significant image distortions, including loss of contrast, blur, noise, color shift, scattering artifacts, and reduced light sensitivity. In this paper, we propose an image-restoration pipeline that is ISP-agnostic, i.e. it can be combined with any legacy ISP to produce a final image that matches the appearance of regular cameras using the same ISP. This is achieved with a deep learning approach that performs a RAW-to-RAW image restoration. To obtain large quantities of real under-display camera training data with sufficient contrast and scene diversity, we furthermore develop a data capture method utilizing an HDR monitor, as well as a data augmentation method to generate suitable HDR content. The monitor data is supplemented with real-world data that has less scene diversity but allows us to achieve fine detail recovery without being limited by the monitor resolution. Together, this approach successfully restores color and contrast as well as image detail.

eess.IV↗

arXiv2021

A partial knowledge of friends of friends speeds social search

Milgram empirically showed that people knowing only connections to their friends could locate any person in the U.S. in a few steps. Later research showed that social network topology enables a node aware of its full routing to find an arbitrary target in even fewer steps. Yet, the success of people in forwarding efficiently knowing only personal connections is still not fully explained. To study this problem, we emulate it on a real location-based social network, Gowalla. It provides explicit information about friends and temporal locations of each user useful for studies of human mobility. Here, we use it to conduct a massive computational experiment to establish new necessary and sufficient conditions for achieving social search efficiency. The results demonstrate that only the distribution of friendship edges and the partial knowledge of friends of friends are essential and sufficient for the efficiency of social search. Surprisingly, the efficiency of the search using the original distribution of friendship edges is not dependent on how the nodes are distributed into space. Moreover, the effect of using a limited knowledge that each node possesses about friends of its friends is strongly nonlinear. We show that gains of such use grow statistically significantly only when this knowledge is limited to a small fraction of friends of friends.

cs.SI↗

arXiv2021

Image deblurring based on lightweight multi-information fusion network

Recently, deep learning based image deblurring has been well developed. However, exploiting the detailed image features in a deep learning framework always requires a mass of parameters, which inevitably makes the network suffer from high computational burden. To solve this problem, we propose a lightweight multiinformation fusion network (LMFN) for image deblurring. The proposed LMFN is designed as an encoder-decoder architecture. In the encoding stage, the image feature is reduced to various smallscale spaces for multi-scale information extraction and fusion without a large amount of information loss. Then, a distillation network is used in the decoding stage, which allows the network benefit the most from residual learning while remaining sufficiently lightweight. Meanwhile, an information fusion strategy between distillation modules and feature channels is also carried out by attention mechanism. Through fusing different information in the proposed approach, our network can achieve state-of-the-art image deblurring result with smaller number of parameters and outperforms existing methods in model complexity.

cs.CV↗

arXiv2019

Making Study Populations Visible through Knowledge Graphs

Treatment recommendations within Clinical Practice Guidelines (CPGs) are largely based on findings from clinical trials and case studies, referred to here as research studies, that are often based on highly selective clinical populations, referred to here as study cohorts. When medical practitioners apply CPG recommendations, they need to understand how well their patient population matches the characteristics of those in the study cohort, and thus are confronted with the challenges of locating the study cohort information and making an analytic comparison. To address these challenges, we develop an ontology-enabled prototype system, which exposes the population descriptions in research studies in a declarative manner, with the ultimate goal of allowing medical practitioners to better understand the applicability and generalizability of treatment recommendations. We build a Study Cohort Ontology (SCO) to encode the vocabulary of study population descriptions, that are often reported in the first table in the published work, thus they are often referred to as Table 1. We leverage the well-used Semanticscience Integrated Ontology (SIO) for defining property associations between classes. Further, we model the key components of Table 1s, i.e., collections of study subjects, subject characteristics, and statistical measures in RDF knowledge graphs. We design scenarios for medical practitioners to perform population analysis, and generate cohort similarity visualizations to determine the applicability of a study population to the clinical population of interest. Our semantic approach to make study populations visible, by standardized representations of Table 1s, allows users to quickly derive clinically relevant inferences about study populations.

cs.LO↗

arXiv2015

Study of Memristor-based Oscillatory Neural Networks using PPV modeling

Memristor-based oscillator is becoming promising thanks to its inherent NDR (Negative Differential Region) property and compact circuit structure. This paves the way to the large scale oscillatory neural network (ONN) and the realization of pattern recognition based on its global synchronization. However, the simulation of large scale ONN encounters the problem of long simulation time because of the large number of oscillators. Here we propose a highly efficient method to abstract the phase sensitivity characteristic of the memristor-based oscillator, i.e., its PPV (Perturbation Projection Vector), which allows reducing considerably the complexity of ONN simulation, and speeding up the simulation more than 2000 times. Our study also reveals the impact of the circuit parameters on the pattern recognition accuracy and the robustness against the frequency mismatch.

cs.ET↗

arXiv2015

PPV modelling of memristor-based oscillator

In this letter, we propose for the first time a method of abstracting the PPV (Perturbation Projection Vector) characteristic of the up-to-date memristor-based oscillators. Inspired from biological oscillators and its characteristic named PRC (Phase Response Curve), we build a bridge between PRC and PPV. This relationship is verified rigorously using the transistor level simulation of Colpitts and ring oscillators, i.e., comparing the PPV converted from PRC and the PPV obtained from accurate PSS+PXF simulation. Then we apply this method to the PPV calculation of the memristor-based oscillator. By keeping the phase dynamics of the oscillator and dropping the details of voltage/current amplitude, the PPV modelling is highly efficient to describe the phase dynamics due to the oscillator coupling, and will be very suitable for the fast simulation of large scale oscillatory neural networks.

cs.ET↗