• Title/Summary/Keyword: point pattern matching

Search Result 97, Processing Time 0.022 seconds

Prototypical Eye Shape Classification to Solve Life-and-Death Problem in Go, using Monte-Carlo Method and Point Pattern Matching (몬테카를로 방법과 점 패턴 매칭을 활용한 바둑에서의 사활문제 해결을 위한 원형 안형의 분류)

  • Lee, Byung-Doo
    • Journal of Korea Game Society
    • /
    • v.21 no.6
    • /
    • pp.31-40
    • /
    • 2021
  • Go has a history of more than 2,500 years, and the life-and-death problems in Go is a fundamental problem domain that must be solved when implementing a computer Go. We attempted to determine the numbers of prototypical eye shapes with 3, 4, 5, and 6 eyes that are directly related to the life-and-death problems, and to classify the prototypical eye shapes represented in 4-tuple forms. Experiment was conducted by Monte-Carlo method and point pattern matching. According to the experimental results, the numbers of prototypical eye shapes were 2 for 3-eye, 5 for 4-eye, 12 for 5-eye, and 35 for 6-eye shapes. Further, using a 4-tuple form, we classified prototypical eye shapes into 1 for 3-eye, 3 for 4-eye, 4 for 5-eye, and 8 for 6-eye shapes.

Development of an edge-based point correlation algorithm for fast and stable visual inspection system (고속 검사자동화를 위한 에지기반 점 상관 알고리즘의 개발)

  • 강동중;노태정
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.8
    • /
    • pp.640-646
    • /
    • 2003
  • We presents an edge-based point correlation algorithm for fast and stable visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties in applying automated inspection systems to real factory environment. First of all, NGC algorithms involve highly complex computation and thus require high performance hardware for realtime process. In addition, lighting condition in realistic factory environments is not stable and therefore intensity variation from uncontrolled lights gives many troubles for applying NGC directly as pattern matching algorithm. We propose an algorithm to solve these problems, using thinned and binarized edge data, which are obtained from the original image. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the computational complexity. Matching edges instead of using original gray-level image pixels overcomes problems in NGC method and pyramid of edges also provides fast and stable processing. All proposed methods are proved by the experiments using real images.

A Method to Adjust Cyclic Signal Length Using Time Invariant Feature Point Extraction and Matching(TIFEM) (시불변 특징점 추출 및 정합을 이용한 주기 신호의 길이 보정 기법)

  • Han, A-Hyang;Park, Cheong-Sool;Kim, Sung-Shick;Baek, Jun-Geol
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.111-122
    • /
    • 2010
  • In this study, a length adjustment algorithm for cyclic signals in manufacturing process using Time Invariant Feature point Extraction and Matching(TIFEM) is proposed. In order to precisely compensate the length of cyclic signals which have irregular length in the middle of signal as well as in the full length more feature points are needed. The extracted feature must involve information about the pattern of signal and should have invariant properties on time and scale. The proposed TIFEM algorithm extracts features having the intrinsic properties of the signal characteristics at first. By using those extracted features, feature vector is constructed for each time point. Among those extracted features, the only effective features are filtered and are chosen such as basis for the length adjustment. And then the partial length adjustment is performed by matching feature points. To verify the performance of the proposed algorithm, the experiments were performed with the experimental data mimicking the three kinds of signals generated from the actual semiconductor process.

A Block Matching Algorithm using Motion Vector Predictor Candidates and Adaptive Search Pattern (움직임 벡터 예측 후보들과 적응적인 탐색 패턴을 이용하는 블록 정합 알고리즘)

  • Kwak, Sung-Keun;Wee, Young-Cheul;Kim, Ha-JIne
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.247-256
    • /
    • 2004
  • In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.

Robust Fingerprint Verification By Selective Ridge Matching (선택적 융선 정합에 의한 강건한 지문 인증기법)

  • Park, Young-Tae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.5
    • /
    • pp.1-8
    • /
    • 2000
  • Point pattern matching schemes for finger print recognition do not guarantee robust matching performance for fingerprint Images of poor quality We present a finger print recognition scheme, where transformation parameters of matched ridge pairs are estimated by Hough transform and the matching hypothesis is verified by a new measure of the matching degree using selective directional information Proposed method may exhibit extremely low FAR(False accept rate) while maintaining low reject rate even for the Images of poor quality because of the robustness to the variation of minutia points.

  • PDF

Enhancement of Fall-Detection Rate using Frequency Spectrum Pattern Matching

  • Lee, Suhwan;Oh, Dongik;Nam, Yunyoung
    • Journal of Internet Computing and Services
    • /
    • v.18 no.3
    • /
    • pp.11-17
    • /
    • 2017
  • To the elderly, sudden falls are one of the most frightening accidents. If an accident occurs, a prompt action has to be taken to deal with the situation. Recently, there have been a number of attempts to detect sudden falls using acceleration sensors embedded in the mobile devices, such as smart phones and wrist-bands. However, using the sensor readings only, the detection rate of the falls is around 65%. Ordinary daily activities such as running or jumping could not be well distinguished from the falls. In this paper, we describe our attempts on improving the fall-detection rate. We implemented a wrist-band fall detection module, using a three-axis acceleration sensor. With the pattern matching on the fall signal-strength frequency spectrum, in addition to the conventional signal strength measurement, we could improve the detection rate by 9% point. Furthermore, by applying two wrist-bands in the experiment, we could further improve the detection rate to 82%.

