• Title/Summary/Keyword: Image Pattern Matching

Search Result 225, Processing Time 0.03 seconds

The Estimation of the Transform Parameters Using the Pattern Matching with 2D Images (2차원 영상에서 패턴매칭을 이용한 3차원 물체의 변환정보 추정)

  • 조택동;이호영;양상민
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.7
    • /
    • pp.83-91
    • /
    • 2004
  • The determination of camera position and orientation from known correspondences of 3D reference points and their images is known as pose estimation in computer vision or space resection in photogrammetry. This paper discusses estimation of transform parameters using the pattern matching method with 2D images only. In general, the 3D reference points or lines are needed to find out the 3D transform parameters, but this method is applied without the 3D reference points or lines. It uses only two images to find out the transform parameters between two image. The algorithm is simulated using Visual C++ on Windows 98.

The Faulty Detection of COG Using Image Registration (이미지 정합을 이용한 COG 불량 검출)

  • JOO KISEE;Jeong Jong-Myeon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.2
    • /
    • pp.308-314
    • /
    • 2006
  • A line scan camera is applied to enhance COG(Chip On Glass) inspection accuracy to be measured a few micro unit. The foreign substance detection among various faulty factors has been the most difficult technology in the faulty automatic inspection step since COG pattern is very miniature and complexity. In this paper, we proposed two step area segmentation template matching method to increase matching speed. Futhermore to detect foreign substance(such as dust, scratch) with a few micro unit, the new method using gradient mask and AND operation was proposed. The proposed 2 step template matching method increased 0.3 - 0.4 second matching speed compared with conventional correlation coefficient. Also, the proposed foreign substance applied masks enhanced $5-8\%$ faulty detection rate compared with conventional no mask application method.

Matching Algorithm for PCB Inspection Using Vision System (Vision System을 이용한 PCB 검사 매칭 알고리즘)

  • An, Eung-Seop;Jang, Il-Young;Lee, Jae-Kang;Kim, Il-Hwan
    • Journal of Industrial Technology
    • /
    • v.21 no.B
    • /
    • pp.67-74
    • /
    • 2001
  • According as the patterns of PCB (Printed Circuit Board) become denser and complicated, quality and accuracy of PCB influence the performance of final product. It's attempted to obtain trust of 100% about all of parts. Because human inspection in mass-production manufacturing facilities are both time-consuming and very expensive, the automation of visual inspection has been attempted for many years. Thus, automatic visual inspection of PCB is required. In this paper, we used an algorithm which compares the reference PCB patterns and the input PCB patterns are separated an object and a scene by filtering and edge detection. And than compare two image using pattern matching algorithm. We suggest an defect inspection algorithm in PCB pattern, to be satisfied low cost, high speed, high performance and flexibility on the basis of $640{\times}480$ binary pattern.

  • PDF

A Novel Cryptosystem Based on Steganography and Automata Technique for Searchable Encryption

  • Truong, Nguyen Huy
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.2258-2274
    • /
    • 2020
  • In this paper we first propose a new cryptosystem based on our data hiding scheme (2,9,8) introduced in 2019 with high security, where encrypting and hiding are done at once, the ciphertext does not depend on the input image size as existing hybrid techniques of cryptography and steganography. We then exploit our automata approach presented in 2019 to design two algorithms for exact and approximate pattern matching on secret data encrypted by our cryptosystem. Theoretical analyses remark that these algorithms both have O(n) time complexity in the worst case, where for the approximate algorithm, we assume that it uses ⌈(1-ε)m)⌉ processors, where ε, m and n are the error of our string similarity measure and lengths of the pattern and secret data, respectively. In searchable encryption, our cryptosystem is used by users and our pattern matching algorithms are performed by cloud providers.

Indoor Location Positioning System for Image Recognition based LBS (영상인식 기반의 위치기반서비스를 위한 실내위치인식 시스템)

  • Kim, Jong-Bae
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.2
    • /
    • pp.49-62
    • /
    • 2008
  • This paper proposes an indoor location positioning system for the image recognition based LBS. The proposed system is a vision-based location positioning system that is implemented the augmented reality by overlaying the location results with the view of the user. For implementing, the proposed system uses the pattern matching and location model to recognize user location from images taken by a wearable mobile PC with camera. In the proposed system, the system uses the pattern matching and location model for recognizing a personal location in image sequences. The system is estimated user location by the image sequence matching and marker detection methods, and is recognized user location by using the pre-defined location model. To detect marker in image sequences, the proposed system apply to the adaptive thresholding method, and by using the location model to recognize a location, the system can be obtained more accurate and efficient results. Experimental results show that the proposed system has both quality and performance to be used as an indoor location-based services(LBS) for visitors in various environments.

  • PDF

