• Title/Summary/Keyword: 홍채 검출

Search Result 65, Processing Time 0.027 seconds

Autometic Eye Image Detection for Iris Recognition (홍채인식을 위한 자동 눈 영역 검출)

  • Hur, Yoon;Sung, Han-Ho;Lee, Yill-Byung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.574-576
    • /
    • 2003
  • 현재 홍채 인식은 주로 수동형 영상 획득 시스템을 통한 홍채 획득이 주를 이루고 있다. 이는 장비가 고가인 점과 정확한 홍채 위치추적의 어려움 등의 문제로 인한 것이다. 본 연구에서는 24bit 칼라 영상에서 피부색 정보와 윤곽선 검출 정보를 이용한 실시간 자동 홍채 인식 시스템을 제안하였다. 제안한 방법에서는 HSI 칼라 좌표계상에서의 얼굴 피부색 인식 외에 조명으로 인한 잡음을 제거 하였고, 배경과 사용자의 보다 정확한 영역 분리를 위하여 영상을 이진화한 후 윤곽선 영역을 다시 한 번 제거 한 후 레이블링을 실행 하였다. 또한, 보다 정확한 눈 영역 추출을 위하여 일정 크기까지의 줌을 한 후 윤곽선 검출을 사용하였다. 이러한 방법들을 통하여, 주위 환경에 영향을 덜 받으면서 보다 정확한 눈 영역을 추출 할 수 있었다.

  • PDF

Autometic Eye Image Detection for using Face Shape Recognition (얼굴 형태 인식을 이용한 자동 홍채 인식 시스템)

  • Hur, Yoon;Lee, Yill-Byung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.829-831
    • /
    • 2004
  • 다양한 개인 생체 정보 중에서 비교적 높은 인식률과 사용자 편의성을 제공하는 것은 홍채 인식이다. 그러나, 현재의 홍채 인식은 수동 영상 획득 시스템으로 비접촉식이라는 사용자 편의성을 제대로 제공을 못하는 것이 현실이다. 이것은 정밀한 홍채 영상 획득을 위하여 고해상도의 영상 획득 장비의 필요와 정확한 홍채 위치 수적의 어려움으로 인한 문제이다. 본 연구에서는 24bit 칼라 영상을 이용한 사랑의 얼굴 형태의 인식과 인식된 얼굴 형태에서의 눈 영역 추적 확대를 통한 실시간 자동 홍채 인식 시스템을 제안하였다. 제안된 시스템에서 얼굴의 피부색을 이용한 얼굴 인식 방법이외에 윤곽선 검출 정보를 이용한 기울기 보정과 눈 영역 검출을 실행하여, 이를 이용하여 눈 영역 추적과 확대를 실행을 한다. 그 다음 과정으로 눈 영역 영상에서 동공 중심을 획득하여 그 중심을 이은 선분으로 기준선을 잡아 홍채를 획득하는 과정으로 이루어지게 된다.

  • PDF

The Robust Iris Extraction for various pose (자세에 강인한 홍채 영역 추출)

  • Kim Soolin;Kim Jaemin;Cho Seongwon;Kim Daehwan
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.359-362
    • /
    • 2005
  • 본 논문에서는 홍채 인식을 할 때 여러 가지 자세 변화에 민감한 홍채 패턴을 일정한 기준에 따라 항상 고정된 형태로 추출하기 위해 눈꺼풀의 윤곽을 검출하여 눈의 모양을 바로잡는 방법을 소개한다. 이와 더불어 효과적인 홍채 영역 검출을 위한 정확한 동공의 경계 측정과 공막 경계 측정을 위한 새로운 방법을 제시한다. Template Matching과 Mean Shape을 이용하여 여러 가지 다양한 눈의 형태와 눈썹의 영향 때문에 판단이 까다로운 눈꺼풀의 경계를 검출하였다. 동공 경계의 자세한 검출은 Hough Transform을 이용하였고 공막의 경계는 최소 자승법을 이용하였다.

  • PDF

Iris Change Analysis that Using Differential Image (차영상을 이용한 홍채 변화 분석)

  • 김남식;김장형
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.932-934
    • /
    • 2003
  • In this paper, time, studied about method that can analyze iris change to using differential image of iris image that put interval and films and utilize as patient's health examination according to iris change. Time, Differential mage of iris image that put interval and films ran be used usefully to search early diagnosis of disease and unfolding process etc.. of disease by showing definitely change by tine. In the case of iris diagnostic system, iris outside area extracts iris area and uses Differential image of before filming image and image that film present to use canny edge detector as there is cay to extract iris area as do not help in diagnostic and change analyzed comparison.

  • PDF

A Study on Extraction of Irregular Iris Patterns (비정형 홍채 패턴 분리에 관한 연구)

  • Won, Jung-Woo;Cho, Seong-Won;Kim, Jae-Min;Baik, Kang-Chul
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.169-174
    • /
    • 2008
  • Recently, biometric systems are of interest for the reliable security system. Iris recognition technology is one of the biometric system with the highest reliability. Various iris recognition methods have been proposed for automatic personal identification and verification. These methods require accurate iris segmentation for successful processing because the iris is a small part of an acquired image. The iris boundaries have been parametrically modeled and subsequently detected by circles or parabolic arcs. Since the iris boundaries have a wide range of edge contrast and irregular border shapes, the assumption that they can be fit to circles or parabolic arcs is not always valid. In some cases, the shape of a dilated pupil is slightly different from a constricted one. This is especially true when the pupil has an irregular shape. This is why this research is important. This paper addresses how to accurately detect iris boundaries for improved iris recognition, which is robust to noises.

