• Title/Summary/Keyword: point matching

Search Result 840, Processing Time 0.022 seconds

Efficient Image Stitching Using Fast Feature Descriptor Extraction and Matching (빠른 특징점 기술자 추출 및 정합을 이용한 효율적인 이미지 스티칭 기법)

  • Rhee, Sang-Burm
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.65-70
    • /
    • 2013
  • Recently, the field of computer vision has been actively researched through digital image which can be easily generated as the development and expansion of digital camera technology. Especially, research that extracts and utilizes the feature in image has been actively carried out. The image stitching is a method that creates the high resolution image using features extract and match. Image stitching can be widely used in military and medical purposes as well as in variety fields of real life. In this paper, we have proposed efficient image stitching method using fast feature descriptor extraction and matching based on SURF algorithm. It can be accurately, and quickly found matching point by reduction of dimension of feature descriptor. The feature descriptor is generated by classifying of unnecessary minutiae in extracted features. To reduce the computational time and efficient match feature, we have reduced dimension of the descriptor and expanded orientation window. In our results, the processing time of feature matching and image stitching are faster than previous algorithms, and also that method can make natural-looking stitched image.

A Study on the VR Payment System using Hand Gesture Recognition (손 제스쳐 인식을 활용한 VR 결제 시스템 연구)

  • Kim, Kyoung Hwan;Lee, Won Hyung
    • Journal of the Korean Society for Computer Game
    • /
    • v.31 no.4
    • /
    • pp.129-135
    • /
    • 2018
  • Electronic signatures, QR codes, and bar codes are used in payment systems used in real life. Research has begun on the payment system implemented in the VR environment. This paper proposes a VR electronic sign system that uses hand gesture recognition to implement an existing payment system in a VR environment. In a VR system, you can not hit the keyboard or touch the mouse. There can be several ways to configure a payment system with a VR controller. Electronic signage using hand gesture recognition is one of them, and hand gesture recognition can be classified by the Warping Methods, Statistical Methods, and Template Matching methods. In this paper, the payment system was configured in VR using the $p algorithm belonging to the Template Matching method. To create a VR environment, we implemented a paypal system where actual payment is made using Unity3D and Vive equipment.

Quad-Band RF CMOS Power Amplifier for Wireless Communications (무선 통신을 위한 Quad-band RF CMOS 전력증폭기)

  • Lee, Milim;Yang, Junhyuk;Park, Changkun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.7
    • /
    • pp.807-815
    • /
    • 2019
  • In this paper, we design a power amplifier to support quad-band in wireless communication devices using RF CMOS 180-nm process. The proposed power amplifier consists of low-band 0.9, 1.8, and 2.4 GHz and high-band 5 GHz. We proposed a structure that can support each input matching network without using a switch. For maximum linear output power, the output matching network was designed for impedance conversion to the power matching point. The fabricated quad-band power amplifier was verified using modulation signals. The long-term evolution(LTE) 10 MHz modulated signal was used for 0.9 and 1.8 GHz, and the measured output power is 23.55 and 24.23 dBm, respectively. The LTE 20 MHz modulated signal was used for 1.8 GHz, and the measured output power is 22.24 dBm. The wireless local area network(WLAN) 802.11n modulated signal was used for 2.4 GHz and 5.0 GHz. We obtain maximum linear output power of 20.58 dBm at 2.4 GHz and 17.7 dBm at 5.0 GHz.

Accuracy Improvement of DEM Using Ground Coordinates Package (공공삼각점 위치자료를 이용한 DEM의 위치 정확도 향상)

  • Lee, Hyoseong;Oh, Jaehong
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.3
    • /
    • pp.567-575
    • /
    • 2021
  • In order to correct the provided RPC and DEM generated from the high-resolution satellite images, the acquisition of the ground control point (GCP) must be preceded. This task is a very complicate that requires field surveys, GPS surveying, and image coordinate reading corresponding to GCPs. In addition, since it is difficult to set up and measure a GCP in areas where access is difficult or impossible (tidal flats, polar regions, volcanic regions, etc.), an alternative method is needed. In this paper, we propose a 3D surface matching technique using only the established ground coordinate package, avoiding the ground-image-location survey of the GCP to correct the DEM produced from WorldView-2 satellite images and the provided RPCs. The location data of the public control points were obtained from the National Geographic Information Institute website, and the DEM was corrected by performing 3D surface matching with this package. The accuracy of 3-axis translation and rotation obtained by the matching was evaluated using pre-measured GPS checkpoints. As a result, it was possible to obtain results within 2 m in the plane location and 1 m in height.

