• 제목/요약/키워드: ART Algorithm

검색결과 579건 처리시간 0.024초

YCbCr 색상모델과 ART2 알고리즘을 이용한 충치 추출 (Dental Caries Extraction using YCbCr Color Model and ART2 Algorithm)

  • 박호준;김연규;이상걸;차의영
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2015년도 추계학술발표대회
    • /
    • pp.1289-1291
    • /
    • 2015
  • 본 논문에서는 충치 환자의 진단을 위해 구강 영상에서 충치를 추출하는 방법을 제안한다. 먼저 구강은 붉은색을 띄고 치아는 흰색을 띈다는 특징이 있기 때문에, 구강 영상을 YCbCr 컬러모델로 변환한다. YCbCr 컬러모델에 임계치를 설정하여 붉은 영역을 검출해내고, 검출된 붉은 영역에 대해 이진화하여 치아 영역을 추출한다. 그 후, 모폴로지 기법을 이용하여 잡음 제거 및 치아의 빈 공간을 채운다. 치아 영역 추출 시 영상에 따라 치아 사이를 잇는 모서리 부분이 손실된 경우가 발생할 수 있기 때문에 치아 사이의 손실된 부분을 연결 한다. 치아 영역에 ART2 알고리즘을 적용하여 클러스터링하고 충치 후보 영역을 추출한다. 충치 후보 영역에 8방향 윤곽선 추적 기법을 적용하여 충치를 분석 및 추출한다. 실험 결과 81%의 추출 성공률을 보였고 다양한 형태의 충치를 효과적으로 추출할 수 있는 것을 확인하였다.

Research on Camouflaged Encryption Scheme Based on Hadamard Matrix and Ghost Imaging Algorithm

  • Leihong, Zhang;Yang, Wang;Hualong, Ye;Runchu, Xu;Dawei, Zhang
    • Current Optics and Photonics
    • /
    • 제5권6호
    • /
    • pp.686-698
    • /
    • 2021
  • A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

A Novel Face Recognition Algorithm based on the Deep Convolution Neural Network and Key Points Detection Jointed Local Binary Pattern Methodology

  • Huang, Wen-zhun;Zhang, Shan-wen
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권1호
    • /
    • pp.363-372
    • /
    • 2017
  • This paper presents a novel face recognition algorithm based on the deep convolution neural network and key point detection jointed local binary pattern methodology to enhance the accuracy of face recognition. We firstly propose the modified face key feature point location detection method to enhance the traditional localization algorithm to better pre-process the original face images. We put forward the grey information and the color information with combination of a composite model of local information. Then, we optimize the multi-layer network structure deep learning algorithm using the Fisher criterion as reference to adjust the network structure more accurately. Furthermore, we modify the local binary pattern texture description operator and combine it with the neural network to overcome drawbacks that deep neural network could not learn to face image and the local characteristics. Simulation results demonstrate that the proposed algorithm obtains stronger robustness and feasibility compared with the other state-of-the-art algorithms. The proposed algorithm also provides the novel paradigm for the application of deep learning in the field of face recognition which sets the milestone for further research.

SFMOG : 초고속 MOG 기반 배경 제거 알고리즘 (SFMOG : Super Fast MOG Based Background Subtraction Algorithm)

  • 송석빈;김진헌
    • 전기전자학회논문지
    • /
    • 제23권4호
    • /
    • pp.1415-1422
    • /
    • 2019
  • 배경 제거는 동영상에서 변화를 감지하는 컴퓨터 비전 및 이미지 처리의 주요 작업이다. 최상의 성능을 가지는 배경 제거 방법은 일반적인 컴퓨팅 환경에서 실시간으로 사용할 수 없을 만큼 계산량이 많다. 제안하는 알고리즘은 널리 사용되는 MOG 기반의 배경 제거 알고리즘을 이미지 크기 조정 알고리즘으로 개선했다. 제안된 이미지 크기 조정 알고리즘은 계산량을 대폭 감소시키고 지역 정보를 활용하도록 설계해 카메라 잡음에 강력하다. 제안된 알고리즘의 실험결과는 최신 배경 제거 방법에 근접하는 분류능력과 13배 이상 빠른 처리 속도를 가진다.

Human Visual System based Automatic Underwater Image Enhancement in NSCT domain

  • Zhou, Yan;Li, Qingwu;Huo, Guanying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.837-856
    • /
    • 2016
  • Underwater image enhancement has received considerable attention in last decades, due to the nature of poor visibility and low contrast of underwater images. In this paper, we propose a new automatic underwater image enhancement algorithm, which combines nonsubsampled contourlet transform (NSCT) domain enhancement techniques with the mechanism of the human visual system (HVS). We apply the multiscale retinex algorithm based on the HVS into NSCT domain in order to eliminate the non-uniform illumination, and adopt the threshold denoising technique to suppress underwater noise. Our proposed algorithm incorporates the luminance masking and contrast masking characteristics of the HVS into NSCT domain to yield the new HVS-based NSCT. Moreover, we define two nonlinear mapping functions. The first one is used to manipulate the HVS-based NSCT contrast coefficients to enhance the edges. The second one is a gain function which modifies the lowpass subband coefficients to adjust the global dynamic range. As a result, our algorithm can achieve contrast enhancement, image denoising and edge sharpening automatically and simultaneously. Experimental results illustrate that our proposed algorithm has better enhancement performance than state-of-the-art algorithms both in subjective evaluation and quantitative assessment. In addition, our algorithm can automatically achieve underwater image enhancement without any parameter tuning.

