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

J. R. Muller

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

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

Artificial intelligence and machine learning · 1 · 1 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.

Computer graphics and multimedia
1 paper
Image and video processing · 62% Computational photography and imaging · 38%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image registration
0.011994
Adaptive-complexity registration of images · CVPR 1994
Computational photography and imaging
image stitching
0.011994
Adaptive-complexity registration of images · CVPR 1994
Computational photography and imaging › image stitching
panoramic image stitching
0.011994
Adaptive-complexity registration of images · CVPR 1994

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

coarse-to-fine parameter estimation · 0.0
YearPublicationVenuePosition
1994 Adaptive-complexity registration of images
abstract
We present a framework for image registration algorithms that finds a lowest-order model of the flow between two images. Low-order models are useful in image registration, because they leave scene structure intact. But in real images complexity varies, and cannot be determined ahead of time. Algorithms in our framework adapt model complexity to image data during a coarse-fine parameter estimation process. Complexity increases keep residual flow small enough that motion can be correctly estimated at each subsequent resolution level. We present one algorithm within this framework which increases complexity by replacing global estimates with estimates over successively smaller patches. We show results of applying this algorithm to the task of mosaicing panoramic aerial images with unknown lens distortion and unknown camera position.>
J. R. Muller, P. Anandan 0001, James R. Bergen
CVPR1