Facial Feature Location with Delaunay Triangulation/Voronoi Diagram Calculation
نویسندگان
چکیده
Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature extraction is still a filed to be explored. In this paper, an automatic extracting algorithm is developed to locate “key points” of facial features. The Delaunay Triangulation/Voronoi Diagram technique well known in computational geometric is applied on the edge enhanced binarized facial image. Facial features are classified and extracted in terms of various types of Delaunay triangles and the dual of a subset of the Delaunay triangles, Voronoi edges form the skeleton of facial skin. That is, facial feature's shape is described by Delaunay Triangulation/Voronoi Diagram. Furthermore, the facial features can be identified. The method succeeds in locating facial features in the facial region exactly and is insensitive to face deformation. The method is executable in a reasonably short time.
منابع مشابه
Exploiting Voronoi diagram properties in face segmentation and feature extraction
Segmentation of human faces from still images is a research field of rapidly increasing interest. Although the field encounters several challenges, this paper seeks to present a novel face segmentation and facial feature extraction algorithm for gray intensity images (each containing a single face object). Face location and extraction must first be performed to obtain the approximate, if not ex...
متن کاملA Distributed Delaunay Triangulation Algorithm Based on Centroid Voronoi Tessellation for Wireless Sensor Networks
A wireless sensor network can be represented by a graph. While the network graph is extremely useful, it often exhibits undesired irregularity. Therefore, special treatment of the graph is required by a variety of network algorithms and protocols. In particular, many geometry-oriented algorithms depend on a type of subgraph called Delaunay triangulation. However, when location information is un...
متن کاملRiemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space
One of most famous theorems in computational geometry is the duality between Voronoi diagram and Delaunay triangulation in Euclidean space. This paper proposes an extension of that theorem to the Voronoi diagram and Delaunay-type triangulation in dually at space. In that space, the Voronoi diagram and the triangulation can be computed e ciently by using potential functions. We also propose high...
متن کاملVoronoi diagrams in Cgal
In this paper we describe a generic C++ adaptor, that adapts a 2-dimensional triangulated Delaunay graph and to the corresponding a Voronoi diagram, represented as a doubly connected edge list (DCEL) data structure. Our adaptor has the ability to automatically eliminate, in a consistent manner, degenerate features of the Voronoi diagram, that are artifacts of the requirement that Delaunay graph...
متن کاملVoronoi Diagram Generation Algorithm based on Delaunay Triangulation
Voronoi diagram and its geometric dual, the Delaunay triangulation, both are practical geometric constructions which have been applied extensively in spatial analysis. Considering the low efficiency of the algorithm of indirectly building Voronoi diagram, this paper proposes an improved Voronoi diagram generation algorithm based on Delaunay triangulation of randomly distributed points in the Eu...
متن کامل