arXiv subjects

Cheng Ma

Publications and source records attributed to Cheng Ma.

At least 37 records · Page 2Linked to original sources

arXiv2024

Streamlined Photoacoustic Image Processing with Foundation Models: A Training-Free Solution

Foundation models have rapidly evolved and have achieved significant accomplishments in computer vision tasks. Specifically, the prompt mechanism conveniently allows users to integrate image prior information into the model, making it possible to apply models without any training. Therefore, we propose a method based on foundation models and zero training to solve the tasks of photoacoustic (PA) image segmentation. We employed the segment anything model (SAM) by setting simple prompts and integrating the model's outputs with prior knowledge of the imaged objects to accomplish various tasks, including: (1) removing the skin signal in three-dimensional PA image rendering; (2) dual speed-of-sound reconstruction, and (3) segmentation of finger blood vessels. Through these demonstrations, we have concluded that deep learning can be directly applied in PA imaging without the requirement for network design and training. This potentially allows for a hands-on, convenient approach to achieving efficient and accurate segmentation of PA images. This letter serves as a comprehensive tutorial, facilitating the mastery of the technique through the provision of code and sample datasets.

cs.CV↗

arXiv2024

Fluctuations and Persistence in Quantum Diffusion on Regular Lattices

We investigate quantum persistence by analyzing amplitude and phase fluctuations of the wave function governed by the time-dependent free-particle Schrödinger equation. The quantum system is initialized with local random uncorrelated Gaussian amplitude and phase fluctuations. In analogy with classical diffusion, the persistence probability is defined as the probability that the local (amplitude or phase) fluctuations have not changed sign up to time $t$. Our results show that the persistence probability in quantum diffusion exhibits exponential-like tails. More specifically, in $d=1$ the persistence probability decays in a stretched exponential fashion, while in $d=2$ and $d=3$ as an exponential. We also provide some insights by analyzing the two-point spatial and temporal correlation functions in the limit of small fluctuations. In particular, in the long-time limit, the temporal correlation functions for both local amplitude and phase fluctuations become time-homogeneous, i.e., the zero-crossing events correspond to those of a stationary Gaussian process, with sufficiently fast-decaying power-law tail of its autocorrelation function, implying an exponential-like tail of the persistence probabilities.

cond-mat.stat-mech↗

arXiv2023

Generalized dimension reduction approach for heterogeneous networked systems with time-delay

Networks of interconnected agents are essential to study complex networked systems' state evolution, stability, resilience, and control. Nevertheless, the high dimensionality and nonlinear dynamics are vital factors preventing us from theoretically analyzing them. Recently, the dimension-reduction approaches reduced the system's size by mapping the original system to a one-dimensional system such that only one effective representative can capture its macroscopic dynamics. However, the approaches dramatically fail as the network becomes heterogeneous and has multiple community structures. Here, we bridge the gap by developing a generalized dimension reduction approach, which enables us to map the original system to a $m$-dimensional system that consists of $m$ interacting components. Notably, by validating it on various dynamical models, this approach accurately predicts the original system state and the tipping point, if any. Furthermore, the numerical results demonstrate that this approach approximates the system evolution and identifies the critical points for complex networks with time delay.

physics.soc-ph↗

arXiv2022

Learning Series-Parallel Lookup Tables for Efficient Image Super-Resolution

Lookup table (LUT) has shown its efficacy in low-level vision tasks due to the valuable characteristics of low computational cost and hardware independence. However, recent attempts to address the problem of single image super-resolution (SISR) with lookup tables are highly constrained by the small receptive field size. Besides, their frameworks of single-layer lookup tables limit the extension and generalization capacities of the model. In this paper, we propose a framework of series-parallel lookup tables (SPLUT) to alleviate the above issues and achieve efficient image super-resolution. On the one hand, we cascade multiple lookup tables to enlarge the receptive field of each extracted feature vector. On the other hand, we propose a parallel network which includes two branches of cascaded lookup tables which process different components of the input low-resolution images. By doing so, the two branches collaborate with each other and compensate for the precision loss of discretizing input pixels when establishing lookup tables. Compared to previous lookup table-based methods, our framework has stronger representation abilities with more flexible architectures. Furthermore, we no longer need interpolation methods which introduce redundant computations so that our method can achieve faster inference speed. Extensive experimental results on five popular benchmark datasets show that our method obtains superior SISR performance in a more efficient way. The code is available at https://github.com/zhjy2016/SPLUT.

