Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9669951 | Real-Time Imaging | 2005 | 9 Pages |
Abstract
In this paper an efficient procedure for 3D digital curve smoothing is presented. It is described by linear operators which allow to perform the constrained, position invariant, least-squares smoothing of 3D digital curves minimizing the undersampling, digitizing and quantizing error and to calculate various curve characteristics and invariants related to the original digitized curve. They are represented by sparse symmetric circulant Toeplitz matrices with integer coefficients which can be efficiently realized in serial as well as in parallel manner.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Ján Glasa,