<?xml version="1.0"?>
<!--
Stump-based 20x20 gentle adaboost frontal face detector.
This detector uses tree of stage classifiers instead of a cascade
Created by Rainer Lienhart.
////////////////////////////////////////////////////////////////////////////////////////
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.
Intel License Agreement
For Open Source Computer Vision Library
Copyright (C) 2000, Intel Corporation, all rights reserved.
Third party copyrights are property of their respective owners.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistribution's of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistribution's 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 Intel Corporation may not be 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 Intel Corporation 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.
-->
<opencv_storage>
<haarcascade_frontalface_tree_alt type_id="opencv-haar-classifier">
<size>20 20</size>
<stages>
<_>
<!-- stage 0 -->
<trees>
<_>
<!-- tree 0 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>2 7 14 4 -1.</_>
<_>2 9 14 2 2.</_></rects>
<tilted>0</tilted></feature>
<threshold>3.7895569112151861e-003</threshold>
<left_val>-0.9294580221176148</left_val>
<right_val>0.6411985158920288</right_val></_></_>
<_>
<!-- tree 1 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>1 2 18 4 -1.</_>
<_>7 2 6 4 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>0.0120981102809310</threshold>
<left_val>-0.7181009054183960</left_val>
<right_val>0.4714100956916809</right_val></_></_>
<_>
<!-- tree 2 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>5 5 9 5 -1.</_>
<_>8 5 3 5 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>1.2138449819758534e-003</threshold>
<left_val>-0.7283161282539368</left_val>
<right_val>0.3033069074153900</right_val></_></_></trees>
<stage_threshold>-1.3442519903182983</stage_threshold>
<parent>-1</parent>
<next>-1</next></_>
<_>
<!-- stage 1 -->
<trees>
<_>
<!-- tree 0 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>3 6 14 9 -1.</_>
<_>3 9 14 3 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>8.7510552257299423e-003</threshold>
<left_val>-0.8594707250595093</left_val>
<right_val>0.3688138127326965</right_val></_></_>
<_>
<!-- tree 1 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>1 1 18 5 -1.</_>
<_>7 1 6 5 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>0.0219867005944252</threshold>
<left_val>-0.6018015146255493</left_val>
<right_val>0.3289783000946045</right_val></_></_>
<_>
<!-- tree 2 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>4 6 12 8 -1.</_>
<_>4 10 12 4 2.</_></rects>
<tilted>0</tilted></feature>
<threshold>6.4913398819044232e-004</threshold>
<left_val>-0.7943195104598999</left_val>
<right_val>0.2549329996109009</right_val></_></_>
<_>
<!-- tree 3 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>9 5 6 10 -1.</_>
<_>12 5 3 5 2.</_>
<_>9 10 3 5 2.</_></rects>
<tilted>0</tilted></feature>
<threshold>-1.0192029876634479e-003</threshold>
<left_val>0.2272932976484299</left_val>
<right_val>-0.6362798213958740</right_val></_></_>
<_>
<!-- tree 4 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>4 0 11 9 -1.</_>
<_>4 3 11 3 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>1.3674780493602157e-003</threshold>
<left_val>-0.6001418232917786</left_val>
<right_val>0.2411836981773377</right_val></_></_>
<_>
<!-- tree 5 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>12 5 4 8 -1.</_>
<_>12 9 4 4 2.</_></rects>
<tilted>0</tilted></feature>
<threshold>1.0245250305160880e-003</threshold>
<left_val>-0.5854247212409973</left_val>
<right_val>0.1255010962486267</right_val></_></_>
<_>
<!-- tree 6 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>4 5 10 10 -1.</_>
<_>4 5 5 5 2.</_>
<_>9 10 5 5 2.</_></rects>
<tilted>0</tilted></feature>
<threshold>0.0184658598154783</threshold>
<left_val>0.1956356018781662</left_val>
<right_val>-0.6763023138046265</right_val></_></_>
<_>
<!-- tree 7 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>7 5 6 7 -1.</_>
<_>9 5 2 7 3.</_></rects>
<tilted>0</tilted></feature>
<threshold>4.0901508182287216e-003</threshold>
<left_val>-0.4491649866104126</left_val>
<right_val>0.2667768895626068</right_val></_></_>
<_>
<!-- tree 8 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>3 8 5 12 -1.</_>
<_>3 14 5 6 2.</_></rects>
<tilted>0</tilted></feature>
<threshold>0.0113580999895930</threshold>
<left_val>0.1878322958946228</left_val>
<right_val>-0.6137936115264893</right_val></_></_></trees>
<stage_threshold>-1.6378560066223145</stage_threshold>
<parent>0</parent>
<next>-1</next></_>
<_>
<!-- stage 2 -->
<trees>
<_>
<!-- tree 0 -->
<_>
<!-- root node -->
<feature>
<rects>
<_>5 3 9 9 -1.</_>
<_>5 6 9 3 3
opencv haar检测训练成功xml
需积分: 33 116 浏览量
2017-11-05
14:49:53
上传
评论
收藏 1.98MB ZIP 举报
瞅瞅小龙
- 粉丝: 6
- 资源: 6
最新资源
- 实现了7种排序算法.三种复杂度排序.三种nlogn复杂度排序(堆排序,归并排序,快速排序)一种线性复杂度的排序.zip
- 冒泡排序 直接选择排序 直接插入排序 随机快速排序 归并排序 堆排序.zip
- 课设-内部排序算法比较 包括冒泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、归并排序和堆排序.zip
- Python排序算法.zip
- C语言实现直接插入排序、希尔排序、选择排序、冒泡排序、堆排序、快速排序、归并排序、计数排序,并带图详解.zip
- 常用工具集参考用于图像等数据处理
- 音乐展示网页、基于Stenography的图像数字水印添加与提取,以及基于颜色矩和Tamura算法的图像相似度评估算法py源码
- 基于EmguCV(OpenCV .net封装),图像数字水印加解密算法的实现,其中包含最低有效位算法,离散傅里叶变换算法+文档书
- 基于matlab+DWT的图像水印项目,数字水印+源代码+文档说明+图片+报告pdf
- (优秀毕业设计)基于python实现的数字图像可视化水印系统的设计与实现,多种数字算法实现+源代码+文档说明+理论演示pdf
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