eess.IV↗

arXiv2022

Nonlocal Pseudopotential Energy Density Functional for Orbital-Free Density Functional Theory

Orbital-free density functional theory (OF-DFT) runs at low computational cost that scales linearly with the number of simulated atoms, making it suitable for large-scale material simulations. It is generally considered that OF-DFT strictly requires the use of local pseudopotentials, rather than orbital-dependent nonlocal pseudopotentials, for the calculation of electron-ion interaction energies, as no orbitals are available. This is unfortunate situation since the nonlocal pseudopotentials are known to give much better transferability and calculation accuracy than local ones. We report here the development of a theoretical scheme that allows the direct use of nonlocal pseudopotentials in OF-DFT. In this scheme, a nonlocal pseudopotential energy density functional is derived by the projection of nonlocal pseudopotential onto the non-interacting density matrix (instead of 'orbitals') that can be approximated explicitly as a functional of electron density. Our development defies the belief that nonlocal pseudopotentials are not applicable to OF-DFT, leading to the creation of an alternate theoretical framework of OF-DFT that works superior to the traditional one.

cond-mat.mtrl-sci↗

arXiv2021

Weakly Supervised High-Fidelity Clothing Model Generation

The development of online economics arouses the demand of generating images of models on product clothes, to display new clothes and promote sales. However, the expensive proprietary model images challenge the existing image virtual try-on methods in this scenario, as most of them need to be trained on considerable amounts of model images accompanied with paired clothes images. In this paper, we propose a cheap yet scalable weakly-supervised method called Deep Generative Projection (DGP) to address this specific scenario. Lying in the heart of the proposed method is to imitate the process of human predicting the wearing effect, which is an unsupervised imagination based on life experience rather than computation rules learned from supervisions. Here a pretrained StyleGAN is used to capture the practical experience of wearing. Experiments show that projecting the rough alignment of clothing and body onto the StyleGAN space can yield photo-realistic wearing results. Experiments on real scene proprietary model images demonstrate the superiority of DGP over several state-of-the-art supervised methods when generating clothing model images.

cs.CV↗

arXiv2021

On-Demand Storage and Retrieval of Microwave Photons Using a Superconducting Multiresonator Quantum Memory

A quantum memory that can store quantum states faithfully and retrieve them on demand has wide applications in quantum information science. An efficient quantum memory in the microwave regime working alongside quantum processors based on superconducting quantum circuits may serve as an important architecture for quantum computers. Here we realize on-demand storage and retrieval of weak coherent microwave photon pulses at the single-photon level. We implement a superconducting multi-resonator quantum memory which is composed of a set of frequency-tunable coplanar transmission line (CPW) resonators. By dynamically tuning the resonant frequencies of the resonators, we achieve tunable memory bandwidth from 10 MHz to 55 MHz, with an overall storage efficiency up to 12 % with well preserved phase coherence. We further demonstrate on-demand storage and retrieval of a time-bin flying qubit. This result opens up a prospect to integrate our chip-based quantum memory with the state-of-the-art superconducting quantum circuit technology for quantum information processing.

quant-ph↗

arXiv2021

Improved superconducting qubit state readout by path interference

High fidelity single shot qubit state readout is essential for many quantum information processing protocols. In superconducting quantum circuit, the qubit state is usually determined by detecting the dispersive frequency shift of a microwave cavity from either transmission or reflection. In this paper, we demonstrate the use of constructive interference between the transmitted and reflected signal to optimize the qubit state readout, with which we find a better resolved state discrimination and an improved qubit readout fidelity. As a simple and convenient approach, our scheme can be combined with other qubit readout methods based on the discrimination of cavity photon states to further improve the qubit state readout.

