• Title/Summary/Keyword: Otsu 알고리즘

Search Result 47, Processing Time 0.033 seconds

Accuracy Assessment of Unsupervised Change Detection Using Automated Threshold Selection Algorithms and KOMPSAT-3A (자동 임계값 추출 알고리즘과 KOMPSAT-3A를 활용한 무감독 변화탐지의 정확도 평가)

  • Lee, Seung-Min;Jeong, Jong-Chul
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.5_2
    • /
    • pp.975-988
    • /
    • 2020
  • Change detection is the process of identifying changes by observing the multi-temporal images at different times, and it is an important technique in remote sensing using satellite images. Among the change detection methods, the unsupervised change detection technique has the advantage of extracting rapidly the change area as a binary image. However, it is difficult to understand the changing pattern of land cover in binary images. This study used grid points generated from seamless digital map to evaluate the satellite image change detection results. The land cover change results were extracted using multi-temporal KOMPSAT-3A (K3A) data taken by Gimje Free Trade Zone and change detection algorithm used Spectral Angle Mapper (SAM). Change detection results were presented as binary images using the methods Otsu, Kittler, Kapur, and Tsai among the automated threshold selection algorithms. To consider the seasonal change of vegetation in the change detection process, we used the threshold of Differenced Normalized Difference Vegetation Index (dNDVI) through the probability density function. The experimental results showed the accuracy of the Otsu and Kapur was the highest at 58.16%, and the accuracy improved to 85.47% when the seasonal effects were removed through dNDVI. The algorithm generated based on this research is considered to be an effective method for accuracy assessment and identifying changes pattern when applied to unsupervised change detection.

Region Segmentation from MR Brain Image Using an Ant Colony Optimization Algorithm (개미 군집 최적화 알고리즘을 이용한 뇌 자기공명 영상의 영역분할)

  • Lee, Myung-Eun;Kim, Soo-Hyung;Lim, Jun-Sik
    • The KIPS Transactions:PartB
    • /
    • v.16B no.3
    • /
    • pp.195-202
    • /
    • 2009
  • In this paper, we propose the regions segmentation method of the white matter and the gray matter for brain MR image by using the ant colony optimization algorithm. Ant Colony Optimization (ACO) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. This algorithm finds the expected pixel for image as the real ant finds the food from nest to food source. Then ants deposit pheromone on the pixels, and the pheromone will affect the motion of next ants. At each iteration step, ants will change their positions in the image according to the transition rule. Finally, we can obtain the segmentation results through analyzing the pheromone distribution in the image. We compared the proposed method with other threshold methods, viz. the Otsu' method, the genetic algorithm, the fuzzy method, and the original ant colony optimization algorithm. From comparison results, the proposed method is more exact than other threshold methods for the segmentation of specific region structures in MR brain image.

Automatic Thresholding Selection for Image Segmentation Based on Genetic Algorithm (유전자알고리즘을 이용한 영상분할 문턱값의 자동선정에 관한 연구)

  • Lee, Byung-Ryong;Truong, Quoc Bao;Pham, Van Huy;Kim, Hyoung-Seok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.6
    • /
    • pp.587-595
    • /
    • 2011
  • In this paper, we focus on the issue of automatic selection for multi-level threshold, and we greatly improve the efficiency of Otsu's method for image segmentation based on genetic algorithm. We have investigated and evaluated the performance of the Otsu and Valley-emphasis threshold methods. Based on this observation we propose a method for automatic threshold method that segments an image into more than two regions with high performance and processing in real-time. Our paper introduced new peak detection, combines with evolution algorithm using MAGA (Modified Adaptive Genetic Algorithm) and HCA (Hill Climbing Algorithm), to find the best threshold automatically, accurately, and quickly. The experimental results show that the proposed evolutionary algorithm achieves a satisfactory segmentation effect and that the processing time can be greatly reduced when the number of thresholds increases.

Musical Score Recognition with SOM and Enhanced ART-1 (SOM과 개선된 ART-1을 이용한 악보 인식)

  • Kim, Kwang-Baek
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1064-1069
    • /
    • 2013
  • In this paper, we propose a Musical Score Recognition with SOM and Enhanced ART-1 Algorithm. First, we apply Hough transform and Otsu's binarization to the original BMP format image and extract notes from separated passages by histogram analysis with removing staff lines. Then extracted musical notes are normalized to same size by SOM algorithm and ART-1 algorithm plays the learning and recognition role. The experiment verifies that the proposed method is quite effective on printed musical score recognition.

