Home » Source Code » Eye tracking using opencv » haarcascade_frontalface_alt.xml

haarcascade_frontalface_alt.xml ( File view )

  • By marque 2014-03-29
  • View(s):51
  • Download(s):6
  • Point(s): 2
			<?xml version="1.0"?>
<!--
    Stump-based 20x20 gentle adaboost frontal face detector.
    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_alt type_id="opencv-haar-classifier">
  <size>20 20</size>
  <stages>
    <_>
      <!-- stage 0 -->
      <trees>
        <_>
          <!-- tree 0 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>3 7 14 4 -1.</_>
                <_>3 9 14 2 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>4.0141958743333817e-003</threshold>
            <left_val>0.0337941907346249</left_val>
            <right_val>0.8378106951713562</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.0151513395830989</threshold>
            <left_val>0.1514132022857666</left_val>
            <right_val>0.7488812208175659</right_val></_></_>
        <_>
          <!-- tree 2 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>1 7 15 9 -1.</_>
                <_>1 10 15 3 3.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>4.2109931819140911e-003</threshold>
            <left_val>0.0900492817163467</left_val>
            <right_val>0.6374819874763489</right_val></_></_></trees>
      <stage_threshold>0.8226894140243530</stage_threshold>
      <parent>-1</parent>
      <next>-1</next></_>
    <_>
      <!-- stage 1 -->
      <trees>
        <_>
          <!-- tree 0 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>5 6 2 6 -1.</_>
                <_>5 9 2 3 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>1.6227109590545297e-003</threshold>
            <left_val>0.0693085864186287</left_val>
            <right_val>0.7110946178436279</right_val></_></_>
        <_>
          <!-- tree 1 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>7 5 6 3 -1.</_>
                <_>9 5 2 3 3.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>2.2906649392098188e-003</threshold>
            <left_val>0.1795803010463715</left_val>
            <right_val>0.6668692231178284</right_val></_></_>
        <_>
          <!-- tree 2 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>4 0 12 9 -1.</_>
                <_>4 3 12 3 3.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>5.0025708042085171e-003</threshold>
            <left_val>0.1693672984838486</left_val>
            <right_val>0.6554006934165955</right_val></_></_>
        <_>
          <!-- tree 3 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>6 9 10 8 -1.</_>
                <_>6 13 10 4 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>7.9659894108772278e-003</threshold>
            <left_val>0.5866332054138184</left_val>
            <right_val>0.0914145186543465</right_val></_></_>
        <_>
          <!-- tree 4 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>3 6 14 8 -1.</_>
                <_>3 10 14 4 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>-3.5227010957896709e-003</threshold>
            <left_val>0.1413166970014572</left_val>
            <right_val>0.6031895875930786</right_val></_></_>
        <_>
          <!-- tree 5 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>14 1 6 10 -1.</_>
                <_>14 1 3 10 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>0.0366676896810532</threshold>
            <left_val>0.3675672113895416</left_val>
            <right_val>0.7920318245887756</right_val></_></_>
        <_>
          <!-- tree 6 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>7 8 5 12 -1.</_>
                <_>7 12 5 4 3.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>9.3361474573612213e-003</threshold>
            <left_val>0.6161385774612427</left_val>
            <right_val>0.2088509947061539</right_val></_></_>
        <_>
          <!-- tree 7 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>1 1 18 3 -1.</_>
                <_>7 1 6 3 3.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>8.6961314082145691e-003</threshold>
            <left_val>0.2836230993270874</left_val>
            <right_val>0.6360273957252502</right_val></_></_>
        <_>
          <!-- tree 8 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>1 8 17 2 -1.</_>
                <_>1 9 17 1 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>1.1488880263641477e-003</threshold>
            <left_val>0.2223580926656723</left_val>
            <right_val>0.5800700783729553</right_val></_></_>
        <_>
          <!-- tree 9 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>16 6 4 2 -1.</_>
                <_>16 7 4 1 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>-2.1484689787030220e-003</threshold>
            <left_val>0.2406464070081711</left_val>
            <right_val>0.5787054896354675</right_val></_></_>
        <_>
          <!-- tree 10 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>5 17 2 2 -1.</_>
                <_>5 18 2 1 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>2.1219060290604830e-003</threshold>
            <left_val>0.5559654831886292</left_val>
            <right_val>0.1362237036228180</right_val></_></_>
        <_>
          <!-- tree 11 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>14 2 6 12 -1.</_>
                <_>14 2 3 12 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>-0.0939491465687752</threshold>
            <left_val>0.8502737283706665</left_val>
            <right_val>0.4717740118503571</right_val></_></_>
        <_>
          <!-- tree 12 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>4 0 4 12 -1.</_>
                <_>4 0 2 6 2.</_>
                <_>6 6 2 6 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>1.3777789426967502e-003</threshold>
            <left_val>0.5993673801422119</left_val>
            <right_val>0.2834529876708984</right_val></_></_>
        <_>
          <!-- tree 13 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>2 11 18 8 -1.</_>
                <_>8 11 6 8 3.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>0.0730631574988365</threshold>
            <left_val>0.4341886043548584</left_val>
            <right_val>0.7060034275054932</right_val></_></_>
        <_>
          <!-- tree 14 -->
          <_>
            <!-- root node -->
            <feature>
              <rects>
                <_>5 7 10 2 -1.</_>
                <_>5 8 10 1 2.</_></rects>
              <tilted>0</tilted></feature>
            <threshold>3.6767389974556863e-004</threshold>
            <le
...
...
(Not finished, please download and read the complete file)
			
...
Expand> <Close

Want complete source code? Download it here

Point(s): 2

Download
0 lines left, continue to read
Sponsored links

File list

Tips: You can preview the content of files by clicking file names^_^
Name Size Date
constants.h685.00 B2014-03-23 00:51
eye_track.sln879.00 B2014-01-12 12:47
eye_track.vcxproj5.52 kB2014-03-22 23:39
eye_track.vcxproj.filters1.49 kB2014-03-22 23:39
main.cpp2.52 kB2014-03-23 01:09
OPENCV_DEBUG.props883.00 B2014-01-14 18:35
OPENCV_RELEASE.props872.00 B2014-01-14 18:36
01.97 kB
haarcascade_frontalface_alt.xml923.86 kB2014-01-12 12:58
haarcascade_frontalface_alt_tree.xml3.48 MB2013-11-13 15:14
lbpcascade_frontalface.xml50.64 kB2013-11-13 15:14
track_eye.cpp6.28 kB2014-03-23 01:22
track_eye.h267.00 B2014-03-22 23:51
...
Sponsored links

haarcascade_frontalface_alt.xml (550.50 kB)

Need 2 point
Your Point(s)

Your Point isn't enough.

Get point immediately by PayPal

More(Debit card / Credit card / PayPal Credit / Online Banking)

Submit your source codes. Get more point

LOGIN

Don't have an account? Register now
Need any help?
Mail to: support@codeforge.com

切换到中文版?

CodeForge Chinese Version
CodeForge English Version

Where are you going?

^_^"Oops ...

Sorry!This guy is mysterious, its blog hasn't been opened, try another, please!
OK

Warm tip!

CodeForge to FavoriteFavorite by Ctrl+D