loading...
A Relationship between Spline-Based Deformable Models and Weighted Graphs in Non-Rigid Matching
Kauai, Hawaii December 08-December 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2001.9906172001 IEEE Computer Society Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Anand Rangarajan, Univ. of Florida
Haili Chui, R2 Tech.
Deformable models are central to non-rigid motion analysis, shape matching and non-rigid medical image registration. Spline-based deformations are a very popular class of parameterizations of deformable models and have been heavily used in multiple domains. In a somewhat separate sub-field, weighted graphs are a frequently used object parameterization. Graph matching using weighted graph ob-ject parameterizations finds application in a spectrum ranging from rigid pose estimation to deformable object recognition. Here, we demonstrate a hitherto unsuspected relationship between spline-based deformable models and weighted graphs. It turns out that spline parameterizations in the kernel representation can be used to construct equivalent weighted graphs. With this connection established, we envision a cross-fertilization between these two seemingly disparate sub-fields of computer vision.
Citation:
Anand Rangarajan, Haili Chui, Eric Mjolsness, "A Relationship between Spline-Based Deformable Models and Weighted Graphs in Non-Rigid Matching," cvpr, vol. 1, pp.897, 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'01) - Volume 1, 2001
Usage of this product signifies your acceptance of the Terms of Use.