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

Joseph M. Burdis

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

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

Theory of computation · 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.

Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Computational geometry
curve similarity
0.112012
Object-image correspondence for curves under central and parallel projections · SCG 2012
Computational geometry › differential geometry
differential invariant
0.112012
Object-image correspondence for curves under central and parallel projections · SCG 2012
Computational geometry › projective geometry
projective transformation
0.112012
Object-image correspondence for curves under central and parallel projections · SCG 2012
YearPublicationVenuePosition
2012 Object-image correspondence for curves under central and parallel projections
abstract
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. A straightforward approach to this problem consists of setting up a system of conditions on the projection parameters and then checking whether or not this system has a solution. The computational advantage of the algorithm presented here, in comparison to algorithms based on the straightforward approach, lies in a significant reduction of a number of real parameters that need to be eliminated in order to establish existence or non-existence of a projection that maps a given spatial curve to a given planar curve. Our algorithm is based on projection criteria that reduce the projection problem to a certain modification of the equivalence problem of planar curves under affine and projective transformations. The latter problem is then solved using a separating set of rational differential invariants. A similar approach can be used to solve the projection problem for finite lists of points. The motivation comes from the problem of establishing a correspondence between an object and an image, taken by a camera with unknown position and parameters.
Joseph M. Burdis, Irina A. Kogan
SCG1