Earticle

In this paper, the classification of artificial defects in semiconductor packages is studied by using pattern recognition technology. For this purpose, the pattern recognition algorithm includes the user made MATLAB code. And preprocess is made of the image process and self-organizing map, which is the input of the back-propagation neural network and the dimensionality reduction method, The image process steps are data acquisition, equalization, binary and edge detection. Image process and self-organizing map are compared to the preprocess method. Also the pattern recognition technology is applied to classify two kinds of defects in semiconductor packages: cracks and delaminations.

Demand response is usually operated through using the power rates and incentives. Demand management based on power charges is the most rational and efficient demand management method, and such methods include rolling base charges with peak time, sliding scaling charges depending on time, sliding scaling charges depending on seasons, and nighttime power charges. Search for other methods to stimulate resources on demand by actively deriving the demand reaction of loads to increase the energy efficiency of loads. In this paper, ESS algorithm for saving energy based on predicting the amount of solar power generation that can be used for buildings with small loads not under electrical grid.

The purpose of this study was to investigate the effectiveness of dy-namic time warping (DTW) in gait research. Participants in this study were consist of 10 males and 10 females. Equipment used for collecting the gait data of participants in this study was three-dimensional (3D) motion analysis system consisted of 8 infrared CCD cameras operated with a sampling frequency of 120 frames/sec. DTW program used in this study was made using the MATLAB and the normal operation of the DTW program was verified by comparison of result manually calculated and output by the DTW program. Flexion angle of the knee joint of both feet obtained by 3D motion analysis system was analyzed by the DTW program and symmetry index (SI) equation. Statistical analysis of the values obtained by DTW was performed by one-sample t-test in confi-dence interval (CI) 99%, 95%, 90%, 85%, and 80% each using the SPSS. The subjects’ left and right legs were compared 20 times, and other steps of the same foot were compared 20 times. In this study, DTW showed different results from SI which is generally used to test the sim-ilarity of gait. Compared to that of DTW, the threshold figure for similarity evaluation in SI, 10%, is considered too large/high. When the CI thresh-old figure of 95% was adopted in statistical analysis, DTW demonstrat-ed a lower rate of judging two sequences as similar even in the case of normal gait. This study suggests that DTW can be used for the similarity test of gait research.

패턴매칭 연산은 네트워크 보안, 바이오 인포매틱스와 같은 분야에서 광범위하게 사용되는 중요한 연산이다. 많은 패턴 매칭 알고리즘 들 중에서 Aho-Corasick (AC) 알고리즘이 위와 같은 분야에서 집중적으로 활용되고 있어, AC 알고리즘의 실행을 가속화하고 실시간 실행을 위한 성능 상의 요구사항을 만족시키기 위하여 효율적인 병렬화 기법을 개발하는 것이 필수적이다. 본 논문에서는 AC 알고리즘의 실행에 활용되는 입력 텍스트 데이터와 비교의 대상이 되는 2-차원 배열로 구성된 레퍼런스 데이터를 모두 GPU 상의 on-chip 메모리 (또는 캐시)에 적재하여 병렬 패턴 매칭을 실행하는 기법을 개발한다. 이러한 새로운 접근법의 개발에 있어 데이터를 on-chip의 shared memory에 적재할 때 필요한 메모리 접근들을 효율적으로 스케쥴링 함으로써 데이터 적재에 드는 오버헤드를 크게 감소시킨다. 따라서 새 접근법은 데이터 적재에 드는 메모리 대기시간을 크게 줄이고, 이에 따라 큰 폭의 성능 향상을 얻게 된다. NVidia 9500 GT GPU를 활용한 실험결과, 본 논문의 접근법을 활용한 병렬실행 결과 순차실행 결과(Intel Core2Duo 범용 마이크로프로세서를 활용한)와 비교하여15배까지 성능을 향상시킬 수 있었다.

Pattern matching is a common and important operation in many applications including network security, bioinformatics, etc. Among many pattern matching algorithms, Aho-Corasick (AC) algorithm is intensively used in these applications. In order to speed up and meet the real-time performance requirement for AC algorithm, developing an efficient parallelization technique is essential. In this paper, we develop a new parallelization approach to cache both the input text data and the reference data organized as a 2-dimensional table in the on-chip memories (or caches) on the Graphic Processing Unit (GPU). The new approach also schedules memory accesses carefully to minimize the overhead in loading data to the on-chip shared memory. The approach significantly cuts down the memory latency to load the data and leads to impressive performance improvement. Experimental results on NVidia GT9500 GPU shows up to 15x speedup compared with a serial version on 2.2Ghz Core2Duo Intel processor.

