Automatic Ear Localization Using Entropy-Based Binary Jaya Algorithm and Weighted Hausdorff Distance

2021 ◽  
Vol 12 (1) ◽  
pp. 50-76
Author(s):  
Partha Pratim Sarangi ◽  
Abhimanyu Sahu ◽  
Madhumita Panda ◽  
Bhabani Shankar Prasad Mishra

This paper presents an automatic human ear localization technique for handling uncontrolled scenarios such as illumination variation, poor contrast, partial occlusion, pose variation, ear ornaments, and background noise. The authors developed entropy-based binary Jaya algorithm (EBJA) and weighted doubly modified Hausdorff distance (W-MHD) to use edge information rather than pixels intensity values of the side face image. First, it embodies skin segmentation procedure using skin color model and successively remove spurious and non-ear edges which reduces the search space of the skin regions. Secondly, EBJA is proposed to trace dense edge regions as probable ear candidates. Thirdly, this paper developed an edge based weight function to represent the ear shape along with for the edge based template matching using W-MHD to identify true ear from a set of probable ear candidates. Experimental results using publicly available benchmark datasets demonstrate the competitiveness of the proposed technique in comparison to the state-of-the-art methods.

2014 ◽  
Vol 23 (02) ◽  
pp. 1450001
Author(s):  
T. Hamrouni ◽  
S. Ben Yahia ◽  
E. Mephu Nguifo

In many real-life datasets, the number of extracted frequent patterns was shown to be huge, hampering the effective exploitation of such amount of knowledge by human experts. To overcome this limitation, exact condensed representations were introduced in order to offer a small-sized set of elements from which the faithful retrieval of all frequent patterns is possible. In this paper, we introduce a new exact condensed representation only based on particular elements from the disjunctive search space. In this space, a pattern is characterized by its disjunctive support, i.e., the frequency of complementary occurrences – instead of the ubiquitous co-occurrence link – of its items. For several benchmark datasets, this representation has been shown interesting in compactness terms compared to the pioneering approaches of the literature. In this respect, we mainly focus here on proposing an efficient tool for mining this representation. For this purpose, we introduce an algorithm, called DSSRM, dedicated to this task. We also propose several techniques to optimize its mining time as well as its memory consumption. The carried out empirical study on benchmark datasets shows that DSSRM is faster by several orders of magnitude than the MEP algorithm.


2014 ◽  
Vol 610 ◽  
pp. 358-361
Author(s):  
Hong Wei Di ◽  
Wei Xu

To solve the problem that traditional threshold segmentation model is not very robust in skin segmentation under different skin colors and different illuminations, an improved adaptive skin color model is proposed. This model detects the change rate of the skin color pixels by modifying the certain threshold while fixing others, then selects the optimum threshold adaptively. The experimental results show that this algorithm can effectively distinguish skin color regions and background regions, and has strong robustness on light disturbance.


2015 ◽  
Vol 743 ◽  
pp. 317-320
Author(s):  
Ravi Subban ◽  
Pasupathi Perumalsamy ◽  
G. Annalakshmi

This paper presents a novel method for skin segmentation in color images using piece-wise linear bound skin detection. Various color schemes are investigated and evaluated to find the effect of color space transformation over the skin detection performance. The comprehensive knowledge about the various color spaces helps in skin color modeling evaluation. The absence of the luminance component increases performance, which also supports in finding the appropriate color space for skin detection. The single color component produces the better performance than combined color component and reduces computational complexity.


2004 ◽  
Vol 10 (2) ◽  
pp. 143-153 ◽  
Author(s):  
Qiu Chen ◽  
Koji Kotani ◽  
Yoshiyuki Taniguchi ◽  
Zhibin Pan ◽  
Tadahiro Ohmi

Sign in / Sign up

Export Citation Format

Share Document