• Title/Summary/Keyword: SURF Matching

Search Result 75, Processing Time 0.024 seconds

Automatic Extraction Method of Control Point Based on Geospatial Web Service (지리공간 웹 서비스 기반의 기준점 자동추출 기법 연구)

  • Lee, Young Rim
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.2
    • /
    • pp.17-24
    • /
    • 2014
  • This paper proposes an automatic extraction method of control point based on Geospatial Web Service. The proposed method consists of 3 steps. 1) The first step is to acquires reference data using the Geospatial Web Service. 2) The second step is to finds candidate control points in reference data and the target image by SURF algorithm. 3) By using RANSAC algorithm, the final step is to filters the correct matching points of candidate control points as final control points. By using the Geospatial Web Service, the proposed method increases operation convenience, and has the more extensible because of following the OGC Standard. The proposed method has been tested for SPOT-1, SPOT-5, IKONOS satellite images and has been used military standard data as reference data. The proposed method yielded a uniform accuracy under RMSE 5 pixel. The experimental results proved the capabilities of continuous improvement in accuracy depending on the resolution of target image, and showed the full potential of the proposed method for military purpose.

An Object Tracking Method for Studio Cameras by OpenCV-based Python Program (OpenCV 기반 파이썬 프로그램에 의한 방송용 카메라의 객체 추적 기법)

  • Yang, Yong Jun;Lee, Sang Gu
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.1
    • /
    • pp.291-297
    • /
    • 2018
  • In this paper, we present an automatic image object tracking system for Studio cameras on the stage. For object tracking, we use the OpenCV-based Python program using PC, Raspberry Pi 3 and mobile devices. There are many methods of image object tracking such as mean-shift, CAMshift (Continuously Adaptive Mean shift), background modelling using GMM(Gaussian mixture model), template based detection using SURF(Speeded up robust features), CMT(Consensus-based Matching and Tracking) and TLD methods. CAMshift algorithm is very efficient for real-time tracking because of its fast and robust performance. However, in this paper, we implement an image object tracking system for studio cameras based CMT algorithm. This is an optimal image tracking method because of combination of static and adaptive correspondences. The proposed system can be applied to an effective and robust image tracking system for continuous object tracking on the stage in real time.

Invariant-Feature Based Object Tracking Using Discrete Dynamic Swarm Optimization

  • Kang, Kyuchang;Bae, Changseok;Moon, Jinyoung;Park, Jongyoul;Chung, Yuk Ying;Sha, Feng;Zhao, Ximeng
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.151-162
    • /
    • 2017
  • With the remarkable growth in rich media in recent years, people are increasingly exposed to visual information from the environment. Visual information continues to play a vital role in rich media because people's real interests lie in dynamic information. This paper proposes a novel discrete dynamic swarm optimization (DDSO) algorithm for video object tracking using invariant features. The proposed approach is designed to track objects more robustly than other traditional algorithms in terms of illumination changes, background noise, and occlusions. DDSO is integrated with a matching procedure to eliminate inappropriate feature points geographically. The proposed novel fitness function can aid in excluding the influence of some noisy mismatched feature points. The test results showed that our approach can overcome changes in illumination, background noise, and occlusions more effectively than other traditional methods, including color-tracking and invariant feature-tracking methods.

