• 제목/요약/키워드: ART2 algorithm

검색결과 220건 처리시간 0.033초

ART2 기반 RBF 네트워크와 얼굴 인증을 이용한 주민등록증 인식 (Recognition of Resident Registration Card using ART2-based RBF Network and face Verification)

  • 김광백;김영주
    • 지능정보연구
    • /
    • 제12권1호
    • /
    • pp.1-15
    • /
    • 2006
  • 우리나라의 주민등록증은 주소지, 주민등록번호, 얼굴사진, 지문 등 개인의 다양한 정보를 가진다. 현재의 플라스틱형 주민등록증은 위조 및 변조가 쉽고 그 수법이 날로 전문화 되어가고 있다. 따라서 육안으로 위조 및 변조 사실을 쉽게 확인하기가 어려워 사회적으로 문제를 일으키고 있다. 이에 본 논문에서는 개선된 ART2 기반 RBF 네트워크에 이용한 주민등록번호 인식과 얼굴 인증을 통한 주민등록증 자동 인식 방법을 제안한다. 제안된 방법은 주민등록증 영상으로부터 주민등록번호와 발행일을 추출하기 위하여 주민등록증 영상에 소벨 마스킹와 미디언 필터링을 적용한 후에 수평 스미어링을 적용하여 주민등록번호와 발행일 영역을 추출한다. 그리고 원영상에 대해 고주파 필터링을 적용하여 영상 전체를 이진화하고, 이진화된 영상에 CDM 마스크를 적용하여 주민등록번호와 발행일 코드를 복원한 다음, 검출된 각 영역에 대해 4-방향 윤곽선 추적 알고리즘을 적용하여 개별 문자를 추출한다. 추출된 주민등록번호 등의 개별 문자를 인식하기 위해 개선된 ART2 기반 RBF 네트워크를 제안하고 인식에 적용한다. 제안된 ART2 기반 RBF 네트워크는 학습 성능을 개선하기 위하여 중간층과 출력층의 학습에 퍼지 제어 기법을 적용하여 학습률을 동적으로 조정한다. 얼굴 인증은 템플릿 매칭 알고리즘을 이용하여 얼굴 템플릿 데이터베이스를 구축하고 주민등록증에서 추출된 얼굴 영역과의 유사도를 측정하여 주민등록증 얼굴 영역의 위조여부를 판별한다. 제안된 주민등록증 인식 방법의 성능을 평가하기 위해 원본 주민등록증 영상에 대해 얼굴 영역 위조, 노이즈추가, 대비 증감, 밝기 증감 그리고 영상 흐리기 등의 변형된 영상들을 생성하여 실험한 결과, 제안된 방법이 주민등록번호 인식 및 얼굴 인증에 있어서 우수한 성능이 있음을 확인하였다

  • PDF

ACDE2: 수렴 속도가 향상된 적응적 코시 분포 차분 진화 알고리즘 (ACDE2: An Adaptive Cauchy Differential Evolution Algorithm with Improved Convergence Speed)

  • 최태종;안창욱
    • 정보과학회 논문지
    • /
    • 제41권12호
    • /
    • pp.1090-1098
    • /
    • 2014
  • 이 연구는 단봉 전역 최적화 성능이 개선된 적응적 코시 분포 차분 진화 알고리즘을 제안한다. 기존 적응적 코시 분포 차분 진화 알고리즘은(ACDE) 개체의 다양성을 보장하여 다봉 전역 최적화 문제에 우수한 "DE/rand/1" 돌연변이 전략을 사용했다. 그러나 이 돌연변이 전략은 수렴 속도가 느려 단봉 전역 최적화 문제에 단점이 있다. 제안 알고리즘은 "DE/rand/1" 돌연변이 전략 대신 수렴 속도가 빠른 "DE/current-to-best/1" 돌연변이 전략을 사용했다. 이때, 개체의 다양성이 부족하여 발생할 수 있는 지역 최적해로의 수렴을 방지하기 위해서 매개변수 초기화 연산이 추가됐다. 매개변수 초기화 연산은 특정세대를 주기로 실행되거나 또는 선택 연산에서 모든 개체가 진화에 실패하는 경우 실행된다. 매개변수 초기화 연산은 각 개체들의 매개변수에 탐험적 특성이 높은 값을 할당하여 넓은 공간을 탐색할 수 있도록 보장한다. 성능 평가 결과, 개선된 적응적 코시 분포 차분 진화 알고리즘이 최신 차분 진화 알고리즘들에 비해 특히, 단봉 전역 최적화 문제에서 성능이 개선됨을 확인했다.