3D geometric model generation based on a stereo vision system using random pattern projection (랜덤 패턴 투영을 이용한 스테레오 비전 시스템 기반 3차원 기하모델 생성)

  • Na, Sang-Wook;Son, Jeong-Soo;Park, Hyung-Jun
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.848-853
    • /
    • 2005
  • 3D geometric modeling of an object of interest has been intensively investigated in many fields including CAD/CAM and computer graphics. Traditionally, CAD and geometric modeling tools are widely used to create geometric models that have nearly the same shape of 3D real objects or satisfy designers intent. Recently, with the help of the reverse engineering (RE) technology, we can easily acquire 3D point data from the objects and create 3D geometric models that perfectly fit the scanned data more easily and fast. In this paper, we present 3D geometric model generation based on a stereo vision system (SVS) using random pattern projection. A triangular mesh is considered as the resulting geometric model. In order to obtain reasonable results with the SVS-based geometric model generation, we deal with many steps including camera calibration, stereo matching, scanning from multiple views, noise handling, registration, and triangular mesh generation. To acquire reliable stere matching, we project random patterns onto the object. With experiments using various random patterns, we propose several tips helpful for the quality of the results. Some examples are given to show their usefulness.

  • PDF

Image-based structural dynamic displacement measurement using different multi-object tracking algorithms

  • Ye, X.W.;Dong, C.Z.;Liu, T.
    • Smart Structures and Systems
    • /
    • v.17 no.6
    • /
    • pp.935-956
    • /
    • 2016
  • With the help of advanced image acquisition and processing technology, the vision-based measurement methods have been broadly applied to implement the structural monitoring and condition identification of civil engineering structures. Many noncontact approaches enabled by different digital image processing algorithms are developed to overcome the problems in conventional structural dynamic displacement measurement. This paper presents three kinds of image processing algorithms for structural dynamic displacement measurement, i.e., the grayscale pattern matching (GPM) algorithm, the color pattern matching (CPM) algorithm, and the mean shift tracking (MST) algorithm. A vision-based system programmed with the three image processing algorithms is developed for multi-point structural dynamic displacement measurement. The dynamic displacement time histories of multiple vision points are simultaneously measured by the vision-based system and the magnetostrictive displacement sensor (MDS) during the laboratory shaking table tests of a three-story steel frame model. The comparative analysis results indicate that the developed vision-based system exhibits excellent performance in structural dynamic displacement measurement by use of the three different image processing algorithms. The field application experiments are also carried out on an arch bridge for the measurement of displacement influence lines during the loading tests to validate the effectiveness of the vision-based system.

A Flat Hexagon-based Search Algorithm for Fast Block Matching Motion Estimation (고속 블록 정합 움직임 예측을 위한 납작한 육각 패턴 기반 탐색 알고리즘)

  • Nam, Hyeon-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.57-65
    • /
    • 2007
  • In the fast block matching algorithm. search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image qualify. In this paper, we propose a new fast block matching algorithm using the flat-hexagon search pattern that ate solved disadvantages of the diamond pattern search algorithm(DS) and the hexagon-based search algorithm(HEXBS). Our proposed algorithm finds mainly the motion vectors that not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the DS and HEXBS, the proposed f)at-hexagon search algorithm(FHS) improves about $0.4{\sim}21.3%$ in terms of average number of search point per motion vector estimation and improves about $0.009{\sim}0.531dB$ in terms of PSNR(Peak Signal to Noise Ratio).

  • PDF

A Study on Underwater Source Localization Using the Wideband Interference Pattern Matching (수중에서 광대역 간섭 패턴 정합을 이용한 음원의 위치 추정 연구)

  • Chun, Seung-Yong;Kim, Se-Young;Kim, Ki-Man
    • The Journal of the Acoustical Society of Korea
    • /
    • v.26 no.8
    • /
    • pp.415-425
    • /
    • 2007
  • This paper proposes a method of underwater source localization using the wideband interference patterns matching. By matching two interference patterns in the spectrogram, it is estimated a ratio of the range from source to sensor5, and then this ratio is applied to the Apollonius circle. The Apollonius circle is defined as the locus of all points whose distances from two fixed points are in a constant value so that it is possible to represent the locus of potential source location. The Apollonius circle alone, however still keeps the ambiguity against the correct source location. Therefore another equation is necessary to estimate the unique locus of the source location. By estimating time differences of signal arrivals between source and sensors, the hyperbola equation is used to get the cross point of the two equations, where the point being assumed to be the source position. Simulations are performed to get performances of the proposed algorithm. Also, comparisons with real sea experiment data are made to prove applicability of the algorithm in real environment. The results show that the proposed algorithm successfully estimates the source position within an error bound of 10%.