Efficient Skin Region Segmentation Using Low Complexity Fuzzy Decision Tree Model
Summary (1 min read)
Introduction
- Various colour space-based approaches have been proposed by researchers [7-11].
- Further, applications in to consumer electronics products should work with very good timeaccuracy trade-off for deployment into market and success of the products.
- In Section II, the authors describe the skin-like region segmentation approach proposed in this paper along with the brief description of FDT and specifically, FDT induced for the skin segmentation problem.
- Computational experiments and results have been discussed in Section III.
A. The Proposed Approach
- The authors aim is to build an efficient human object presence algorithm and localize at least one face for categorization of consumer images into portraits and non portraits for Auto Album generation.
- For the induction of rule-based model for skin segmentation the authors have used fuzzy decision trees trained over skin and nonskin samples.
- This makes their training Db is of the dimension 51444 * 4 where first three columns are B,G,R (x1, x2, and x3 features) values and fourth column is of the class labels (decision variable y).
- On this Db the authors have developed fuzzy decision tree using fuzzy ID3 induction algorithm.
III. COMPUTATIONAL EXPERIMENTS
- The authors ten fold cross validation average performance is 94.10 %.
- The average confusion matrix is given below : .
- Above results shows that the algorithm is highly efficient in declaring actual skin as skin, where as confusion of almost 7.5 % is involved for nonskin segments.
- To report the timing performance all the images have been scaled to standard 640 * 480 (i.e., VGA size) resolution.
IV. CONCLUSIONS
- The authors have proposed B,G,R colour-based skin segmentation approach using fuzzy decision tree.
- Very compact FDT model using just seven leaf nodes (i.e., fuzzy rules) makes it very efficient for application into embedded devices.
- Further, each fuzzy rule makes use of at the most two attributes which makes the algorithm application fast enough for the real world applications into products.
Did you find this useful? Give us your feedback
Citations
55 citations
42 citations
34 citations
30 citations
19 citations
References
2,075 citations
1,724 citations
871 citations
437 citations
256 citations
Related Papers (5)
Frequently Asked Questions (11)
Q2. What is the purpose of this paper?
Fuzzy decision trees are powerful, top-down, hierarchical search methodology to extract easily interpretable classification rules [14, 15].
Q3. What is the aim of this paper?
Their aim is to build an efficient human object presencealgorithm and localize at least one face for categorization of consumer images into portraits and non portraits for Auto Album generation.
Q4. What is the way to classify a leaf node?
One can use either min-max-max or productproduct-sum [14] reasoning mechanism over extracted rules to calculate the degree of certainty with which an arbitrary pattern can be classified to one class.
Q5. What is the definition of fuzzy decision trees?
Fuzzy decision trees are composed of a set of internal nodes representing variables used in the solution of a classification problem, a set of branches representing fuzzy sets of corresponding node variables, and a set of leaf nodes representing the degree of certainty with which each class has been approximated.
Q6. What is the definition of fuzzy decision trees?
Fuzzy decision trees are composed of a set of internal nodes representing variables used in the solution of a classification problem, a set of branches representing fuzzy sets of corresponding node variables, and a set of leaf nodes representing the degree of certainty with which each class has been approximated.
Q7. how is the fuzzy decision tree used?
Verycompact FDT model using just seven leaf nodes (i.e., fuzzy rules) makes it very efficient for application into embedded devices.
Q8. How can one classify a leaf node?
Using this FDT, patterns are classified by starting from the root node and then reaching to one or more than one leaf nodes by following the path of degree of membership greater than zero.
Q9. What is the product of the operation to aggregate membership values of the fuzzy evidences?
63.10066.12 63.10075.9 46.958.80 46.993.90 46.902.90 46.958.80 40.1100 ; 97.133050.227 97.133017.164 17.18706.1280 17.18765.2200 49.23495.820 49.23497.1700 45.2200 == SCThe authors have performed various computational experiments on PC and on embedded hardware with specifications given in Section II above.
Q10. What is the Db of the training Db?
This makes their training Db is of the dimension 51444 * 4 where first three columns are B,G,R (x1, x2, and x3 features) values and fourth column is of the class labels (decision variable y).
Q11. What is the Db of the training Db?
This makes their training Db is of the dimension 51444 * 4 where first three columns are B,G,R (x1, x2, and x3 features) values and fourth column is of the class labels (decision variable y).