| User Documentation |
| Centre for Vision, Speech & Signal Processing |
| DEVELOP | IN NAMESPACE | AMMA TREE ROOT | AMMA SEARCH | AMMA HOME |
PUBLIC
AffTransfC::AffTransfC(void)
AffTransfC::AffTransfC(const AffTransfC &)
AffTransfC::AffTransfC(const MatrixC,const VectorC)
AffTransfC::AffTransfC(const StringC)
AffTransfC::AffTransfC(const GeomFeatSetC &,const GeomFeatSetC &)
AffTransfC::AffTransfC(const SArray1dC
AffTransfC::AffTransfC(const GeomFeatSetC &,const GeomFeatSetC &,const RealSArray1dC &,const bool)
AffTransfC::AffTransfC(const StringC,const RealSArray1dC &,const bool)
AffTransfC::Transformation(void) const
AffTransfC::Dim(void) const
AffTransfC::T(void)
AffTransfC::R(void)
AffTransfC::S(void)
AffTransfC::V(void)
AffTransfC::SingVal(void) const
AffTransfC::operator*(const VectorC &) const
AffTransfC::operator*(const GeomFeatSetC &) const
AffTransfC::Similarity(void)
AffTransfC::Euclidean(void)
AffTransfC::Translation(void)
| AffTransfC | |
| The class AffTransfC represents an affine transformation from one space into another. | |
| include | "amma/aff.hh" |
| User Level: | Default |
| Library: | Caff |
| Example: | aff_transf.cc |
| Section: | Geometry.N-D |
| In Scope: | std |
Comments:
The transformation may be constructed from two corresponding feature sets (e.g. points or line segments) using a least-mean-squared fit. In this case the result transforms the coordinate system of the first feature set into that of the second. (Alternatively you can view it as transforming points from the second set into the first.)
The transformation may be decomposed into rotation, scaling etc.
It needs rewriting, based on VecMatC.
Parent Classes:
If transformation is given by b = Ma + t then M can be decomposed as:
M = U S VT = R V S VT
( = U S UT R )
where:
S is a diagonal (scaling) matrix
R represents the overall rotation
V (or U) represents the orientation of the scaling axes with
respect to the axes of a (or b).
| Programmer:Bill Christmas, Documentation by CxxDoc: Tue Mar 20 10:48:08 2001 |