<?xml version="1.0"?>
<!----------------------------------------------------------------------------
25x15 Mouth detector computed with 7000 positive samples
//////////////////////////////////////////////////////////////////////////
| Contributors License Agreement
| IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
| By downloading, copying, installing or using the software you agree
| to this license.
| If you do not agree to this license, do not download, install,
| copy or use the software.
|
| Copyright (c) 2006, Modesto Castrillon-Santana (IUSIANI, University of
| Las Palmas de Gran Canaria, Spain).
| All rights reserved.
|
| Redistribution and use in source and binary forms, with or without
| modification, are permitted provided that the following conditions are
| met:
|
| * Redistributions of source code must retain the above copyright
| notice, this list of conditions and the following disclaimer.
| * 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.
| * The name of Contributor may not used to endorse or promote products
| derived from this software without specific prior written permission.
|
| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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
| 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. Back to
| Top
//////////////////////////////////////////////////////////////////////////
RESEARCH USE:
If you are using any of the detectors or involved ideas please cite one of these papers:
@ARTICLE{Castrillon07-jvci,
author = "Castrill\'on Santana, M. and D\'eniz Su\'arez, O. and Hern\'andez Tejera, M. and Guerra Artal, C.",
title = "ENCARA2: Real-time Detection of Multiple Faces at Different Resolutions in Video Streams",
journal = "Journal of Visual Communication and Image Representation",
year = "2007",
vol = "18",
issue = "2",
month = "April",
pages = "130-140"
}
@INPROCEEDINGS{Castrillon07-swb,
author = "Castrill\'on Santana, M. and D\'eniz Su\'arez, O. and Hern\'andez Sosa, D. and Lorenzo Navarro, J. ",
title = "Using Incremental Principal Component Analysis to Learn a Gender Classifier Automatically",
booktitle = "1st Spanish Workshop on Biometrics",
year = "2007",
month = "June",
address = "Girona, Spain",
file = F
}
A comparison of this and other face related classifiers can be found in:
@InProceedings{Castrillon08a-visapp,
'athor = "Modesto Castrill\'on-Santana and O. D\'eniz-Su\'arez, L. Ant\'on-Canal\'{\i}s and J. Lorenzo-Navarro",
title = "Face and Facial Feature Detection Evaluation"
booktitle = "Third International Conference on Computer Vision Theory and Applications, VISAPP08"
year = "2008",
month = "January"
}
More information can be found at http://mozart.dis.ulpgc.es/Gias/modesto_eng.html or in the papers.
COMMERCIAL USE:
If you have any commercial interest in this work please contact
mcastrillon@iusiani.ulpgc.es
------------------------------------------------------------------------>
<opencv_storage>
<Boca_17stages type_id="opencv-haar-classifier">
<size>
25 15</size>
<stages>
<_>
<!-- stage 0 -->
<trees>
<_>
<!-- tree 0 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
0 0 14 9 -1.</_>
<_>
0 3 14 3 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>-0.1192855015397072</threshold>
<left_val>0.7854182124137878</left_val>
<right_val>-0.4541360139846802</right_val></_></_>
<_>
<!-- tree 1 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
17 1 8 14 -1.</_>
<_>
17 8 8 7 2.</_></rects>
<tilted>0</tilted></feature>
<threshold>-0.0641647726297379</threshold>
<left_val>-0.7407680749893189</left_val>
<right_val>0.2652035951614380</right_val></_></_>
<_>
<!-- tree 2 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
7 3 11 6 -1.</_>
<_>
7 5 11 2 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>0.0910761803388596</threshold>
<left_val>-0.2063370943069458</left_val>
<right_val>0.8400946259498596</right_val></_></_>
<_>
<!-- tree 3 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
5 2 15 6 -1.</_>
<_>
5 4 15 2 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>-0.1129330024123192</threshold>
<left_val>0.8284121751785278</left_val>
<right_val>-0.1866362988948822</right_val></_></_>
<_>
<!-- tree 4 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
6 4 11 6 -1.</_>
<_>
6 6 11 2 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>-0.0741933435201645</threshold>
<left_val>0.8354660272598267</left_val>
<right_val>-0.1527701020240784</right_val></_></_>
<_>
<!-- tree 5 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
17 1 6 3 -1.</_>
<_>
19 1 2 3 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>2.1404659491963685e-005</threshold>
<left_val>-0.0716945603489876</left_val>
<right_val>0.1858334988355637</right_val></_></_>
<_>
<!-- tree 6 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
5 0 15 6 -1.</_>
<_>
5 2 15 2 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>-0.0996975302696228</threshold>
<left_val>0.6870458126068115</left_val>
<right_val>-0.1721730977296829</right_val></_></_>
<_>
<!-- tree 7 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>
7 3 13 6 -1.</_>
<_>
7 5 13 2 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>-0.0900413617491722</threshold>
<left_val>0.7310237884521484</left_val>
<right_val>-0.1368771940469742</right_val></_></_>
<_>
<!-- tree 8 -->
<_>
<!-- root no