The Maximum Scatter Travelling Salesman Problem: A Hybrid Genetic Algorithm

  • Zakir Hussain Ahmed;Asaad Shakir Hameed;Modhi Lafta Mutar;Mohammed F. Alrifaie;Mundher Mohammed Taresh
    • International Journal of Computer Science & Network Security
    • /
    • 제23권6호
    • /
    • pp.193-201
    • /
    • 2023
  • In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

Topology, shape, and size optimization of truss structures using modified teaching-learning based optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • 제2권4호
    • /
    • pp.313-331
    • /
    • 2017
  • In this study, teaching-learning based optimization (TLBO) is improved by incorporating model of multiple teachers, adaptive teaching factor, self-motivated learning, and learning through tutorial. Modified TLBO (MTLBO) is applied for simultaneous topology, shape, and size optimization of space and planar trusses to study its effectiveness. All the benchmark problems are subjected to stress, displacement, and kinematic stability constraints while design variables are discrete and continuous. Analyses of unacceptable and singular topologies are prohibited by seeing element connectivity through Grubler's criterion and the positive definiteness. Performance of MTLBO is compared to TLBO and state-of-the-art algorithms available in literature, such as a genetic algorithm (GA), improved GA, force method and GA, ant colony optimization, adaptive multi-population differential evolution, a firefly algorithm, group search optimization (GSO), improved GSO, and intelligent garbage can decision-making model evolution algorithm. It is observed that MTLBO has performed better or found nearly the same optimum solutions.

동적 및 정적 물체 회피를 위한 정밀 도로지도 기반 지역 경로 계획 (High-Definition Map-based Local Path Planning for Dynamic and Static Obstacle Avoidance)

  • 정의곤;송원호;명현
    • 로봇학회논문지
    • /
    • 제16권2호
    • /
    • pp.112-121
    • /
    • 2021
  • Unlike a typical small-sized robot navigating in a free space, an autonomous vehicle has to travel in a designated road which has lanes to follow and traffic rules to obey. High-Definition (HD) maps, which include road markings, traffic signs, and traffic lights with high location accuracy, can help an autonomous vehicle avoid the need to detect such challenging road surroundings. With space constraints and a pre-built HD map, a new type of path planning algorithm can be conceived as a substitute for conventional grid-based path planning algorithms, which require substantial planning time to cover large-scale free space. In this paper, we propose an obstacle-avoiding, cost-based planning algorithm in a continuous space that aims to pursue a globally-planned path with the help of HD map information. Experimentally, the proposed algorithm is shown to outperform other state-of-the-art path planning algorithms in terms of computation complexity in a typical urban road setting, thereby achieving real-time performance and safe avoidance of obstacles.

데이터 융합을 이용한 내용기반 이미지 검색에 관한 연구 (Content-based Image Retrieval Using Data Fusion Strategy)

  • 백우진;정선은;김기영;안의근;신문선
    • 정보관리학회지
    • /
    • 제25권2호
    • /
    • pp.49-68
    • /
    • 2008
  • 지금까지의 정보검색 연구에서 데이터 융합 기법을 이용한 문서 검색은 하나의 알고리즘에 의한 검색에 비하여 많은 경우에 효율성이 높은 결과를 얻을 수 있었다. 하지만 이미지 검색에서 상이한 알고리즘을 이용한 다수의 검색 결과를 합쳐 하나의 검색결과를 얻는 데이터 융합 기법의 사용은 많지 않았다. 이 연구에서는 소벨 연산자를 이용한 윤곽선 검출과 자기조직화 지도 알고리즘에 의한 두 검색 결과를 융합하여 각각의 알고리즘에 의한 검색결과 보다 높은 효율성을 보여주는 방법을 제시하였다. 이 연구에서는 상용 클립아트 이미지를 이용하여 사람의 주관적인 적합성 판단을 배제한 검색 실험 데이터를 만들어 사용하였다.

Passport Recognition using Fuzzy Binarization and Enhanced Fuzzy RBF Network

  • Kim, Kwang-Baek
    • 한국지능시스템학회논문지
    • /
    • 제14권2호
    • /
    • pp.222-227
    • /
    • 2004
  • Today, an automatic and accurate processing using computer is essential because of the rapid increase of travelers. The determination of forged passports plays an important role in the immigration control system. Hence, as the preprocessing phase for the determination of forged passports, this paper proposes a novel method for the recognition of passports based on the fuzzy binarization and the fuzzy RBF network. First, for the extraction of individual codes for recognizing, this paper targets code sequence blocks including individual codes by applying Sobel masking, horizontal smearing and a contour tracking algorithm on the passport image. Then the proposed method binarizes the extracted blocks using fuzzy binarization based on the trapezoid type membership function. Then, as the last step, individual codes are recovered and extracted from the binarized areas by applying CDM masking and vertical smearing. This paper also proposes an enhanced fuzzy RBF network that adapts the enhanced fuzzy ART network for the middle layer. This network is applied to the recognition of individual codes. The results of the experiments for performance evaluation on the real passport images showed that the proposed method has the better performance compared with other approaches.

