Results 1 - 10 of 5,180

Pose estimation for multiple camera systems

by Wen-yan Chang, Chu-song Chen - in: International Conference on Pattern Recognition
"... Pose estimation of a multiple camera system (MCS) is usually achieved by either solving the PnP problem or finding the least-squared-error rigid transformation between two 3D point sets. These methods employ partial information of an MCS, in which only a small number of features in one or two camera ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Pose estimation of a multiple camera system (MCS) is usually achieved by either solving the PnP problem or finding the least-squared-error rigid transformation between two 3D point sets. These methods employ partial information of an MCS, in which only a small number of features in one or two

EigenTracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation

by Michael J. Black, Allan D. Jepson - International Journal of Computer Vision , 1998
"... This paper describes an approach for tracking rigid and articulated objects using a view-based representation. The approach builds on and extends work on eigenspace representations, robust estimation techniques, and parameterized optical flow estimation. First, we note that the least-squares image r ..."
Abstract - Cited by 656 (16 self) - Add to MetaCart
This paper describes an approach for tracking rigid and articulated objects using a view-based representation. The approach builds on and extends work on eigenspace representations, robust estimation techniques, and parameterized optical flow estimation. First, we note that the least-squares image

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

by D. Rueckert, L. I. Sonoda, C. Hayes, D. L. G. Hill, M. O. Leach, D. J. Hawkes - IEEE Transactions on Medical Imaging , 1999
"... Abstract — In this paper we present a new approach for the nonrigid registration of contrast-enhanced breast MRI. A hierarchical transformation model of the motion of the breast has been developed. The global motion of the breast is modeled by an affine transformation while the local breast motion i ..."
Abstract - Cited by 697 (36 self) - Add to MetaCart
Abstract — In this paper we present a new approach for the nonrigid registration of contrast-enhanced breast MRI. A hierarchical transformation model of the motion of the breast has been developed. The global motion of the breast is modeled by an affine transformation while the local breast motion

New tight frames of curvelets and optimal representations of objects with piecewise C² singularities

by Emmanuel J. Candès, David L. Donoho - COMM. ON PURE AND APPL. MATH , 2002
"... This paper introduces new tight frames of curvelets to address the problem of finding optimally sparse representations of objects with discontinuities along C2 edges. Conceptually, the curvelet transform is a multiscale pyramid with many directions and positions at each length scale, and needle-shap ..."
Abstract - Cited by 428 (21 self) - Add to MetaCart
for discontinuities along C 2 curves and is essentially optimal. In comparison, the squared error of n-term wavelet approximations only converges as n −1 as n → ∞, which is considerably worst than the optimal behavior.

Fast Contact Force Computation for Nonpenetrating Rigid Bodies

by David Baraff , 1994
"... A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In contrast to previous approaches, the problem of computing contact forces is not transformed into an optimization problem. B ..."
Abstract - Cited by 278 (7 self) - Add to MetaCart
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In contrast to previous approaches, the problem of computing contact forces is not transformed into an optimization problem

As-rigid-as-possible shape interpolation

by Marc Alexa, Daniel Cohen-or, David Levin , 2000
"... We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense that local volumes are least-distorting as they vary from their source to target configurations. Given a boundary vertex cor ..."
Abstract - Cited by 188 (9 self) - Add to MetaCart
We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense that local volumes are least-distorting as they vary from their source to target configurations. Given a boundary vertex

Image deformation using moving least squares

by Scott Schaefer, Travis Mcphail, Joe Warren - ACM Trans. on Graph , 2006
"... Figure 1: Deformation using Moving Least Squares. Original image with control points shown in blue (a). Moving Least Squares deformations using affine transformations (b), similarity transformations (c) and rigid transformations (d). We provide an image deformation method based on Moving Least Squar ..."
Abstract - Cited by 129 (2 self) - Add to MetaCart
Figure 1: Deformation using Moving Least Squares. Original image with control points shown in blue (a). Moving Least Squares deformations using affine transformations (b), similarity transformations (c) and rigid transformations (d). We provide an image deformation method based on Moving Least

Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit

by David L. Donoho, Yaakov Tsaig, Iddo Drori, Jean-luc Starck , 2006
"... Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NP-hard in general. We show here that for systems with ‘typical’/‘random ’ Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our pr ..."
Abstract - Cited by 274 (22 self) - Add to MetaCart
a least-squares problem using the selected coordinates, and subtracts the leastsquares fit, producing a new residual. After a fixed number of stages (e.g. 10), it stops. In contrast to Orthogonal Matching Pursuit (OMP), many coefficients can enter the model at each stage in StOMP while only one

A New Algorithm for Non-Rigid Point Matching

by Haili Chui, Anand Rangarajan - IN CVPR , 2000
"... We present a new robust point matching algorithm (RPM) that can jointly estimate the correspondence and non-rigid transformations between two point-sets that may be of different sizes. The algorithm utilizes the softassign for the correspondence and the thin-plate spline for the non-rigid mapping. E ..."
Abstract - Cited by 191 (8 self) - Add to MetaCart
We present a new robust point matching algorithm (RPM) that can jointly estimate the correspondence and non-rigid transformations between two point-sets that may be of different sizes. The algorithm utilizes the softassign for the correspondence and the thin-plate spline for the non-rigid mapping

A Pyramid Approach to Sub-Pixel Registration Based on Intensity

by Philippe Thevenaz, Urs Ruttiman, Michal Unser , 1998
"... We present an automatic sub-pixel registration algorithm that minimizes the mean square intensity difference between a reference and a test data set, which can be either images (2-D) or volumes (3-D). It uses an explicit spline representation of the images in conjunction with spline processing, and ..."
Abstract - Cited by 237 (18 self) - Add to MetaCart
, and is based on a coarse-to-fine iterative strategy (pyramid approach). The minimization is performed according to a new variation (ML*) of the Marquardt-Levenberg algorithm for non-linear least-square optimization. The geometric deformation model is a global 3-D affine transformation that can be optionally
Results 1 - 10 of 5,180