효율적인 빈발 패턴 알고리즘은 연관 규칙 마이닝이나 융복합을 위한 마이닝 과정에서 필수적인 요소이며 많은 활용성을 가지고 있다. 패턴 마이닝을 위한 많은 모델들이 빈발 패턴에 관한 정보를 추출하여 FP-트리를 이용하여 저장하고 있다. 본 논문에서는 항목들의 무게중심을 이용한 새로운 빈발 패턴 알고리즘(CAWFP-Growth)을 제안하여 항목들이 가지는 가중치와 빈도수를 같이 고려하여 항목간의 중심을 계산하여 기존의 FP-Growth 알고리즘의 효율성을 향상시킨다. 제안한 방법은 하향 폐쇄의 성질을 유지하기 위한 기존의 전역적 최대치 가중치 지지도를 필요로 하지 않기 때문에 자연히 빈발 패턴의 탐색시간이 줄어들고 정보의 손실을 줄일 수 있다. 실험결과를 통하여 제안된 알고리즘이 기존의 동적 가중치를 이용하는 다른 방법과 비교해볼 때, 항목들의 무게중심이 빈발패턴의 정확한 정보를 유지하고 FP-트리의 처리 시간을 줄여주기 때문에 제안한 방법의 중요성을 보이고 있다 또한 가상 분산모드에서 맵리듀스 프레임을 기반으로 빅데이터를 모델링하고 향후 완전분산 모드에서 제안한 알고리즘의 모델링이 필요하다.

An efficient frequent pattern algorithm is essential for mining association rules as well as many other mining tasks for convergence with its application spread over a very broad spectrum. Models for mining pattern have been proposed using a FP-tree for storing compressed information about frequent patterns. In this paper, we propose a centroid frequent pattern growth algorithm which we called “CAWFP-Growth” that enhances he FP-Growth algorithm by making the center of weights and frequencies for the itemsets. Because the conventional constraint of maximum weighted support is not necessary to maintain the downward closure property, it is more likely to reduce the search time and the information loss of the frequent patterns. The experimental results show that the proposed algorithm achieves better performance than other algorithms without scarifying the accuracy and increasing the processing time via the centroid of the items. The MapReduce framework model is provided to handle large amounts of data via a pseudo-distributed computing environment. In addition, the modeling of the proposed algorithm is required in the fully distributed mode.

본 논문에서는 최근 컴퓨터게임 분야 뿐 아니라 애니메이션이나 가상현실에서 분야에서도 적용 가능한 게임 인공지능 기술 중 하나인 Flocking 규칙에 기초하여, 그룹형 NPC의 군집 행동에 적용하기 위한 물고기 떼의 행동형태 알고리즘을 제안한다. 또한, 이 알고리즘을 사용하여 물고기 어종이 하나인 경우와 두 종류인 경우, 그리고 장애물이 있는 경우의 Fish 개체 이동을 시뮬레이션하여 그 결과를 제시하였다.

In this paper, we propose a Behavioral pattern Algorithm of fish schools for group NPC behaviors in games, which can be applicable in the field of animation and virtual reality. The algorithm is based on the Flocking rules, one of AI techniques in games. We also present the simulation results separately in the case of one kind of kin, two kinds of kin, and avoiding obstacle problems.

In the navigation for a mobile robot, the collision avoidance with unexpected obstacles is essential for the safe navigation and it is independent of the technique used to control the mobile robot. This paper presents a new collision avoidance algorithm using neural network for the safe navigation of the autonomous mobile robot equipped with CAN and ultrasonic sensors. A tracked wheeled mobile robot has a stability and an efficiency to move on a rough ground. And its mechanism is simple. However it has difficulties to recognize its surroundings. Because the shape of the tracked wheeled mobile robot is a square type, sensor modules are generally located on the each plane surface of 4 sides only. In this paper, the algorithm using neural network is proposed in order to avoid unexpected obstacles. The important character of the proposed algorithm is to be able to detect the distance and the angle of inclination of obstacles. Only using datum of the distance and the angle, informations about the location and shape of obstacles are obtained, and then the driving direction is changed. Consequently, this algorithm is capable of real time processing and available for a mobile robot which has few sensor modules or the limited sensing range such as a tracked wheeled mobile robot. Effectiveness of the proposed algorithm is illustrated through a computer simulation and an experiment using a real robot.