FAST and BRIEF based Real-Time Feature Matching Algorithms (FAST와 BRIEF 기반의 실시간 특징점 매칭 알고리즘)

  • Kim, Seungryong;Yoo, Hunjae;Sohn, Kwanghoon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.11a
    • /
    • pp.1-4
    • /
    • 2012
  • 영상 매칭 기술은 컴퓨터 비전 분야에서 다양하게 응용될 수 있는 기초적인 기술 중에 하나이다. 대표적인 영상 매칭 기술인 SIFT나 SURF는 강인한 영상 매칭 성능을 나타내지만 계산량이 방대하여 실시간 기술에 사용될 수 없는 문제점을 가진다. 최근에 ORB나 BRISK는 FAST 특징점 검출기와 BRIEF 특징점 표현자를 조합하여 실시간 영상 매칭을 가능하게 하면서 기존의 영상 매칭 기술과 견줄만한 성능을 나타내었다. 본 논문에서는 FAST와 BRIEF를 수정하여 영상 왜곡에 강인하면서 실시간으로 매칭을 수행할 수 있는 영상 매칭 알고리즘을 제안한다. 노이즈에 강인하면서 스케일 변화를 고려하기 위하여 특징점 후보 영역을 제한하고 스케일 공간을 생성하여 특징점을 검출한다. 또한 영상의 회전 변화에 강인한 영상 매칭을 가능하게 하기 위하여 주변 픽셀 패턴의 Gradient로 특징점 방향을 결정하여 픽셀 밝기 값 비교로 이진 특징점 표현자를 생성한다. 제안하는 영상 매칭 알고리즘은 적은 계산량으로 기존의 알고리즘보다 우수한 영상 매칭 성능을 나타낸다. 특별히 노이즈가 존재하는 영상의 매칭에서 노이즈의 영향에 강인한 매칭 성능을 보여준다.

  • PDF

A Mobile Landmarks Guide : Outdoor Augmented Reality based on LOD and Contextual Device (모바일 랜드마크 가이드 : LOD와 문맥적 장치 기반의 실외 증강현실)

  • Zhao, Bi-Cheng;Rosli, Ahmad Nurzid;Jang, Chol-Hee;Lee, Kee-Sung;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.1
    • /
    • pp.1-21
    • /
    • 2012
  • In recent years, mobile phone has experienced an extremely fast evolution. It is equipped with high-quality color displays, high resolution cameras, and real-time accelerated 3D graphics. In addition, some other features are includes GPS sensor and Digital Compass, etc. This evolution advent significantly helps the application developers to use the power of smart-phones, to create a rich environment that offers a wide range of services and exciting possibilities. To date mobile AR in outdoor research there are many popular location-based AR services, such Layar and Wikitude. These systems have big limitation the AR contents hardly overlaid on the real target. Another research is context-based AR services using image recognition and tracking. The AR contents are precisely overlaid on the real target. But the real-time performance is restricted by the retrieval time and hardly implement in large scale area. In our work, we exploit to combine advantages of location-based AR with context-based AR. The system can easily find out surrounding landmarks first and then do the recognition and tracking with them. The proposed system mainly consists of two major parts-landmark browsing module and annotation module. In landmark browsing module, user can view an augmented virtual information (information media), such as text, picture and video on their smart-phone viewfinder, when they pointing out their smart-phone to a certain building or landmark. For this, landmark recognition technique is applied in this work. SURF point-based features are used in the matching process due to their robustness. To ensure the image retrieval and matching processes is fast enough for real time tracking, we exploit the contextual device (GPS and digital compass) information. This is necessary to select the nearest and pointed orientation landmarks from the database. The queried image is only matched with this selected data. Therefore, the speed for matching will be significantly increased. Secondly is the annotation module. Instead of viewing only the augmented information media, user can create virtual annotation based on linked data. Having to know a full knowledge about the landmark, are not necessary required. They can simply look for the appropriate topic by searching it with a keyword in linked data. With this, it helps the system to find out target URI in order to generate correct AR contents. On the other hand, in order to recognize target landmarks, images of selected building or landmark are captured from different angle and distance. This procedure looks like a similar processing of building a connection between the real building and the virtual information existed in the Linked Open Data. In our experiments, search range in the database is reduced by clustering images into groups according to their coordinates. A Grid-base clustering method and user location information are used to restrict the retrieval range. Comparing the existed research using cluster and GPS information the retrieval time is around 70~80ms. Experiment results show our approach the retrieval time reduces to around 18~20ms in average. Therefore the totally processing time is reduced from 490~540ms to 438~480ms. The performance improvement will be more obvious when the database growing. It demonstrates the proposed system is efficient and robust in many cases.