• Title/Summary/Keyword: 에지 교차

Search Result 30, Processing Time 0.023 seconds

Precise Measurement of the Steel Box Girder Using Industrial Photogrammetry Method (산업사진측량 기법에 의한 교랑 강박스거더 정밀측정)

  • Jung Sung Heuk;Lee Jae Kee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.23 no.1
    • /
    • pp.69-76
    • /
    • 2005
  • The purpose of this study was to establish the accuracy of the industrial photogrammetry system constructed with INCA2 metric camera and V-STARS system on steel box girder measurement under industrial measurement condition. The objective of the measurement was to determine the distances of plane to plane or plane to libs, precise positions of the bolt holes and angles of the plane to plane on the steel box girder using coded targets, tape targets, edge targets and target adapters. The measurement undertaken has shown that industrial photogrammetry method were a very accurate and more importantly were produced quickly to measure the steel box girder.

A Stud on the Self Healing Characteristics of MPPF by Voids (보이드에 의한 MPPF의 셀프힐링 특성 연구)

  • 박하용;곽희로
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.14 no.4
    • /
    • pp.77-82
    • /
    • 2000
  • This paper describes the self healing characteristics of a metalized polypropylene film(MPPF) by voids under a.c condition. PDIVs were increased with the number of pre-self healing due to void defects, and several pre-self healing events took place at lower voltage than the critical breakdown voltage of a PPF. Self healing mainly occurred at pin tips, wrinkle sides, and cross points of wrinkles, and the main self healing voltage was increased with PPF thickness. The burn out area at self healing was increased with the applied voltage, and the peak currents in a grounding conductor at self healing was also increased with the applied voltage.

  • PDF

Design of a Dual-fed Microstrip Patch Antenna (이중급전 마이크로스트립 패치 안테나 설계)

  • Lee, Jong-Ig;Yeo, Junho;Kim, Gun-kyun;Rhee, Seung-Yeop
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.79-80
    • /
    • 2016
  • In this paper, we considered a design method for a microstrip patch antenna fed through two radiating edges by two feeding microstrip lines. Two feedlines are made to have a phase difference of 180 degree with each other in order to reduce cross-polarization level radiated from the antenna. The operation principle and design procedure for the considered antenna are explained using equivalent circuits. In order to check the validity of this study, the results for reflection coefficients of the antenna obtained by the proposed equivalent circuit method and the simulation using commercial antenna design tool are compared with each other.

  • PDF

A Robust License Plate Extraction Method for Low Quality Images (저화질 영상에서 강건한 번호판 추출 방법)

  • Lee, Yong-Woo;Kim, Hyun-Soo;Kang, Woo-Yun;Kim, Gyeong-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.2
    • /
    • pp.8-17
    • /
    • 2008
  • This paper proposes a robust license plate extraction method from images taken under unconstrained environments. Utilization of the color and the edge information in complementary fashion makes the proposed method deal with not only various lighting conditions, hilt blocking artifacts frequently observed in compressed images. Computational complexity is significantly reduced by applying Hough transform to estimate the skew angle, and subsequent do-skewing procedure only to the candidate regions. The true plate region is determined from the candidates under examination using clues including the aspect ratio, the number of zero crossings from vertical scan lines, and the number of connected components. The performance of the proposed method is evaluated using compressed images collected under various realistic circumstances. The experimental results show 94.9% of correct license plate extraction rate.

Path-finding Algorithm using Heuristic-based Genetic Algorithm (휴리스틱 기반의 유전 알고리즘을 활용한 경로 탐색 알고리즘)

  • Ko, Jung-Woon;Lee, Dong-Yeop
    • Journal of Korea Game Society
    • /
    • v.17 no.5
    • /
    • pp.123-132
    • /
    • 2017
  • The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

A Minimun-diameter Spanning Tree with Bounded Degrees (제한된 분지수를 가지는 최소지름 신장트리)

  • 안희갑;신찬수
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.78-85
    • /
    • 2004
  • Given a set S of n points in the plane, a minimum-diameter spanning tree(MDST) for the set might have a degree up to n-1. This might cause the degradation of the network performance because the node with high degree should handle much more requests than others relatively. Thus it is important to construct a spanning tree network with small degree and diameter. This paper presents an algorithm to construct a spanning tree for S satisfying the following four conditions: (1) the degree is controled as an input, (2) the tree diameter is no more than constant times the diameter of MDST, (3) the tree is monotone (even if arbitrary point is fixed as a root of the tree) in the sense that the Euclidean distance from the root to any node on the path to any leaf node is not decreasing, and (4) there are no crossings between edges of the tree. The monotone property will play a role as an aesthetic criterion in visualizing the tree in the plane.

