Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huixuan Xie

dblp:274/1240 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-0578-8373ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Visualization and visual analytics · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Computer networks
1 paper
Wireless networking · 100%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
image abstraction
0.712023
ASTF: Visual Abstractions of Time-Varying Patterns in Radio Signals · IEEE Trans. Vis. Comput. Graph. 2023
Visualization and visual analytics › graph visualization
graph sampling
0.512021
Preserving Minority Structures in Graph Sampling · IEEE Trans. Vis. Comput. Graph. 2021
Visualization and visual analytics
graph visualization
0.512021
Preserving Minority Structures in Graph Sampling · IEEE Trans. Vis. Comput. Graph. 2021
Graph algorithms and graph theory
graph sampling
0.512021
Preserving Minority Structures in Graph Sampling · IEEE Trans. Vis. Comput. Graph. 2021

Methods — techniques the papers use, named apart from their topics

user study · 1.3time segmentation algorithm · 1.3triangle-based algorithm · 1.0greedy strategy · 1.0cut-point-based algorithm · 1.0
YearPublicationVenuePosition
2023 ASTF: Visual Abstractions of Time-Varying Patterns in Radio Signals
abstract
A time-frequency diagram is a commonly used visualization for observing the time-frequency distribution of radio signals and analyzing their time-varying patterns of communication states in radio monitoring and management. While it excels when performing short-term signal analyses, it becomes inadaptable for long-term signal analyses because it cannot adequately depict signal time-varying patterns in a large time span on a space-limited screen. This research thus presents an abstract signal time-frequency (ASTF) diagram to address this problem. In the diagram design, a visual abstraction method is proposed to visually encode signal communication state changes in time slices. A time segmentation algorithm is proposed to divide a large time span into time slices. Three new quantified metrics and a loss function are defined to ensure the preservation of important time-varying information in the time segmentation. An algorithm performance experiment and a user study are conducted to evaluate the effectiveness of the diagram for long-term signal analyses.
Ying Zhao 0001, Luhao Ge, Huixuan Xie, Genghuai Bai, Yun Lin 0005
IEEE Trans. Vis. Comput. Graph.3
2021 Preserving Minority Structures in Graph Sampling
abstract
Sampling is a widely used graph reduction technique to accelerate graph computations and simplify graph visualizations. By comprehensively analyzing the literature on graph sampling, we assume that existing algorithms cannot effectively preserve minority structures that are rare and small in a graph but are very important in graph analysis. In this work, we initially conduct a pilot user study to investigate representative minority structures that are most appealing to human viewers. We then perform an experimental study to evaluate the performance of existing graph sampling algorithms regarding minority structure preservation. Results confirm our assumption and suggest key points for designing a new graph sampling approach named mino-centric graph sampling (MCGS). In this approach, a triangle-based algorithm and a cut-point-based algorithm are proposed to efficiently identify minority structures. A set of importance assessment criteria are designed to guide the preservation of important minority structures. Three optimization objectives are introduced into a greedy strategy to balance the preservation between minority and majority structures and suppress the generation of new minority structures. A series of experiments and case studies are conducted to evaluate the effectiveness of the proposed MCGS.
Ying Zhao 0001, Haojin Jiang, Qi'an Chen, Yaqi Qin, Huixuan Xie, Shixia Liu, Zhiguang Zhou, Jiazhi Xia
IEEE Trans. Vis. Comput. Graph.5