• Title/Summary/Keyword: 에지정의

Search Result 103, Processing Time 0.019 seconds

Detection of Entry/Exit Zones for Visual Surveillance System using Graph Theoretic Clustering (그래프 이론 기반의 클러스터링을 이용한 영상 감시 시스템 시야 내의 출입 영역 검출)

  • Woo, Ha-Yong;Kim, Gyeong-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.46 no.6
    • /
    • pp.1-8
    • /
    • 2009
  • Detecting entry and exit zones in a view covered by multiple cameras is an essential step to determine the topology of the camera setup, which is critical for achieving and sustaining the accuracy and efficiency of multi-camera surveillance system. In this paper, a graph theoretic clustering method is proposed to detect zones using data points which correspond to entry and exit events of objects in the camera view. The minimum spanning tree (MST) is constructed by associating the data points. Then a set of well-formed clusters is sought by removing inconsistent edges of the MST, based on the concepts of the cluster balance and the cluster density defined in the paper. Experimental results suggest that the proposed method is effective, even for sparsely elongated clusters which could be problematic for expectation-maximization (EM). In addition, comparing to the EM-based approaches, the number of data required to obtain stable outcome is relatively small, hence shorter learning period.

A 2D FLIR Image-based 3D Target Recognition using Degree of Reliability of Contour (윤곽선의 신뢰도를 고려한 2차원 적외선 영상 기반의 3차원 목표물 인식 기법)

  • 이훈철;이청우;배성준;이광연;김성대
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2359-2368
    • /
    • 1999
  • In this paper we propose a 2D FLIR image-based 3D target recognition system which performs group-to-ground vehicle recognition using the target contour and its degree of reliability extracted from FLIR image. First we extract target from background in FLIR image. Then we define contour points of the extracted target which have high edge gradient magnitude and brightness value as reliable contour point and make reliable contour by grouping all reliable contour points. After that we extract corresponding reliable contours from model contour image and perform comparison between scene and model features which are calculated by DST(discrete sine transform) of reliable contours. Experiment shows that the proposed algorithm work well and even in case of imperfect target extraction it showed better performance then conventional 2D contour-based matching algorithms.

  • PDF

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.

An XML Access Control Method through Filtering XPath Expressions (XPath 표현식의 필터링을 통한 XML 접근 제어 기법)

  • Jeon Jae-myeong;Chung Yon Dohn;Kim Myoung Ho;Lee Yoon Joon
    • Journal of KIISE:Databases
    • /
    • v.32 no.2
    • /
    • pp.193-203
    • /
    • 2005
  • XML (extensible Markup Language) is recognized as a standard of data representation and transmission on Internet. XPath is a standard for specifying parts of XML documents anda suitable language for both query processing and access control of XML. In this paper, we use the XPath expression for representing user queries and access control for XML. And we propose an access control method for XML, where we control accesses to XML documents by filtering query XPath expressions through access control XPath expressions. In the proposed method, we directly search XACT (XML Access Control Tree) for a query XPath expression and extract the access-granted parts. The XACT is our proposedstructure, where the edges are structural summary of XML elements and the nodes contain access-control information. We show the query XPath expressions are successfully filtered through the XACT by our proposed method, and also show the performance improvement by comparing the proposed method with the previous work.

Privilege Management Technique for Unreliable Network Environments based on Tree Structure (신뢰도가 낮은 네트워크 환경을 위한 트리 구조 기반의 권한 관리 기법)

  • Yang, Soo-Mi
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.5
    • /
    • pp.83-91
    • /
    • 2008
  • IISO/IEC 9594-8 defines the public key framework and attribute certificate framework. Attribute certificate framework deals with privilege management infrastructure(PMI). In PMI, for privilege management using attribute certificates, role assignment certificates and role specification certificates are used to assign and specify privileges independently. Role specification certificates includes privilege specifications and the details far privilege management of network environments. Privilege management of unreliable network environment tries to enhance the reliability and efficiency of privilege information transmission forwarding over unreliable routes in the presence of potentially faulty nodes and edges. Each node forms a role specification tree based on role specification relationship data collected from the network. In this paper privilege management cost with the role specification certificates tree structure is evaluated trying to reduce the overhead incurred by role creation and modification of privileges. The multicasting of packets are used for scalability. We establish management cost model taking into account the packet loss and node reliability which continuously join and leave for network. We present quantitative results which demonstrate the effectiveness of the proposed privilege management scheme.

Automatic analysis of golf swing from single-camera video sequences (단일 카메라 영상으로부터 골프 스윙의 자동 분석)

  • Kim, Pyeoung-Kee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.5
    • /
    • pp.139-148
    • /
    • 2009
  • In this paper, I propose an automatic analysis method of golf swine from single-camera video sequences. I define necessary swing features for automatic swing analysis in 2-dimensional environment and present efficient swing analysis methods using various image processing techniques including line and edge detection. The proposed method has two characteristics compared with previous swing analysis systems and related studies. First, the proposed method enables an automatic swing analysis in 2-dimension while previous systems require 3-dimensional environment which is relatively complex and expensive to run. Second, swing analysis is done automatically without human intervention while other 2-dimensional systems necessarily need analysis by a golf expert. I tested the method on 20 swing video sequences and found the proposed method works effective for automatic analysis of golf swing.

