so3.h

// -*- c++ -*-

// Copyright (C) 2005,2009 Tom Drummond (twd20@cam.ac.uk)

//All rights reserved.
//
//Redistribution and use in source and binary forms, with or without
//modification, are permitted provided that the following conditions
//are met:
//1. Redistributions of source code must retain the above copyright
//    notice, this list of conditions and the following disclaimer.
//2. Redistributions in binary form must reproduce the above copyright
//   notice, this list of conditions and the following disclaimer in the
//   documentation and/or other materials provided with the distribution.
//
//THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND OTHER CONTRIBUTORS ``AS IS''
//AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
//IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
//ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR OTHER CONTRIBUTORS BE
//LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
//CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
//SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
//INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
//CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
//ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
//POSSIBILITY OF SUCH DAMAGE.

#ifndef TOON_INCLUDE_SO3_H
#define TOON_INCLUDE_SO3_H

#include <TooN/TooN.h>
#include <TooN/helpers.h>
#include <cassert>

namespace TooN {

template <typename Precision> class SO3;
template <typename Precision> class SE3;
template <typename Precision> class SIM3;

template<class Precision> inline std::istream & operator>>(std::istream &, SO3<Precision> & );
template<class Precision> inline std::istream & operator>>(std::istream &, SE3<Precision> & );
template<class Precision> inline std::istream & operator>>(std::istream &, SIM3<Precision> & );

template <typename Precision = DefaultPrecision>
class SO3 {
public:
    friend std::istream& operator>> <Precision> (std::istream& is, SO3<Precision> & rhs);
    friend std::istream& operator>> <Precision> (std::istream& is, SE3<Precision> & rhs);
    friend std::istream& operator>> <Precision> (std::istream& is, SIM3<Precision> & rhs);
    friend class SE3<Precision>;
    friend class SIM3<Precision>;

    SO3() : my_matrix(Identity) {}
    
    template <int S, typename P, typename A>
    SO3(const Vector<S, P, A> & v) { *this = exp(v); }
    
    template <int R, int C, typename P, typename A>
    SO3(const Matrix<R,C,P,A>& rhs) { *this = rhs; }
    
    template <int S1, int S2, typename P1, typename P2, typename A1, typename A2>
    SO3(const Vector<S1, P1, A1> & a, const Vector<S2, P2, A2> & b ){
        SizeMismatch<3,S1>::test(3, a.size());
        SizeMismatch<3,S2>::test(3, b.size());
        Vector<3, Precision> n = a ^ b;
        if(norm_sq(n) == 0) {
            //check that the vectors are in the same direction if cross product is 0. If not,
            //this means that the rotation is 180 degrees, which leads to an ambiguity in the rotation axis.
            assert(a*b>=0);
            my_matrix = Identity;
            return;
        }
        n = unit(n);
        Matrix<3> R1;
        R1.T()[0] = unit(a);
        R1.T()[1] = n;
        R1.T()[2] = R1.T()[0] ^ n;
        my_matrix.T()[0] = unit(b);
        my_matrix.T()[1] = n;
        my_matrix.T()[2] = my_matrix.T()[0] ^ n;
        my_matrix = my_matrix * R1.T();
    }
    
    template <int R, int C, typename P, typename A>
    SO3& operator=(const Matrix<R,C,P,A> & rhs) {
        my_matrix = rhs;
        coerce();
        return *this;
    }
    
    void coerce() {
        my_matrix[0] = unit(my_matrix[0]);
        my_matrix[1] -= my_matrix[0] * (my_matrix[0]*my_matrix[1]);
        my_matrix[1] = unit(my_matrix[1]);
        my_matrix[2] -= my_matrix[0] * (my_matrix[0]*my_matrix[2]);
        my_matrix[2] -= my_matrix[1] * (my_matrix[1]*my_matrix[2]);
        my_matrix[2] = unit(my_matrix[2]);
        // check for positive determinant <=> right handed coordinate system of row vectors
        assert( (my_matrix[0] ^ my_matrix[1]) * my_matrix[2] > 0 ); 
    }
    
    template<int S, typename VP, typename A> inline static SO3 exp(const Vector<S,VP,A>& vect);
    
    inline Vector<3, Precision> ln() const;
    
    SO3 inverse() const { return SO3(*this, Invert()); }

    template <typename P>
    SO3& operator *=(const SO3<P>& rhs) {
        *this = *this * rhs;
        return *this;
    }

    template<typename P>
    SO3<typename Internal::MultiplyType<Precision, P>::type> operator *(const SO3<P>& rhs) const { 
        return SO3<typename Internal::MultiplyType<Precision, P>::type>(*this,rhs); 
    }

    const Matrix<3,3, Precision> & get_matrix() const {return my_matrix;}

    inline static Matrix<3,3, Precision> generator(int i){
        Matrix<3,3,Precision> result(Zeros);
        result[(i+1)%3][(i+2)%3] = -1;
        result[(i+2)%3][(i+1)%3] = 1;
        return result;
    }

