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

Joonhyuk Choi

dblp:30/4642 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 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
3D vision · 100%
Theoretical computer science
1 paper
Mathematical optimization · 50% Computational geometry · 50%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › structure from motion
direct motion and shape recovery
0.012003
Simultaneous shape and motion recovery: geometry, optimal estimation, and coordinate descent algorithms · ICRA 2003
Computer vision › 3D vision
structure from motion
0.012003
Simultaneous shape and motion recovery: geometry, optimal estimation, and coordinate descent algorithms · ICRA 2003
Computational geometry › geometric inference
geometric estimation
0.012003
Simultaneous shape and motion recovery: geometry, optimal estimation, and coordinate descent algorithms · ICRA 2003
Mathematical optimization
least squares
0.012003
Simultaneous shape and motion recovery: geometry, optimal estimation, and coordinate descent algorithms · ICRA 2003

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

total least squares · 0.1differential geometry · 0.1coordinate descent · 0.1
YearPublicationVenuePosition
2003 Simultaneous shape and motion recovery: geometry, optimal estimation, and coordinate descent algorithms
abstract
With few exceptions, most previous approaches to the structure from motion problem have been based on a decoupling between shape and motion recovery, usually via discrete or differential versions of the epipolar constraint. This paper offers a differential geometric framework for the simultaneous shape and motion recovery problem. We first pose the simultaneous shape and motion recovery problem as one of fitting a parameterized differentiable manifold to a finite set of points in a larger ambient manifold endowed with a distance metric; this framework includes epipolar constraint-based approaches as a special case. Based on this framework, we then examine a class of least-squares and total least squares fitting criteria, and the physical implications of these criteria with respect to both noise models and choice of distance metric on the relevant manifolds. We show that these criteria lead to linear objective functions on SO(3) that admit analytic solutions. We also derive a set of cyclic coordinate descent (CCD) optimization algorithms and show that simple analytic formulas can be obtained for each iteration. Simulation results on accuracy and noise sensitivity of these algorithms are also presented.
Joonhyuk Choi, Frank C. Park 0001
ICRA1