quant-ph↗

arXiv2021

Structure-Preserving Image Super-Resolution

Structures matter in single image super-resolution (SISR). Benefiting from generative adversarial networks (GANs), recent studies have promoted the development of SISR by recovering photo-realistic images. However, there are still undesired structural distortions in the recovered images. In this paper, we propose a structure-preserving super-resolution (SPSR) method to alleviate the above issue while maintaining the merits of GAN-based methods to generate perceptual-pleasant details. Firstly, we propose SPSR with gradient guidance (SPSR-G) by exploiting gradient maps of images to guide the recovery in two aspects. On the one hand, we restore high-resolution gradient maps by a gradient branch to provide additional structure priors for the SR process. On the other hand, we propose a gradient loss to impose a second-order restriction on the super-resolved images, which helps generative networks concentrate more on geometric structures. Secondly, since the gradient maps are handcrafted and may only be able to capture limited aspects of structural information, we further extend SPSR-G by introducing a learnable neural structure extractor (NSE) to unearth richer local structures and provide stronger supervision for SR. We propose two self-supervised structure learning methods, contrastive prediction and solving jigsaw puzzles, to train the NSEs. Our methods are model-agnostic, which can be potentially used for off-the-shelf SR networks. Experimental results on five benchmark datasets show that the proposed methods outperform state-of-the-art perceptual-driven SR methods under LPIPS, PSNR, and SSIM metrics. Visual results demonstrate the superiority of our methods in restoring structures while generating natural SR images. Code is available at https://github.com/Maclory/SPSR.

cs.CV↗

arXiv2021

Universality of noise-induced resilience restoration in spatially-extended ecological systems

Many systems may switch to an undesired state due to internal failures or external perturbations, of which critical transitions toward degraded ecosystem states are a prominent example. Resilience restoration focuses on the ability of spatially-extended systems and the required time to recover to their desired states under stochastic environmental conditions. While mean-field approaches may guide recovery strategies by indicating the conditions needed to destabilize undesired states, these approaches are not accurately capturing the transition process toward the desired state of spatially-extended systems in stochastic environments. The difficulty is rooted in the lack of mathematical tools to analyze systems with high dimensionality, nonlinearity, and stochastic effects. We bridge this gap by developing new mathematical tools that employ nucleation theory in spatially-embedded systems to advance resilience restoration. We examine our approach on systems following mutualistic dynamics and diffusion models, finding that systems may exhibit single-cluster or multi-cluster phases depending on their sizes and noise strengths, and also construct a new scaling law governing the restoration time for arbitrary system size and noise strength in two-dimensional systems. This approach is not limited to ecosystems and has applications in various dynamical systems, from biology to infrastructural systems.

q-bio.PE↗

arXiv2021

Tunable electronic structure and magnetic anisotropy in bilayer ferromagnetic semiconductor Cr2Ge2Te6

The emergence of ferromagnetism in two-dimensional van der Waals materials has aroused broad interest. However, the ferromagnetic instability has been a problem remained. In this work, by using the first-principles calculations, we identified the critical ranges of strain and doping for the bilayer Cr2Ge2Te6 within which the ferromagnetic stability can be enhanced. Beyond the critical range, the tensile strain can induce the phase transition from the ferromagnetic to the antiferromagnetic, and the direction of magnetic easy axis can be converted from out-of-plane to in-plane due to the increase of compressive strain, or electrostatic doping. We also predicted an electron doping range, within which the ferromagnetism can be enhanced, while the ferromagnetic stability was maintained. Moreover, we found that the compressive strain can reverse the spin polarization of electrons at the conduction band minimum, so that two categories of half-metal can be induced by controlling electrostatic doping in the bilayer Cr2Ge2Te6. These results should shed a light on achieving ferromagnetic stability for low-dimensional materials.

cond-mat.str-el↗

