arXiv subjects

Ying Lu

Publications and source records attributed to Ying Lu.

At least 37 records · Page 2Linked to original sources

arXiv2024

Scalable Radar-based Roadside Perception: Self-localization and Occupancy Heat Map for Traffic Analysis

4D mmWave radar sensors are suitable for roadside perception in city-scale Intelligent Transportation Systems (ITS) due to their long sensing range, weatherproof functionality, simple mechanical design, and low manufacturing cost. In this work, we investigate radar-based ITS for scalable traffic analysis. Localization of these radar sensors at city scale is a fundamental task in ITS. For flexible sensor setups, it requires even more effort. To address this task, we propose a self-localization approach that matches two descriptions of the "road": the one from the geometry of the motion trajectories of cumulatively observed vehicles, and the other one from the aerial laser scan. An Iterative Closest Point (ICP) algorithm is used to register the motion trajectory in the road section of the laser scan. The resulting estimate of the transformation matrix represents the sensor pose in a global reference frame. We evaluate the results and show that it outperforms other map-based radar localization methods, especially for the orientation estimation. Beyond the localization result, we project radar sensor data onto a city-scale laser scan and generate a scalable occupancy heat map as a traffic analysis tool. This is demonstrated using two radar sensors monitoring an urban area in the real world.

cs.RO↗

arXiv2024

Opportunities and challenges in the application of large artificial intelligence models in radiology

Influenced by ChatGPT, artificial intelligence (AI) large models have witnessed a global upsurge in large model research and development. As people enjoy the convenience by this AI large model, more and more large models in subdivided fields are gradually being proposed, especially large models in radiology imaging field. This article first introduces the development history of large models, technical details, workflow, working principles of multimodal large models and working principles of video generation large models. Secondly, we summarize the latest research progress of AI large models in radiology education, radiology report generation, applications of unimodal and multimodal radiology. Finally, this paper also summarizes some of the challenges of large AI models in radiology, with the aim of better promoting the rapid revolution in the field of radiography.

cs.CV↗

arXiv2024

Distribution Properties of the 6.7 GHz Methanol Masers and Their Surrounding Gases in the Milky Way

An updated catalog consisting of 1092 6.7-GHz methanol maser sources was reported in this work. Additionally, the NH3 (1, 1), NH3 (2, 2), and NH3 (3, 3) transitions were observed towards 214 star forming regions using the Shanghai Tianma radio telescope (TMRT) in order to examine the differences in physical environments, such as excitation temperature and column density of molecular clouds associated with methanol masers on the Galactic scale. Statistical results reveal that the number of 6.7 GHz methanol masers in the Perseus arm is significantly lower than that in the other three main spiral arms. In addition, the Perseus arm also has the lowest gas column density among the main spiral arms traced by the NH3 observations. Both of these findings suggest that the Perseus arm has the lowest rate of high-mass star formation compared to the other three main spiral arms. We also observed a trend in which both the luminosity of 6.7 GHz methanol masers and the ammonia gas column density decreased as the galactocentric distances. This finding indicates that the density of material in the inner Milky Way is generally higher than that in the outer Milky Way. It further suggests that high-mass stars are more easily formed at the head of spiral arms. Furthermore, we found that the column density of ammonia gas is higher in the regions on the arms than that in the inter-arm regions, supporting that the former is more likely to be the birthplace of high-mass stars.

astro-ph.GA↗

arXiv2023

Developing A Fair Individualized Polysocial Risk Score (iPsRS) for Identifying Increased Social Risk of Hospitalizations in Patients with Type 2 Diabetes (T2D)

