Mingwei Li

Mingwei Li

Auto-generated profile, based on publicly available information

Mingwei Li

Vanderbilt University USA

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 November 2021 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
MEMateus Espadoto
Mateus Espadoto
GAGabriel Appleby
Gabriel Appleby
ASAshley Suh
Ashley Suh
DCDylan Cashman
Dylan Cashman
MLMingwei Li
Mingwei Li
Alexandru TeleaAlexandru Telea
Alexandru Telea
Projection techniques are often used to visualize high-dimensional data, allowing users to better understand the overall structure of multi-dimensional spaces on a 2D screen. Although many such methods exist, comparably little work has been done on generalizable methods of inverse-projection – the process of mapping the projected points, or more generally, the projection space back to the original high-dimensional space. In this article we present NNInv, a deep learning technique with the ability to approximate the inverse of any projection or mapping. NNInv learns to reconstruct high-dimensional data from any arbitrary point on a 2D projection space, giving users the ability to interact with the learned high-dimensional representation in a visual analytics system. We provide an analysis of the parameter space of NNInv, and offer guidance in selecting these parameters. We extend validation of the effectiveness of NNInv through a series of quantitative and qualitative analyses. We then demonstrate the method’s utility by applying it to three visualization tasks: interactive instance interpolation, classifier agreement, and gradient visualization.

1 January 2020
Verified
Book Chapter
Closed access
PDF file
RAReyan Ahmed
Reyan Ahmed
FLFelice De Luca
Felice De Luca
SDSabin Devkota
Sabin Devkota
SKStephen Kobourov
Stephen Kobourov
MLMingwei Li
Mingwei Li

1 March 2022 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
RAReyan Ahmed
Reyan Ahmed
FLFelice De Luca
Felice De Luca
SDSabin Devkota
Sabin Devkota
SKStephen G Kobourov
Stephen G Kobourov
MLMingwei Li
Mingwei Li
Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension of the underlying data. With few exceptions, graph drawing algorithms typically optimize one such criterion, usually at the expense of others. We propose a layout approach, Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, $(SGD)^{2}$ , that can handle multiple readability criteria. $(SGD)^{2}$ can optimize any criterion that can be described by a differentiable function. Our approach is flexible and can be used to optimize several criteria that have already been considered earlier (e.g., obtaining ideal edge lengths, stress, neighborhood preservation) as well as other criteria which have not yet been explicitly optimized in such fashion (e.g., node resolution, angular resolution, aspect ratio). The approach is scalable and can handle large graphs. A variation of the underlying approach can also be used to optimize many desirable properties in planar graphs, while maintaining planarity. Finally, we provide quantitative and qualitative evidence of the effectiveness of $(SGD)^{2}$ : we analyze the interactions between criteria, measure the quality of layouts generated from $(SGD)^{2}$ as well as the runtime behavior, and analyze the impact of sample sizes. The source code is available on github and we also provide an interactive demo for small graphs.

9 May 2023 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
KGKathryn Gray
Kathryn Gray
MLMingwei Li
Mingwei Li
RAReyan Ahmed
Reyan Ahmed
KRKhaledur Rahman
Khaledur Rahman
AAAriful Azad
Ariful Azad
KBKaty Börner
Katy Börner
Large tree structures are ubiquitous and real-world relational datasets often have information associated with nodes (e.g., labels or other attributes) and edges (e.g., weights or distances) that need to be communicated to the viewers. Yet, scalable, easy to read tree layouts are difficult to achieve. We consider tree layouts to be readable if they meet some basic requirements: node labels should not overlap, edges should not cross, edge lengths should be preserved, and the output should be compact. There are many algorithms for drawing trees, although very few take node labels or edge lengths into account, and none optimizes all requirements above. With this in mind, we propose a new scalable method for readable tree layouts. The algorithm guarantees that the layout has no edge crossings and no label overlaps, and optimizing one of the remaining aspects: desired edge lengths and compactness. We evaluate the performance of the new algorithm by comparison with related earlier approaches using several real-world datasets, ranging from a few thousand nodes to hundreds of thousands of nodes. Tree layout algorithms can be used to visualize large general graphs, by extracting a hierarchy of progressively larger trees. We illustrate this functionality by presenting several map-like visualizations generated by the new tree layout algorithm.

19 April 2023
Verified
Conference Paper
Open access
YZYayan Zhao
Yayan Zhao
MLMingwei Li
Mingwei Li
MBMatthew Berger
Matthew Berger
In recent years, considerable work has been devoted to explaining predictive, deep learning-based models, and in turn how to evaluate explanations. An important class of evaluation methods are ones that are human-centered, which typically require the communication of explanations through visualizations. And while visualization plays a critical role in perceiving and understanding model explanations, how visualization design impacts human perception of explanations remains poorly understood. In this work, we study the graphical perception of model explanations, specifically, saliency-based explanations for visual recognition models. We propose an experimental design to investigate how human perception is influenced by visualization design, wherein we study the task of alignment assessment, or whether a saliency map aligns with an object in an image. Our findings show that factors related to visualization design decisions, the type of alignment, and qualities of the saliency map all play important roles in how humans perceive saliency-based visual explanations.

1 May 2012
Verified
Conference Paper
Closed access
MLMingwei Li
Mingwei Li
YYYuanwei YuanJing
Yuanwei YuanJing
More attention has been paid to congestion control in the emerging area of wireless sensor network (WSN). However, most research works in the past stayed at the level of the current algorithms design or modification, and seldom sought solutions on the viewpoint of architecture. In this work, we propose innovative model and congestion control algorithm for wireless sensor networks based on feedback control, which will be referred to as Feedback Congestion Control (FBCC). The algorithm has been designed by exploiting linear discrete time control theory. A feedback control scheme is set up between children node and father node. The FBCC detects the onset of congestion using queue length. Then, an active flow control scheme selects suitable incoming traffic which is enforced by the newly proposed active scheme. Closed-loop stability of the proposed hop-by-hop congestion control is demonstrated by using the Lyapunov-based approach. The scheme makes congestion control in WSN rise to theoretical height. Simulation results show that the FBCC reduces congestion and improves performance over Congestion Detection and Avoidance (CODA). The results of simulations validate FBCC can avoid and alleviate congestion, and has reasonable effects of reliability,low energy consumption and high throughout.