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

Limin Shang

dblp:36/2557 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 4 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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
3 papers
3D vision · 71% Video understanding and tracking · 29%

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

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
object tracking
0.122007
Model-Based Tracking by Classification in a Tiny Discrete Pose Space · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Efficient Tracking with the Bounded Hough Transform · CVPR (1) 2004
Computer vision › 3D vision
3d shape representation
0.112010
Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding · Int. J. Comput. Vis. 2010
Computer vision › 3D vision › 3d object recognition
range image object recognition
0.112010
Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding · Int. J. Comput. Vis. 2010
Computer vision › 3D vision › 3d scene understanding
range image understanding
0.112010
Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding · Int. J. Comput. Vis. 2010
Computer vision › Video understanding and tracking › object tracking
3d object tracking
0.112007
Model-Based Tracking by Classification in a Tiny Discrete Pose Space · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Computer vision › 3D vision › point cloud registration
iterative closest point
0.112007
Model-Based Tracking by Classification in a Tiny Discrete Pose Space · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Computer vision › 3D vision
shape matching
0.112007
Model-Based Tracking by Classification in a Tiny Discrete Pose Space · IEEE Trans. Pattern Anal. Mach. Intell. 2007

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

range image processing · 0.1discrete pose classification · 0.1bounded hough transform · 0.0
YearPublicationVenuePosition
2025 Event-based Depth from Focus
abstract
Depth from focus (DFF) is a well-established method for measuring depth in vision systems. However, its efficacy and accuracy are limited by the slow speed required to capture high-quality focal stacks. We address this limitation by leveraging emerging hardware technologies: the event camera and liquid lens. In this paper, we introduce an innovative approach called Event-Based Depth from Focus (EDFF). We present a prototype system and propose Event Cancellation Score (ECS) as a novel metric to efficiently detect event data focus. To validate the effectiveness of our system, we have curated the first EDFF dataset, which comprises event recordings of focal sweeps performed on 3D-printed test targets. Comparative analysis against existing event focus detection algorithms demonstrates the superior performance of our algorithm in the EDFF task.
Wenjie Xue, Limin Shang
IROS2
2010 Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding
Limin Shang, Michael A. Greenspan
Int. J. Comput. Vis.1
2007 Model-Based Tracking by Classification in a Tiny Discrete Pose Space
abstract
A method is presented for tracking 3D objects as they transform rigidly in space within a sparse range image sequence. The method operates in discrete space and exploits the coherence across image frames that results from the relationship between known bounds on the object's velocity and the sensor frame rate. These motion bounds allow the interframe transformation space to be reduced to a reasonable and indeed tiny size, comprising only tens or hundreds of possible states. The tracking problem is in this way cast into a classification framework, effectively trading off localization precision for runtime efficiency and robustness. The method has been implemented and tested extensively on a variety of freeform objects within a sparse range data stream comprising only a few hundred points per image. It has been shown to compare favorably against continuous domain Iterative Closest Point (ICP) tracking methods, performing both more efficiently and more robustly. A hybrid method has also been implemented that executes a small number of ICP iterations following the initial discrete classification phase. This hybrid method is both more efficient than the ICP alone and more robust than either the discrete classification method or the ICP separately.
Limin Shang, Piotr Jasiobedzki, Michael A. Greenspan
IEEE Trans. Pattern Anal. Mach. Intell.1
2004 Efficient Tracking with the Bounded Hough Transform
Michael A. Greenspan, Limin Shang, Piotr Jasiobedzki
CVPR (1)2