• Title/Summary/Keyword: edge-detection algorithm

Search Result 678, Processing Time 0.027 seconds

UAV-based bridge crack discovery via deep learning and tensor voting

  • Xiong Peng;Bingxu Duan;Kun Zhou;Xingu Zhong;Qianxi Li;Chao Zhao
    • Smart Structures and Systems
    • /
    • v.33 no.2
    • /
    • pp.105-118
    • /
    • 2024
  • In order to realize tiny bridge crack discovery by UAV-based machine vision, a novel method combining deep learning and tensor voting is proposed. Firstly, the grid images of crack are detected and descripted based on SE-ResNet50 to generate feature points. Then, the probability significance map of crack image is calculated by tensor voting with feature points, which can define the direction and region of crack. Further, the crack detection anchor box is formed by non-maximum suppression from the probability significance map, which can improve the robustness of tiny crack detection. Finally, a case study is carried out to demonstrate the effectiveness of the proposed method in the Xiangjiang-River bridge inspection. Compared with the original tensor voting algorithm, the proposed method has higher accuracy in the situation of only 1-2 pixels width crack and the existence of edge blur, crack discontinuity, which is suitable for UAV-based bridge crack discovery.

Invariant Image Matching using Linear Features (선형특징을 사용한 불변 영상정합 기법)

  • Park, Se-Je;Park, Young-Tae
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.55-62
    • /
    • 1998
  • Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching, using linear features, is presented. Scene or model images are described by a set of linear features approximating edge information, which can be obtained by the conventional edge detection, thinning, and piecewise linear approximation. A set of candidate parameters are hypothesized by mapping the angular difference and a new distance measure to the Hough space and by detecting maximally consistent points. These hypotheses are verified by a fast linear feature matching algorithm composed of a single-step relaxation and a Hough technique. The proposed method is shown to be much faster than the conventional one where the relaxation process is repeated until convergence, while providing matching performance robust to the random alteration of the linear features, without a priori information on the geometrical transformation parameters.

  • PDF

High Resolution Satellite Image Segmentation Algorithm Development Using Seed-based region growing (시드 기반 영역확장기법을 이용한 고해상도 위성영상 분할기법 개발)

  • Byun, Young-Gi;Kim, Yong-Il
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.28 no.4
    • /
    • pp.421-430
    • /
    • 2010
  • Image segmentation technique is becoming increasingly important in the field of remote sensing image analysis in areas such as object oriented image classification to extract object regions of interest within images. This paper presents a new method for image segmentation in High Resolution Remote Sensing Image based on Improved Seeded Region Growing (ISRG) and Region merging. Firstly, multi-spectral edge detection was done using an entropy operator in pan-sharpened QuickBird imagery. Then, the initial seeds were automatically selected from the obtained multi-spectral edge map. After automatic selection of significant seeds, an initial segmentation was achieved by applying ISRG to consider spectral and edge information. Finally the region merging process, integrating region texture and spectral information, was carried out to get the final segmentation result. The accuracy assesment was done using the unsupervised objective evaluation method for evaluating the effectiveness of the proposed method. Experimental results demonstrated that the proposed method has good potential for application in the segmentation of high resolution satellite images.

Efficient Image Segmentation Using Morphological Watershed Algorithm (형태학적 워터쉐드 알고리즘을 이용한 효율적인 영상분할)

  • Kim, Young-Woo;Lim, Jae-Young;Lee, Won-Yeol;Kim, Se-Yun;Lim, Dong-Hoon
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.4
    • /
    • pp.709-721
    • /
    • 2009
  • This paper discusses an efficient image segmentation using morphological watershed algorithm that is robust to noise. Morphological image segmentation consists of four steps: image simplification, computation of gradient image and watershed algorithm and region merging. Conventional watershed segmentation exhibits a serious weakness for over-segmentation of images. In this paper we present a morphological edge detection methods for detecting edges under noisy condition and apply our watershed algorithm to the resulting gradient images and merge regions using Kolmogorov-Smirnov test for eliminating irrelevant regions in the resulting segmented images. Experimental results are analyzed in both qualitative analysis through visual inspection and quantitative analysis with percentage error as well as computational time needed to segment images. The proposed algorithm can efficiently improve segmentation accuracy and significantly reduce the speed of computational time.

APBT-JPEG Image Coding Based on GPU

  • Wang, Chengyou;Shan, Rongyang;Zhou, Xiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1457-1470
    • /
    • 2015
  • In wireless multimedia sensor networks (WMSN), the latency of transmission is an increasingly problem. With the improvement of resolution, the time cost in image and video compression is more and more, which seriously affects the real-time of WMSN. In JPEG system, the core of the system is DCT, but DCT-JPEG is not the best choice. Block-based DCT transform coding has serious blocking artifacts when the image is highly compressed at low bit rates. APBT is used in this paper to solve that problem, but APBT does not have a fast algorithm. In this paper, we analyze the structure in JPEG and propose a parallel framework to speed up the algorithm of JPEG on GPU. And we use all phase biorthogonal transform (APBT) to replace the discrete cosine transform (DCT) for the better performance of reconstructed image. Therefore, parallel APBT-JPEG is proposed to solve the real-time of WMSN and the blocking artifacts in DCT-JPEG in this paper. We use the CUDA toolkit based on GPU which is released by NVIDIA to design the parallel algorithm of APBT-JPEG. Experimental results show that the maximum speedup ratio of parallel algorithm of APBT-JPEG can reach more than 100 times with a very low version GPU, compared with conventional serial APBT-JPEG. And the reconstructed image using the proposed algorithm has better performance than the DCT-JPEG in terms of objective quality and subjective effect. The proposed parallel algorithm based on GPU of APBT also can be used in image compression, video compression, the edge detection and some other fields of image processing.