An Improved LBP-based Facial Expression Recognition through Optimization of Block Weights (블록가중치의 최적화를 통해 개선된 LBP기반의 표정인식)

  • Park, Seong-Chun;Koo, Ja-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.73-79
    • /
    • 2009
  • In this paper, a method is proposed that enhances the performance of the facial expression recognition using template matching of Local Binary Pattern(LBP) histogram. In this method, the face image is segmented into blocks, and the LBP histogram is constructed to be used as the feature of the block. Block dissimilarity is calculated between a block of input image and the corresponding block of the model image. Image dissimilarity is defined as the weighted sum of the block dissimilarities. In conventional methods, the block weights are assigned by intuition. In this paper a new method is proposed that optimizes the weights from training samples. An experiment shows the recognition rate is enhanced by the proposed method.

Probabilistic localization of the service robot by mapmatching algorithm

  • Lee, Dong-Heui;Woojin Chung;Kim, Munsang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.92.3-92
    • /
    • 2002
  • A lot of localization algorithms have been developed in order to achieve autonomous navigation. However, most of localization algorithms are restricted to certain conditions. In this paper, Monte Carlo localization scheme with a map-matching algorithm is suggested as a robust localization method for the Public Service Robot to accomplish its tasks autonomously. Monte Carlo localization can be applied to local, global and kidnapping localization problems. A range image based measure function and a geometric pattern matching measure function are applied for map matching algorithm. This map matching method can be applied to both polygonal environments and un-polygonal environments and achieves...

  • PDF

Two-Stage Template Matching Using Integral Projection (가상 투영법을 사용한 Two-Stage Template Matching)

  • Kim, Geun Hyung;Park, Rae Hong
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.2
    • /
    • pp.324-330
    • /
    • 1987
  • The registration is an important part of image processing and pattern recognition. In this paper, the integral projection method is proposed as the first stage of the two-stage template matching. The computation time of the proposed method is one-tenth of that of the two-stage template matching technique with a sub-template. This method is applied to a noisy (real)image with a different bias level and gives a correct template position, while the two-stage template matching technique with a sub-template cannot detect correctly.

  • PDF

A Study of Electrical and Optical Method of Safety Standards for diagnosis of Power Facility using UV-IR Camera (UV-IR 카메라를 이용한 전력설비 진단을 위한 전기 및 광학적 안전 기준 설정 연구)

  • Kim, Young-Seok;Kim, Chong-Min;Choi, Myeong-Il;Bang, Sun-Bae;Shong, Kil-Mok;Kwag, Dong-Soon
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.27 no.4
    • /
    • pp.54-61
    • /
    • 2013
  • UV-IR camera is being used for predictive maintenance of high voltage equipment together with measurement of temperature on localized heat and corona discharge. This paper was suggested the judgement method that is the discharge count, UV image pattern and discharge matching rate to apply the UV-IR camera on power facility. The discharge count method is counted by UV image pixel value. the UV image pattern method is determined by the UV image shape using neural network algorithm method, separated by Sunflower, Jellyfish, Ameba. The UV discharge matching is compare the breakdown the UV image size and measuring UV image size according to distance.

A Fast Block Matching Algorithm by using the Cross Pattern and Flat-Hexagonal Search Pattern (크로스 패턴과 납작한 육각 탐색패턴을 이용한 고속 블록 정합 알고리즘)

  • 남현우;김종경
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.12
    • /
    • pp.953-964
    • /
    • 2003
  • In the 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 quality. In this paper, we propose a new fast block matching algorithm using the cross pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the cross pattern, and then lastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed cross pattern and flat-hexagonal pattern search algorithm(CFHPS ) improves about 0.2-6.2% in terms of average number of search point per motion vector estimation and improves about 0.02-0.31dB in terms of PSNR(Peak Signal to Noise Ratio).

  • PDF