저전력 모바일 드라이브에서의 멀티미디어 데이터 재생 (ARM Multimedia data retrieval in low power mobile disk drive)

  • Park, Jung-Wan;Won, You-Jip
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2002년도 봄 학술발표논문집 Vol.29 No.1 (A)
    • /
    • pp.676-678
    • /
    • 2002
  • In this work, we present the novel scheduling algorithm of the multimedia data retrieval for the mobile disk drive. Our algorithm is focused on minimizing the power consumption involved in data retrieval from the local disk drive. The prime commodity in mobile devices is the electricity. Strict restriction on power consumption requirement of the mobile device put unique demand in designing of its hardware and software components. State of the art disk based storage subsystem becomes small enough to be embedded in handhold devices. It delivers abundant storage capacity and portability. However, it is never be trivial to integrate small hard disk or optical disk drive in handhold devices due to its excessive power consumption. Our algorithm ARM in this article generates the optimal schedule of retrieving data blocks from the mobile disk drive while guaranteeing continuous playback of multimedia data.

  • PDF

제어알고리즘 개선을 위한 3차원 반송 시스템 선형유도전동기의 동특성 해석 (Dynamic Characteristics Analysis of 3D Conveyor System Linear Induction Motor for Control Algorithm Developments)

  • 전수진;이중호
    • 전기학회논문지
    • /
    • 제56권3호
    • /
    • pp.514-518
    • /
    • 2007
  • It is necessary to modify the state-of-the-art of speed control theory because of the phase asymmetry in the Linear Induction Motor (LIM)and for the constant speed control of mover using single vector control inverter system, it is important that primary stack is located in appropriated intervals in the 3D conveyer system using LIM. The dynamic characteristic analysis method of the vector controlled LIM using coupled FEM and control algorithm taking into account the movement is proposed. The focus of this paper is the analysis relative to selecting primary stack intervals in order to constant speed control in the 3D conveyer system using LIM.

Examination of three meta-heuristic algorithms for optimal design of planar steel frames

  • Tejani, Ghanshyam G.;Bhensdadia, Vishwesh H.;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • 제1권1호
    • /
    • pp.79-86
    • /
    • 2016
  • In this study, the three different meta-heuristics namely the Grey Wolf Optimizer (GWO), Stochastic Fractal Search (SFS), and Adaptive Differential Evolution with Optional External Archive (JADE) algorithms are examined. This study considers optimization of the planer frame to minimize its weight subjected to the strength and displacement constraints as per the American Institute of Steel and Construction - Load and Resistance Factor Design (AISC-LRFD). The GWO algorithm is associated with grey wolves' activities in the social hierarchy. The SFS algorithm works on the natural phenomenon of growth. JADE on the other hand is a powerful self-adaptive version of a differential evolution algorithm. A one-bay ten-story planar steel frame problem is examined in the present work to investigate the design ability of the proposed algorithms. The frame design is produced by optimizing the W-shaped cross sections of beam and column members as per AISC-LRFD standard steel sections. The results of the algorithms are compared. In addition, these results are also mapped with other state-of-art algorithms.

State of the Art Review of Shading Effects on PV Module Efficiencies and Their Detection Algorithm Focusing on Maximum Power Point

  • Lee, Duk Hwan;Lee, Kwang Ho
    • KIEAE Journal
    • /
    • 제14권2호
    • /
    • pp.21-28
    • /
    • 2014
  • This paper provides the up to date review of the shading effects on PV module performance and the associated detection algorithm related to the maximum power point tracking. It includes the brief explanations of the MMP variations due to the shading occurrence on the PV modules. Review of experimental and simulation studies highlighting the significant impacts of shading on PV efficiencies were presented. The literature indicates that even the partial shading of a single cell can greatly drop the entire module voltage and power efficiency. The MMP tracking approaches were also reviewed in this study. Both conventional and advanced soft computing methods such as ANN, FLC and EA were described for the proper tracking of MMP under shaded conditions. This paper would be the basic source and the comprehensive information associated with the shading effects and relevant MPP tracking technique.

SCATOMi : Scheduling Driven Circuit Partitioning Algorithm for Multiple FPGAs using Time-multiplexed, Off-chip, Multicasting Interconnection Architecture

  • Young-Su kwon;Kyung, Chong-Min
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 II
    • /
    • pp.823-826
    • /
    • 2003
  • FPGA-based logic emulator with lane gate capacity generally comprises a large number of FPGAs connected in mesh or crossbar topology. However, gate utilization of FPGAs and speed of emulation are limited by the number of signal pins among FPGAs and the interconnection architecture of the logic emulator. The time-multiplexing of interconnection wires is required for multi-FPGA system incorporating several state-of-the-art FPGAs. This paper proposes a circuit partitioning algorithm called SCATOMi(SCheduling driven Algorithm for TOMi)for multi-FPGA system incorporating four to eight FPGAs where FPGAs are interconnected through TOMi(Time-multiplexed, Off-chip, Multicasting interconnection). SCATOMi improves the performance of TOMi architecture by limiting the number of inter-FPGA signal transfers on the critical path and considering the scheduling of inter-FPGA signal transfers. The performance of the partitioning result of SCATOMi is 5.5 times faster than traditional partitioning algorithms. Architecture comparison show that the pin count is reduced to 15.2%-81.3% while the critical path delay is reduced to 46.1%-67.6% compared to traditional architectures.

  • PDF