• Title/Summary/Keyword: Feature Point Matching

Search Result 196, Processing Time 0.021 seconds

Hardware Accelerated Design on Bag of Words Classification Algorithm

  • Lee, Chang-yong;Lee, Ji-yong;Lee, Yong-hwan
    • Journal of Platform Technology
    • /
    • v.6 no.4
    • /
    • pp.26-33
    • /
    • 2018
  • In this paper, we propose an image retrieval algorithm for real-time processing and design it as hardware. The proposed method is based on the classification of BoWs(Bag of Words) algorithm and proposes an image search algorithm using bit stream. K-fold cross validation is used for the verification of the algorithm. Data is classified into seven classes, each class has seven images and a total of 49 images are tested. The test has two kinds of accuracy measurement and speed measurement. The accuracy of the image classification was 86.2% for the BoWs algorithm and 83.7% the proposed hardware-accelerated software implementation algorithm, and the BoWs algorithm was 2.5% higher. The image retrieval processing speed of BoWs is 7.89s and our algorithm is 1.55s. Our algorithm is 5.09 times faster than BoWs algorithm. The algorithm is largely divided into software and hardware parts. In the software structure, C-language is used. The Scale Invariant Feature Transform algorithm is used to extract feature points that are invariant to size and rotation from the image. Bit streams are generated from the extracted feature point. In the hardware architecture, the proposed image retrieval algorithm is written in Verilog HDL and designed and verified by FPGA and Design Compiler. The generated bit streams are stored, the clustering step is performed, and a searcher image databases or an input image databases are generated and matched. Using the proposed algorithm, we can improve convenience and satisfaction of the user in terms of speed if we search using database matching method which represents each object.

Efficient Image Warping Mechanism Using Template Matching and Partial Warping (템플릿 매칭과 부분 워핑을 이용한 효율적인 원근 영상 워핑 기법)

  • Jeong, Dae-Heon;Cho, Tai-Hoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.339-342
    • /
    • 2017
  • Geometric transform of an image is used to image correction. Ridid-Body, Simlilary transform, etc, many correction methods are exist in computer vision. Image warping is used to correction for image with perspective. To image warping I extracted 4 feature point about warping position. But It is difficult to extract 4 points accurately and warping result with these point is occurs error over 3 or 4 pixel at warping position. So I used template matching to extract 4 points correctly and selected repeatedly 2 points of 4 points because to confirm result correctly. positions of 2 points are changed in near of 3 by 3 pixel and warped each change. So I selected optimal 4 points with a error of less than 1 pixel and finally, warped image using optimal points. For this way is possible to obtain optimum result.

  • PDF

Fast Fingerprint Alignment Method and Weighted Feature Vector Extraction Method in Filterbank-Based Fingerprint Matching (필터뱅크 기반 지문정합에서 빠른 지문 정렬 방법 및 가중치를 부여한 특징 벡터 추출 방법)

  • 정석재;김동윤
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.1
    • /
    • pp.71-81
    • /
    • 2004
  • Minutiae-based fingerprint identification systems use minutiae points, which cannot completely characterize local ridge structures. Further, this method requires many methods for matching two fingerprint images containing different number of minutiae points. Therefore, to represent the fired length information for one fingerprint image, the filterbank-based method was proposed as an alternative to minutiae-based fingerprint representation. However, it has two shortcomings. One shortcoming is that similar feature vectors are extracted from the different fingerprints which have the same fingerprint type. Another shortcoming is that this method has overload to reduce the rotation error in the fingerprint image acquisition. In this paper, we propose the minutia-weighted feature vector extraction method that gives more weight in extracting feature value, if the region has minutiae points. Also, we Propose new fingerprint alignment method that uses the average local orientations around the reference point. These methods improve the fingerprint system's Performance and speed, respectively. Experimental results indicate that the proposed methods can reduce the FRR of the filterbank-based fingerprint matcher by approximately 0.524% at a FAR of 0.967%, and improve the matching performance by 5% in ERR. The system speed is over 1.28 times faster.

Application of Point Cloud Based Hull Structure Deformation Detection Algorithm (포인트 클라우드 기반 선체 구조 변형 탐지 알고리즘 적용 연구)

  • Song, Sang-ho;Lee, Gap-heon;Han, Ki-min;Jang, Hwa-sup
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.59 no.4
    • /
    • pp.235-242
    • /
    • 2022
  • As ship condition inspection technology has been developed, research on collecting, analyzing, and diagnosing condition information has become active. In ships, related research has been conducted, such as analyzing, detecting, and classifying major hull failures such as cracks and corrosion using 2D and 3D data information. However, for geometric deformation such as indents and bulges, 2D data has limitations in detection, so 3D data is needed to utilize spatial feature information. In this study, we aim to detect hull structural deformation positions. It builds a specimen based on actual hull structure deformation and acquires a point cloud from a model scanned with a 3D scanner. In the obtained point cloud, deformation(outliers) is found with a combination of RANSAC algorithms that find the best matching model in the Octree data structure and dataset.

Matching Algorithms using the Union and Division (결합과 분배를 이용한 정합 알고리즘)

  • 박종민;조범준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.5
    • /
    • pp.1102-1107
    • /
    • 2004
  • Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using “Delta” and “Core” as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. Therefore, I would like to represent the more correct matching algorism in this paper which has not only better matching rate but also lower mismatching rate compared to the present matching algorism by selecting the line segment connecting two minutiae on the same ridge and furrow structures as the reference point.

