Searcharxiv⌕ Search

arXiv subjects

Fei Gao

Publications and source records attributed to Fei Gao.

At least 433 records · Page 24Linked to original sources

Low-Cost Optoacoustic Tomography System with Programmable Acoustic Delay-Line

Photoacoustic tomography (PAT) is an emerging technology for biomedical imaging that combines the superiorities of high optical contrast and acoustic penetration. In the PAT system, more photoacoustic (PA) signals are preferred to be detected from full field of view to reconstruct PA images with higher fidelity. However, the requirement for more PA signals detection leads to more time consumption for single-channel scanning based PAT system, or higher cost of data acquisition (DAQ) module for an array-based PAT system. To address this issue, we proposed a programmable acoustic delay line module to reduce DAQ cost and accelerate imaging speed for PAT system. The module is based on bidirectional conversion between acoustic signals and electrical signals, including ultrasound transmission in between to provide sufficient time delay. The acoustic delay line module achieves tens or hundreds of microseconds delay for each channel, and is controlled by a programmable control unit. In this work, it achieves to merge four inputs of PA signals into one output signal, which can be recovered into original four PA signals in the digital domain after DAQ. The imaging experiments of pencil leads embedded in agar phantom is conducted by the PAT system equipped with the proposed programmable acoustic delay-line module, which demonstrated its feasibility in biomedical imaging system.

physics.ins-det↗

Deep learning for photoacoustic imaging: a survey

Machine learning has been developed dramatically and witnessed a lot of applications in various fields over the past few years. This boom originated in 2009, when a new model emerged, that is, the deep artificial neural network, which began to surpass other established mature models on some important benchmarks. Later, it was widely used in academia and industry. Ranging from image analysis to natural language processing, it fully exerted its magic and now become the state-of-the-art machine learning models. Deep neural networks have great potential in medical imaging technology, medical data analysis, medical diagnosis and other healthcare issues, and is promoted in both pre-clinical and even clinical stages. In this review, we performed an overview of some new developments and challenges in the application of machine learning to medical image analysis, with a special focus on deep learning in photoacoustic imaging. The aim of this review is threefold: (i) introducing deep learning with some important basics, (ii) reviewing recent works that apply deep learning in the entire ecological chain of photoacoustic imaging, from image reconstruction to disease diagnosis, (iii) providing some open source materials and other resources for researchers interested in applying deep learning to photoacoustic imaging.

cs.CV↗

Higgs modulation of emergent mass as revealed in kaon and pion parton distributions

Strangeness was discovered roughly seventy years ago, lodged in a particle now known as the kaon, $K$. Kindred to the pion, $π$; both states are massless in the absence of Higgs-boson couplings. Kaons and pions are Nature's most fundamental Nambu-Goldstone modes. Their properties are largely determined by the mechanisms responsible for emergent mass in the standard model, but modulations applied by the Higgs are crucial to Universe evolution. Despite their importance, little is known empirically about $K$ and $π$ structure. This study delivers the first parameter-free predictions for all $K$ distribution functions (DFs) and comparisons with the analogous $π$ distributions, i.e. the one-dimensional maps that reveal how the light-front momentum of these states is shared amongst the gluons and quarks from which they are formed. The results should stimulate improved analyses of existing data and motivate new experiments sensitive to all $K$ and $π$ DFs.

hep-ph↗

Generating Large Convex Polytopes Directly on Point Clouds

In this paper, we present a method to efficiently generate large, free, and guaranteed convex space among arbitrarily cluttered obstacles. Our method operates directly on point clouds, avoids expensive calculations, and processes thousands of points within a few milliseconds, which extremely suits embedded platforms. The base stone of our method is sphere flipping, a one-one invertible nonlinear transformation, which maps a set of unordered points to a nonlinear space. With these wrapped points, we obtain a collision-free star convex polytope. Then, utilizing the star convexity, we efficiently modify the polytope to convex and guarantee its free of obstacles. Extensive quantitative evaluations show that our method significantly outperforms state-of-the-art works in efficiency. We also present practical applications with our method in 3D, including large-scale deformable topological mapping and quadrotor optimal trajectory planning, to validate its capability and efficiency. The source code of our method will be released for the reference of the community.

