Researcher profile

Yingjie Liu

Yingjie Liu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 19 - UnverifiedVerification L1Unclaimed author
5works
0followers
6topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

5 published item(s)

preprint2026arXiv

Curvature-Aware Captioning:Leveraging Geodesic Attention for 3D Scene Understanding

Accurate 3D scene description is fundamental to robotic navigation and augmented reality, yet current dense captioning methods face significant limitations in processing sparse point cloud data. % Existing approaches that apply Euclidean embedding spaces struggle to simultaneously preserve fine-grained local geometric details and model exponentially growing global semantic hierarchies, leading to either inaccurate localization or disjointed, shallow scene descriptions. % In this work, we propose a novel \textbf{\textsc{Curvature-Aware Captioning}} framework, integrating novel non-Euclidean geodesic attention mechanisms, to resolve the localization-contextualization conflict. % Specifically, self-attention within Oblique space enforces dimensional homogeneity while establishing long-range dependencies. Bidirectional geodesic cross-attention within Lorentz space models hierarchical semantic relationships across scene instances, enabling simultaneous precision in object localization and coherence in scene descriptions. % Theoretical analysis confirms that the curvature complementarity between the Oblique manifold and Lorentz hyperboloid resolves the Euclidean-hyperbolic conflict, ensuring feature stability via isotropic optimization while preserving inherent hierarchical relationships. Extensive experiments on ScanRefer and Nr3D benchmarks demonstrate state-of-the-art performance, with significant gains in both localization accuracy and descriptive richness.

preprint2022arXiv

Neural Networks with Local Converging Inputs (NNLCI) for Solving Conservation Laws, Part II: 2D Problems

In our prior work [arXiv:2109.09316], neural network methods with inputs based on domain of dependence and a converging sequence were introduced for solving one dimensional conservation laws, in particular the Euler systems. To predict a high-fidelity solution at a given space-time location, two solutions of a conservation law from a converging sequence, computed from low-cost numerical schemes, and in a local domain of dependence of the space-time location, serve as the input of a neural network. In the present work, we extend the methods to two dimensional Euler systems and introduce variations. Numerical results demonstrate that the methods not only work very well in one dimension [arXiv:2109.09316], but also perform well in two dimensions. Despite smeared local input data, the neural network methods are able to predict shocks, contacts, and smooth regions of the solution accurately. The neural network methods are efficient and relatively easy to train because they are local solvers.

preprint2022arXiv

O-ViT: Orthogonal Vision Transformer

Inspired by the tremendous success of the self-attention mechanism in natural language processing, the Vision Transformer (ViT) creatively applies it to image patch sequences and achieves incredible performance. However, the scaled dot-product self-attention of ViT brings about scale ambiguity to the structure of the original feature space. To address this problem, we propose a novel method named Orthogonal Vision Transformer (O-ViT), to optimize ViT from the geometric perspective. O-ViT limits parameters of self-attention blocks to be on the norm-keeping orthogonal manifold, which can keep the geometry of the feature space. Moreover, O-ViT achieves both orthogonal constraints and cheap optimization overhead by adopting a surjective mapping between the orthogonal group and its Lie algebra.We have conducted comparative experiments on image recognition tasks to demonstrate O-ViT's validity and experiments show that O-ViT can boost the performance of ViT by up to 3.6%.

preprint2022arXiv

SparGE: Sparse Coding-based Patient Similarity Learning via Low-rank Constraints and Graph Embedding

Patient similarity assessment (PSA) is pivotal to evidence-based and personalized medicine, enabled by analyzing the increasingly available electronic health records (EHRs). However, machine learning approaches for PSA has to deal with inherent data deficiencies of EHRs, namely missing values, noise, and small sample sizes. In this work, an end-to-end discriminative learning framework, called SparGE, is proposed to address these data challenges of EHR for PSA. SparGE measures similarity by jointly sparse coding and graph embedding. First, we use low-rank constrained sparse coding to identify and calculate weight for similar patients, while denoising against missing values. Then, graph embedding on sparse representations is adopted to measure the similarity between patient pairs via preserving local relationships defined by distances. Finally, a global cost function is constructed to optimize related parameters. Experimental results on two private and public real-world healthcare datasets, namely SingHEART and MIMIC-III, show that the proposed SparGE significantly outperforms other machine learning patient similarity methods.

preprint2021arXiv

A Finite Difference Method on Irregular Grids with Local Second Order Ghost Point Extension for Solving Maxwell's Equations Around Curved PEC Objects

A new finite difference method on irregular, locally perturbed rectangular grids has been developed for solving electromagnetic waves around curved perfect electric conductors (PEC). This method incorporates the back and forth error compensation and correction method (BFECC) and level set method to achieve convenience and higher order of accuracy at complicated PEC boundaries. A PDE-based local second order ghost cell extension technique is developed based on the level set framework in order to compute the boundary value to first order accuracy (cumulatively), and then BFECC is applied to further improve the accuracy while increasing the CFL number. Numerical experiments are conducted to validate the properties of the method.