cvd/haar.h

/*                       
    This file is part of the CVD Library.

    Copyright (C) 2005 The Authors

    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Lesser General Public
    License as published by the Free Software Foundation; either
    version 2.1 of the License, or (at your option) any later version.

    This library is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
    Lesser General Public License for more details.

    You should have received a copy of the GNU Lesser General Public
    License along with this library; if not, write to the Free Software
    Foundation, Inc., 
    51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
*/
#ifndef CVD_HAAR_H
#define CVD_HAAR_H

#include <vector>
#include <cmath>
#include <cvd/image.h>

namespace CVD {

namespace Internal {
    template<class It, class TempIt>
    inline void haar1D(It from, int w, TempIt store){
        for(int i = 0; i < w; ++i){
            store[i] = (from[2*i] + from[2*i+1]) * M_SQRT1_2;
            store[i+w] = (from[2*i] - from[2*i+1]) * M_SQRT1_2;
        }
        std::copy(store, store+2*w, from);
    }

    template<class It, class TempIt>
    inline void inv_haar1D(It from, int w, TempIt store){
        for(int i = 0; i < w; ++i){
            store[2*i] = (from[i] + from[w+i]) * M_SQRT1_2;
            store[2*i+1] = (from[i] - from[w+i]) * M_SQRT1_2;
        }
        std::copy(store, store+2*w, from);
    }
}


template<class It>
inline void haar1D(It from, It to){
    std::vector<typename std::iterator_traits<It>::value_type> store(std::distance(from,to), typename std::iterator_traits<It>::value_type());
    for(int w = std::distance(from,to)/2; w > 0; w /= 2)
        Internal::haar1D(from, w, store.begin());
}

template<class It>
inline void inv_haar1D(It from, It to){
    std::vector<typename std::iterator_traits<It>::value_type> store(std::distance(from,to), typename std::iterator_traits<It>::value_type());
    for(int w = 1; w < std::distance(from,to); w *= 2)
        Internal::inv_haar1D(from, w, store.begin());
}

template<class It>
inline void haar1D(It from, int size){
    haar1D(from, from + size);
}

template<class It>
inline void inv_haar1D(It from, int size){
    inv_haar1D(from, from + size);
}

template<class It>
inline void haar2D(It from, const int width, const int height, int stride = -1){
    if(stride < 0) stride = width;
    typedef typename std::iterator_traits<It>::value_type T;
    std::vector<T> column(height, T());
    std::vector<T> store(std::max(width,height), T());
    int w = width;
    int h = height;
    while(w > 1 || h > 1){
        if(w > 1){
            for(int i = 0; i < h; ++i){
                Internal::haar1D(from + stride * i, w/2, store.begin());
            }
        }
        if(h > 1){
            for(int i = 0; i < w; ++i){
                for(int j = 0; j < h; ++j)
                    column[j] = from[stride * j + i];
                Internal::haar1D(column.begin(), h/2, store.begin());
                for(int j = 0; j < h; ++j)
                    from[stride * j + i] = column[j];
            }
        }
        if(w>1) w/=2;
        if(h>1) h/=2;
    }
}

template<class T>
inline void haar2D( SubImage<T> & I ){
    haar2D(I.data(), I.size().x, I.size().y, I.row_stride());
}

}

#endif // CVD_HAAR_H