BIS (Bus Information System:버스정보시스템, 이하 BIS)는 시내버스 운행과 관련된 각종 정보를 수집하고 예측알고리즘을 통해 이용객에게 정보를 제공하고 있다. 동일 구간의 최근 정보를 통한 예측방법은 해당 구간의 소통상황을 반영하지만 예측 대상노선의 특성을 반영할 수 없다는 한계가 있다. 해당노선의 동시간대 과거이력자료를 통해 예측하는 방법은 소통상황의 변동성이 큰 첨두시 예측에 한계가 있는 실정이다. 따라서 예측대상 시점의 통행패턴을 인식하고 가장 유사한 과거 시점의 통행패턴을 선택할 수 있는 패턴인식형 버스도착시간 예측 알고리즘을 개발하였다. 본연구의 예측 결과를 서울시 BIS 도착예측정보이력과 비교 검증한 결과 각 정류장 간 통행시간의 평균제곱근오차가 비첨두시 약 35초(기존: 40초), 첨두시 약 40초(기존: 60초)로 기존대비 약 10~20 %의 개선을 보였다. 이는 동일 과거 시간대 외의 시간대에 현재 교통상황을 대표할 수 있는 자료가 존재함을 의미한다.

Bus Information System (BIS) collects information related to the operation of buses and provides information to users through predictive algorithms. Method of predicting through recent information in same section reflects the traffic situation of the section, but cannot reflect the characteristics of the target line. The method of predicting the historical data at the same time zone is limited in forecasting peak time with high volatility of traffic flow. Therefore, we developed a pattern recognition bus arrival time prediction algorithm which could be overcome previous limitation. This method recognize the traffic pattern of target flow and select the most similar past traffic pattern. The results of this study were compared with the BIS arrival forecast information history of Seoul. RMSE of travel time between estimated and observed was approximately 35 seconds (40 seconds in BIS) at the off-peak time and 40 seconds (60 seconds in BIS) at the peak time. This means that there is data that can represent the current traffic situation in other time zones except for the same past time zone.

본 논문에서는 빅 데이터를 이용하여 범죄 발생 패턴을 분석하는 알고리즘을 제안하고 구현했다. 제안된 알고리즘은 대검찰청에서수집하여 공개한 범죄관련 빅 데이터를 사용하며, 표준편차 타원체 및 공간밀도 분석과 같은 공간통계분석을 통해 서울시의2011-2013년 범죄발생 패턴을 분석했다. 범죄 발생 빈도수를 이용하여 범죄발생지역, 시간, 요일, 장소의 위험지수를 구했고, 범죄패턴 분석 알고리즘을 통해 범죄 발생 확률을 구했다. 이를 통해 공간통계분석을 했다. 제안된 알고리즘의 구현 결과, 서울시의 각구별로 범죄발생 패턴이 다르다는 것을 파악할 수 있었고, 다양한 범죄발생 패턴을 분석하고 범죄발생확률을 위험지수를 통해 수치화하여 위험도를 정량적으로 산출할 수 있었다.

In this paper, we proposed and implemented a crime pattern analysis algorithm using big data. The proposed algorithm usescrime-related big data collected and published in the supreme prosecutors’ office. The algorithm analyzed crime patterns inSeoul city from 2011 to 2013 using the spatial statistics analysis like the standard deviational ellipse and spatial densityanalysis. Using crime frequency, We calculated the crime probability and danger factors of crime areas, time, date, andplaces. Through a result we analyzed spatial statistics. As the result of the proposed algorithm, we could grasp differencesin crime patterns of Seoul city, and we calculated degree of risk through analysis of crime pattern and danger factor.

순위다중패턴매칭문제는 길이가 n인 텍스트 T와 패턴들의 집합 가 주어졌을 때, 에 속한 패턴들과 순위동형인 의 모든 부분문자열들을 찾는 문제이다. 개의 연속적인 문자인 -그램, 에서 가장 짧은 패턴의 길이를 , 가장 긴 패턴의 길이를 , 모든 패턴들의 길이의 합을 이라 할 때, -그램과 계승수체계를 이용하여 시간에 순위다중패턴매칭문제를 해결하는 알고리즘이 제시되었다. 본 논문에서는 이진인코딩된 텍스트의 핑거프린트를 이용하여 시간에 순위다중패턴매칭문제를 해결하는 알고리즘을 제시한다. 또한, 시간에 탐색 과정을 수행하는 병렬 구현 방법을 제시한다. 실험 결과, 가 커질수록 제시한 알고리즘의 기존 알고리즘보다 수행시간이 느려지지만 공간사용량은 적어졌다. 제시한 병렬 구현 방법은 기존 알고리즘보다 공간효율적이면서 수행시간은 유사하다.

