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

Runhao Lin

dblp:425/0458 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0009-5550-0321ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper
Visualization and visual analytics · 100%
Artificial intelligence
1 paper
Segmentation and scene understanding · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
ensemble visualization
1.012026
Probabilistic Inclusion Depth for Fuzzy Contour Ensemble Visualization · IEEE Trans. Vis. Comput. Graph. 2026

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

probabilistic inclusion operator · 2.0mean probabilistic contour · 2.0GPU parallel algorithm · 2.0
YearPublicationVenuePosition
2026 Probabilistic Inclusion Depth for Fuzzy Contour Ensemble Visualization
abstract
We propose Probabilistic Inclusion Depth (PID) for the ensemble visualization of scalar fields. By introducing a probabilistic inclusion operator $\subset_{p}$, our method is a general data depth model supporting ensembles of fuzzy contours, such as soft masks from modern segmentation methods, and conventional ensembles of binary contours. We also advocate for extending contour extraction in scalar field ensembles to become a fuzzy decision by considering the probabilistic distribution of an isovalue to encode the sensitivity information. To reduce the complexity of the data depth computation, an efficient approximation using the mean probabilistic contour is devised. Furthermore, an order-of-magnitude reduction in computational time is achieved with an efficient parallel algorithm on the GPU. Our new method enables the computation of contour boxplots for ensembles of probabilistic masks, ensembles defined on various types of grids, and large 3D ensembles not studied by existing methods. The effectiveness of our method is evaluated through numerical comparisons with existing techniques on synthetic datasets, examples of real-world ensemble datasets, and expert feedback.
Cenyang Wu, Daniel Klötzl, Qinhan Yu, Shudan Guo, Runhao Lin, Daniel Weiskopf, Liang Zhou 0001
IEEE Trans. Vis. Comput. Graph.5