Extended Snake Algorithm Using Color Variance Energy (컬러 분산 에너지를 이용한 확장 스네이크 알고리즘)

  • Lee, Seung-Tae;Han, Young-Joon;Hahn, Hern-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.10
    • /
    • pp.83-92
    • /
    • 2009
  • In this paper, an extended snake algorithm using color variance energy is proposed for segmenting an interest object in color image. General snake algorithm makes use of energy in image to segment images into a interesting area and background. There are many kinds of energy that can be used by the snake algorithm. The efficiency of the snake algorithm is depend on what kind of energy is used. A general snake algorithm based on active contour model uses the intensity value as an image energy that can be implemented and analyzed easily. But it is sensitive to noises because the image gradient uses a differential operator to get its image energy. And it is difficult for the general snake algorithm to be applied on the complex image background. Therefore, the proposed snake algorithm efficiently segment an interest object on the color image by adding a color variance of the segmented area to the image energy. This paper executed various experiments to segment an interest object on color images with simple or complex background for verifying the performance of the proposed extended snake algorithm. It shows improved accuracy performance about 12.42 %.

Automatic Boundary Detection of Carotid Intima-Media based on Multiresolution Snake (다해상도 스네이크를 통한 경동맥 내막-중막 경계선 자동추출)

  • Lee, Yu-Bu;Choi, Yoo-Joo;Kim, Myoung-Hee
    • The KIPS Transactions:PartA
    • /
    • v.14A no.2
    • /
    • pp.77-84
    • /
    • 2007
  • The intima media thickness(IMT) of the carotid artery from B mode ultrasound images has recently been proposed as the most useful index of individual atherosclerosis and can be used to predict major cardiovascular events. Ultrasonic measurements of the IMT are conventionally obtained by manually tracing interfaces between tissue layers. The drawbacks of this method are the inter and intra observer variability and its inefficiency. In this paper, we present a multiresolution snake method combined with the dynamic programming, which overcomes the various noises and sensitivity to initialization of conventional snake. First, an image pyramid is constructed using the Gaussian pyramid that maintains global edge information with smoothing in the images, and then the boundaries are automatically detected in the lowest resolution level by minimizing a cost function based on dynamic programming. The cost function includes cost terms which are representing image features and geometrical continuity of the vessel interfaces. Since the detected boundaries are selected as initial contour of the snake for the next level, this automated approach solves the problem of the initialization. Moreover, the proposed snake improves the problem of converging th the local minima by defining the external energy based on multiple image features. In this paper, our method has been validated by computing the correlation between manual and automatic measurements. This automated detection method has obtained more accurate and reproducible results than conventional edge detection by considering multiple image features.

Scene Text Extraction in Natural Images using Hierarchical Feature Combination and Verification (계층적 특징 결합 및 검증을 이용한 자연이미지에서의 장면 텍스트 추출)

  • 최영우;김길천;송영자;배경숙;조연희;노명철;이성환;변혜란
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.420-438
    • /
    • 2004
  • Artificially or naturally contained texts in the natural images have significant and detailed information about the scenes. If we develop a method that can extract and recognize those texts in real-time, the method can be applied to many important applications. In this paper, we suggest a new method that extracts the text areas in the natural images using the low-level image features of color continuity. gray-level variation and color valiance and that verifies the extracted candidate regions by using the high-level text feature such as stroke. And the two level features are combined hierarchically. The color continuity is used since most of the characters in the same text lesion have the same color, and the gray-level variation is used since the text strokes are distinctive in their gray-values to the background. Also, the color variance is used since the text strokes are distinctive in their gray-values to the background, and this value is more sensitive than the gray-level variations. The text level stroke features are extracted using a multi-resolution wavelet transforms on the local image areas and the feature vectors are input to a SVM(Support Vector Machine) classifier for the verification. We have tested the proposed method using various kinds of the natural images and have confirmed that the extraction rates are very high even in complex background images.

Contour Extraction Method using p-Snake with Prototype Energy (원형에너지가 추가된 p-Snake를 이용한 윤곽선 추출 기법)

  • Oh, Seung-Taek;Jun, Byung-Hwan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.101-109
    • /
    • 2014
  • It is an essential element for the establishment of image processing related systems to find the exact contour from the image of an arbitrary object. In particular, if a vision system is established to inspect the products in the automated production process, it is very important to detect the contours for standardized shapes such lines and curves. In this paper, we propose a prototype adaptive dynamic contour model, p-Snake with improved contour extraction algorithms by adding the prototype energy. The proposed method is to find the initial contour by applying the existing Snake algorithm after Sobel operation is performed for prototype analysis. Next, the final contour of the object is detected by analyzing prototypes such as lines and circles, defining prototype energy and using it as an additional energy item in the existing Snake function on the basis of information on initial contour. We performed experiments on 340 images obtained by using an environment that duplicated the background of an industrial site. It was found that even if objects are not clearly distinguished from the background due to noise and lighting or the edges being insufficiently visible in the images, the contour can be extracted. In addition, in the case of similarity which is the measure representing how much it matches the prototype, the prototype similarity of contour extracted from the proposed p-ACM is superior to that of ACM by 9.85%.