A Vehicle License Plate Recognition Using the Haar-like Feature and CLNF Algorithm (Haar-like Feature 및 CLNF 알고리즘을 이용한 차량 번호판 인식)

  • Park, SeungHyun;Cho, Seongwon
    • Smart Media Journal
    • /
    • v.5 no.1
    • /
    • pp.15-23
    • /
    • 2016
  • This paper proposes an effective algorithm of Korean license plate recognition. By applying Haar-like feature and Canny edge detection on a captured vehicle image, it is possible to find a connected rectangular, which is a strong candidate for license plate. The color information of license plate separates plates into white and green. Then, OTSU binary image processing and foreground neighbor pixel propagation algorithm CLNF will be applied to each license plates to reduce noise except numbers and letters. Finally, through labeling, numbers and letters will be extracted from the license plate. Letter and number regions, separated from the plate, pass through mesh method and thinning process for extracting feature vectors by X-Y projection method. The extracted feature vectors are classified using neural networks trained by backpropagation algorithm to execute final recognition process. The experiment results show that the proposed license plate recognition algorithm works effectively.

A Vehicle License Plate Recognition Using the Feature Vectors based on Mesh and Thinning (메쉬 및 세선화 기반 특징 벡터를 이용한 차량 번호판 인식)

  • Park, Seung-Hyun;Cho, Seong-Won
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.705-711
    • /
    • 2011
  • This paper proposes an effective algorithm of license plate recognition for industrial applications. By applying Canny edge detection on a vehicle image, it is possible to find a connected rectangular, which is a strong candidate for license plate. The color information of license plate separates plates into white and green. Then, OTSU binary image processing and foreground neighbor pixel propagation algorithm CLNF will be applied to each license plates to reduce noise except numbers and letters. Finally, through labeling, numbers and letters will be extracted from the license plate. Letter and number regions, separated from the plate, pass through mesh method and thinning process for extracting feature vectors by X-Y projection method. The extracted feature vectors are compared with the pre-learned weighting values by backpropagation neural network to execute final recognition process. The experiment results show that the proposed license plate recognition algorithm works effectively.

Moving Object Segmentation Using Object Area Tracking Algorithm (움직임 영역 추출 알고리즘을 이용한 자동 움직임 물체 분할)

  • Lee Kwang-Ho;Lee Seung-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.9
    • /
    • pp.1240-1245
    • /
    • 2004
  • This paper presents the moving objects segmentation algorithms from the sequence images in the stationary backgrounds such as surveillance camera and video phone and so on. In this paper, the moving object area is extracted with proposed object searching algorithm and then moving object is segmented within the moving object area. Also the proposed algorithms have the robustness against noise problems and results show the proposed algorithm is able to efficiently segment and track the moving object area.

  • PDF

Development of Vision system for Back Light Unit of Defect (백라이트 유닛의 결함 검사를 위한 비전 시스템 개발)

  • Cho, Sang-Hee;Han, Chang-Ho;Oh, Choon-Suk;Ryu, Young-Kee
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.127-129
    • /
    • 2005
  • 본 연구에서는 백라이트 유닛의 검사를 위한 머신비전 시스템을 구축한다. 시스템은 크게 하드웨어와 소프트웨어로 나눌 수 있고 하드웨어는 조명부, 영상획득부, 로봇 암 제어부로 분류된다. 조명부는 36W FPL램프로 구성되었고 조명부의 상판에 아크릴판을 거치대로 이용하여 백라이트 유닛을 거치한다. 로봇 암 제어부는 2축 로봇 암을 제어하여 로봇 암의 센서부착 지지대에 부착된 CCD 센서를 이동시킨다. 이와 동시에 영상획득부에서는 이미지를 획득하여 PC로 전송한다. 소프트웨어의 화상처리 검사 알고리즘은 일정 패턴이 있는 도광판에 대한 검사 알고리즘과 일정패턴이 없근 백라이트 유닛에 대한 검사 알고리즘으로 분리된다. 일정 패턴이 인쇄되어 있는 패널에 대한 검사 알고리즘은 모폴로지 연산을 이용하는 템플릿 체크방법과 블록 매칭 방법이 사용되었고 일정패턴이 없는 유닛에 대한 검사는 개선된 Otsu 방법을 이용하여 얼룩이나 흐릿한 결함에 대한 결함을 검출하였다. 실험결과 불균일한 결함과 밝기가 일정하지 않은 결함일지라고 90% 이상의 검출율로 뛰어난 성능을 입증하였다.

  • PDF