Background: Racial and ethnic minority groups and individuals facing social disadvantages, which often stem from their social determinants of health (SDoH), bear a disproportionate burden of type 2 diabetes (T2D) and its complications. It is therefore crucial to implement effective social risk management strategies at the point of care. Objective: To develop an EHR-based machine learning (ML) analytical pipeline to identify the unmet social needs associated with hospitalization risk in patients with T2D. Methods: We identified 10,192 T2D patients from the EHR data (from 2012 to 2022) from the University of Florida Health Integrated Data Repository, including contextual SDoH (e.g., neighborhood deprivation) and individual-level SDoH (e.g., housing stability). We developed an electronic health records (EHR)-based machine learning (ML) analytic pipeline, namely individualized polysocial risk score (iPsRS), to identify high social risk associated with hospitalizations in T2D patients, along with explainable AI (XAI) techniques and fairness assessment and optimization. Results: Our iPsRS achieved a C statistic of 0.72 in predicting 1-year hospitalization after fairness optimization across racial-ethnic groups. The iPsRS showed excellent utility for capturing individuals at high hospitalization risk; the actual 1-year hospitalization rate in the top 5% of iPsRS was ~13 times as high as the bottom decile. Conclusion: Our ML pipeline iPsRS can fairly and accurately screen for patients who have increased social risk leading to hospitalization in T2D patients.

cs.LG↗

arXiv2023

Tensor Network Efficiently Representing Schmidt Decomposition of Quantum Many-Body States

Efficient methods to access the entanglement of a quantum many-body state, where the complexity generally scales exponentially with the system size $N$, have long a concern. Here we propose the Schmidt tensor network state (Schmidt TNS) that efficiently represents the Schmidt decomposition of finite- and even infinite-size quantum states with nontrivial bipartition boundary. The key idea is to represent the Schmidt coefficients (i.e., entanglement spectrum) and transformations in the decomposition to tensor networks (TNs) with linearly-scaled complexity versus $N$. Specifically, the transformations are written as the TNs formed by local unitary tensors, and the Schmidt coefficients are encoded in a positive-definite matrix product state (MPS). Translational invariance can be imposed on the TNs and MPS for the infinite-size cases. The validity of Schmidt TNS is demonstrated by simulating the ground state of the quasi-one-dimensional spin model with geometrical frustration. Our results show that the MPS encoding the Schmidt coefficients is weakly entangled even when the entanglement entropy of the decomposed state is strong. This justifies the efficiency of using MPS to encode the Schmidt coefficients, and promises an exponential speedup on the full-state sampling tasks.

quant-ph↗

arXiv2023

Quantum compiling with a variational instruction set for accurate and fast quantum computing

The quantum instruction set (QIS) is defined as the quantum gates that are physically realizable by controlling the qubits in quantum hardware. Compiling quantum circuits into the product of the gates in a properly defined QIS is a fundamental step in quantum computing. We here propose the quantum variational instruction set (QuVIS) formed by flexibly designed multi-qubit gates for higher speed and accuracy of quantum computing. The controlling of qubits for realizing the gates in a QuVIS is variationally achieved using the fine-grained time optimization algorithm. Significant reductions in both the error accumulation and time cost are demonstrated in realizing the swaps of multiple qubits and quantum Fourier transformations, compared with the compiling by a standard QIS such as the quantum microinstruction set (QuMIS, formed by several one- and two-qubit gates including one-qubit rotations and controlled-NOT gates). With the same requirement on quantum hardware, the time cost for QuVIS is reduced to less than one half of that for QuMIS. Simultaneously, the error is suppressed algebraically as the depth of the compiled circuit is reduced. As a general compiling approach with high flexibility and efficiency, QuVIS can be defined for different quantum circuits and be adapted to the quantum hardware with different interactions.

quant-ph↗

arXiv2021

Preparation of Many-body Ground States by Time Evolution with Variational Microscopic Magnetic Fields and Incomplete Interactions