순위다중패턴매칭문제는 길이가 인 텍스트 와 패턴들의 집합 가 주어졌을 때, 에 속한 패턴들과 순위동형인 의 모든 부분문자열들을 찾는 문제이다. 개의 연속적인 문자인 -그램, 에서 가장 짧은 패턴의 길이를 , 가장 긴 패턴의 길이를 , 모든 패턴들의 길이의 합을 이라 할 때, -그램과 계승수체계를 이용하여 시간에 순위다중패턴매칭문제를 해결하는 알고리즘이 제시되었다. 본 논문에서는 이진인코딩된 텍스트의 핑거프린트를 이용하여 시간에 순위다중패턴매칭문제를 해결하는 알고리즘을 제시한다. 또한, 시간에 탐색 과정을 수행하는 병렬 구현 방법을 제시한다. 실험 결과, 가 커질수록 제시한 알고리즘의 기존 알고리즘보다 수행시간이 느려지지만 공간사용량은 적어졌다. 제시한 병렬 구현 방법은 기존 알고리즘보다 공간효율적이면서 수행시간은 유사하다.

이 연구는 시계열 과거 속도자료를 활용하여 유사한 패턴 변화를 보이는 요일을 그룹핑하는 알고리즘을 개발하였다. 알고리즘에 적용할 이력자료 시간적 범위는 과거 2개월치 자료를 사용하였으며, 공간적 범위는 도시부도로를 대상으로 하였다. 이 연구에서 제안한 알고리즘은 크게 거시적인 관점과 미시적인 관점으로 나누어 요일별 패턴분류를 수행하였다. 먼저 거시적인 관점에서 요일별 첨두/비첨두 시간대와 요일별 속도변화가 크게 나타나는 중점시간대를 도출하였다. 미시적인 관점에서는 거시적인 관점에서 도출된 중점시간대를 대상으로 요일간 속도 차이를 개별(요일별) 혹은 그룹간의 유사성을 비교하여 단계적으로 분류하는 2단계 속도 군집 알고리즘(Two-step speed clustering algorithm, TSC)을 개발하였다. TSC 알고리즘은 중점시간대의 매 가공주기(또는 제공주기)마다 요일별(월~일) 속도차이를 토대로 그룹핑하는 1단계와 1단계에서 도출된 각 그룹의 평균과 요일간의 속도차이를 비교하여 재할당하는 2단계로 구성된다. TSC 알고리즘은 실제 지점검지기에서 수집된 시간대별 시계열 자료를 토대로 개발 및 성능평가가 수행되었다. 따라서, 교통정보센터에서 수집·가공·저장되는 과거이력자료를 이용하여 요일별 패턴분류 수행이 가능하고 알고리즘 구현도 실제 가공체계에 적용하기 용이하다. 이 연구에서 제안한 알고리즘은 통행패턴기반 정보가공 알고리즘 개발, 요일별 반복정체구간 운영관리, TOD에 근거한 신호운영 개선 등 교통운영 및 관리 전반에 적용이 가능하다.

The objective of this paper is to develop a daily pattern clustering algorithm using historical traffic data that can reliably detect under various traffic flow conditions in urban streets. The developed algorithm in this paper is categorized into two major parts, that is to say a macroscopic and a microscopic points of view. First of all, a macroscopic analysis process deduces a daily peak/non-peak hour and emphasis analysis time zones based on the speed time-series. A microscopic analysis process clusters a daily pattern compared with a similarity between individuals or between individual and group. The name of the developed algorithm in microscopic analysis process is called "Two-step speed clustering (TSC) algorithm". TSC algorithm improves the accuracy of a daily pattern clustering based on the time-series speed variation data. The experiments of the algorithm have been conducted with point detector data, installed at a Ansan city, and verified through comparison with a clustering techniques using SPSS. Our efforts in this study are expected to contribute to developing pattern-based information processing, operations management of daily recurrent congestion, improvement of daily signal optimization based on TOD plans.

