Searched refs:CvDTreeSplit (Results 1 – 9 of 9) sorted by relevance
| /external/opencv3/apps/traincascade/ |
| D | old_ml.hpp | 577 struct CvDTreeSplit struct
583 CvDTreeSplit* next; argument
606 CvDTreeSplit* split; argument
701 virtual CvDTreeSplit* new_split_ord( int vi, float cmp_val,
703 virtual CvDTreeSplit* new_split_cat( int vi, float quality );
822 virtual CvDTreeSplit* find_best_split( CvDTreeNode* n );
823 virtual CvDTreeSplit* find_split_ord_class( CvDTreeNode* n, int vi,
824 float init_quality = 0, CvDTreeSplit* _split = 0, uchar* ext_buf = 0 );
825 virtual CvDTreeSplit* find_split_cat_class( CvDTreeNode* n, int vi,
826 float init_quality = 0, CvDTreeSplit* _split = 0, uchar* ext_buf = 0 );
[all …]
|
| D | old_ml_tree.cpp | 348 max_split_size = cvAlign(sizeof(CvDTreeSplit) + in set_data()
641 max_split_size = cvAlign(sizeof(CvDTreeSplit) + in set_data()
1074 CvDTreeSplit* CvDTreeTrainData::new_split_ord( int vi, float cmp_val, in new_split_ord()
1077 CvDTreeSplit* split = (CvDTreeSplit*)cvSetNew( split_heap ); in new_split_ord()
1090 CvDTreeSplit* CvDTreeTrainData::new_split_cat( int vi, float quality ) in new_split_cat()
1092 CvDTreeSplit* split = (CvDTreeSplit*)cvSetNew( split_heap ); in new_split_cat()
1109 CvDTreeSplit* split = node->split; in free_node()
1113 CvDTreeSplit* next = split->next; in free_node()
1485 max_split_size = cvAlign(sizeof(CvDTreeSplit) + in read_params()
1683 CvDTreeSplit* best_split = 0; in try_split_node()
[all …]
|
| D | old_ml_boost.cpp | 250 CvDTreeSplit*
252 CvDTreeSplit* _split, uchar* _ext_buf ) in find_split_ord_class()
341 CvDTreeSplit* split = 0; in find_split_ord_class()
361 CvDTreeSplit*
362 CvBoostTree::find_split_cat_class( CvDTreeNode* node, int vi, float init_quality, CvDTreeSplit* _sp… in find_split_cat_class()
465 CvDTreeSplit* split = 0; in find_split_cat_class()
482 CvDTreeSplit*
483 CvBoostTree::find_split_ord_reg( CvDTreeNode* node, int vi, float init_quality, CvDTreeSplit* _spli… in find_split_ord_reg()
537 CvDTreeSplit* split = 0; in find_split_ord_reg()
551 CvDTreeSplit*
[all …]
|
| D | old_ml_precomp.hpp | 360 Ptr<CvDTreeSplit> bestSplit;
361 Ptr<CvDTreeSplit> split;
|
| D | boost.cpp | 544 …int maxSplitSize = cvAlign(sizeof(CvDTreeSplit) + (MAX(0,max_c_count - 33)/32)*sizeof(int),sizeof(… in CvCascadeBoostTrainData()
662 int maxSplitSize = cvAlign(sizeof(CvDTreeSplit) + in setData()
698 maxSplitSize = cvAlign(sizeof(CvDTreeSplit) + in setData()
964 CvDTreeSplit* split = node->split; in predict()
973 CvDTreeSplit* split = node->split; in predict()
|
| /external/opencv/ml/include/ |
| D | ml.h | 652 struct CvDTreeSplit struct
657 CvDTreeSplit* next; argument
681 CvDTreeSplit* split; argument
784 virtual CvDTreeSplit* new_split_ord( int vi, float cmp_val,
786 virtual CvDTreeSplit* new_split_cat( int vi, float quality );
868 virtual CvDTreeSplit* find_best_split( CvDTreeNode* n );
869 virtual CvDTreeSplit* find_split_ord_class( CvDTreeNode* n, int vi );
870 virtual CvDTreeSplit* find_split_cat_class( CvDTreeNode* n, int vi );
871 virtual CvDTreeSplit* find_split_ord_reg( CvDTreeNode* n, int vi );
872 virtual CvDTreeSplit* find_split_cat_reg( CvDTreeNode* n, int vi );
[all …]
|
| /external/opencv/ml/src/ |
| D | mltree.cpp | 272 max_split_size = cvAlign(sizeof(CvDTreeSplit) + in CV_IMPLEMENT_QSORT_EX()
504 max_split_size = cvAlign(sizeof(CvDTreeSplit) + in CV_IMPLEMENT_QSORT_EX()
844 CvDTreeSplit* CvDTreeTrainData::new_split_ord( int vi, float cmp_val, in new_split_ord()
847 CvDTreeSplit* split = (CvDTreeSplit*)cvSetNew( split_heap ); in new_split_ord()
859 CvDTreeSplit* CvDTreeTrainData::new_split_cat( int vi, float quality ) in new_split_cat()
861 CvDTreeSplit* split = (CvDTreeSplit*)cvSetNew( split_heap ); in new_split_cat()
877 CvDTreeSplit* split = node->split; in free_node()
881 CvDTreeSplit* next = split->next; in free_node()
1199 max_split_size = cvAlign(sizeof(CvDTreeSplit) + in read_params()
1336 CvDTreeSplit* best_split = 0; in try_split_node()
[all …]
|
| D | mlboost.cpp | 243 CvDTreeSplit*
330 CvDTreeSplit* in CV_IMPLEMENT_QSORT_EX()
333 CvDTreeSplit* split; in CV_IMPLEMENT_QSORT_EX()
439 CvDTreeSplit*
487 CvDTreeSplit*
490 CvDTreeSplit* split; in find_split_cat_reg()
570 CvDTreeSplit*
636 CvDTreeSplit*
647 CvDTreeSplit* split = data->new_split_cat( vi, 0 ); in find_surrogate_split_cat()
|
| D | mlrtrees.cpp | 96 CvDTreeSplit* CvForestTree::find_best_split( CvDTreeNode* node ) in find_best_split()
99 CvDTreeSplit *best_split = 0, *split = 0, *t; in find_best_split()
|