A Bayesian Sampling Algorithm for Evolving Random Hypergraph Models Representing Higher-Order Correlations (고차상관관계를 표현하는 랜덤 하이퍼그래프 모델 진화를 위한 베이지안 샘플링 알고리즘)

  • Lee, Si-Eun;Lee, In-Hee;Zhang, Byoung-Tak
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.3
    • /
    • pp.208-216
    • /
    • 2009
  • A number of estimation of distribution algorithms have been proposed that do not use explicitly crossover and mutation of traditional genetic algorithms, but estimate the distribution of population for more efficient search. But because it is not easy to discover higher-order correlations of variables, lower-order correlations are estimated most cases under various constraints. In this paper, we propose a new estimation of distribution algorithm that represents higher-order correlations of the data and finds global optimum more efficiently. The proposed algorithm represents the higher-order correlations among variables by building random hypergraph model composed of hyperedges consisting of variables which are expected to be correlated, and generates the next population by Bayesian sampling algorithm Experimental results show that the proposed algorithm can find global optimum and outperforms the simple genetic algorithm and BOA(Bayesian Optimization Algorithm) on decomposable functions with deceptive building blocks.

Automated Areal Feature Matching in Different Spatial Data-sets (이종의 공간 데이터 셋의 면 객체 자동 매칭 방법)

  • Kim, Ji Young;Lee, Jae Bin
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.89-98
    • /
    • 2016
  • In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

Emotion-based Video Scene Retrieval using Interactive Genetic Algorithm (대화형 유전자 알고리즘을 이용한 감성기반 비디오 장면 검색)

  • Yoo Hun-Woo;Cho Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.6
    • /
    • pp.514-528
    • /
    • 2004
  • An emotion-based video scene retrieval algorithm is proposed in this paper. First, abrupt/gradual shot boundaries are detected in the video clip representing a specific story Then, five video features such as 'average color histogram' 'average brightness', 'average edge histogram', 'average shot duration', and 'gradual change rate' are extracted from each of the videos and mapping between these features and the emotional space that user has in mind is achieved by an interactive genetic algorithm. Once the proposed algorithm has selected videos that contain the corresponding emotion from initial population of videos, feature vectors from the selected videos are regarded as chromosomes and a genetic crossover is applied over them. Next, new chromosomes after crossover and feature vectors in the database videos are compared based on the similarity function to obtain the most similar videos as solutions of the next generation. By iterating above procedures, new population of videos that user has in mind are retrieved. In order to show the validity of the proposed method, six example categories such as 'action', 'excitement', 'suspense', 'quietness', 'relaxation', 'happiness' are used as emotions for experiments. Over 300 commercial videos, retrieval results show 70% effectiveness in average.

A Road Luminance Measurement Application based on Android (안드로이드 기반의 도로 밝기 측정 어플리케이션 구현)

  • Choi, Young-Hwan;Kim, Hongrae;Hong, Min
    • Journal of Internet Computing and Services
    • /
    • v.16 no.2
    • /
    • pp.49-55
    • /
    • 2015
  • According to the statistics of traffic accidents over recent 5 years, traffic accidents during the night times happened more than the day times. There are various causes to occur traffic accidents and the one of the major causes is inappropriate or missing street lights that make driver's sight confused and causes the traffic accidents. In this paper, with smartphones, we designed and implemented a lane luminance measurement application which stores the information of driver's location, driving, and lane luminance into database in real time to figure out the inappropriate street light facilities and the area that does not have any street lights. This application is implemented under Native C/C++ environment using android NDK and it improves the operation speed than code written in Java or other languages. To measure the luminance of road, the input image with RGB color space is converted to image with YCbCr color space and Y value returns the luminance of road. The application detects the road lane and calculates the road lane luminance into the database sever. Also this application receives the road video image using smart phone's camera and improves the computational cost by allocating the ROI(Region of interest) of input images. The ROI of image is converted to Grayscale image and then applied the canny edge detector to extract the outline of lanes. After that, we applied hough line transform method to achieve the candidated lane group. The both sides of lane is selected by lane detection algorithm that utilizes the gradient of candidated lanes. When the both lanes of road are detected, we set up a triangle area with a height 20 pixels down from intersection of lanes and the luminance of road is estimated from this triangle area. Y value is calculated from the extracted each R, G, B value of pixels in the triangle. The average Y value of pixels is ranged between from 0 to 100 value to inform a luminance of road and each pixel values are represented with color between black and green. We store car location using smartphone's GPS sensor into the database server after analyzing the road lane video image with luminance of road about 60 meters ahead by wireless communication every 10 minutes. We expect that those collected road luminance information can warn drivers about safe driving or effectively improve the renovation plans of road luminance management.