Development of Path-Finding System for Humanoid Robots Based on Image Pattern Recognition (패턴 인식 알고리즘 기반 휴머노이드 경로 시스템 개발)

  • Park, Hyun;Eun, Jin-Hyuk;Park, Hae-Ryeon;Suk, Jung Bong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.10
    • /
    • pp.925-932
    • /
    • 2012
  • In this paper, we develop a pattern recognition algorithm applied to a humanoid robot which is exploited as a guide for visually handicapped persons to find a desired path to their destinations. Behavior primitives of a humanoid robot are defined, and Canny's edge detection algorithm is employed to extract the pattern and color of the paving blocks that especially devised for visually handicapped persons. Based on these, an efficient path finding algorithm is developed and implemented on a humanoid robot, running on an embedded linux operating system equipped with a video camera. The performance of our algorithm is experimentally examined in terms of the response time and the pattern recognition ratio. In order to validate our algorithm in various realistic environments, the experiments are repeatedly performed by changing the tilt of paving blocks and the brightness in surrounding area. The results show that our algorithm performs sufficiently well to be exploited as a path finding system for visually handicapped persons.

Detection of Tongue Area using Active Contour Model (능동 윤곽선 모델을 이용한 혀 영역의 검출)

  • Han, Young-Hwan
    • Journal of rehabilitation welfare engineering & assistive technology
    • /
    • v.10 no.2
    • /
    • pp.141-146
    • /
    • 2016
  • In this paper, we apply limited area mask operation and active contour model to accurately detect tongue area outline in tongue diagnosis system. To accurately analyze the properties of the tongue, first, the tongue area to be detected. Therefore an effective segmentation method for detecting the edge of tongue is very important. It experimented with tongue image DB consists of 20~30 students 30 people. Experiments on real tongue image show the good performance of this method. Experimental results show that the proposed method extracts object boundaries more accurately than existing methods without mask operation.

Recovery of the connection relationship among planar objects

  • Yao, Fenghui;Shao, Guifeng;T amaki, Akikazu;Kato, Kiyoshi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.430-433
    • /
    • 1996
  • The shape of an object plays a very important role in pattern analysis and classification. Roughly, the researches on this topic can be classified into three fields, i.e. (i) edge detection, (ii) dominant points extraction, and (iii) shape recognition and classification. Many works have been done in these three fields. However, it is very seldom to see the research that discusses the connection relationship of objects. This problem is very important in robot assembly systems. Therefore, here we focus on this problem and discuss how to recover the connection relationship of planar objects. Our method is based on the partial curve identification algorithm. The experiment results show the efficiency and validity of this method.

  • PDF

Harmful Pornographic Detection Algorithm Using High and Low Quality Image Division (고.저화질 영상 분류를 이용한 유해 영상 검출)

  • Chung, Myoung-Beom;Kim, Jae-Kyung;Jang, Dae-Sik;Ko, Il-Ju
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2009.01a
    • /
    • pp.223-226
    • /
    • 2009
  • 유해 영상 검출은 유해 동영상을 내용 기반으로 검색하고 차단하기 위한 방법의 하나로써, 유해 동영상 추적 시스템의 전체 성능을 좌우하는 중요한 기술이다. 기존의 유해 영상 검출은 웹 사이트 내에 음란 콘텐츠를 추출함으로 유해 사이트를 차단하는데 사용되었으며, 주로 RGB 비율, Histogram 등을 이용한 Skin color와 Edge를 추적한 Texture를 기반으로 유해 영상을 검출하였다. 그러나 기존 방식은 UCC 유해 동영상과 같이 저화질 영상에서의 유해 여부를 판단하기에는 정확성이 낮다. 따라서 본 논문에서는 영상 크기에 따른 고/저화질 분류를 이용하여 동영상에서 보다 효과적인 유해 영상 검출할 수 있는 방법을 제안한다. 제안 방법의 성능을 확인하기 위해 고/저화질 분류 사용의 유/무에 따른 검출 실험을 하였으며, 그 결과 분류를 방법이 기존 방법보다 12%의 성능이 향상됨을 알 수 있었다.

  • PDF

Reverse Engineering for Sculptured Surfaces by Using NURBS Approximation (역공학(Reverse Engineering)을 위한 자유곡면 형상의 NURBS Approximation)

  • Cho, Jae-Hyung;Cho, Myung-Woo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.8
    • /
    • pp.108-115
    • /
    • 2002
  • In measuring step for reverse engineering of sculptured surfaces, computer vision system is used to simplify the complicated surface by boundary edge detection method that minimizes the measuring error. The measured data by Coordinate measuring machine is clouded data points of surfaces which is segmented surface using image process. In this research, the measured data is approximated as NURBS surfaces by new suggested algorithm. The position and number of control points, selection of parametric values and compensation of weight factors are proposed. Finally, surface model is simulated and improved resulting performance is obtained.