arXiv2021

Rank-Consistency Deep Hashing for Scalable Multi-Label Image Search

As hashing becomes an increasingly appealing technique for large-scale image retrieval, multi-label hashing is also attracting more attention for the ability to exploit multi-level semantic contents. In this paper, we propose a novel deep hashing method for scalable multi-label image search. Unlike existing approaches with conventional objectives such as contrast and triplet losses, we employ a rank list, rather than pairs or triplets, to provide sufficient global supervision information for all the samples. Specifically, a new rank-consistency objective is applied to align the similarity orders from two spaces, the original space and the hamming space. A powerful loss function is designed to penalize the samples whose semantic similarity and hamming distance are mismatched in two spaces. Besides, a multi-label softmax cross-entropy loss is presented to enhance the discriminative power with a concise formulation of the derivative function. In order to manipulate the neighborhood structure of the samples with different labels, we design a multi-label clustering loss to cluster the hashing vectors of the samples with the same labels by reducing the distances between the samples and their multiple corresponding class centers. The state-of-the-art experimental results achieved on three public multi-label datasets, MIRFLICKR-25K, IAPRTC12 and NUS-WIDE, demonstrate the effectiveness of the proposed method.

cs.CV↗

arXiv2020

Deep Face Super-Resolution with Iterative Collaboration between Attentive Recovery and Landmark Estimation

Recent works based on deep learning and facial priors have succeeded in super-resolving severely degraded facial images. However, the prior knowledge is not fully exploited in existing methods, since facial priors such as landmark and component maps are always estimated by low-resolution or coarsely super-resolved images, which may be inaccurate and thus affect the recovery performance. In this paper, we propose a deep face super-resolution (FSR) method with iterative collaboration between two recurrent networks which focus on facial image recovery and landmark estimation respectively. In each recurrent step, the recovery branch utilizes the prior knowledge of landmarks to yield higher-quality images which facilitate more accurate landmark estimation in turn. Therefore, the iterative information interaction between two processes boosts the performance of each other progressively. Moreover, a new attentive fusion module is designed to strengthen the guidance of landmark maps, where facial components are generated individually and aggregated attentively for better restoration. Quantitative and qualitative experimental results show the proposed method significantly outperforms state-of-the-art FSR methods in recovering high-quality face images.

cs.CV↗

arXiv2020

Structure-Preserving Super Resolution with Gradient Guidance

Structures matter in single image super resolution (SISR). Recent studies benefiting from generative adversarial network (GAN) have promoted the development of SISR by recovering photo-realistic images. However, there are always undesired structural distortions in the recovered images. In this paper, we propose a structure-preserving super resolution method to alleviate the above issue while maintaining the merits of GAN-based methods to generate perceptual-pleasant details. Specifically, we exploit gradient maps of images to guide the recovery in two aspects. On the one hand, we restore high-resolution gradient maps by a gradient branch to provide additional structure priors for the SR process. On the other hand, we propose a gradient loss which imposes a second-order restriction on the super-resolved images. Along with the previous image-space loss functions, the gradient-space objectives help generative networks concentrate more on geometric structures. Moreover, our method is model-agnostic, which can be potentially used for off-the-shelf SR networks. Experimental results show that we achieve the best PI and LPIPS performance and meanwhile comparable PSNR and SSIM compared with state-of-the-art perceptual-driven SR methods. Visual results demonstrate our superiority in restoring structures while generating natural SR images.

eess.IV↗

arXiv2019

Transfer Learning in General Lensless Imaging through Scattering Media

