HaarClassifierCV.cpp

Go to the documentation of this file.

// ****************************************************************************
// This file is part of the Integrating Vision Toolkit (IVT).
//
// The IVT is maintained by the Karlsruhe Institute of Technology (KIT)
// (www.kit.edu) in cooperation with the company Keyetech (www.keyetech.de).
//
// Copyright (C) 2014 Karlsruhe Institute of Technology (KIT).
// 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.
//
// 3. Neither the name of the KIT nor the names of its contributors may be
//    used to endorse or promote products derived from this software
//    without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE KIT AND 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 KIT OR 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.
// ****************************************************************************
// ****************************************************************************
// Filename:  HaarClassifierCV.cpp
// Author:    Pedram Azad
// Date:      2006
// ****************************************************************************


// ****************************************************************************
// Includes
// ****************************************************************************

#include <new> // for explicitly using correct new/delete operators on VC DSPs

#include "HaarClassifierCV.h"

#include "Structs/Structs.h"
#include "Image/IplImageAdaptor.h"

#include <highgui.h>



// ****************************************************************************
// Constructor / Destructor
// ****************************************************************************

CHaarClassifierCV::CHaarClassifierCV()
{
        m_pStorage = cvCreateMemStorage(0);
        m_pCascade = 0;
}

CHaarClassifierCV::~CHaarClassifierCV()
{
        cvReleaseMemStorage(&m_pStorage);
        
        if (m_pCascade)
                cvReleaseHaarClassifierCascade(&m_pCascade);
}


// ****************************************************************************
// Methods
// ****************************************************************************

bool CHaarClassifierCV::Init(const char *pCascadePath)
{
        if (m_pCascade)
                cvReleaseHaarClassifierCascade(&m_pCascade);
        
        m_pCascade = (CvHaarClassifierCascade *) cvLoad(pCascadePath, 0, 0, 0);
        
        return m_pCascade != 0;
}

int CHaarClassifierCV::Find(CByteImage *pImage, RegionList &regionList)
{
        if (!m_pCascade)
                return -1;
                
        regionList.clear();
                
        cvClearMemStorage(m_pStorage);
        
        IplImage *pIplImage = IplImageAdaptor::Adapt(pImage);
        
        const CvSeq *pFaces = cvHaarDetectObjects(pIplImage, m_pCascade, m_pStorage, 1.3, 3, CV_HAAR_DO_CANNY_PRUNING, cvSize(40, 40));
        const int nFaces = pFaces ? pFaces->total : 0;
                
        for (int i = 0; i < nFaces; i++)
        {
                CvRect* r = (CvRect *) cvGetSeqElem(pFaces, i);
                
                MyRegion region;
                region.min_x = r->x;
                region.min_y = r->y;
                region.max_x = r->x + r->width;
                region.max_y = r->y + r->height;
                        
                regionList.push_back(region);
        }

        cvReleaseImageHeader(&pIplImage);
        
        return nFaces;
}