arXiv subjects

Haotian Li

Publications and source records attributed to Haotian Li.

105 records · Page 6Linked to original sources

arXiv2021

KG4Vis: A Knowledge Graph-Based Approach for Visualization Recommendation

Visualization recommendation or automatic visualization generation can significantly lower the barriers for general users to rapidly create effective data visualizations, especially for those users without a background in data visualizations. However, existing rule-based approaches require tedious manual specifications of visualization rules by visualization experts. Other machine learning-based approaches often work like black-box and are difficult to understand why a specific visualization is recommended, limiting the wider adoption of these approaches. This paper fills the gap by presenting KG4Vis, a knowledge graph (KG)-based approach for visualization recommendation. It does not require manual specifications of visualization rules and can also guarantee good explainability. Specifically, we propose a framework for building knowledge graphs, consisting of three types of entities (i.e., data features, data columns and visualization design choices) and the relations between them, to model the mapping rules between data and effective visualizations. A TransE-based embedding technique is employed to learn the embeddings of both entities and relations of the knowledge graph from existing dataset-visualization pairs. Such embeddings intrinsically model the desirable visualization rules. Then, given a new dataset, effective visualizations can be inferred from the knowledge graph with semantically meaningful rules. We conducted extensive evaluations to assess the proposed approach, including quantitative comparisons, case studies and expert interviews. The results demonstrate the effectiveness of our approach.

cs.HC↗

arXiv2021

Can CAV Reduce Non-Recurrent Urban Road Congestion?

A well-designed resilient and sustainable urban transportation system can recover quickly from the non-recurrent road congestion (NRC), which is often caused by en-route events (e.g., road closure due to car collisions). Existing solutions, such as on-board navigation systems and temporary rerouting road signs, are not effective due to delayed responses. Connected Autonomous Vehicles (CAV) can be helpful in improving recurrent traffic as they can autonomously adjust their speed according to their real-time surrounding traffic, sensed by vehicular communications. Preliminary simulation results in this short paper show that CAV can also improve traffic when non-recurrent congestion occurs. Other results in fuel consumption, CO2 emission, and traditional traffic safety indicators are open for future discussions.

eess.SY↗

arXiv2021

Interactive Probing of Multivariate Time Series Prediction Models: A Case of Freight Rate Analysis

We present an interactive probing tool to create, modify and analyze what-if scenarios for multivariate time series models. The solution is applied to freight trading, where analysts can carry out sensitivity analysis on freight rates by changing demand and supply-related econometric variables and observing their resultant effects on freight indexes. We utilize various visualization techniques to enable intuitive scenario creation, alteration, and comprehension of time series inputs and model predictions. Our tool proved to be useful to the industry practitioners, demonstrated by a case study where freight traders are given hypothetical market scenarios and successfully generated quantitative freight index projection with confidence.

stat.OT↗

arXiv2021

Natural Graph Wavelet Packet Dictionaries

We introduce a set of novel multiscale basis transforms for signals on graphs that utilize their "dual" domains by incorporating the "natural" distances between graph Laplacian eigenvectors, rather than simply using the eigenvalue ordering. These basis dictionaries can be seen as generalizations of the classical Shannon wavelet packet dictionary to arbitrary graphs, and do not rely on the frequency interpretation of Laplacian eigenvalues. We describe the algorithms (involving either vector rotations or orthogonalizations) to construct these basis dictionaries, use them to efficiently approximate graph signals through the best basis search, and demonstrate the strengths of these basis dictionaries for graph signals measured on sunflower graphs and street networks.

eess.SP↗

arXiv2021

Topology Density Map for Urban Data Visualization and Analysis

Density map is an effective visualization technique for depicting the scalar field distribution in 2D space. Conventional methods for constructing density maps are mainly based on Euclidean distance, limiting their applicability in urban analysis that shall consider road network and urban traffic. In this work, we propose a new method named Topology Density Map, targeting for accurate and intuitive density maps in the context of urban environment. Based on the various constraints of road connections and traffic conditions, the method first constructs a directed acyclic graph (DAG) that propagates nonlinear scalar fields along 1D road networks. Next, the method extends the scalar fields to a 2D space by identifying key intersecting points in the DAG, dividing the underlying territory into planar regions using a weighted Voronoi diagram, and calculating the scalar fields for every point. Two case studies demonstrate that the Topology Density Map supplies accurate information to users and provides an intuitive visualization for decision making. An interview with domain experts demonstrates the feasibility, usability, and effectiveness of our method.

cs.HC↗

arXiv2021

Deep Colormap Extraction from Visualizations