Recently deep neural networks (DNNs) have been successfully introduced to the field of lensless imaging through scattering media. By solving an inverse problem in computational imaging, DNNs can overcome several shortcomings in the conventional lensless imaging through scattering media methods, namely, high cost, poor quality, complex control, and poor anti-interference. However, for training, a large number of training samples on various datasets have to be collected, with a DNN trained on one dataset generally performing poorly for recovering images from another dataset. The underlying reason is that lensless imaging through scattering media is a high dimensional regression problem and it is difficult to obtain an analytical solution. In this work, transfer learning is proposed to address this issue. Our main idea is to train a DNN on a relatively complex dataset using a large number of training samples and fine-tune the last few layers using very few samples from other datasets. Instead of the thousands of samples required to train from scratch, transfer learning alleviates the problem of costly data acquisition. Specifically, considering the difference in sample sizes and similarity among datasets, we propose two DNN architectures, namely LISMU-FCN and LISMU-OCN, and a balance loss function designed for balancing smoothness and sharpness. LISMU-FCN, with much fewer parameters, can achieve imaging across similar datasets while LISMU-OCN can achieve imaging across significantly different datasets. What's more, we establish a set of simulation algorithms which are close to the real experiment, and it is of great significance and practical value in the research on lensless scattering imaging. In summary, this work provides a new solution for lensless imaging through scattering media using transfer learning in DNNs.

eess.IV↗

arXiv2019

Dynamic Vulnerability in Oscillatory Networks and Power Grids

Recent work found distributed resonances in driven oscillator networks and AC power grids. The emerging dynamic resonance patterns are highly heterogeneous and nontrivial, depending jointly on the driving frequency, the interaction topology of the network and the node or nodes driven. Identifying which nodes are most susceptible to dynamic driving and may thus make the system as a whole vulnerable to external input signals, however, remains a challenge. Here we propose an easy-to-compute Dynamic Vulnerability Index (DVI) for identifying those nodes that exhibit largest amplitude responses to dynamic driving signals with given power spectra and thus are most vulnerable. The DVI is based on linear response theory, as such generic, and enables robust predictions. It thus shows potential for a wide range of applications across dynamically driven networks, for instance for identifying the vulnerable nodes in power grids driven by fluctuating inputs from renewable energy sources and fluctuating power output to households.

nlin.AO↗

arXiv2017

Multi-Context Attention for Human Pose Estimation

In this paper, we propose to incorporate convolutional neural networks with a multi-context attention mechanism into an end-to-end framework for human pose estimation. We adopt stacked hourglass networks to generate attention maps from features at multiple resolutions with various semantics. The Conditional Random Field (CRF) is utilized to model the correlations among neighboring regions in the attention map. We further combine the holistic attention model, which focuses on the global consistency of the full human body, and the body part attention model, which focuses on the detailed description for different body parts. Hence our model has the ability to focus on different granularity from local salient regions to global semantic-consistent spaces. Additionally, we design novel Hourglass Residual Units (HRUs) to increase the receptive field of the network. These units are extensions of residual units with a side branch incorporating filters with larger receptive fields, hence features with various scales are learned and combined within the HRUs. The effectiveness of the proposed multi-context attention mechanism and the hourglass residual units is evaluated on two widely used human pose estimation benchmarks. Our approach outperforms all existing methods on both benchmarks over all the body parts.

cs.CV↗

arXiv2016

Sub-Nyquist sampling boosts targeted light transport through opaque scattering media

Optical time-reversal techniques are being actively developed to focus light through or inside opaque scattering media. When applied to biological tissue, these techniques promise to revolutionize biophotonics by enabling deep-tissue non-invasive optical imaging, optogenetics, optical tweezers and photodynamic therapy. In all previous optical time-reversal experiments, the scattered light field was well-sampled during wavefront measurement and wavefront reconstruction, following the Nyquist sampling criterion. Here, we overturn this conventional practice by demonstrating that even when the scattered field is under-sampled, light can still be focused through or inside opaque media. Even more surprisingly, we show both theoretically and experimentally that the focus achieved by under-sampling is usually about one order of magnitude brighter than that achieved by conventional well-sampling conditions. Moreover, sub-Nyquist sampling improves the signal-to-noise ratio and the collection efficiency of the scattered light. We anticipate that this newly explored under-sampling scheme will transform the understanding of optical time reversal and boost the performance of optical imaging, manipulation, and communication through opaque scattering media.

physics.bio-ph↗