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

Paul Rademacher

dblp:06/169 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0003-3933-9936ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Computer graphics and multimedia
2 papers
Computer animation and physical simulation · 60% Rendering · 40%
Artificial intelligence
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Rendering
image-based rendering
0.011998
Multiple-center-of-projection Images · SIGGRAPH 1998
Computer animation and physical simulation › 2d animation
cel animation
0.011999
View-dependent Geometry · SIGGRAPH 1999
Computer vision › 3D vision › range sensing › depth sensing
range image
0.011998
Multiple-center-of-projection Images · SIGGRAPH 1998

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

key deformation interpolation · 0.0
YearPublicationVenuePosition
2020 Efficient Bayesian Sequential Classification Under the Markov Assumption for Various Loss Functions
abstract
Optimal sequential classification theory generalizes naturally from that of single-hypothesis classification. However, longer sequences require characterization with higher-order probability distributions; consequently, the design of optimal classifiers can become computationally prohibitive for real-time applications. A Markov assumption for the class random process provides structure to the distribution, enabling efficient evaluation with a limited number of arithmetic operations; the Viterbi algorithm exploits this property to provide a computationally inexpensive maximum a posteriori classifier when the Markov process is first-order. This letter extends this classical result for general order Markov processes and assesses the additional computational cost in terms of multiplication operations. Additionally, a second efficient algorithm is provided which determines the optimal hypothesis if a sample-level loss function is used. In contrast to the Viterbi classifier which implicitly penalizes all erroneous sequences equally, this classifier judges misclassifications more gradually, providing higher flexibility for challenging classification tasks.
Paul Rademacher, Kevin Wagner
IEEE Signal Process. Lett.1
1999 View-dependent Geometry
abstract
When constructing 3D geometry for use in cel animation, the reference drawings of the object or character often contain various view-specific distortions, which cannot be captured with conventional 3D models.In this work we present a technique called View-Dependent Geometry, wherein a 3D model changes shape based on the direction it is viewed from.A view-dependent model consists of a base model, a set of key deformations (deformed versions of the base model), and a set of corresponding key viewpoints (which relate each 2D reference drawing to the 3D base model).Given an arbitrary viewpoint, our method interpolates the key deformations to generate a 3D model that is specific to the new viewpoint, thereby capturing the viewdependent distortions of the reference drawings.
Paul Rademacher
SIGGRAPH1
1998 Augmented Reality Visualization for Laparoscopic Surgery
Henry Fuchs, Mark A. Livingston, Ramesh Raskar, D'nardo Colucci, Kurtis Keller, Andrei State, Jessica R. Crawford, Paul Rademacher, Samuel H. Drake, Anthony A. Meyer
MICCAI8
1998 Multiple-center-of-projection Images
abstract
In image-based rendering, images acquired from a scene are used to represent the scene itself.A number of reference images are required to fully represent even the simplest scene.This leads to a number of problems during image acquisition and subsequent reconstruction.We present the multiple-center-of-projection image, a single image acquired from multiple locations, which solves many of the problems of working with multiple range images.This work develops and discusses multiple-center-ofprojection images, and explains their advantages over conventional range images for image-based rendering.The contributions include greater flexibility during image acquisition and improved image reconstruction due to greater connectivity information.We discuss the acquisition and rendering of multiple-center-of-projection datasets, and the associated sampling issues.We also discuss the unique epipolar and correspondence properties of this class of image.
Paul Rademacher, Gary Bishop
SIGGRAPH1