• Journal of Animal Science and Technology
• /
• 제66권1호
• /
• pp.167-177
• /
• 2024

Iris segmentation is an initial step for identifying the biometrics of animals when establishing a traceability system for livestock. In this study, we propose a deep learning framework for pixel-wise segmentation of bovine iris with a minimized use of annotation labels utilizing the BovineAAEyes80 public dataset. The proposed image segmentation framework encompasses data collection, data preparation, data augmentation selection, training of 15 deep neural network (DNN) models with varying encoder backbones and segmentation decoder DNNs, and evaluation of the models using multiple metrics and graphical segmentation results. This framework aims to provide comprehensive and in-depth information on each model's training and testing outcomes to optimize bovine iris segmentation performance. In the experiment, U-Net with a VGG16 backbone was identified as the optimal combination of encoder and decoder models for the dataset, achieving an accuracy and dice coefficient score of 99.50% and 98.35%, respectively. Notably, the selected model accurately segmented even corrupted images without proper annotation data. This study contributes to the advancement of iris segmentation and the establishment of a reliable DNN training framework.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1904-1926
• /
• 2016

Iris recognition for biometric personnel identification has gained much interest owing to the increasing concern with security today. The image quality plays a major role in the performance of iris recognition systems. When capturing an iris image under uncontrolled conditions and dealing with non-cooperative people, the chance of getting non-ideal images is very high owing to poor focus, off-angle, noise, motion blur, occlusion of eyelashes and eyelids, and wearing glasses. In order to improve the accuracy of iris recognition while dealing with non-ideal iris images, we propose a novel algorithm that improves the quality of degraded iris images. First, the iris image is localized properly to obtain accurate iris boundary detection, and then the iris image is normalized to obtain a fixed size. Second, the valid region (iris region) is extracted from the segmented iris image to obtain only the iris region. Third, to get a well-distributed texture image, bilinear interpolation is used on the segmented valid iris gray image. Using contrast-limited adaptive histogram equalization (CLAHE) enhances the low contrast of the resulting interpolated image. The results of CLAHE are further improved by stretching the maximum and minimum values to 0-255 by using histogram-stretching technique. The gray texture information is extracted by 1D Gabor filters while the Hamming distance technique is chosen as a metric for recognition. The NICE-II training dataset taken from UBRIS.v2 was used for the experiment. Results of the proposed method outperformed other methods in terms of equal error rate (EER).

• 한국컴퓨터정보학회논문지
• /
• 제14권7호
• /
• pp.9-15
• /
• 2009

퍼지 가중치 평균 분류기는 가중치를 적절히 설정함으로써 뛰어난 분류 성능을 얻을 수 있다는 장점이 있다. 그러나 일반적으로 가중치는 인식 문제 분야의 특성이나 해당 전문가의 지식과 주관적 경험을 기반으로 설정되므로 설정된 가중치의 일관성과 객관성을 보장하기가 어려운 문제점을 갖고 있다. 따라서 이 논문에서는 퍼지 가중치 평균 분류기의 가중치를 설정하기 위한 객관적 기준을 제시하기 위하여 특정값들 간의 통계적 정보를 이용한 가중치 설정 기법들을 제안하였다. 제안한 기법들의 효과를 조사하기 위하여 UCI machine learning repository 사이트에서 제공되는 표준 데이터들 중의 하나인 Iris 데이터 세트를 이용하여 실험하였으며, 그 결과 우수한 성능을 확인 할 수 있었다.

• 대한전자공학회논문지SP
• /
• 제47권5호
• /
• pp.175-182
• /
• 2010

본 논문에서는 얼굴과 동공을 검색하는 새로운 기법을 제시하며, 안전운행을 위한 운전자의 동공 감시에 적용한 실험결과를 포함하고 있다. 제시된 기법은 세 단계 주요 과정을 거치는데, 먼저 스킨칼라 세그먼테이션 기법으로 얼굴을 찾는 과정으로 이는 지금까지 사용된 휴리스틱모델이 아닌 학습과정 모델에 기반을 두고 있다. 다음에 얼굴 특징 세그먼테이션으로 눈, 입, 눈썹 등의 부분을 검출 하는데, 이를 위해 얼굴 각 부분에서 추출한 고유 특징들에 대한 PDF 추정을 사용하고 있다. 마지막으로 서큘러 하프 변환기법으로 눈 안의 동공을 찾아낸다. 제시된 기법을 조명이 다른 웹 얼굴 영상과 운전자의 CCD 얼굴 영상에 적용하여 동공을 찾아내는 실험을 하여, 높은 동공 검출율을 확인하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.2029-2032
• /
• 2004

The quantity of data were rapidly increased recently and caused the data overwhelming. This led to be difficult in searching the required data. The method of eliminating redundant data was needed. One of the efficient methods was Knowledge Discovery in Database (KDD). Generally data can be separate into 2 cases, continuous data and discrete data. This paper describes algorithm that transforms continuous attributes into discrete ones. We present an Improved Class Attribute Interdependence Maximization (ICAIM), which designed to work with supervised data, for discretized process. The algorithm does not require user to predefine the number of intervals. ICAIM improved CAIM by using significant test to determine which interval should be merged to one interval. Our goal is to generate a minimal number of discrete intervals and improve accuracy for classified class. We used iris plant dataset (IRIS) to test this algorithm compare with CAIM algorithm.

• 한국지능시스템학회논문지
• /
• 제18권6호
• /
• pp.814-820
• /
• 2008