A Study of an Collarette Extraction in Iris Image (홍채 영상에서 자율신경환 추출에 관한 연구)

  • 강진영;김장형
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.754-757
    • /
    • 2003
  • In Oriental medicine, the shape of collarette that formed with position in iris of patients often used by health diagnotcian to grasp health condition. In this paper, we present method that effectively extract collarette that exist in Iris image. After proposed method detert iris area using circular edge detector, derides boundary candidate point through radial line search and threshold value establishment. And boundary candidate line is treated to use nearest neighbor calculation at each boundary candidate point, finally extracts collarette through linear interpolation. As a result of experimenting about iris images, We Confirmed that can be used as assistant tool of diagnostic system that can presume state of ventriculus of human body.

  • PDF

A Study on Performance Enhancement for Iris Recognition by Eyelash Detection (속눈썹 추출 방법을 이용한 홍채 인식 성능 향상 연구)

  • Kang Byung Joon;Park Kang Ryoung
    • The KIPS Transactions:PartB
    • /
    • v.12B no.3 s.99
    • /
    • pp.233-238
    • /
    • 2005
  • With iris recognition algorithm, unique iris code can be generated and user can be identified by using iris pattern. However, if unnecessary information such as eyelash is included in iris region, the error for iris recognition is increased, consequently. In detail, if iris region is used to generate ins code not excluding eyelash and the position of eyelash is moved, the iris codes are also changed and the error rate is increased. To overcome such problem, we propose the method of detecting eyelash by using mask and excluding the detected eyelash region in case of generating iris code. Experimental results show that EER(Equal Error Rate) for iris recognition using the proposed algorithm is lessened as much as $0.18\%$ compared to that not using it.

A Fast Iris Region Finding Algorithm for Iris Recognition (홍채 인식을 위한 고속 홍채 영역 추출 방법)

  • 송선아;김백섭;송성호
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.9
    • /
    • pp.876-884
    • /
    • 2003
  • It is essential to identify both the pupil and iris boundaries for iris recognition. The circular edge detector proposed by Daugman is the most common and powerful method for the iris region extraction. The method is accurate but requires lots of computational time since it is based on the exhaustive search. Some heuristic methods have been proposed to reduce the computational time, but they are not as accurate as that of Daugman. In this paper, we propose a pupil and iris boundary finding algorithm which is faster than and as accurate as that of Daugman. The proposed algorithm searches the boundaries using the Daugman's circular edge detector, but reduces the search region using the problem domain knowledge. In order to find the pupil boundary, the search region is restricted in the maximum and minimum bounding circles in which the pupil resides. The bounding circles are obtained from the binarized pupil image. Two iris boundary points are obtained from the horizontal line passing through the center of the pupil region obtained above. These initial boundary points, together with the pupil point comprise two bounding circles. The iris boundary is searched in this bounding circles. Experiments show that the proposed algorithm is faster than that of Daugman and more accurate than the conventional heuristic methods.

A Novel Circle Detection Algorithm for Iris Segmentation (홍채 영역 분할을 위한 새로운 원 검출 알고리즘)

  • Yoon, Woong-Bae;Kim, Tae-Yun;Oh, Ji-Eun;Kim, Kwang Gi
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.12
    • /
    • pp.1385-1392
    • /
    • 2013
  • There is a variety of researches about recognition system using biometric data these days. In this study, we propose a new algorithm, uses simultaneous equation that made of the edge of objects, to segment an iris region without threshold values from an anterior eye image. The algorithm attempts to find a center area through calculated outskirts information of an iris, and decides the area where the most points are accumulated. To verify the proposed algorithm, we conducted comparative experiments to Hough transform and Daugman's method, based on 50 images anterior eye images. It was found that proposed algorithm is 5 and 75 times faster than on each algorithm, and showed high accuracy of detecting a center point (95.36%) more than Hough transform (92.43%). In foreseeable future, this study is expected to useful application in diverse department of human's life, such as, identification system using an iris, diagnosis a disease using an anterior image.

A Study on Eyelid and Eyelash Localization for Iris Recognition (홍채 인식에서의 눈꺼풀 및 눈썹 추출 연구)

  • Kang, Byung-Joon;Park, Kang-Ryoung
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.7
    • /
    • pp.898-905
    • /
    • 2005
  • Iris recognition Is that identifies a user based on the unique iris muscle patterns which has the functionalities of dilating or contracting pupil region. Because it is reported that iris recognition is more accurate than other biometries such as face, fingerprint, vein and speaker recognition, iris recognition is widely used in the high security application domain. However, if unnecessary information such as eyelid and eyelash is included in iris region, the error for iris recognition is increased, consequently. In detail, if iris region is used to generate iris code including eyelash and eyelid, the iris codes are also changed and the error rate is increased. To overcome such problem, we propose the method of detecting eyelid by using pyramid searching parabolic deformable template. In addition, we detect the eyelash by using the eyelash mask. Experimental results show that EER(Equal Error Rate) for iris recognition using the proposed algorithm is lessened as much as $0.3\%$ compared to that not using it.

  • PDF