cs.RO↗

Limited-view Photoacoustic Imaging Reconstruction With Dual Domain Inputs Under Mutual Information Constraint

Based on photoacoustic effect, photoacoustic tomography is developing very fast in recent years, and becoming an important imaging tool for both preclinical and clinical studies. With enough ultrasound transducers placed around the biological tissue, PAT can provide both deep penetration and high image contrast by hybrid usage of light and sound. However, considering space and measurement environmental limitations, transducers are always placed in a limited-angle way, which means that the other side without transducer coverage suffers severe information loss. With conventional image reconstruction algorithms, the limited-view tissue induces artifacts and information loss, which may cause doctors misdiagnosis or missed diagnosis. In order to solve limited-view PA imaging reconstruction problem, we propose to use both time domain and frequency domain reconstruction algorithms to get delay-and-sum (DAS) image inputs and k-space image inputs. These dual domain images share nearly same texture information but different artifact information, which can teach network how to distinguish these two kinds of information at input level. In this paper, we propose Dual Domain Unet (DuDoUnet) with specially designed Information Sharing Block (ISB), which can further share two domains' information and distinguish artifacts. Besides, we use mutual information (MI) with an auxiliary network, whose inputs and outputs are both ground truth, to compensate prior knowledge of limited-view PA inputs. The proposed method is verified with a public clinical database, and shows superior results with SSIM = 93.5622% and PSNR = 20.8859.

eess.IV↗

Mapless-Planner: A Robust and Fast Planning Framework for Aggressive Autonomous Flight without Map Fusion

Maintaining a map online is resource-consuming while a robust navigation system usually needs environment abstraction via a well-fused map. In this paper, we propose a mapless planner which directly conducts such abstraction on the unfused sensor data. A limited-memory data structure with a reliable proximity query algorithm is proposed for maintaining raw historical information. A sampling-based scheme is designed to extract the free-space skeleton. A smart waypoint selection strategy enables to generate high-quality trajectories within the resultant flight corridors. Our planner differs from other mapless ones in that it can abstract and exploit the environment information efficiently. The online replan consistency and success rate are both significantly improved against conventional mapless methods.

cs.RO↗

TGK-Planner: An Efficient Topology Guided Kinodynamic Planner for Autonomous Quadrotors

In this paper, we propose a lightweight yet effective Topology Guided Kinodynamic planner (TGK-Planner) for quadrotor aggressive flights with limited onboard computing resources. The proposed system follows the traditional hierarchical planning workflow, with novel designs to improve the robustness and efficiency in both the pathfinding and trajectory optimization sub-modules. Firstly, we propose the topology guided graph, which roughly captures the topological structure of the environment and guides the state sampling of a sampling-based kinodynamic planner. In this way, we significantly improve the efficiency of finding a safe and dynamically feasible trajectory. Then, we refine the smoothness and continuity of the trajectory in an optimization framework, which incorporates the homotopy constraint to guarantee the safety of the trajectory. The optimization program is formulated as a sequence of quadratic programmings (QPs) and can be iteratively solved in a few milliseconds. Finally, the proposed system is integrated into a fully autonomous quadrotor and validated in various simulated and real-world scenarios. Benchmark comparisons show that our method outperforms state-of-the-art methods with regard to efficiency and trajectory quality. Moreover, we will release our code as an open-source package.

cs.RO↗

Fast-Tracker: A Robust Aerial System for Tracking Agile Target in Cluttered Environments