A Study on the 3D Shape Reconstruction Algorithm of an Indoor Environment Using Active Stereo Vision (능동 스테레오 비젼을 이용한 실내환경의 3차원 형상 재구성 알고리즘)

  • Byun, Ki-Won;Joo, Jae-Heum;Nam, Ki-Gon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.1
    • /
    • pp.13-22
    • /
    • 2009
  • In this paper, we propose the 3D shape reconstruction method that combine the mosaic method and the active stereo matching using the laser beam. The active stereo matching method detects the position information of the irradiated laser beam on object by analyzing the color and brightness variation of left and right image, and acquires the depth information in epipolar line. The mosaic method extracts feature point of image by using harris comer detection and matches the same keypoint between the sequence of images using the keypoint descriptor index method and infers correlation between the sequence of images. The depth information of the sequence image was calculated by the active stereo matching and the mosaic method. The merged depth information was reconstructed to the 3D shape information by wrapping and blending with image color and texture. The proposed reconstruction method could acquire strong the 3D distance information, and overcome constraint of place and distance etc, by using laser slit beam and stereo camera.

  • PDF

Analysis of the Increase of Matching Points for Accuracy Improvement in 3D Reconstruction Using Stereo CCTV Image Data

  • Moon, Kwang-il;Pyeon, MuWook;Eo, YangDam;Kim, JongHwa;Moon, Sujung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.35 no.2
    • /
    • pp.75-80
    • /
    • 2017
  • Recently, there has been growing interest in spatial data that combines information and communication technology with smart cities. The high-precision LiDAR (Light Dectection and Ranging) equipment is mainly used to collect three-dimensional spatial data, and the acquired data is also used to model geographic features and to manage plant construction and cultural heritages which require precision. The LiDAR equipment can collect precise data, but also has limitations because they are expensive and take long time to collect data. On the other hand, in the field of computer vision, research is being conducted on the methods of acquiring image data and performing 3D reconstruction based on image data without expensive equipment. Thus, precise 3D spatial data can be constructed efficiently by collecting and processing image data using CCTVs which are installed as infrastructure facilities in smart cities. However, this method can have an accuracy problem compared to the existing equipment. In this study, experiments were conducted and the results were analyzed to increase the number of extracted matching points by applying the feature-based method and the area-based method in order to improve the precision of 3D spatial data built with image data acquired from stereo CCTVs. For techniques to extract matching points, SIFT algorithm and PATCH algorithm were used. If precise 3D reconstruction is possible using the image data from stereo CCTVs, it will be possible to collect 3D spatial data with low-cost equipment and to collect and build data in real time because image data can be easily acquired through the Web from smart-phones and drones.

An Improved RANSAC Algorithm Based on Correspondence Point Information for Calculating Correct Conversion of Image Stitching (이미지 Stitching의 정확한 변환관계 계산을 위한 대응점 관계정보 기반의 개선된 RANSAC 알고리즘)

  • Lee, Hyunchul;Kim, Kangseok
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.1
    • /
    • pp.9-18
    • /
    • 2018
  • Recently, the use of image stitching technology has been increasing as the number of contents based on virtual reality increases. Image Stitching is a method for matching multiple images to produce a high resolution image and a wide field of view image. The image stitching is used in various fields beyond the limitation of images generated from one camera. Image Stitching detects feature points and corresponding points to match multiple images, and calculates the homography among images using the RANSAC algorithm. Generally, corresponding points are needed for calculating conversion relation. However, the corresponding points include various types of noise that can be caused by false assumptions or errors about the conversion relationship. This noise is an obstacle to accurately predict the conversion relation. Therefore, RANSAC algorithm is used to construct an accurate conversion relationship from the outliers that interfere with the prediction of the model parameters because matching methods can usually occur incorrect correspondence points. In this paper, we propose an algorithm that extracts more accurate inliers and computes accurate transformation relations by using correspondence point relation information used in RANSAC algorithm. The correspondence point relation information uses distance ratio between corresponding points used in image matching. This paper aims to reduce the processing time while maintaining the same performance as RANSAC.

Construction of 2D Image Mosaics Using Quasi-feature Point (유사 특징점을 이용한 모자이킹 영상의 구성)

  • Kim, Dae-Hyeon;Choe, Jong-Su
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.4
    • /
    • pp.381-391
    • /
    • 2001
  • This paper presents an efficient approach to build an image mosaics from image sequences. Unlike general panoramic stitching methods, which usually require some geometrical feature points or solve the iterative nonlinear equations, our algorithm can directly recover the 8-parameter planar perspective transforms. We use four quasi-feature points in order to compute the projective transform between two images. This feature is based on the graylevel distribution and defined in the overlap area between two images. Therefore the proposed algorithm can reduce the total amount of the computation. We also present an algorithm lot efficiently matching the correspondence of the extracted feature. The proposed algorithm is applied to various images to estimate its performance and. the simulation results present that our algorithm can find the correct correspondence and build an image mosaics.

  • PDF

Camera Extrinsic Parameter Estimation using 2D Homography and LM Method based on PPIV Recognition (PPIV 인식기반 2D 호모그래피와 LM방법을 이용한 카메라 외부인수 산출)

  • Cha Jeong-Hee;Jeon Young-Min
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.43 no.2 s.308
    • /
    • pp.11-19
    • /
    • 2006
  • In this paper, we propose a method to estimate camera extrinsic parameter based on projective and permutation invariance point features. Because feature informations in previous research is variant to c.:men viewpoint, extraction of correspondent point is difficult. Therefore, in this paper, we propose the extracting method of invariant point features, and new matching method using similarity evaluation function and Graham search method for reducing time complexity and finding correspondent points accurately. In the calculation of camera extrinsic parameter stage, we also propose two-stage motion parameter estimation method for enhancing convergent degree of LM algorithm. In the experiment, we compare and analyse the proposed method with existing method by using various indoor images to demonstrate the superiority of the proposed algorithms.