스마트폰, 태블릿 PC, 울트라북등 휴대기기 사용의 증가로 인해 NAND-형 Flash Memory의 수요도 지속적으로 증가하고 있다. 그렇기 때문에 NAND-형 Flash Memory에서 발생할 수 있는 고장을 진단하기 위한 알고리즘 연 구가 매우 중요하다. Flash Memory는 셀 배열구조에 따라서 NOR-형 Flash Memory와 NAND-형 Flash Memory로 구분이 된다. NOR-형 Flash Memory는 다양한 테스트 알고리즘과 BIRA(Built-in Redundancy Analysis)알고리즘, 진단 알고리즘 등 다양한 알고리즘 연구가 진행되어 왔다. 그러나 NOR-형 Flash Memory에 서 연구되었던 이러한 알고리즘들을 이용하여 NAND-형 Flash Memory를 위한 고장을 확인하는 것이 매우 어렵 다. 따라서 본 논문에서는 NAND-형 Flash Memory에서 발생할 수 있는 고장 확인이 가능한 정확하고 효율적인 진단 알고리즘을 제안한다. 그래서 NAND-형 Flash Memory를 위한 고장 진단을 가능하게 한다.

The increasing usage of mobile devices such as SmartPhone, TabletPC, and Ultrabook, the demand for NAND-type Flash Memory is also constantly growing. Therefore, high speed and miniaturization able, NAND-type Flash Memory’s research for diagnosis of possible malfunction is very important. The Flash Memory is divided into NOR-type Flash Memory, and NAND-type Flash Memory. A lot of study such as Test Algorithm, BISR(Built-In Self Repair) Algorithm and Diagnostic Algorithm, etc. has been progressed in NOR-type Flash Memory. However, it is very difficult to detect for NAND-type Flash Memory’s fault, with the former studies of algorithms for NOR-type Flash Memory. In this paper, an efficient and accurate problem diagnosable algorithm that can identify, the type of possible failure of the cell in NAND-type Flash Memory, is proposed. So it allows error diagnosing for NAND-type Flash Memory.

본 논문은 서베일런스 네트워크에서 이동하는 객체 추적 시 영상 데이터의 전송량을 감소시키는 신경망 계산 시간의 단축 알고리즘을 제안한다. 객체 검출은 디지털화 연속된 영상으로부터 객체 존재 유무를 판단하고, 객체가 존재할 경우 영상 내 객체의 위치, 방향, 크기 등을 알아내는 기술로 정의된다. 그러나 영상 내의 객체는 위치, 크기, 빛의 방향 및 밝기, 장애물 등의 환경적 변화로 인해 객체 모양이 다양해지므로 정확하고 빠른 검출이 어렵다. 따라서 본 논문에서는 신경망을 사용하여 몇 가지 환경적 조건을 극복한 정확하고 빠른 객체 검출 방법을 제안한다. 검색 영역의 축소는 영상 내 색상 영역의 분할과 차영상을 이용하였고, 주성분 분석을 통해 신경망의 입력 벡터를 축소시킴으로써 신경망 수행 시간과 학습 시간을 단축시켰다. 실시간으로 입력되는 동영상에서 모두 실험하였으며, 색상 영역의 분할을 사용할 경우 입력 영상의 칼라 설정의 유무에 따른 검출 성공률의 차를 보였다. 실험 결과에서 보면 제안하는 방법으로써 객체의 움직임을 탐지하였을 때 기존의 방법보다 30% 정도 더 높은 인식 성능을 보여준다.

This paper proposes algorithm to reduce the computing time in a neural network that reduces transmission of data for tracking mobile objects in surveillance networks in terms of detection and communication load. Object Detection can be defined as follows : Given image sequence, which can forom a digitalized image, the goal of object detection is to determine whether or not there is any object in the image, and if present, returns its location, direction, size, and so on. But object in an given image is considerably difficult because location, size, light conditions, obstacle and so on change the overall appearance of objects, thereby making it difficult to detect them rapidly and exactly. Therefore, this paper proposes fast and exact object detection which overcomes some restrictions by using neural network. Proposed system can be object detection irrelevant to obstacle, background and pose rapidly. And neural network calculation time is decreased by reducing input vector size of neural network. Principle Component Analysis can reduce the dimension of data. In the video input in real time from a CCTV was experimented and in case of color segment, the result shows different success rate depending on camera settings. Experimental results show proposed method attains 30% higher recognition performance than the conventional method.