This paper proposes a systematic solution that uses an unmanned aerial vehicle (UAV) to aggressively and safely track an agile target. The solution properly handles the challenging situations where the intent of the target and the dense environments are unknown to the UAV. Our work is divided into two parts: target motion prediction and tracking trajectory planning. The target motion prediction method utilizes target observations to reliably predict the future motion of the target considering dynamic constraints. The tracking trajectory planner follows the traditional hierarchical workflow.A target informed kinodynamic searching method is adopted as the front-end, which heuristically searches for a safe tracking trajectory. The back-end optimizer then refines it into a spatial-temporal optimal and collision-free trajectory. The proposed solution is integrated into an onboard quadrotor system. We fully test the system in challenging real-world tracking missions.Moreover, benchmark comparisons validate that the proposed method surpasses the cutting-edge methods on time efficiency and tracking effectiveness.

cs.RO↗

Improved quantum algorithm for A-optimal projection

Dimensionality reduction (DR) algorithms, which reduce the dimensionality of a given data set while preserving the information of the original data set as well as possible, play an important role in machine learning and data mining. Duan \emph{et al}. proposed a quantum version of the A-optimal projection algorithm (AOP) for dimensionality reduction [Phys. Rev. A 99, 032311 (2019)] and claimed that the algorithm has exponential speedups on the dimensionality of the original feature space $n$ and the dimensionality of the reduced feature space $k$ over the classical algorithm. In this paper, we correct the time complexity of Duan \emph{et al}.'s algorithm to $O(\frac{κ^{4s}\sqrt{k^s}} {ε^{s}}\mathrm{polylog}^s (\frac{mn}ε))$, where $κ$ is the condition number of a matrix that related to the original data set, $s$ is the number of iterations, $m$ is the number of data points and $ε$ is the desired precision of the output state. Since the time complexity has an exponential dependence on $s$, the quantum algorithm can only be beneficial for high dimensional problems with a small number of iterations $s$. To get a further speedup, we propose an improved quantum AOP algorithm with time complexity $O(\frac{s κ^6 \sqrt{k}}ε\mathrm{polylog}(\frac{nm}ε) + \frac{s^2 κ^4}ε\mathrm{polylog}(\frac{κk}ε))$ and space complexity $O(\log_2(nk/ε)+s)$. With space complexity slightly worse, our algorithm achieves at least a polynomial speedup compared to Duan \emph{et al}.'s algorithm. Also, our algorithm shows exponential speedups in $n$ and $m$ compared with the classical algorithm when both $κ$, $k$ and $1/ε$ are $O(\mathrm{polylog}(nm))$.

quant-ph↗

Sample Size Calculation for Active-Arm Trial with Counterfactual Incidence Based on Recency Assay

The past decade has seen tremendous progress in the development of biomedical agents that are effective as pre-exposure prophylaxis (PrEP) for HIV prevention. To expand the choice of products and delivery methods, new medications and delivery methods are under development. Future trials of non-inferiority, given the high efficacy of ARV-based PrEP products as they become current or future standard of care, would require a large number of participants and long follow-up time that may not be feasible. This motivates the construction of a counterfactual estimate that approximates incidence for a randomized concurrent control group receiving no PrEP. We propose an approach that is to enroll a cohort of prospective PrEP users and augment screening for HIV with laboratory markers of duration of HIV infection to indicate recent infections. We discuss the assumptions under which these data would yield an estimate of the counterfactual HIV incidence and develop sample size and power calculations for comparisons to incidence observed on an investigational PrEP agent.

stat.ME↗

Optimization Algorithm-Based Approach for Modelling Large Deflection of Cantilever Beam Subjected to Tip Load

Beam mechanism and beam theory have attracted substantial attention from researchers, as they have been widely used in many fields such as compliant mechanisms and soft robots. The modeling of beam mechanisms becomes complicated due to the geometric nonlinearity that is proved to be significant with large deflection. A new method, called optimization algorithm-based approach (OABA), is proposed to predict the large deflection of cantilever beams, in which an optimization algorithm is exploited to find the locus of the beam tip. With the derived locus of the beam tip, the deflection curve of the cantilever beam can be calculated. The optimization algorithm in this paper is embodied in a particle swarm optimization (PSO) algorithm. Experimental results show that the proposed method can precisely predict the deflection of the uniform and non-uniform cantilever beams. The maximum error is limited to 4.35% when the normalized maximum transverse deflection reaches 0.75. Given that, the proposed OABA would be a universal approach to model the large deflection of cantilever beams subjected to tip loads.