Fast Motion Estimation Algorithm Using Early Detection of Optimal Candidates with Priority and a Threshold (우선순위와 문턱치를 가지고 최적 후보 조기 검출을 사용하는 고속 움직임 예측 알고리즘)

  • Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.21 no.2
    • /
    • pp.55-60
    • /
    • 2020
  • In this paper, we propose a fast block matching algorithm of motion estimation using early detection of optimal candidate with high priority and a threshold. Even though so many fast algorithms for motion estimation have been published to reduce computational reduction full search algorithm, still so many works to improve performance of motion estimation are being reported. The proposed algorithm calculates block matching error for each candidate with high priority from previous partial matching error. The proposed algorithm can be applied additionally to most of conventional fast block matching algorithms for more speed up. By doing that, we can find the minimum error point early and get speed up by reducing unnecessary computations of impossible candidates. The proposed algorithm uses smaller computation than conventional fast full search algorithms with the same prediction quality as the full search algorithm. Experimental results shows that the proposed algorithm reduces 30~70% compared with the computation of the PDE and full search algorithms without any degradation of prediction quality and further reduces it with other fast lossy algorithms.

Matching Points Filtering Applied Panorama Image Processing Using SURF and RANSAC Algorithm (SURF와 RANSAC 알고리즘을 이용한 대응점 필터링 적용 파노라마 이미지 처리)

  • Kim, Jeongho;Kim, Daewon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.144-159
    • /
    • 2014
  • Techniques for making a single panoramic image using multiple pictures are widely studied in many areas such as computer vision, computer graphics, etc. The panorama image can be applied to various fields like virtual reality, robot vision areas which require wide-angled shots as an useful way to overcome the limitations such as picture-angle, resolutions, and internal informations of an image taken from a single camera. It is so much meaningful in a point that a panoramic image usually provides better immersion feeling than a plain image. Although there are many ways to build a panoramic image, most of them are using the way of extracting feature points and matching points of each images for making a single panoramic image. In addition, those methods use the RANSAC(RANdom SAmple Consensus) algorithm with matching points and the Homography matrix to transform the image. The SURF(Speeded Up Robust Features) algorithm which is used in this paper to extract featuring points uses an image's black and white informations and local spatial informations. The SURF is widely being used since it is very much robust at detecting image's size, view-point changes, and additionally, faster than the SIFT(Scale Invariant Features Transform) algorithm. The SURF has a shortcoming of making an error which results in decreasing the RANSAC algorithm's performance speed when extracting image's feature points. As a result, this may increase the CPU usage occupation rate. The error of detecting matching points may role as a critical reason for disqualifying panoramic image's accuracy and lucidity. In this paper, in order to minimize errors of extracting matching points, we used $3{\times}3$ region's RGB pixel values around the matching points' coordinates to perform intermediate filtering process for removing wrong matching points. We have also presented analysis and evaluation results relating to enhanced working speed for producing a panorama image, CPU usage rate, extracted matching points' decreasing rate and accuracy.

Performance Improvement of Stereo Matching by Image Segmentation based on Color and Multi-threshold (컬러와 다중 임계값 기반 영상 분할 기법을 통한 스테레오 매칭의 성능 향상)

  • Kim, Eun Kyeong;Cho, Hyunhak;Jang, Eunseok;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.26 no.1
    • /
    • pp.44-49
    • /
    • 2016
  • This paper proposed the method to improve performance of a pixel, which has low accuracy, by applying image segmentation methods based on color and multi-threshold of brightness. Stereo matching is the process to find the corresponding point on the right image with the point on the left image. For this process, distance(depth) information in stereo images is calculated. However, in the case of a region which has textureless, stereo matching has low accuracy and bad pixels occur on the disparity map. In the proposed method, the relationship between adjacent pixels is considered for compensating bad pixels. Generally, the object has similar color and brightness. Therefore, by considering the relationship between regions based on segmented regions by means of color and multi-threshold of brightness respectively, the region which is considered as parts of same object is re-segmented. According to relationship information of segmented sets of pixels, bad pixels in the disparity map are compensated efficiently. By applying the proposed method, the results show a decrease of nearly 28% in the number of bad pixels of the image applied the method which is established.

