• Title/Summary/Keyword: Otsu Algorithm

Search Result 73, Processing Time 0.027 seconds

Study on Robust Driving for Autonomous Vehicle in Real-Time (자율주행차량의 실시간 강건한 주행을 위한 연구)

  • 이대은;김정훈;김영배
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.908-911
    • /
    • 2004
  • In this paper, we describe a robust image processing algorithm to recognize the road lane in real-time. For the real-time processing, a detection area is decided by a lane segment of a previous frame and edges are detected on the basis of the lane width. For the robust driving, the global threshold with the Otsu algorithm is used to get a binary image in a frame. Therefore, reliable edges are obtained from the algorithms suggested in this paper in a short time. Lastly, the lane segment is found by hough transform. We made a RC(Radio Control) car equipped with a vision system and verified these algorithms using the RC Car.

  • PDF

Texture-based PCA for Analyzing Document Image (텍스처 정보 기반의 PCA를 이용한 문서 영상의 분석)

  • Kim, Bo-Ram;Kim, Wook-Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.283-284
    • /
    • 2006
  • In this paper, we propose a novel segmentation and classification method using texture features for the document image. First, we extract the local entropy and then segment the document image to separate the background and the foreground using the Otsu's method. Finally, we classify the segmented regions into each component using PCA(principle component analysis) algorithm based on the texture features that are extracted from the co-occurrence matrix for the entropy image. The entropy-based segmentation is robust to not only noise and the change of light, but also skew and rotation. Texture features are not restricted from any form of the document image and have a superior discrimination for each component. In addition, PCA algorithm used for the classifier can classify the components more robustly than neural network.

  • PDF

Automatic Matching of Building Polygon Dataset from Digital Maps Using Hierarchical Matching Algorithm (계층적 매칭 기법을 이용한 수치지도 건물 폴리곤 데이터의 자동 정합에 관한 연구)

  • Yeom, Junho;Kim, Yongil;Lee, Jeabin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.1
    • /
    • pp.45-52
    • /
    • 2015
  • The interoperability of multi-source data has become more important due to various digital maps, produced from public institutions and enterprises. In this study, the automatic matching algorithm of multi-source building data using hierarchical matching was proposed. At first, we divide digital maps into blocks and perform the primary geometric registration of buildings with the ICP algorithm. Then, corresponding building pairs were determined by evaluating the similarity of overlap area, and the matching threshold value of similarity was automatically derived by the Otsu binary thresholding. After the first matching, we extracted error matching candidates buildings which are similar with threshold value to conduct the secondary ICP matching and to make a matching decision using turning angle function analysis. For the evaluation, the proposed method was applied to representative public digital maps, road name address map and digital topographic map 2.0. As a result, the F measures of matching and non-matching buildings increased by 2% and 17%, respectively. Therefore, the proposed method is efficient for the matching of building polygons from multi-source digital maps.

Automated Vessels Detection on Infant Retinal Images

  • Sukkaew, Lassada;Uyyanonvara, Bunyarit;Barman, Sarah A;Jareanjit, Jaruwat
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.321-325
    • /
    • 2004
  • Retinopathy of Prematurity (ROP) is a common retinal neovascular disorder of premature infants. It can be characterized by inappropriate and disorganized vessel. This paper present a method for blood vessel detection on infant retinal images. The algorithm is designed to detect the retinal vessels. The proposed method applies a Lapalacian of Gaussian as a step-edge detector based on the second-order directional derivative to identify locations of the edge of vessels with zero crossings. The procedure allows parameters computation in a fixed number of operations independent of kernel size. This method is composed of four steps : grayscale conversion, edge detection based on LOG, noise removal by adaptive Wiener filter & median filter, and Otsu's global thresholding. The algorithm has been tested on twenty infant retinal images. In cooperation with the Digital Imaging Research Centre, Kingston University, London and Department of Opthalmology, Imperial College London who supplied all the images used in this project. The algorithm has done well to detect small thin vessels, which are of interest in clinical practice.

  • PDF

Multi-Level Segmentation of Infrared Images with Region of Interest Extraction

  • Yeom, Seokwon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.4
    • /
    • pp.246-253
    • /
    • 2016
  • Infrared (IR) imaging has been researched for various applications such as surveillance. IR radiation has the capability to detect thermal characteristics of objects under low-light conditions. However, automatic segmentation for finding the object of interest would be challenging since the IR detector often provides the low spatial and contrast resolution image without color and texture information. Another hindrance is that the image can be degraded by noise and clutters. This paper proposes multi-level segmentation for extracting regions of interest (ROIs) and objects of interest (OOIs) in the IR scene. Each level of the multi-level segmentation is composed of a k-means clustering algorithm, an expectation-maximization (EM) algorithm, and a decision process. The k-means clustering initializes the parameters of the Gaussian mixture model (GMM), and the EM algorithm estimates those parameters iteratively. During the multi-level segmentation, the area extracted at one level becomes the input to the next level segmentation. Thus, the segmentation is consecutively performed narrowing the area to be processed. The foreground objects are individually extracted from the final ROI windows. In the experiments, the effectiveness of the proposed method is demonstrated using several IR images, in which human subjects are captured at a long distance. The average probability of error is shown to be lower than that obtained from other conventional methods such as Gonzalez, Otsu, k-means, and EM methods.