cs.RO↗

Chiral phase structure and critical end point in QCD

We map out the QCD phase structure at finite temperature and chemical potential for 2-flavour and 2 + 1-flavour QCD. This is done within a generalised functional approach to QCD put forward in arXiv:2002.07500 [hep-ph]. Specifically we compute the quark propagator and the finite-temperature and density fluctuations of the gluon propagator and the quark-gluon vertex on the basis of precision data for vacuum correlation functions. The novel ingredient is the direct self-consistent computation of the DSEs for the dressings of the quark-gluon vertex, in contrast to the common use of STI-inspired vertices. For small densities the results for the chiral order parameter agree with the respective lattice and functional renormalisation group results, for large densities the present results are in a quantitative agreement with the latter, including the location of the critical end point.

hep-ph↗

High-Q plasmonic crystal laser for ultra-sensitive biomolecule detection

Plasmonic lasers provide a paradigm-changing approach for the generation of coherent light at the nanoscale. In addition to the usual properties of coherent radiation, the emission of plasmonic lasers can feature high sensitivity to the surrounding environment, which makes this technology attractive for developing high-performance and highly-integrated sensing devices. Here, we investigate a plasmonic laser architecture based on a high-Q plasmonic crystal consisting of a periodic arrangement of nanoholes on a thin gold film cladded with an organic-dye-doped SiO$_2$ gain layer as the gain material. We report an extensive full-wave numerical analysis of the device's lasing performance and its application as a biochemical sensor, showing that the proposed design features excellent figures of merit for surface sensing that in principle can be over an order of magnitude larger than those of previously reported high-performance plasmonic biosensor architectures.

physics.optics↗

Light-scanning hand-held photoacoustic probe design

Significance: We proposed a new design of hand-held linear-array photoacoustic (PA) probe which can acquire multi images via motor moving. Moreover, images from different locations are utilized via imaging fusion for SNR enhancement. Aim: We devised an adjustable hand-held for the purpose of realizing different images at diverse location for further image fusion. For realizing the light spot which is more matched with the Ultrasonic transducer detection area, we specially design a light adjust unit. Moreover, due to no displacement among the images, there is no need to execute image register process. The program execution time be reduced, greatly. Approach: mechanical design; Montel carol simulation; no-registration image fusion; Spot compression. Results: Multiple PA images with different optical illumination areas were acquired. After image fusion, we obtained fused PA images with higher signal-to-noise-ratio (SNR) and image fidelity than each single PA image. A quantitative comparison shows that the SNR of fused image is improved by 36.06% in agar-milk phantom, and 44.69% in chicken breast phantom, respectively. Conclusions: In this paper, the light scanning adjustable hand-held PA imaging probe is proposed, which can realize PA imaging with different illumination positions via adjusting the optical unit.

physics.med-ph↗

Dipole coupling of a tunable hole double quantum dot in germanium hut wire to a microwave resonator

The germanium (Ge) hut wire system has strong spin-orbit coupling, a long coherence time due to a very large heavy-light hole splitting, and the advantage of site-controlled large-scale hut wire positioning. These properties make the Ge hut wire a promising candidate for the realization of strong coupling of spin to superconducting resonators and scalability for multiple qubit coupling. We have coupled a reflection line resonator to a hole double quantum dot (DQD) formed in Ge hut wire. The amplitude and phase responses of the microwave resonator revealed that the charge stability diagrams of the DQD are in good agreement with those obtained from transport measurements. The DQD interdot tunneling rate is shown to be tunable from 6.2 GHz to 8.5 GHz, which demonstrates the ability to adjust the frequency detuning between the qubit and the resonator. Furthermore, we achieved a hole-resonator coupling strength of up to 15 MHz, with a charge qubit decoherence rate of 0.28 GHz. Meanwhile the hole spin-resonator coupling rate was estimated to be 3 MHz. These results suggest that holes of a DQD in a Ge hut wire are dipole coupled to microwave photons, potentially enabling tunable hole spin-photon interactions in Ge with an inherent spin-orbit coupling.