This work presents a new approach based on deep learning to automatically extract colormaps from visualizations. After summarizing colors in an input visualization image as a Lab color histogram, we pass the histogram to a pre-trained deep neural network, which learns to predict the colormap that produces the visualization. To train the network, we create a new dataset of 64K visualizations that cover a wide variety of data distributions, chart types, and colormaps. The network adopts an atrous spatial pyramid pooling module to capture color features at multiple scales in the input color histograms. We then classify the predicted colormap as discrete or continuous and refine the predicted colormap based on its color histogram. Quantitative comparisons to existing methods show the superior performance of our approach on both synthetic and real-world visualizations. We further demonstrate the utility of our method with two use cases,i.e., color transfer and color remapping.

cs.HC↗

arXiv2021

A Visual Analytics Approach to Facilitate the Proctoring of Online Exams

Online exams have become widely used to evaluate students' performance in mastering knowledge in recent years, especially during the pandemic of COVID-19. However, it is challenging to conduct proctoring for online exams due to the lack of face-to-face interaction. Also, prior research has shown that online exams are more vulnerable to various cheating behaviors, which can damage their credibility. This paper presents a novel visual analytics approach to facilitate the proctoring of online exams by analyzing the exam video records and mouse movement data of each student. Specifically, we detect and visualize suspected head and mouse movements of students in three levels of detail, which provides course instructors and teachers with convenient, efficient and reliable proctoring for online exams. Our extensive evaluations, including usage scenarios, a carefully-designed user study and expert interviews, demonstrate the effectiveness and usability of our approach.

cs.HC↗

arXiv2021

A Switched View of Retinex: Deep Self-Regularized Low-Light Image Enhancement

Self-regularized low-light image enhancement does not require any normal-light image in training, thereby freeing from the chains on paired or unpaired low-/normal-images. However, existing methods suffer color deviation and fail to generalize to various lighting conditions. This paper presents a novel self-regularized method based on Retinex, which, inspired by HSV, preserves all colors (Hue, Saturation) and only integrates Retinex theory into brightness (Value). We build a reflectance estimation network by restricting the consistency of reflectances embedded in both the original and a novel random disturbed form of the brightness of the same scene. The generated reflectance, which is assumed to be irrelevant of illumination by Retinex, is treated as enhanced brightness. Our method is efficient as a low-light image is decoupled into two subspaces, color and brightness, for better preservation and enhancement. Extensive experiments demonstrate that our method outperforms multiple state-of-the-art algorithms qualitatively and quantitatively and adapts to more lighting conditions.

cs.CV↗

arXiv2020

Maximizing spin-orbit torque efficiency of Ta(O)/Py via modulating oxygen-induced interface orbital hybridization

Spin-orbit torques due to interfacial Rashba and spin Hall effects have been widely considered as a potentially more efficient approach than the conventional spin-transfer torque to control the magnetization of ferromagnets. We report a comprehensive study of spin-orbit torque efficiency in Ta(O)/Ni81Fe19 bilayers by tuning low-oxidation of \b{eta}-phase tantalum, and find that the spin Hall angle θDL increases from ~ -0.18 of the pure Ta/Py to the maximum value ~ -0.30 of Ta(O)/Py with 7.8% oxidation. Furthermore, we distinguish the efficiency of the spin-orbit torque generated by the bulk spin Hall effect and by interfacial Rashba effect, respectively, via a series of Py/Cu(0-2 nm)/Ta(O) control experiments. The latter has more than twofold enhancement, and even more significant than that of the former at the optimum oxidation level. Our results indicate that 65% enhancement of the efficiency should be related to the modulation of the interfacial Rashba-like spin-orbit torque due to oxygen-induced orbital hybridization cross the interface. Our results suggest that the modulation of interfacial coupling via oxygen-induced orbital hybridization can be an alternative method to boost the change-spin conversion rate.

cond-mat.mtrl-sci↗

arXiv2020

TradAO: A Visual Analytics System for Trading Algorithm Optimization

With the wide applications of algorithmic trading, it has become critical for traders to build a winning trading algorithm to beat the market. However, due to the lack of efficient tools, traders mainly rely on their memory to manually compare the algorithm instances of a trading algorithm and further select the best trading algorithm instance for the real trading deployment. We work closely with industry practitioners to discover and consolidate user requirements and develop an interactive visual analytics system for trading algorithm optimization. Structured expert interviews are conducted to evaluateTradAOand a representative case study is documented for illustrating the system effectiveness. To the best of our knowledge, previous financial data visual analyses have mainly aimed to assist investment managers in investment portfolio analysis but have neglected the need of traders in developing trading algorithms for portfolio execution.TradAOis the first visual analytics system that assists users in comprehensively exploring the performances of a trading algorithm with different parameter settings.

