An Eyelid Detection Algorithm for the Iris Recognition

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Eyelid Detection Algorithm for the Iris Recognition

To reduce the influence of the eyelid for the iris recognition rate, an eyelid detection algorithm for the iris recognition is proposed. The grayscale morphological operations are employed to remove the interference of the eyelash and the light spot to the eyelid region. The points of the minimum grayscale value of each column in the eyelid region are extracted as edge points. The least squares...

متن کامل

An Iterative Algorithm for Fast Iris Detection

Reliable detection of irises is a necessary precondition for any iris-based biometric identification system. It is also important in measuring the movement of eyes in applications such as alertness detection and eye-guided user interfaces. This paper introduces a novel iterative algorithm for the accurate and fast localization of irises in eye images.

متن کامل

Efficient Iris Segmentation Based on Eyelid Detection

This paper proposes a computationally efficient eyelid detection algorithm for detecting eyelid boundaries in iris images acquired under less constrained imaging conditions. The proposed eyelid detection algorithm is developed based on the live-wire technique. The major advantage of the proposed algorithm is its computational simplicity as compared to the prior eyelid detection algorithms. The ...

متن کامل

A New Algorithm for Rotation Detection in Iris Pattern Recognition

A new method for finding the rotation angle in iris images for biometric identification is presented in this paper. The proposed approach is based on Fourier descriptors analysis and algebraic properties of vector rotation in complex space.

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Security and Its Applications

سال: 2015

ISSN: 1738-9976,1738-9976

DOI: 10.14257/ijsia.2015.9.5.11