  template<typename Base>
  inline static Vector<3,Precision> generator_field(int i, const Vector<3, Precision, Base>& pos)
  {
    Vector<3, Precision> result;
    result[i]=0;
    result[(i+1)%3] = - pos[(i+2)%3];
    result[(i+2)%3] = pos[(i+1)%3];
    return result;
  }

    template <int S, typename A>
    inline Vector<3, Precision> adjoint(const Vector<S, Precision, A>& vect) const 
    { 
        SizeMismatch<3, S>::test(3, vect.size());
        return *this * vect; 
    }

    template <typename PA, typename PB>
    inline SO3(const SO3<PA>& a, const SO3<PB>& b) : my_matrix(a.get_matrix()*b.get_matrix()) {}
    
private:
    struct Invert {};
    inline SO3(const SO3& so3, const Invert&) : my_matrix(so3.my_matrix.T()) {}
    
    Matrix<3,3, Precision> my_matrix;
};

template <typename Precision>
inline std::ostream& operator<< (std::ostream& os, const SO3<Precision>& rhs){
    return os << rhs.get_matrix();
}

template <typename Precision>
inline std::istream& operator>>(std::istream& is, SO3<Precision>& rhs){
    is >> rhs.my_matrix;
    rhs.coerce();
    return is;
}

template <typename Precision, int S, typename VP, typename VA, typename MA>
inline void rodrigues_so3_exp(const Vector<S,VP, VA>& w, const Precision A, const Precision B, Matrix<3,3,Precision,MA>& R){
    SizeMismatch<3,S>::test(3, w.size());
    {
        const Precision wx2 = (Precision)w[0]*w[0];
        const Precision wy2 = (Precision)w[1]*w[1];
        const Precision wz2 = (Precision)w[2]*w[2];
    
        R[0][0] = 1.0 - B*(wy2 + wz2);
        R[1][1] = 1.0 - B*(wx2 + wz2);
        R[2][2] = 1.0 - B*(wx2 + wy2);
    }
    {
        const Precision a = A*w[2];
        const Precision b = B*(w[0]*w[1]);
        R[0][1] = b - a;
        R[1][0] = b + a;
    }
    {
        const Precision a = A*w[1];
        const Precision b = B*(w[0]*w[2]);
        R[0][2] = b + a;
        R[2][0] = b - a;
    }
    {
        const Precision a = A*w[0];
        const Precision b = B*(w[1]*w[2]);
        R[1][2] = b - a;
        R[2][1] = b + a;
    }
}

template <typename Precision>
template<int S, typename VP, typename VA>
inline SO3<Precision> SO3<Precision>::exp(const Vector<S,VP,VA>& w){
    using std::sqrt;
    using std::sin;
    using std::cos;
    SizeMismatch<3,S>::test(3, w.size());
    
    static const Precision one_6th = 1.0/6.0;
    static const Precision one_20th = 1.0/20.0;
    
    SO3<Precision> result;
    
    const Precision theta_sq = w*w;
    const Precision theta = sqrt(theta_sq);
    Precision A, B;
    //Use a Taylor series expansion near zero. This is required for
    //accuracy, since sin t / t and (1-cos t)/t^2 are both 0/0.
    if (theta_sq < 1e-8) {
        A = 1.0 - one_6th * theta_sq;
        B = 0.5;
    } else {
        if (theta_sq < 1e-6) {
            B = 0.5 - 0.25 * one_6th * theta_sq;
            A = 1.0 - theta_sq * one_6th*(1.0 - one_20th * theta_sq);
        } else {
            const Precision inv_theta = 1.0/theta;
            A = sin(theta) * inv_theta;
            B = (1 - cos(theta)) * (inv_theta * inv_theta);
        }
    }
    rodrigues_so3_exp(w, A, B, result.my_matrix);
    return result;
}

template <typename Precision>
inline Vector<3, Precision> SO3<Precision>::ln() const{
    using std::sqrt;
    Vector<3, Precision> result;
    
    const Precision cos_angle = (my_matrix[0][0] + my_matrix[1][1] + my_matrix[2][2] - 1.0) * 0.5;
    result[0] = (my_matrix[2][1]-my_matrix[1][2])/2;
    result[1] = (my_matrix[0][2]-my_matrix[2][0])/2;
    result[2] = (my_matrix[1][0]-my_matrix[0][1])/2;
    
    Precision sin_angle_abs = sqrt(result*result);
    if (cos_angle > M_SQRT1_2) {            // [0 - Pi/4[ use asin
        if(sin_angle_abs > 0){
            result *= asin(sin_angle_abs) / sin_angle_abs;
        }
    } else if( cos_angle > -M_SQRT1_2) {    // [Pi/4 - 3Pi/4[ use acos, but antisymmetric part
        const Precision angle = acos(cos_angle);
        result *= angle / sin_angle_abs;        
    } else {  // rest use symmetric part
        // antisymmetric part vanishes, but still large rotation, need information from symmetric part
        const Precision angle = M_PI - asin(sin_angle_abs);
        const Precision d0 = my_matrix[0][0] - cos_angle,
            d1 = my_matrix[1][1] - cos_angle,
            d2 = my_matrix[2][2] - cos_angle;
        TooN::Vector<3, Precision> r2;
        if(d0*d0 > d1*d1 && d0*d0 > d2*d2){ // first is largest, fill with first column
            r2[0] = d0;
            r2[1] = (my_matrix[1][0]+my_matrix[0][1])/2;
            r2[2] = (my_matrix[0][2]+my_matrix[2][0])/2;
        } else if(d1*d1 > d2*d2) {              // second is largest, fill with second column
            r2[0] = (my_matrix[1][0]+my_matrix[0][1])/2;
            r2[1] = d1;
            r2[2] = (my_matrix[2][1]+my_matrix[1][2])/2;
        } else {                                // third is largest, fill with third column
            r2[0] = (my_matrix[0][2]+my_matrix[2][0])/2;
            r2[1] = (my_matrix[2][1]+my_matrix[1][2])/2;
            r2[2] = d2;
        }
        // flip, if we point in the wrong direction!
        if(r2 * result < 0)
            r2 *= -1;
        r2 = unit(r2);
        result = TooN::operator*(angle,r2);
    } 
    return result;
}

template<int S, typename P, typename PV, typename A> inline
Vector<3, typename Internal::MultiplyType<P, PV>::type> operator*(const SO3<P>& lhs, const Vector<S, PV, A>& rhs){
    return lhs.get_matrix() * rhs;
}

template<int S, typename P, typename PV, typename A> inline
Vector<3, typename Internal::MultiplyType<PV, P>::type> operator*(const Vector<S, PV, A>& lhs, const SO3<P>& rhs){
    return lhs * rhs.get_matrix();
}

template<int R, int C, typename P, typename PM, typename A> inline
Matrix<3, C, typename Internal::MultiplyType<P, PM>::type> operator*(const SO3<P>& lhs, const Matrix<R, C, PM, A>& rhs){
    return lhs.get_matrix() * rhs;
}

template<int R, int C, typename P, typename PM, typename A> inline
Matrix<R, 3, typename Internal::MultiplyType<PM, P>::type> operator*(const Matrix<R, C, PM, A>& lhs, const SO3<P>& rhs){
    return lhs * rhs.get_matrix();
}

#if 0   // will be moved to another header file ?

template <class A> inline
Vector<3> transform(const SO3& pose, const FixedVector<3,A>& x) { return pose*x; }

template <class A1, class A2> inline
Vector<3> transform(const SO3& pose, const FixedVector<3,A1>& x, FixedMatrix<3,3,A2>& J_x)
{
    J_x = pose.get_matrix();
    return pose * x;
}

template <class A1, class A2, class A3> inline
Vector<3> transform(const SO3& pose, const FixedVector<3,A1>& x, FixedMatrix<3,3,A2>& J_x, FixedMatrix<3,3,A3>& J_pose)
{
    J_x = pose.get_matrix();
    const Vector<3> cx = pose * x;
    J_pose[0][0] = J_pose[1][1] = J_pose[2][2] = 0;
    J_pose[1][0] = -(J_pose[0][1] = cx[2]);
    J_pose[0][2] = -(J_pose[2][0] = cx[1]);
    J_pose[2][1] = -(J_pose[1][2] = cx[0]);
    return cx;
}

template <class A1, class A2, class A3> inline
Vector<2> project_transformed_point(const SO3& pose, const FixedVector<3,A1>& in_frame, FixedMatrix<2,3,A2>& J_x, FixedMatrix<2,3,A3>& J_pose)
{
    const double z_inv = 1.0/in_frame[2];
    const double x_z_inv = in_frame[0]*z_inv;
    const double y_z_inv = in_frame[1]*z_inv;
    const double cross = x_z_inv * y_z_inv;
    J_pose[0][0] = -cross;
    J_pose[0][1] = 1 + x_z_inv*x_z_inv;
    J_pose[0][2] = -y_z_inv;
    J_pose[1][0] = -1 - y_z_inv*y_z_inv;
    J_pose[1][1] =  cross;
    J_pose[1][2] =  x_z_inv;

    const TooN::Matrix<3>& R = pose.get_matrix();
    J_x[0][0] = z_inv*(R[0][0] - x_z_inv * R[2][0]);
    J_x[0][1] = z_inv*(R[0][1] - x_z_inv * R[2][1]);
    J_x[0][2] = z_inv*(R[0][2] - x_z_inv * R[2][2]);
    J_x[1][0] = z_inv*(R[1][0] - y_z_inv * R[2][0]);
    J_x[1][1] = z_inv*(R[1][1] - y_z_inv * R[2][1]);
    J_x[1][2] = z_inv*(R[1][2] - y_z_inv * R[2][2]);

    return makeVector(x_z_inv, y_z_inv);
}


template <class A1> inline
Vector<2> transform_and_project(const SO3& pose, const FixedVector<3,A1>& x)
{
    return project(transform(pose,x));
}

template <class A1, class A2, class A3> inline
Vector<2> transform_and_project(const SO3& pose, const FixedVector<3,A1>& x, FixedMatrix<2,3,A2>& J_x, FixedMatrix<2,3,A3>& J_pose)
{
    return project_transformed_point(pose, transform(pose,x), J_x, J_pose);
}

#endif

}

#endif