cs.HC↗

arXiv2020

Peer-inspired Student Performance Prediction in Interactive Online Question Pools with Graph Neural Network

Student performance prediction is critical to online education. It can benefit many downstream tasks on online learning platforms, such as estimating dropout rates, facilitating strategic intervention, and enabling adaptive online learning. Interactive online question pools provide students with interesting interactive questions to practice their knowledge in online education. However, little research has been done on student performance prediction in interactive online question pools. Existing work on student performance prediction targets at online learning platforms with predefined course curriculum and accurate knowledge labels like MOOC platforms, but they are not able to fully model knowledge evolution of students in interactive online question pools. In this paper, we propose a novel approach using Graph Neural Networks (GNNs) to achieve better student performance prediction in interactive online question pools. Specifically, we model the relationship between students and questions using student interactions to construct the student-interaction-question network and further present a new GNN model, called R^2GCN, which intrinsically works for the heterogeneous networks, to achieve generalizable student performance prediction in interactive online question pools. We evaluate the effectiveness of our approach on a real-world dataset consisting of 104,113 mouse trajectories generated in the problem-solving process of over 4000 students on 1631 questions. The experiment results show that our approach can achieve a much higher accuracy of student performance prediction than both traditional machine learning approaches and GNN models.

cs.LG↗

arXiv2020

Predicting Student Performance in Interactive Online Question Pools Using Mouse Interaction Features

Modeling student learning and further predicting the performance is a well-established task in online learning and is crucial to personalized education by recommending different learning resources to different students based on their needs. Interactive online question pools (e.g., educational game platforms), an important component of online education, have become increasingly popular in recent years. However, most existing work on student performance prediction targets at online learning platforms with a well-structured curriculum, predefined question order and accurate knowledge tags provided by domain experts. It remains unclear how to conduct student performance prediction in interactive online question pools without such well-organized question orders or knowledge tags by experts. In this paper, we propose a novel approach to boost student performance prediction in interactive online question pools by further considering student interaction features and the similarity between questions. Specifically, we introduce new features (e.g., think time, first attempt, and first drag-and-drop) based on student mouse movement trajectories to delineate students' problem-solving details. In addition, heterogeneous information network is applied to integrating students' historical problem-solving information on similar questions, enhancing student performance predictions on a new question. We evaluate the proposed approach on the dataset from a real-world interactive question pool using four typical machine learning models.

cs.HC↗

arXiv2019

Lightfield Coordinates Adapted to Asgeirsson's Theorem

John's differential equation and its canonical form, the ultrahyperbolic equation, plays important role in lightfield imaging. The equation describes a local constraint on the lightfield, that was first observed as a "dimensionality gap" in the frequency representation. Related to the ultrahyperbolic equation, Asgeirsson's theorems describe global properties. These indicate new, global, constraints on the lightfield. In order to help validate those theorems on real captured images, we introduce a coordinate system for the lightfield, which suits better the Asgeirsson theorems, and analyze behaviour in terms of the new coordinates.

eess.IV↗

arXiv2019

John Transform and Ultrahyperbolic Equation for Lightfields

This paper explores possibilities for new uses of the Radon transform for imaging and analysis of lightfields. We show that the previously reported Dimansionality Gap can be derived from an ultrahyperbolic PDE, first proposed by F. John, which is satisfied by lightfields. Based on inverse John transform we demonstrate rigorous Focal Stack rendering and viewing from arbitrary angles. Based on Asgeirsson's theorems for the ultrahyperbolic PDE we derive new kernels for processing lightfields. Our kernels provide alternative methods for depth computation and other image processing in lightfields.

eess.IV↗

arXiv2018

VommaNet: an End-to-End Network for Disparity Estimation from Reflective and Texture-less Light Field Images

The precise combination of image sensor and micro-lens array enables lenslet light field cameras to record both angular and spatial information of incoming light, therefore, one can calculate disparity and depth from light field images. In turn, 3D models of the recorded objects can be recovered, which is a great advantage over other imaging system. However, reflective and texture-less areas in light field images have complicated conditions, making it hard to correctly calculate disparity with existing algorithms. To tackle this problem, we introduce a novel end-to-end network VommaNet to retrieve multi-scale features from reflective and texture-less regions for accurate disparity estimation. Meanwhile, our network has achieved similar or better performance in other regions for both synthetic light field images and real-world data compared to the state-of-the-art algorithms. Currently, we achieve the best score for mean squared error (MSE) on HCI 4D Light Field Benchmark.

cs.CV↗