Development of Geocoding and Reverse Geocoding Method Implemented for Street-based Addresses in Korea (우리나라 도로명주소를 활용한 지오코딩 및 역 지오코딩 기법 개발)

  • Seok, Sangmuk;Lee, Jiyeong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.1
    • /
    • pp.33-42
    • /
    • 2016
  • In Korea, the address-point matching technique has been used to provide geocoding services. In fact, this technique brings the high positional accuracy. However, the quality of geocoding result can be limited, since it is significantly affected by data quality. Also, it cannot be used for the 3D address geocoding and the reverse geocoding. In order to alleviate issues, the paper has implemeted proposed geocoding methods, based on street-based addresses matching technique developed by US census bureau, for street-based addresses in Korea. Those proposed geocoding methods are illustrated in two ways; (1) street address-matching method, which of being used for not only 2D addresses representing a single building but also 3D addresses representing indoor space or underground building, and (2) reverse geocoding method, whichas converting a location point to a readable address. The result of street-based address geocoding shows 82.63% match rates, while the result of reverse geocoding shows 98.5% match rates within approximately 1.7(m) the average position error. According to the results, we could conclude that the proposed geocoding techniques enable to provide the LBS(Location Based Service). To develop the geocoding methods, the study has perfoermed by ignoring the parsing algorithms for address standardization as well as the several areas with unusual addresses, such as sub-urban areas or subordinate areas to the roads, etc. In the future, we are planning the improved geocoding methods for considering these cases.

Damage Analysis and Accuracy Assessment for River-side Facilities using UAV images (UAV 영상을 활용한 수변구조물 피해분석 및 정확도 평가)

  • Kim, Min Chul;Yoon, Hyuk Jin;Chang, Hwi Jeong;Yoo, Jong Su
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.81-87
    • /
    • 2016
  • It is important to analyze the exact damage information for fast recovery when natural disasters cause damage on river-side facilities such as dams, bridges, embankments etc. In this study, we shows the method to effectively damage analysis plan using UAV(Unmanned aerial vehicle) images and accuracy assessment of it. The UAV images are captured on area near the river-side facilities and the core methodology for damage analysis are image matching and change detection algorithm. The result(point cloud) from image matching is to construct 3-dimensional data using by 2-dimensional images, it extracts damage areas by comparing the height values on same area with reference data. The results are tested absolute locational precision compared by post-processed aerial LiDAR data named reference data. The assessment analysis test shows our matching results 10-20 centimeter level precision if external orientation parameters are very accurate. This study shows suggested method is very useful for damage analysis in a large size structure like river-side facilities. But the complexity building can't apply this method, it need to the other method for damage analysis.

Feature Matching using Variable Circular Template for Multi-resolution Image Registration (다중 해상도 영상 등록을 위한 가변 원형 템플릿을 이용한 특징 정합)

  • Ye, Chul-Soo
    • Korean Journal of Remote Sensing
    • /
    • v.34 no.6_3
    • /
    • pp.1351-1367
    • /
    • 2018
  • Image registration is an essential process for image fusion, change detection and time series analysis using multi-sensor images. For this purpose, we need to detect accurately the difference of scale and rotation between the multi-sensor images with difference spatial resolution. In this paper, we propose a new feature matching method using variable circular template for image registration between multi-resolution images. The proposed method creates a circular template at the center of a feature point in a coarse scale image and also a variable circular template in a fine scale image, respectively. After changing the scale of the variable circular template, we rotate the variable circular template by each predefined angle and compute the mutual information between the two circular templates and then find the scale, the angle of rotation and the center location of the variable circular template, respectively, in fine scale image when the mutual information between the two circular templates is maximum. The proposed method was tested using Kompsat-2, Kompsat-3 and Kompsat-3A images with different spatial resolution. The experimental results showed that the error of scale factor, the error of rotation angle and the localization error of the control point were less than 0.004, $0.3^{\circ}$ and one pixel, respectively.