Optimized K-Means Algorithm

المؤلفون المشاركون

Belhaouari, Samir Brahim
Ahmed, Shahnawaz
Mansour, Samer

المصدر

Mathematical Problems in Engineering

العدد

المجلد 2014، العدد 2014 (31 ديسمبر/كانون الأول 2014)، ص ص. 1-14، 14ص.

الناشر

Hindawi Publishing Corporation

تاريخ النشر

2014-09-07

دولة النشر

مصر

عدد الصفحات

14

التخصصات الرئيسية

هندسة مدنية

الملخص EN

The localization of the region of interest (ROI), which contains the face, is the first stepin any automatic recognition system, which is a special case of the face detection.

However, facelocalization from input image is a challenging task due to possible variations in location, scale, pose,occlusion, illumination, facial expressions, and clutter background.

In this paper we introduce a newoptimized k-means algorithm that finds the optimal centers for each cluster which corresponds to theglobal minimum of the k-means cluster.

This method was tested to locate the faces in the input imagebased on image segmentation.

It separates the input image into two classes: faces and nonfaces.

Toevaluate the proposed algorithm, MIT-CBCL, BioID, and Caltech datasets are used.

The results showsignificant localization accuracy.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Belhaouari, Samir Brahim& Ahmed, Shahnawaz& Mansour, Samer. 2014. Optimized K-Means Algorithm. Mathematical Problems in Engineering،Vol. 2014, no. 2014, pp.1-14.
https://search.emarefa.net/detail/BIM-1044319

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Belhaouari, Samir Brahim…[et al.]. Optimized K-Means Algorithm. Mathematical Problems in Engineering No. 2014 (2014), pp.1-14.
https://search.emarefa.net/detail/BIM-1044319

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Belhaouari, Samir Brahim& Ahmed, Shahnawaz& Mansour, Samer. Optimized K-Means Algorithm. Mathematical Problems in Engineering. 2014. Vol. 2014, no. 2014, pp.1-14.
https://search.emarefa.net/detail/BIM-1044319

نوع البيانات

مقالات

لغة النص

الإنجليزية

الملاحظات

Includes bibliographical references

رقم السجل

BIM-1044319