State preparation is of fundamental importance in quantum physics, which can be realized by constructing the quantum circuit as a unitary that transforms the initial state to the target, or implementing a quantum control protocol to evolve to the target state with a designed Hamiltonian. In this work, we study the latter on quantum many-body systems by the time evolution with fixed couplings and variational magnetic fields. In specific, we consider to prepare the ground states of the Hamiltonians containing certain interactions that are missing in the Hamiltonians for the time evolution. An optimization method is proposed to optimize the magnetic fields by "fine-graining" the discretization of time, in order to gain high precision and stability. The back propagation technique is utilized to obtain the gradients of the fields against the logarithmic fidelity. Our method is tested on preparing the ground state of Heisenberg chain with the time evolution by the XY and Ising interactions, and its performance surpasses two baseline methods that use local and global optimization strategies, respectively. Our work can be applied and generalized to other quantum models such as those defined on higher dimensional lattices. It enlightens to reduce the complexity of the required interactions for implementing quantum control or other tasks in quantum information and computation by means of optimizing the magnetic fields.

quant-ph↗

arXiv2021

Twist-diameter coupling drives DNA twist changes by salt and temperature

DNA deformations play crucial roles in many biological processes and material applications. During DNA deformation, DNA structural parameters often exhibit non-trivial and counterintuitive couplings, such as the twist-stretch and twist-bending couplings. Here, we reveal an unexpectedly strong negative twist-diameter coupling through the synergy of magnetic-tweezers experiments, atomistic molecular dynamics simulations, and theoretical calculations. In experiments, the DNA twist angle always increases with the concentration of NaCl, KCl, or RbCl. Our simulations quantitatively reproduce salt-induced twist changes and reveal the underlying physical mechanism: the reduction of DNA diameter under a high salt concentration leads to the increase in DNA twist angle through a strong negative twist-diameter coupling. The twist-diameter coupling is mediated by two dihedral angles in DNA structure and the coupling constant is 4.5 kBT/(deg nm) for one base-pair. Based on this coupling constant, we predict the temperature-dependence of DNA twist -0.0102 deg/K per bp, which agrees with our and previous experimental results. Our analysis suggests that the twist-diameter coupling is a common driving force for salt- and temperature-induced DNA twist changes.

physics.bio-ph↗

arXiv2021

Embedding Node Structural Role Identity Using Stress Majorization

Nodes in networks may have one or more functions that determine their role in the system. As opposed to local proximity, which captures the local context of nodes, the role identity captures the functional "role" that nodes play in a network, such as being the center of a group, or the bridge between two groups. This means that nodes far apart in a network can have similar structural role identities. Several recent works have explored methods for embedding the roles of nodes in networks. However, these methods all rely on either approximating or indirect modeling of structural equivalence. In this paper, we present a novel and flexible framework using stress majorization, to transform the high-dimensional role identities in networks directly (without approximation or indirect modeling) to a low-dimensional embedding space. Our method is also flexible, in that it does not rely on specific structural similarity definitions. We evaluated our method on the tasks of node classification, clustering, and visualization, using three real-world and five synthetic networks. Our experiments show that our framework achieves superior results than existing methods in learning node role representations.

cs.SI↗

arXiv2020

Embedding Node Structural Role Identity into Hyperbolic Space

Recently, there has been an interest in embedding networks in hyperbolic space, since hyperbolic space has been shown to work well in capturing graph/network structure as it can naturally reflect some properties of complex networks. However, the work on network embedding in hyperbolic space has been focused on microscopic node embedding. In this work, we are the first to present a framework to embed the structural roles of nodes into hyperbolic space. Our framework extends struct2vec, a well-known structural role preserving embedding method, by moving it to a hyperboloid model. We evaluated our method on four real-world and one synthetic network. Our results show that hyperbolic space is more effective than euclidean space in learning latent representations for the structural role of nodes.

cs.SI↗

arXiv2019

Flexible Demand Resource Pricing Scheme: A Stochastic Benefit-Sharing Approach