Color Image Segmentation of Vitiligo Region (컬러 영상 분석을 통한 백반증 영역 분할)

  • Shin, Seung-Won;Kim, Kyeong-Seop;Lee, Se-Min;Kim, Jeong-Hwan
    • Proceedings of the KIEE Conference
    • /
    • 2011.07a
    • /
    • pp.2037-2038
    • /
    • 2011
  • 피부에 나타나는 난치성 질환인 백반증은 심리적인 위축감을 주어 정상적인 생활에 지장을 줄 수 있는 질병이다. 이에 따라서 본 연구에서는 피부에 나타나는 백반증의 진행 상태를 판단하기 위하여 L*a*b* 컬러 공간으로 변환된 피부 영상에 Otsu 임계값 설정 기법을 적용하여 백반증의 발병 영역을 자동으로 판별하는 알고리즘을 제안하였다.

  • PDF

Quantitative Assessment Technology of Small Animal Myocardial Infarction PET Image Using Gaussian Mixture Model (다중가우시안혼합모델을 이용한 소동물 심근경색 PET 영상의 정량적 평가 기술)

  • Woo, Sang-Keun;Lee, Yong-Jin;Lee, Won-Ho;Kim, Min-Hwan;Park, Ji-Ae;Kim, Jin-Su;Kim, Jong-Guk;Kang, Joo-Hyun;Ji, Young-Hoon;Choi, Chang-Woon;Lim, Sang-Moo;Kim, Kyeong-Min
    • Progress in Medical Physics
    • /
    • v.22 no.1
    • /
    • pp.42-51
    • /
    • 2011
  • Nuclear medicine images (SPECT, PET) were widely used tool for assessment of myocardial viability and perfusion. However it had difficult to define accurate myocardial infarct region. The purpose of this study was to investigate methodological approach for automatic measurement of rat myocardial infarct size using polar map with adaptive threshold. Rat myocardial infarction model was induced by ligation of the left circumflex artery. PET images were obtained after intravenous injection of 37 MBq $^{18}F$-FDG. After 60 min uptake, each animal was scanned for 20 min with ECG gating. PET data were reconstructed using ordered subset expectation maximization (OSEM) 2D. To automatically make the myocardial contour and generate polar map, we used QGS software (Cedars-Sinai Medical Center). The reference infarct size was defined by infarction area percentage of the total left myocardium using TTC staining. We used three threshold methods (predefined threshold, Otsu and Multi Gaussian mixture model; MGMM). Predefined threshold method was commonly used in other studies. We applied threshold value form 10% to 90% in step of 10%. Otsu algorithm calculated threshold with the maximum between class variance. MGMM method estimated the distribution of image intensity using multiple Gaussian mixture models (MGMM2, ${\cdots}$ MGMM5) and calculated adaptive threshold. The infarct size in polar map was calculated as the percentage of lower threshold area in polar map from the total polar map area. The measured infarct size using different threshold methods was evaluated by comparison with reference infarct size. The mean difference between with polar map defect size by predefined thresholds (20%, 30%, and 40%) and reference infarct size were $7.04{\pm}3.44%$, $3.87{\pm}2.09%$ and $2.15{\pm}2.07%$, respectively. Otsu verse reference infarct size was $3.56{\pm}4.16%$. MGMM methods verse reference infarct size was $2.29{\pm}1.94%$. The predefined threshold (30%) showed the smallest mean difference with reference infarct size. However, MGMM was more accurate than predefined threshold in under 10% reference infarct size case (MGMM: 0.006%, predefined threshold: 0.59%). In this study, we was to evaluate myocardial infarct size in polar map using multiple Gaussian mixture model. MGMM method was provide adaptive threshold in each subject and will be a useful for automatic measurement of infarct size.