High-performance distributed memory and computing algorithm for face recognition via conformal mapping

Dalila B. Megherbi; A. J. Boulenouar; Venkataramanan Rajagopalan

doi:10.1117/12.438263

28 August 2001 High-performance distributed memory and computing algorithm for face recognition via conformal mapping

Dalila B. Megherbi, A. J. Boulenouar, Venkataramanan Rajagopalan

Proceedings Volume 4388, Visual Information Processing X; (2001) https://doi.org/10.1117/12.438263
Event: Aerospace/Defense Sensing, Simulation, and Controls, 2001, Orlando, FL, United States

Abstract

This work deals with a new distributed face recognition technique based on transformation invariant conformal mapping. Face recognition using digital images is constrained by several factors like rotation (in and out of plane), scaling, and is usually operated under strict lighting conditions. In a previous work, through a conformal mapping process, we demonstrated the ability to 1) recognize shapes, and 2) concisely represent shape boundaries using a set of polynomial coefficients derived in the mapping process. In this work we illustrate how these previous results can be applied to face recognition. Additionally, in the approach outlined herein, a syntactic representation is formed for polygonal and non-polygonal shapes representing a given face features whose representation we desire to extract and reproduce compactly. In particular, in this paper we focus on the face outline, left eyebrow, right eyebrow, left eye, right eye, nose, curve form the lower nose to upper lips, and lips as face features. Some of these face features are grouped together and then processed in parallel in a distributed network of workstations via a Message Passing Interface running over TCP/IP. In particular, we show that a master-salve paradigm is used here to implement the proposed parallel and distributed algorithm and is base don a distributed-memory approach. Test were performed with 1,2, and three workstations. The algorithm assumes no constraints in the lighting, and the size of the window that has the face. This work deals with face representation and recognition and face segmentation is not the subject of this paper. We finally show the potential of the proposed generalized technique in its ability to handle both polygonal, non- polygonal and mixed polygonal/non-polygonal object shapes. We also show that the proposed algorithm achieves high recognition rates for rotations in the plane, translation, and scaling and is robust in noisy environments.

Citation Download Citation

Dalila B. Megherbi, A. J. Boulenouar, and Venkataramanan Rajagopalan "High-performance distributed memory and computing algorithm for face recognition via conformal mapping", Proc. SPIE 4388, Visual Information Processing X, (28 August 2001); https://doi.org/10.1117/12.438263

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available