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

Jingchang Zhang

dblp:38/5802 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-6523-5201ORCID · corroborated

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

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

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
Computer animation and physical simulation · 34% Visualization and visual analytics · 34% Virtual and augmented reality · 33%

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

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
mesh animation
0.312017
Automatic Mesh Animation Preview With User Voting-Based Refinement · IEEE Trans. Multim. 2017
Visualization and visual analytics › volume visualization
viewpoint selection
0.312017
Automatic Mesh Animation Preview With User Voting-Based Refinement · IEEE Trans. Multim. 2017
Virtual and augmented reality › virtual environment
networked virtual environment
0.212015
Efficient 3-D Scene Prefetching From Learning User Access Patterns · IEEE Trans. Multim. 2015

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

user voting · 0.3shortest path optimization · 0.3user access pattern mining · 0.2graph-based clustering · 0.2
YearPublicationVenuePosition
2017 Automatic Mesh Animation Preview With User Voting-Based Refinement
abstract
With the rapid growth in the number and quality of mesh animations, browsing mesh animations wastes considerable bandwidth and requires tremendous rendering resources. Accordingly, the preview technique, which provides users a rapid understanding of a mesh animation before downloading, has received increasing attention. In this paper, we propose an automatic mesh animation preview method that incorporates the interframe motion saliency, intraframe surface saliency, user preference, and camera smoothness constraint to formulate the viewpoint selection as a minimization problem. Then, the minimization is solved by finding the shortest path, and the viewpoints for mesh animation preview are generated accordingly. A voting mechanism is introduced into this process to collect user feedbacks and periodically use user voting feedbacks to refine the preview camera path. The experiment results show that our mesh preview method helps users acquire a good understanding of animation contents. A user study demonstrates that our preview results are superior to those generated by typical preview methods in terms of the subjective visual quality.
Zhong Zhou, Jingchang Zhang
IEEE Trans. Multim.4
2015 Efficient 3-D Scene Prefetching From Learning User Access Patterns
abstract
Rendering large-scale 3-D scenes on a thin client is attracting increasing attention with the development of the mobile Internet. Efficient scene prefetching to provide timely data with a limited cache is one of the most critical issues for remote 3-D data scheduling in networked virtual environment applications. Existing prefetching schemes predict the future positions of each individual user based on user traces. In this paper, we investigate scene content sequences accessed by various users instead of user viewpoint traces and propose a user access pattern-based 3-D scene prefetching scheme. We make a relationship graph-based clustering to partition history user access sequences into several clusters and choose representative sequences from among these clusters as user access patterns. Then, these user access patterns are prioritized by their popularity and users' personal preference. Based on these access patterns, the proposed prefetching scheme predicts the scene contents that will most likely be visited in the future and delivers them to the client in advance. The experiment results demonstrate that our user access pattern-based prefetching approach achieves a high hit ratio and outperforms the prevailing prefetching schemes in terms of access latency and cache capacity.
Zhong Zhou, Jingchang Zhang
IEEE Trans. Multim.3