Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Comparison of Facial Alignment Techniques: With Test Results on Gender Classification Task
Date
2014-08-24
Author
Kaya, Tunç Güven
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
196
views
0
downloads
Cite This
In this paper, different facial alignment techniques are revised in terms of their effects on machine learning algorithms. This paper, investigates techniques that are widely accepted in literature and measures their effect on gender classification task. There is no special reason on selecting gender classification task, any other task could have been chosen. In audience measurement systems, many important demographics, i.e. gender, age, facial expression, can be measured by using machine learning algorithms. Moreover; in such a system, these demographics are so substantial since their discriminative features on customers' habits. Due to this importance, any performance enhancement on any machine learning algorithm becomes important. A carefully chosen alignment method can boost performance of machine learning algorithms used within system.
Subject Keywords
Feature point
,
Machine learning algorithm
,
Delaunay triangulation
,
Face detector
,
Alignment algorithm
URI
https://hdl.handle.net/11511/30643
DOI
https://doi.org/10.1007/978-3-319-12811-5_6
Collections
Graduate School of Informatics, Conference / Seminar
Suggestions
OpenMETU
Core
Optimization of physical parameters of an underactuated quadrupedal robot
Karagoz, Osman Kaan; Ankaralı, Mustafa Mert (2018-01-01)
In this paper, we present the comparison of different optimization algorithms that are used to optimize the parameters of a simulated legged robotic platform. We compare the results obtained by applying different algorithms on the same model and show the relative advantages and disadvantages of these algorithms. The tested algorithms are Particle Swarm Optimization, Binary Coded Genetic Algorithm, Broyden-Fletcher-Goldfrab-Shannon Algorithm and Method of Zoutendijk. We showed that the globally optimal param...
Robust multiobjective evolutionary feature subset selection algorithm for binary classification using machine learning techniques
Deniz, Ayca; Kiziloz, Hakan Ezgi; Dokeroglu, Tansel; Coşar, Ahmet (2017-06-07)
This study investigates the success of a multiobjective genetic algorithm (GA) combined with state-of-the-art machine learning (ML) techniques for the feature subset selection (FSS) in binary classification problem (BCP). Recent studies have focused on improving the accuracy of BCP by including all of the features, neglecting to determine the best performing subset of features. However, for some problems, the number of features may reach thousands, which will cause too much computation power to be consumed ...
MODELLING OF KERNEL MACHINES BY INFINITE AND SEMI-INFINITE PROGRAMMING
Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2009-06-03)
In Machine Learning (ML) algorithms, one of the crucial issues is the representation of the data. As the data become heterogeneous and large-scale, single kernel methods become insufficient to classify nonlinear data. The finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, we propose a novel method of "infinite" kernel combinations for learning problems with the help of infinite and semi-infinite programming regarding all elements in kernel space. Looking...
Improving the big bang-big crunch algorithm for optimum design of steel frames
Hasançebi, Oğuzhan (null; 2012-01-01)
This paper presents an improved version of the big bang-big crunch (BB-BC) algorithm namely exponential BB-BC algorithm (EBB-BC) for optimum design of steel frames according to ASD-AISC provisions. It is shown that the standard version of the algorithm sometimes is unable to provide reasonable solutions for problems from discrete design optimization of steel frames. Therefore, by investigating the shortcomings of the BB-BC algorithm, it is aimed to enhance the algorithm for solving complicated steel frame o...
On numerical optimization theory of infinite kernel learning
Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2010-10-01)
In Machine Learning algorithms, one of the crucial issues is the representation of the data. As the given data source become heterogeneous and the data are large-scale, multiple kernel methods help to classify "nonlinear data". Nevertheless, the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, a novel method of "infinite" kernel combinations is proposed with the help of infinite and semi-infinite programming regarding all elements in kernel space. Look...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
T. G. Kaya, “Comparison of Facial Alignment Techniques: With Test Results on Gender Classification Task,” 2014, vol. 8811, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30643.