scispace - formally typeset
Book ChapterDOI

Monocular template-based reconstruction of smooth and inextensible surfaces

Reads0
Chats0
TLDR
The idea is to say that the 2D-3D map must be everywhere a local isometry, which induces conditions on the Jacobian matrix of the map which are included in a least-squares minimization problem.
Abstract
We present different approaches to reconstructing an inextensible surface from point correspondences between an input image and a template image representing a flat reference shape from a frontoparallel point of view We first propose a 'point-wise' method, ie a method that only retrieves the 3D positions of the point correspondences This method is formulated as a second-order cone program and it handles inaccuracies in the point measurements It relies on the fact that the Euclidean distance between two 3D points must be shorter than their geodesic distance (which can easily be computed from the template image) We then present an approach that reconstructs a smooth 3D surface based on Free-Form Deformations The surface is represented as a smooth map from the template image space to the 3D space Our idea is to say that the 2D-3D map must be everywhere a local isometry This induces conditions on the Jacobian matrix of the map which are included in a least-squares minimization problem

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A Simple Prior-Free Method for Non-rigid Structure-from-Motion Factorization

TL;DR: This paper proposes a simple “prior-free” method for solving the non-rigid structure-from-motion (NRSfM) factorization problem, which involves solving a very small SDP of fixed size, and a nuclear-norm minimization problem.
Proceedings ArticleDOI

A simple prior-free method for non-rigid structure-from-motion factorization

TL;DR: This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems that outperforms most of the existing linear methods of nonrigid factorization.
Book

Computer Architecture Performance Evaluation Methods

TL;DR: The goal of this book is to present an overview of the current state-of-the-art in computer architecture performance evaluation, with a special emphasis on methods for exploring processor architectures.
Proceedings ArticleDOI

A constrained latent variable model

TL;DR: This paper introduces a constrained latent variable model whose generated output inherently accounts for prior knowledge about the specific problem at hand, and proposes an approach that explicitly imposes equality and inequality constraints on the model's output during learning, thus avoiding the computational burden of having to account for these constraints at inference.
References
More filters
Book

Convex Optimization

TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Journal ArticleDOI

Nonrigid registration using free-form deformations: application to breast MR images

TL;DR: The results clearly indicate that the proposed nonrigid registration algorithm is much better able to recover the motion and deformation of the breast than rigid or affine registration algorithms.
Book

Numerical Methods for Least Squares Problems

Åke Björck
TL;DR: Theorems and statistical properties of least squares solutions are explained and basic numerical methods for solving least squares problems are described.
Book

Curve and Surface Fitting with Splines

TL;DR: Fitpack as discussed by the authors is a software for least-squares spline curve fitting with convexity constraints, where spline functions are univariate spline bivariate splines.
Book ChapterDOI

Active Matching

TL;DR: This paper shows that the dramatically different approach of using priors dynamically to guide a feature by feature matching search can achieve global matching with much fewer image processing operations and lower overall computational cost.
Related Papers (5)