최근, 패턴분류에 온톨로지를 이용하려는 연구가 다양한 분야에서 시도되고 있다. 그러나 대부분의 이러한 연구에서는 패턴분류 관련 지식을 표현한 온톨로지지가 패턴분류 과정에서 단순히 참조되는 수준에 머물고 있다. 본 논문에서는 퍼지 규칙기반 분류기를 확장한 온톨로지 기반 퍼지 분류기를 제안한다. 이를 위해 퍼지규칙 기반 패턴분류 방법을 개념화하여 온톨로지를 구성하고, 패턴분류를 위한 온톨로지 추론 규칙을 생성한다. 그리고 IRIS 데이터집합의 패턴분류 실험을 통해 온톨로지 기반 퍼지 분류기의 타당성을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권3호
• /
• pp.976-990
• /
• 2020

The k-means algorithm is widely used in academia and industry due to easy and simple implementation, enabling fast learning for complex datasets. However, k-means struggles to classify datasets without prior knowledge of specific domains. We proposed the repulsive k-means (RK-means) algorithm in a previous study to improve the k-means algorithm, using the repulsive force concept, which allows deleting unnecessary cluster centroids. Accordingly, the RK-means enables to classifying of a dataset without domain knowledge. However, three main problems remain. The RK-means algorithm includes a cluster repulsive force offset, for clusters confined in other clusters, which can cause cluster locking; we were unable to prove RK-means provided optimal convergence in the previous study; and RK-means shown better performance only normalize term and weight. Therefore, this paper proposes the advanced RK-means (ARK-means) algorithm to resolve the RK-means problems. We establish an initialization strategy for deploying cluster centroids and define a metric for the ARK-means algorithm. Finally, we redefine the mass and normalize terms to close to the general dataset. We show ARK-means feasibility experimentally using blob and iris datasets. Experiment results verify the proposed ARK-means algorithm provides better performance than k-means, k'-means, and RK-means.

• Journal of Information Processing Systems
• /
• 제16권4호
• /
• pp.750-759
• /
• 2020

The wide application of various integrated location-based services (LBS social) and tourism application (app) has generated a large amount of trajectory space data. The trajectory data are used to identify popular tourist attractions with high density of tourists, and they are of great significance to smart service and emergency management of scenic spots. A hot spot analysis method is proposed, based on spatial clustering of trajectory stop points. The DBSCAN algorithm is studied with fast clustering speed, noise processing and clustering of arbitrary shapes in space. The shortage of parameters is manually selected, and an improved method is proposed to adaptively determine parameters based on statistical distribution characteristics of data. DBSCAN clustering analysis and contrast experiments are carried out for three different datasets of artificial synthetic two-dimensional dataset, four-dimensional Iris real dataset and scenic track retention point. The experiment results show that the method can automatically generate reasonable clustering division, and it is superior to traditional algorithms such as DBSCAN and k-means. Finally, based on the spatial clustering results of the trajectory stay points, the Getis-Ord Gi* hotspot analysis and mapping are conducted in ArcGIS software. The hot spots of different tourist attractions are classified according to the analysis results, and the distribution of popular scenic spots is determined with the actual heat of the scenic spots.

• 한국지능시스템학회논문지
• /
• 제18권5호
• /
• pp.685-691
• /
• 2008

퍼지 규칙기반 분류 시스템에서 위한 퍼지 분할 경계들의 선택은 중요하고 어려운 문제이다. 그래서 이들을 효과적으로 결정하기 위해서 신경망, 유전자알고리즘 등과 같은 학습과정에 기반을 둔 다양한 방법들이 제안되었고, 이전 연구에서는 이들 방법에 대한 문제점을 지적하고 이를 개선하기 위하여 중첩 형태에서 퍼지 분할을 결정할 수 있는 방법에 대해서 논의하였다. 본 논문에서는 이전 연구의 방법을 3가지 형태의 분류 경계들, 즉 비중첩, 중첩, 1점 인접 형태로 확장하였다. 또한 이들을 학습에 의존하지 않고 주어진 데이터로부터 얻어진 통계적 정보만을 사용하여 결정하는 방법을 제안하고, 이를 패턴 분류 문제에 적용하여 제안된 방법의 효용성을 보인다.

• 전기학회논문지
• /
• 제61권1호
• /
• pp.135-142
• /
• 2012

In this paper, we proposed a new architecture called radial basis function-based polynomial neural networks classifier that consists of heterogeneous neural networks such as radial basis function neural networks and polynomial neural networks. The underlying architecture of the proposed model equals to polynomial neural networks(PNNs) while polynomial neurons in PNNs are composed of Fuzzy-c means-based radial basis function neural networks(FCM-based RBFNNs) instead of the conventional polynomial function. We consider PNNs to find the optimal local models and use RBFNNs to cover the high dimensionality problems. Also, in the hidden layer of RBFNNs, FCM algorithm is used to produce some clusters based on the similarity of given dataset. The proposed model depends on some parameters such as the number of input variables in PNNs, the number of clusters and fuzzification coefficient in FCM and polynomial type in RBFNNs. A multiobjective particle swarm optimization using crowding distance (MoPSO-CD) is exploited in order to carry out both structural and parametric optimization of the proposed networks. MoPSO is introduced for not only the performance of model but also complexity and interpretability. The usefulness of the proposed model as a classifier is evaluated with the aid of some benchmark datasets such as iris and liver.