With the rapidly increased penetration of renewable generations, incentive-based demand side management (DSM) shows great value on alleviating the uncertainty and providing flexibility for microgrid. However, how to price those demand resources becomes one of the most significant challenges for promoting incentive-based DSM under microgrid environments. In this paper, a flexible demand resource pricing scheme is proposed. Instead of using the utility function of end users like most existing literatures, the economic benefit of flexible demand resources is evaluated by the operation performance enhancement of microgrid and correspondingly the resource is priced based on a benefit sharing approach. An iteration-based chance-constrained method is established to calculate the economic benefit and shared compensation for demand resource providers. Meanwhile, the financial risks for the microgrid operator due to uncertain factors are mitigated by the chance-constrained criterion. The proposed scheme is examined by an experimental microgrid to illustrate its effectiveness.

math.OC↗

arXiv2019

D$^2$-City: A Large-Scale Dashcam Video Dataset of Diverse Traffic Scenarios

Driving datasets accelerate the development of intelligent driving and related computer vision technologies, while substantial and detailed annotations serve as fuels and powers to boost the efficacy of such datasets to improve learning-based models. We propose D$^2$-City, a large-scale comprehensive collection of dashcam videos collected by vehicles on DiDi's platform. D$^2$-City contains more than 10000 video clips which deeply reflect the diversity and complexity of real-world traffic scenarios in China. We also provide bounding boxes and tracking annotations of 12 classes of objects in all frames of 1000 videos and detection annotations on keyframes for the remainder of the videos. Compared with existing datasets, D$^2$-City features data in varying weather, road, and traffic conditions and a huge amount of elaborate detection and tracking annotations. By bringing a diverse set of challenging cases to the community, we expect the D$^2$-City dataset will advance the perception and related areas of intelligent driving.

cs.LG↗

arXiv2018

Critical slowing down and attractive manifold: a mechanism for dynamic robustness in yeast cell-cycle process

The biological processes that execute complex multiple functions, such as cell cycle, must ensure the order of sequential events and keep the dynamic robustness against various fluctuations. Here, we examine the dynamic mechanism and the fundamental structure to achieve these properties in the cell-cycle process of budding yeast Saccharomyces cerevisiae. We show that the budding yeast cell-cycle process behaves like an excitable system containing three well-coupled saddle-node bifurcations to execute DNA replication and mitosis events. The yeast cell-cycle regulatory network can be separated into G1/S phase module, early M module and late M phase module, where the positive feedbacks in each module and the interactions among the modules play important role. If the cell-cycle process operates near the critical points of the saddle-node bifurcations, there is a critical slowing down or ghost effect. This can provide the cell-cycle process with a sufficient duration for each event and an attractive manifold for the state checking of the completion of DNA replication and mitosis; moreover, the fluctuation in the early module/event is forbidden to transmit to the latter module/event. Our results suggest both a fundamental structure of cell-cycle regulatory network and a hint for the evolution of eukaryotic cell-cycle processes, from the dynamic checking mechanism to the molecule checkpoint pathway.

q-bio.MN↗

arXiv2018

Probing single protein dynamics on liposome surfaces

It is crucial to measure position and conformational changes of a membrane-interacting protein relative to the membrane surface. This is however challenging because the thickness of a membrane is usually only about 4 nm. We developed a fluorescence method which makes use of the principle of FRET between a fluorophore and a cloud of quenchers encapsulated in a liposome, hence the name LipoFRET. LipoFRET can readily locate a fluorophore in different depths inside and at different heights above the membrane. We applied LipoFRET to study α-synuclein, a key player in the pathology of Parkinson's disease. Our approach yielded quantita-tive information about the dynamics of different regions of α-syn in lipid membranes, which has never been explored before.

physics.bio-ph↗

arXiv2018

Brenier approach for optimal transportation between a quasi-discrete measure and a discrete measure