Object Tracking Based on Weighted Local Sub-space Reconstruction Error

  • Zeng, Xianyou;Xu, Long;Hu, Shaohai;Zhao, Ruizhen;Feng, Wanli
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권2호
    • /
    • pp.871-891
    • /
    • 2019
  • Visual tracking is a challenging task that needs learning an effective model to handle the changes of target appearance caused by factors such as pose variation, illumination change, occlusion and motion blur. In this paper, a novel tracking algorithm based on weighted local sub-space reconstruction error is presented. First, accounting for the appearance changes in the tracking process, a generative weight calculation method based on structural reconstruction error is proposed. Furthermore, a template update scheme of occlusion-aware is introduced, in which we reconstruct a new template instead of simply exploiting the best observation for template update. The effectiveness and feasibility of the proposed algorithm are verified by comparing it with some state-of-the-art algorithms quantitatively and qualitatively.

A Novel Approach for Blind Estimation of Reverberation Time using Gamma Distribution Model

  • Hamza, Amad;Jan, Tariqullah;Jehangir, Asiya;Shah, Waqar;Zafar, Haseeb;Asif, M.
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권2호
    • /
    • pp.529-536
    • /
    • 2016
  • In this paper we proposed an unsupervised algorithm to estimate the reverberation time (RT) directly from the reverberant speech signal. For estimation process we use maximum likelihood estimation (MLE) which is a very well-known and state of the art method for estimation in the field of signal processing. All existing RT estimation methods are based on the decay rate distribution. The decay rate can be obtained either from the energy envelop decay curve analysis of noise source when it is switch off or from decay curve of impulse response of an enclosure. The analysis of a pre-existing method of reverberation time estimation is the foundation of the proposed method. In one of the state of the art method, the reverberation decay is modeled as a Laplacian distribution. In this paper, the proposed method models the reverberation decay as a Gamma distribution along with the unification of an effective technique for spotting free decay in reverberant speech. Maximum likelihood estimation technique is then used to estimate the RT from the free decays. The method was motivated by our observation that the RT of a reverberant signal when falls in specific range, then the decay rate of the signal follows Gamma distribution. Experiments are carried out on different reverberant speech signal to measure the accuracy of the suggested method. The experimental results reveal that the proposed method performs better and the accuracy is high in comparison to the state of the art method.

A Wide Dynamic Range NUC Algorithm for IRCS Systems

  • Cai, Li-Hua;He, Feng-Yun;Chang, Song-Tao;Li, Zhou
    • Journal of the Korean Physical Society
    • /
    • 제73권12호
    • /
    • pp.1821-1826
    • /
    • 2018
  • Uniformity is a key feature of state-of-the-art infrared focal planed array (IRFPA) and infrared imaging system. Unlike traditional infrared telescope facility, a ground-based infrared radiant characteristics measurement system with an IRFPA not only provides a series of high signal-to-noise ratio (SNR) infrared image but also ensures the validity of radiant measurement data. Normally, a long integration time tends to produce a high SNR infrared image for infrared radiant characteristics radiometry system. In view of the variability of and uncertainty in the measured target's energy, the operation of switching the integration time and attenuators usually guarantees the guality of the infrared radiation measurement data obtainted during the infrared radiant characteristics radiometry process. Non-uniformity correction (NUC) coefficients in a given integration time are often applied to a specified integration time. If the integration time is switched, the SNR for the infrared imaging will degenerate rapidly. Considering the effect of the SNR for the infrared image and the infrared radiant characteristics radiometry above, we propose a-wide-dynamic-range NUC algorithm. In addition, this essasy derives and establishes the mathematical modal of the algorithm in detail. Then, we conduct verification experiments by using a ground-based MWIR(Mid-wave Infared) radiant characteristics radiometry system with an Ø400 mm aperture. The experimental results obtained using the proposed algorithm and the traditional algorithm for different integration time are compared. The statistical data shows that the average non-uniformity for the proposed algorithm decreased from 0.77% to 0.21% at 2.5 ms and from 1.33% to 0.26% at 5.5 ms. The testing results demonstrate that the usage of suggested algorithm can improve infrared imaging quality and radiation measurement accuracy.