EDBT 2026 Demo / reviewers in the wild / expert
Guangfeng Ji
dblp:97/4158
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author
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
1 paper |
Visualization and visual analytics · 87% Rendering · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › volume visualization
time-varying volume rendering |
0.1 | 1 | 2006 | Dynamic View Selection for Time-Varying Volumes · IEEE Trans. Vis. Comput. Graph. 2006 |
Visualization and visual analytics › visualization recommendation
view selection |
0.1 | 1 | 2006 | Dynamic View Selection for Time-Varying Volumes · IEEE Trans. Vis. Comput. Graph. 2006 |
Rendering
volume rendering |
0.0 | 1 | 2006 | Dynamic View Selection for Time-Varying Volumes · IEEE Trans. Vis. Comput. Graph. 2006 |
Methods — techniques the papers use, named apart from their topics
view selection metric · 0.1dynamic programming · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Interactive Exploration of Remote Isosurfaces with Point-Based Non-Photorealistic RenderingabstractWe present a non-photo realistic rendering technique for interactive exploration of isosurfaces generated from remote volumetric data. Instead of relying on the conventional smooth shading technique to render the isosurfaces, a point-based technique is used to represent and render the isosurfaces in a remote client-server environment. The non-photo realistic nature of the proposed rendering method enables the server to transmit only the essential surface features, which substantially reduces the network traffic. The algorithm also utilizes frame coherence and efficiently encodes the isosurface configuration inside each voxel cell to further minimize the network overhead. Finally, our algorithm can adjust the point distributions using different illumination settings to adapt to different network speeds. Guangfeng Ji, Han-Wei Shen, Jinzhu Gao |
PacificVis | 1 |
| 2006 | Dynamic View Selection for Time-Varying VolumesabstractAnimation is an effective way to show how time-varying phenomena evolve over time. A key issue of generating a good animation is to select ideal views through which the user can perceive the maximum amount of information from the time-varying dataset. In this paper, we first propose an improved view selection method for static data. The method measures the quality of a static view by analyzing the opacity, color and curvature distributions of the corresponding volume rendering images from the given view. Our view selection metric prefers an even opacity distribution with a larger projection area, a larger area of salient features' colors with an even distribution among the salient features, and more perceived curvatures. We use this static view selection method and a dynamic programming approach to select time-varying views. The time-varying view selection maximizes the information perceived from the time-varying dataset based on the constraints that the time-varying view should show smooth changes of direction and near-constant speed. We also introduce a method that allows the user to generate a smooth transition between any two views in a given time step, with the perceived information maximized as well. By combining the static and dynamic view selection methods, the users are able to generate a time-varying view that shows the maximum amount of information from a time-varying data set. Guangfeng Ji, Han-Wei Shen |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2003 | Volume Tracking Using Higher Dimensional IsocontouringabstractTracking and visualizing local features from a time-varying volumetric data allows the user to focus on selected regions of interest, both in space and time, which can lead to a better understanding of the underlying dynamics. In this paper, we present an efficient algorithm to track time-varying isosurfaces and interval volumes using isosurfacing in higher dimensions. Instead of extracting the data features such as isosurfaces or interval volumes separately from multiple time steps and computing the spatial correspondence between those features, our algorithm extracts the correspondence directly from the higher dimensional geometry and thus can more efficiently follow the user selected local features in time. In addition, by analyzing the resulting higher dimensional geometry, it becomes easier to detect important topological events and the corresponding critical time steps for the selected features. With our algorithm, the user can interact with the underlying time-varying data more easily. The computation cost for performing time-varying volume tracking is also minimized. Guangfeng Ji, Han-Wei Shen, Rephael Wenger |
IEEE Visualization | 1 |