IEEE 802.11e standardized the EDCA mechanism to support the priority based QoS. And the virtual collision handler schedules the transmission time of each MAC frame using the internal back-off window according to the access category(AC). This can provides the differentiated QoS to real-time services at the medium traffic load condition. However, the transmission delay of MAC frame for real-time services may be increased as the traffic load of best effort service increases. It becomes more critical when the real-time service uses a compressed mode video codec such as moving picture experts group(MPEG) 4 codec. That is because each frame has the different importance. That is, the I-frame has more information as compared with the P- and the B-frame. In this paper, we proposed a buffer management algorithm based on the frame importance and the delay bound. The proposed algorithm is consisted of the traffic regulator based on the dual token bucket algorithm and the active queue management algorithm. The traffic regulator reduces the transmission rate of lower AC until that the virtual collision handler can transmit an I-frame. And the active queue management discards frame based on the importance of each frame and the delay bound of head of line(HoL) frame when the channel resource is insufficient.

The escalation of IBS (Intelligent Building System) by convergence technologies is currently in progress with the rapid growth of data communication technology and advanced modern construction system, and on this basis, new high-density urbanization is formed. The severe problem of the formation of high-density cities is leading to the phenomenon of spatial collapse by geographical deformation, global warming and destruction of the ecosystem by climate change. Notwithstanding the fact that high accuracies are shown in the past data in terms of information on precipitation, serious vulnerabilities are shown with respect to flood preparation on the subject of natural disasters by the anomaly climate, which tends to produce an exceedingly low level of accuracy, and consequently, adverse effects by which the loss of nations’ assets and human damage are caused came about. This thesis, to bring about improvement to the drawbacks addressed, suggests a design modeling of water level prediction in relation to regional flood by constructing an OLAP-based multidimensional cube with the use of historic regional precipitation and water level data. The historic precipitation and water level data by region design the prediction model of flood inundation by extracting the pattern of the water level information after topographical relations and intelligent buildings have been increased through the extraction of multidimensional table modeling and construct of the data warehouse for the analysis of the source data via pre-processing of documents.

During the past time information on internet increasing enormously which greed the attacker and invite them for attack. In order to provide protection from illegal access the concept of Intrusion Detection System (IDS) is introduced. Intrusion detection system recognized as a powerful tool for identifying malicious attacks over the network. IDS works on the concept of string matching with the help of Detection engine. Detection engine of IDS uses String matching algorithm for comparing against malicious activities. This comparison takes enough processing time nearly 70% of the whole IDS processing time by improving performance of searching algorithm. In this paper, we proposed an enhanced version of Hash-Boyer-Moore-Horspool string matching algorithm by adding a single digit hash function for reduced the number of character comparisons and improve the efficiency of IDS by reducing the number of false positive match.

The personal name aliases are extremely significant in information retrieval to retrieve complete information about a personal name from the web, as some of the web pages of the person may also be referred by his or her alias name / nick name / real name. There is a rapid growth in people searching where the personal name aliases are concerned. We proposed a pattern generator which includes automatic: lexical pattern extraction algorithm and attribute extraction algorithm. We exploit three data set of known Personal names (consisting of alias name, real name, and nick name), Profession and location names of a person as training semi-structured data set to efficiently extract lexical patterns. The extracted patterns are ranked according to F-Score. It conveys information related to alias names from contingency table returned by web search engine. The extracted lexical patterns (profession pattern and location name pattern) are often used to optimize candidate personal name aliases with attributes of a person availed in the contingency table, the non-frequent items are discarded from the contingency table. Next, we ranking the candidate alias in contingency table, Graph mining ranking algorithm with various similarity measures are used then to measure the strength of association between a name and a candidate alias, co-occurrence statistics are computed.

This study presents a new algorithm for biometric-based iris recognition system. The proposed iris identification algorithm consists of four major fundamental steps: image processing; image localization; IER extraction; and image pattern recognition. An image of an individual’s eye is processed into an 8-bit grayscale BMP image until the boundaries of the iris are detected. The IER (Iris Effective Region) feature is then extracted using the feature extraction algorithm. This IER feature is a 12x8 BMP image pattern which contains the gray values of the iris and will be used for pattern matching. The IER feature extracted is then used as input for the pattern recognition algorithm wherein the linear correlation coefficients are analyzed and will be used as the basis for the identification and verification of an individual.