cond-mat.mes-hall↗

Quantum restricted Boltzmann machine universal for quantum computation

The challenge posed by the many-body problem in quantum physics originates from the difficulty of describing the nontrivial correlations encoded in the many-body wave functions with high complexity. Quantum neural network provides a powerful tool to represent the large-scale wave function, which has aroused widespread concern in the quantum superiority era. A significant open problem is what exactly the representational power boundary of the single-layer quantum neural network is. In this paper, we design a 2-local Hamiltonian and then give a kind of Quantum Restricted Boltzmann Machine (QRBM, i.e. single-layer quantum neural network) based on it. The proposed QRBM has the following two salient features. (1) It is proved universal for implementing quantum computation tasks. (2) It can be efficiently implemented on the Noisy Intermediate-Scale Quantum (NISQ) devices. We successfully utilize the proposed QRBM to compute the wave functions for the notable cases of physical interest including the ground state as well as the Gibbs state (thermal state) of molecules on the superconducting quantum chip. The experimental results illustrate the proposed QRBM can compute the above wave functions with an acceptable error.

quant-ph↗

Deep Learning Enables Robust and Precise Light Focusing on Treatment Needs

If light passes through the body tissues, focusing only on areas where treatment needs, such as tumors, will revolutionize many biomedical imaging and therapy technologies. So how to focus light through deep inhomogeneous tissues overcoming scattering is Holy Grail in biomedical areas. In this paper, we use deep learning to learn and accelerate the process of phase pre-compensation using wavefront shaping. We present an approach (LoftGAN, light only focuses on treatment needs) for learning the relationship between phase domain X and speckle domain Y . Our goal is not just to learn an inverse mapping F:Y->X such that we can know the corresponding X needed for imaging Y like most work, but also to make focusing that is susceptible to disturbances more robust and precise by ensuring that the phase obtained can be forward mapped back to speckle. So we introduce different constraints to enforce F(Y)=X and H(F(Y))=Y with the transmission mapping H:X->Y. Both simulation and physical experiments are performed to investigate the effects of light focusing to demonstrate the effectiveness of our method and comparative experiments prove the crucial improvement of robustness and precision. Codes are available at https://github.com/ChangchunYang/LoftGAN.

eess.IV↗

Making Robots Draw A Vivid Portrait In Two Minutes

Significant progress has been made with artistic robots. However, existing robots fail to produce high-quality portraits in a short time. In this work, we present a drawing robot, which can automatically transfer a facial picture to a vivid portrait, and then draw it on paper within two minutes averagely. At the heart of our system is a novel portrait synthesis algorithm based on deep learning. Innovatively, we employ a self-consistency loss, which makes the algorithm capable of generating continuous and smooth brush-strokes. Besides, we propose a componential sparsity constraint to reduce the number of brush-strokes over insignificant areas. We also implement a local sketch synthesis algorithm, and several pre- and post-processing techniques to deal with the background and details. The portrait produced by our algorithm successfully captures individual characteristics by using a sparse set of continuous brush-strokes. Finally, the portrait is converted to a sequence of trajectories and reproduced by a 3-degree-of-freedom robotic arm. The whole portrait drawing robotic system is named AiSketcher. Extensive experiments show that AiSketcher can produce considerably high-quality sketches for a wide range of pictures, including faces in-the-wild and universal images of arbitrary content. To our best knowledge, AiSketcher is the first portrait drawing robot that uses neural style transfer techniques. AiSketcher has attended a quite number of exhibitions and shown remarkable performance under diverse circumstances.

cs.RO↗