Searcharxiv⌕ Search

arXiv subjects

Jingzhi Guo

Publications and source records attributed to Jingzhi Guo.

6 recordsLinked to original sources

A Hybrid Framework for Blood Vessel Morphology Classification: Discrete Geometry-based Tortuosity Feature Measurement, Information Gain-based Feature Selection, and Random Forest Classification

Subjective visual grading of blood vessel tortuosity relies heavily on clinical experience, while traditional distance-based indices often fail to adequately characterize three-dimensional spatial deformation. Because abnormal internal carotid artery morphology may be clinically relevant to cerebrovascular assessment and stroke-risk evaluation, objective and reproducible quantification of vascular tortuosity is of considerable importance. To address this limitation, we propose a mathematical framework for the morphological classification of the internal carotid artery (ICA-C1) segment. The framework integrates discrete geometric feature measurement, Information Gain-based feature selection, and Random Forest classification. An initial set of 13 tortuosity features is extracted from the corresponding 379 clinical vascular centerlines using discrete geometric methods and subsequently reduced to a six-feature subset consisting of $\mathcal{TI}$, $\mathcal{AC}$, $\mathcal{TC}$, $\mathcal{AC}/\mathcal{AT}$, $\mathcal{AT}$, and $\mathcal{TT}$. The framework is evaluated in two classification tasks. For binary classification of non-severe and severe tortuosity, the RF model achieves a Macro-F1 score of 0.9206. For ternary morphological grading into straight, low-tortuosity, and high-tortuosity groups, it achieves a Macro-F1 score of 0.8626. The results indicate that elongation- and curvature-related features provide strong discriminatory information for basic screening, whereas torsion-related features contribute additional information for more detailed morphological classification. Based on the RF feature-importance values, we further define a Morphological Risk Index (MRI), which provides a direct numerical reference for vascular morphology and may facilitate more objective and consistent clinical assessment.

eess.IV↗

AIDA: Legal Judgment Predictions for Non-Professional Fact Descriptions via Partial-and-Imbalanced Domain Adaptation

In this paper, we study the problem of legal domain adaptation problem from an imbalanced source domain to a partial target domain. The task aims to improve legal judgment predictions for non-professional fact descriptions. We formulate this task as a partial-and-imbalanced domain adaptation problem. Though deep domain adaptation has achieved cutting-edge performance in many unsupervised domain adaptation tasks. However, due to the negative transfer of samples in non-shared classes, it is hard for current domain adaptation model to solve the partial-and-imbalanced transfer problem. In this work, we explore large-scale non-shared but related classes data in the source domain with a hierarchy weighting adaptation to tackle this limitation. We propose to embed a novel pArtial Imbalanced Domain Adaptation technique (AIDA) in the deep learning model, which can jointly borrow sibling knowledge from non-shared classes to shared classes in the source domain and further transfer the shared classes knowledge from the source domain to the target domain. Experimental results show that our model outperforms the state-of-the-art algorithms.

cs.CL↗

NI-UDA: Graph Adversarial Domain Adaptation from Non-shared-and-Imbalanced Big Data to Small Imbalanced Applications

We propose a new general Graph Adversarial Domain Adaptation (GADA) based on semantic knowledge reasoning of class structure for solving the problem of unsupervised domain adaptation (UDA) from the big data with non-shared and imbalanced classes to specified small and imbalanced applications (NI-UDA), where non-shared classes mean the label space out of the target domain. Our goal is to leverage priori hierarchy knowledge to enhance domain adversarial aligned feature representation with graph reasoning. In this paper, to address two challenges in NI-UDA, we equip adversarial domain adaptation with Hierarchy Graph Reasoning (HGR) layer and the Source Classifier Filter (SCF). For sparse classes transfer challenge, our HGR layer can aggregate local feature to hierarchy graph nodes by node prediction and enhance domain adversarial aligned feature with hierarchy graph reasoning for sparse classes. Our HGR contributes to learn direct semantic patterns for sparse classes by hierarchy attention in self-attention, non-linear mapping and graph normalization. our SCF is proposed for the challenge of knowledge sharing from non-shared data without negative transfer effect by filtering low-confidence non-shared data in HGR layer. Experiments on two benchmark datasets show our GADA methods consistently improve the state-of-the-art adversarial UDA algorithms, e.g. GADA(HGR) can greatly improve f1 of the MDD by \textbf{7.19\%} and GVB-GD by \textbf{7.89\%} respectively on imbalanced source task in Meal300 dataset. The code is available at https://gadatransfer.wixsite.com/gada.

cs.CV↗

From Trend Analysis to Virtual World System Design Requirement Satisfaction Study

Virtual worlds have become global platforms connecting millions of people and containing various technologies. The development of technology, shift of market value, and change of user preference shape the features of virtual worlds. In this paper, we first study the new features of virtual worlds and emergent requirements of system development through trend analysis. Based on the trend analysis, we constructed the new design requirement space. We then discuss the requirement satisfaction of existing virtual world system architectures and highlight their limitations through a literature survey. The comparison of existing system architectures sheds some light on future virtual world system development to match the changing trends of the user market. At the end of this study, we briefly introduce our ongoing study, a new architecture, called Virtual Net, and discuss its possibility in requirement satisfaction and new research challenges.

cs.DC↗

Efficient Peer-to-Peer Content Sharing for Learning in Virtual Worlds

Virtual world technologies provide new and immersive space for learning, training, and education. They are enabled by the content creation and content sharing function for allowing users to create and interoperate various learning objects. Unfortunately, virtual world content sharing based on persistent virtual world content storage, to the best of our knowledge, does not exist. In this paper, we address this problem by proposing a content sharing scheme based on Virtual Net, a virtual world persistency framework. For efficient content retrieval, three strategies have been proposed to reduce communication overhead and content load delay.By integrating these strategies, a virtual world content search and retrieval algorithm has been devised. The experiment results verify the effectiveness of the algorithm.

cs.DC↗

Virtual Net: a Decentralized Architecture for Interaction in Mobile Virtual Worlds

With the development of mobile technology, mobile virtual worlds have attracted massive users. To improve scalability, a peer-to-peer virtual world provides the solution to accommodate more users without increasing hardware investment. In mobile settings, however, existing P2P solutions are not applicable due to the unreliability of mobile devices and the instability of mobile networks. To address the issue, a novel infrastructure model, called Virtual Net, is proposed to provide fault-tolerance in managing user content and object state. In this paper, the key problem, namely object state update, is resolved to maintain state consistency and high interaction responsiveness. This work is important in implementing a scalable mobile virtual world.

cs.DC↗