Correctly estimating the discrepancy between two data distributions has always been an important task in Machine Learning. Recently, Cuturi proposed the Sinkhorn distance which makes use of an approximate Optimal Transport cost between two distributions as a distance to describe distribution discrepancy. Although it has been successfully adopted in various machine learning applications (e.g. in Natural Language Processing and Computer Vision) since then, the Sinkhorn distance also suffers from two unnegligible limitations. The first one is that the Sinkhorn distance only gives an approximation of the real Wasserstein distance, the second one is the `divide by zero' problem which often occurs during matrix scaling when setting the entropy regularization coefficient to a small value. In this paper, we introduce a new Brenier approach for calculating a more accurate Wasserstein distance between two discrete distributions, this approach successfully avoids the two limitations shown above for Sinkhorn distance and gives an alternative way for estimating distribution discrepancy.

cs.CV↗

arXiv2017

Discriminative and Geometry Aware Unsupervised Domain Adaptation

Domain adaptation (DA) aims to generalize a learning model across training and testing data despite the mismatch of their data distributions. In light of a theoretical estimation of upper error bound, we argue in this paper that an effective DA method should 1) search a shared feature subspace where source and target data are not only aligned in terms of distributions as most state of the art DA methods do, but also discriminative in that instances of different classes are well separated; 2) account for the geometric structure of the underlying data manifold when inferring data labels on the target domain. In comparison with a baseline DA method which only cares about data distribution alignment between source and target, we derive three different DA models, namely CDDA, GA-DA, and DGA-DA, to highlight the contribution of Close yet Discriminative DA(CDDA) based on 1), Geometry Aware DA (GA-DA) based on 2), and finally Discriminative and Geometry Aware DA (DGA-DA) implementing jointly 1) and 2). Using both synthetic and real data, we show the effectiveness of the proposed approach which consistently outperforms state of the art DA methods over 36 image classification DA tasks through 6 popular benchmarks. We further carry out in-depth analysis of the proposed DA method in quantifying the contribution of each term of our DA model and provide insights into the proposed DA methods in visualizing both real and synthetic data.

cs.CV↗

arXiv2017

Optimal Transport for Deep Joint Transfer Learning

Training a Deep Neural Network (DNN) from scratch requires a large amount of labeled data. For a classification task where only small amount of training data is available, a common solution is to perform fine-tuning on a DNN which is pre-trained with related source data. This consecutive training process is time consuming and does not consider explicitly the relatedness between different source and target tasks. In this paper, we propose a novel method to jointly fine-tune a Deep Neural Network with source data and target data. By adding an Optimal Transport loss (OT loss) between source and target classifier predictions as a constraint on the source classifier, the proposed Joint Transfer Learning Network (JTLN) can effectively learn useful knowledge for target classification from source data. Furthermore, by using different kind of metric as cost matrix for the OT loss, JTLN can incorporate different prior knowledge about the relatedness between target categories and source categories. We carried out experiments with JTLN based on Alexnet on image classification datasets and the results verify the effectiveness of the proposed JTLN in comparison with standard consecutive fine-tuning. This Joint Transfer Learning with OT loss is general and can also be applied to other kind of Neural Networks.

cs.CV↗

arXiv2017

Efficient Detection of Points of Interest from Georeferenced Visual Content

Many people take photos and videos with smartphones and more recently with 360-degree cameras at popular places and events, and share them in social media. Such visual content is produced in large volumes in urban areas, and it is a source of information that online users could exploit to learn what has got the interest of the general public on the streets of the cities where they live or plan to visit. A key step to providing users with that information is to identify the most popular k spots in specified areas. In this paper, we propose a clustering and incremental sampling (C&IS) approach that trades off accuracy of top-k results for detection speed. It uses clustering to determine areas with high density of visual content, and incremental sampling, controlled by stopping criteria, to limit the amount of computational work. It leverages spatial metadata, which represent the scenes in the visual content, to rapidly detect the hotspots, and uses a recently proposed Gaussian probability model to describe the capture intention distribution in the query area. We evaluate the approach with metadata, derived from a non-synthetic, user-generated dataset, for regular mobile and 360-degree visual content. Our results show that the C&IS approach offers 2.8x-19x reductions in processing time over an optimized baseline, while in most cases correctly identifying 4 out of 5 top locations.

cs.DB↗