Small Target Detection with Clutter Rejection using Stochastic Hypothesis Testing

  • Kang, Suk-Jong;Kim, Do-Jong;Ko, Jung-Ho;Bae, Hyeon-Deok
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1559-1565
    • /
    • 2007
  • The many target-detection methods that use forward-looking infrared (FUR) images can deal with large targets measuring $70{\times}40$ pixels, utilizing their shape features. However, detection small targets is difficult because they are more obscure and there are many target-like objects. Therefore, few studies have examined how to detect small targets consisting of fewer than $30{\times}10$ pixels. This paper presents a small target detection method using clutter rejection with stochastic hypothesis testing for FLIR imagery. The proposed algorithm consists of two stages; detection and clutter rejection. In the detection stage, the mean of the input FLIR image is first removed and then the image is segmented using Otsu's method. A closing operation is also applied during the detection stage in order to merge any single targets detected separately. Then, the residual of the clutters is eliminated using statistical hypothesis testing based on the t-test. Several FLIR images are used to prove the performance of the proposed algorithm. The experimental results show that the proposed algorithm accurately detects small targets (Jess than $30{\times}10$ pixels) with a low false alarm rate compared to the center-surround difference method using the receiver operating characteristics (ROC) curve.

  • PDF

Mobile Application based on Image Processing and a Proportion for Food Intake Measuring

  • Kim, Do-Hyeon;Kim, Yoon;Han, Yu-Ri
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.5
    • /
    • pp.57-63
    • /
    • 2017
  • In the paper, we propose a new reliable technique for measuring food intake based on image automatically without user intervention. First, food and bowl image before and after meal is obtained by user. The food and the bowl are divided into each region by the K-means clustering, Otsu algorithm, Morphology, etc. And the volume of food is measured by a proportional expression based on the information of the container such as it's entrance diameter, depth, and bottom diameter. Finally, our method calculates the volume of the consumed food by the difference between before and after meal. The proposed technique has higher accuracy than existing method for measuring food intake automatically. The experiment result shows that the average error rate is up to 7% for three types of containers. Computer simulation results indicate that the proposed algorithm is a convenient and accurate method of measuring the food intake.

Unsupervised Change Detection of Hyperspectral images Using Range Average and Maximum Distance Methods (구간평균 기법과 직선으로부터의 최대거리를 이용한 초분광영상의 무감독변화탐지)

  • Kim, Dae-Sung;Kim, Yong-Il;Pyeon, Mu-Wook
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.1
    • /
    • pp.71-80
    • /
    • 2011
  • Thresholding is important step for detecting binary change/non-change information in the unsupervised change detection. This study proposes new unsupervised change detection method using Hyperion hyperspectral images, which are expected with data increased demand. A graph is drawn with applying the range average method for the result value through pixel-based similarity measurement, and thresholding value is decided at the maximum distance point from a straight line. The proposed method is assessed in comparison with expectation-maximization algorithm, coner method, Otsu's method using synthetic images and Hyperion hyperspectral images. Throughout the results, we validated that the proposed method can be applied simply and had similar or better performance than the other methods.

Lane Detection based Open-Source Hardware according to Change Lane Conditions (오픈소스 하드웨어 기반 차선검출 기술에 대한 연구)

  • Kim, Jae Sang;Moon, Hae Min;Pan, Sung Bum
    • Smart Media Journal
    • /
    • v.6 no.3
    • /
    • pp.15-20
    • /
    • 2017
  • Recently, the automotive industry has been studied about driver assistance systems for helping drivers to drive their cars easily by integrating them with the IT technology. This study suggests a method of detecting lanes, robust to road condition changes and applicable to lane departure warning and autonomous vehicles mode. The proposed method uses the method of detecting candidate areas by using the Gaussian filter and by determining the Otsu threshold value and edge. Moreover, the proposed method uses lane gradient and width information through the Hough transform to detect lanes. The method uses road lane information detected before to detect dashed lines as well as solid lines, calculates routes in which the lanes will be located in the next frame to draw virtual lanes. The proposed algorithm was identified to be able to detect lanes in both dashed- and solid-line situations, and implement real-time processing where applied to Raspberry Pi 2 which is open source hardware.

A Image Search Algorithm using Coefficients of The Cosine Transform (여현변환 계수를 이용한 이미지 탐색 알고리즘)

  • Lee, Seok-Han
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.1
    • /
    • pp.13-21
    • /
    • 2019
  • The content based on image retrieval makes use of features of information within image such as color, texture and share for Retrieval data. we present a novel approach for improving retrieval accuracy based on DCT Filter-Bank. First, we perform DCT on a given image, and generate a Filter-Bank using the DCT coefficients for each color channel. In this step, DC and the limited number of AC coefficients are used. Next, a feature vector is obtained from the histogram of the quantized DC coefficients. Then, AC coefficients in the Filter-Bank are separated into three main groups indicating horizontal, vertical, and diagonal edge directions, respectively, according to their spatial-frequency properties. Each directional group creates its histogram after employing Otsu binarization technique. Finally, we project each histogram on the horizontal and vertical axes, and generate a feature vector for each group. The computed DC and AC feature vectors bins are concatenated, and it is used in the similarity checking procedure. We experimented using 1,000 databases, and as a result, this approach outperformed the old retrieval method which used color information.