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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Carlos Leung

dblp:34/3113 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Artificial intelligence
1 paper
Segmentation and scene understanding · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › 3d reconstruction
volumetric reconstruction		 0.112012
Embedded Voxel Colouring with Adaptive Threshold Selection Using Globally Minimal Surfaces · Int. J. Comput. Vis. 2012

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

globally minimal surfaces · 0.3adaptive threshold selection · 0.3
YearPublicationVenuePosition
2012 Embedded Voxel Colouring with Adaptive Threshold Selection Using Globally Minimal Surfaces
Carlos Leung, Ben Appleton, Mitchell Buckley, Changming Sun
 Int. J. Comput. Vis.1
2008 Iterated dynamic programming and quadtree subregioning for fast stereo matching
Carlos Leung, Ben Appleton, Changming Sun
 Image Vis. Comput.1
2004 Fast Stereo Matching by Iterated Dynamic Programming and Quadtree Subregioning
abstract
The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a few seconds of computation. In this paper, we present our iterated dynamic programming algorithm along with a quadtree subregioning process for fast stereo matching. 1
Carlos Leung, Ben Appleton, Changming Sun
 BMVC1