Cart (Loading....) | Create Account
Close category search window
 

Evolutionary computation applied to mesh optimization of a 3-D facial image

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fujiwara, Y. ; Commun. Res. Lab., Minist. of Posts & Telecommun., Kobe, Japan ; Sawai, H.

We apply evolutionary algorithms to the approximation of a three-dimensional image of a human face using a triangular mesh. The problem is how to locate a limited number of node points such that the mesh approximates the facial surface as closely as possible. Two evolutionary algorithms are implemented and compared. The first does selection and reproduction in the population of node points in a single triangulation. The second is a genetic algorithm in which a set of different triangulations is regarded as a population. We expect that such evolutionary computation can be used in other engineering applications which share the same problem of surface approximation

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:3 ,  Issue: 2 )

Date of Publication:

Jul 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.