Aerial image mosaicing approach based on feature matching

Unmanned aerial vehicles (UAVs), equipped with navigation systems and video capability, are currently being deployed for intelligence, reconnaissance and surveillance mission. In this paper, we present a systematic approach for the generation of UAV trajectory using a video image matching system based on SURF (Speeded up Robust Feature) and Preemptive RANSAC (Random Sample Consensus). Video image matching to find matching points is one of the most important steps for the accurate generation of UAV trajectory (sequence of poses in 3D space). We used the SURF algorithm to find the matching points between video image sequences, and removed mismatching by using the Preemptive RANSAC which divides all matching points to outliers and inliers. The inliers are only used to determine the epipolar geometry for estimating the relative pose (rotation and translation) between image sequences. Experimental results from simulated video image sequences showed that our approach has a good potential to be applied to the automatic geo-localization of the UAVs system

In order to improve the speed of stitching and information extraction of remote sensing images, based on the UAV (Unmanned Aerial Vehicle) image stitching algorithm, this paper proposes a UAV image matching method based on the combination of SURF (Speeded Up Robust Features) and MASC (M-Estimate Sample Consensus) algorithm. the SURF algorithm is fast, and the MASC algorithm can effectively eliminate mismatch points and has high stability. In this paper, the SIFT (Scale-invariant feature transform) algorithm, SURF algorithm, SURF and RANSAC (Random Sample Consensus) algorithm as well as SURF and MASC algorithm are used to stitch the same two images and compare them respectively. The experimental results show that the lowest image matching error rate is only 2.13% and the matching time is 4.772670s when using the combination of SURF and MASC algorithm for image stitching, which has certain advantages.

Speeded Up Robust Features (SURF) algorithm is a fast robust local feature matching method. Because of the advantage of invariance of scale and rotation, the SURF algorithm has been widely used in the image registration. However, due to the acquired angle, imaging mode, different resolution, SURF algorithm becomes quite difficult in the image registration. This paper presents a normalized SURF algorithm which can reduce the impact of hue difference between remote sensing images. Combined with the idea of two-way matching, the normalized SURF is able to improve the accuracy of the image registration. The experimental results show the normalized SURF algorithm can keep greater accuracy and relatively higher speed of matching than the original SURF algorithm.

Abstract. Remote sensing system fitted on UAV (Unmanned Aerial Vehicle) can obtain clear images and high-resolution aerial photographs. It has advantages of flexibility, convenience and ability to work full-time. However, there are some problems of UAV image such as small coverage area, large number, irregular overlap, etc. How to obtain a large regional map quickly becomes a major obstacle to UAV remote sensing application. In this paper, a new method of fast registration of UAV remote sensing images was proposed to meet the needs of practical application. This paper used Progressive Sample Consensus (PROSAC) algorithm to improve the matching accuracy by removed a large number of mismatching point pairs of remote sensing image registration based-on SURF (Speed Up Robust Feature) algorithm, and GPU (Graphic Processing Unit) was also used to accelerate the speed of improved SURF algorithm. Finally, geometric verification was used to achieve mosaic accuracy in survey area. The number of feature points obtained by using improved SURF based-on PROSAC algorithm was only 9.5% than that of SURF algorithm. Moreover, the accuracy rate of improved method was about 99.7%, while the accuracy rate of improved SURF algorithm was increased by 8% than SURF algorithm. Moreover, the improved running time of SURFGPU algorithm for UAV remote sensing image registration was a speed of around 16 times than SURF algorithm, and the image matching time had reached millisecond level. Thus, improved SURF algorithm had better matching accuracy and executing speed to meet the requirements of real-time and robustness in UAV remote sensing image registration.

Ever since the introduction of freely programmable hardware components into modern graphics hardware, graphics processing units (GPUs) have become increasingly popular for general purpose computations. Especially when applied to computer vision algorithms where a Single set of Instructions has to be executed on Multiple Data (SIMD), GPU-based algorithms can provide a major increase in processing speed compared to their CPU counterparts. This paper presents methods that take full advantage of modern graphics card hardware for real-time scale invariant feature detection and matching. The focus lies on the extraction of feature locations and the generation of feature descriptors from natural images. The generation of these featurevectors is based on the Speeded Up Robust Features (SURF) method [1] due to its high stability against rotation, scale and changes in lighting condition of the processed images. With the presented methods feature detection and matching can be performed at framerates exceeding 100 frames per second for 640 × 480 images. The remaining time can then be spent on fast matching against large feature databases on the GPU while the CPU can be used for other tasks. © 2008 IEEE.

This work presents a visual information fusion approach for robust probability-oriented feature matching. It is sustained by omnidirectional imaging, and it is tested in a visual localization framework, in mobile robotics. General visual localization methods have been extensively studied and optimized in terms of performance. However, one of the main threats that jeopardizes the final estimation is the presence of outliers. In this paper, we present several contributions to deal with that issue. First, 3D information data, associated with SURF (Speeded-Up Robust Feature) points detected on the images, is inferred under the Bayesian framework established by Gaussian processes (GPs). Such information represents a probability distribution for the feature points’ existence, which is successively fused and updated throughout the robot’s poses. Secondly, this distribution can be properly sampled and projected onto the next 2D image frame in , by means of a filter-motion prediction. This strategy permits obtaining relevant areas in the image reference system, from which probable matches could be detected, in terms of the accumulated probability of feature existence. This approach entails an adaptive probability-oriented matching search, which accounts for significant areas of the image, but it also considers unseen parts of the scene, thanks to an internal modulation of the probability distribution domain, computed in terms of the current uncertainty of the system. The main outcomes confirm a robust feature matching, which permits producing consistent localization estimates, aided by the odometer’s prior to estimate the scale factor. Publicly available datasets have been used to validate the design and operation of the approach. Moreover, the proposal has been compared, firstly with a standard feature matching and secondly with a localization method, based on an inverse depth parametrization. The results confirm the validity of the approach in terms of feature matching, localization accuracy, and time consumption.

This paper concerns the problem of standing tree image mosaic based on SURF in pocket PC. In standing tree measurement based on image processing, the first step is to take photo of the tree to be measured. Due to some special tall trees, or limited by geographical conditions, it is impossible to get the full image of the tree for one time, and need to shoot sequence tree images with overlapped areas and stitch them. SIFT algorithm is good enough in image mosaic, but it is too complicated to work good in pocket PC. In this paper, a tree image mosaic method based on speed up robust features (SURF) was put forward embedded in pocket PC. The experiment of true tree image sequence stitching achieves the better smooth mosaic effect and shows the method is effective.

위성 SAR 영상의 활용이 증가하면서 영상의 해석 및 융합을 위한 정밀 기하보정에 대한 필요성이 높아지고 있다. 특히 광역감시 목적으로 활용되기 위해 서로 다른 해상도를 갖는 SAR 영상간 정보융합도 활발해지고 있다. 일반적으로 SAR 영상의 기하보정은 위성의 궤도 및 자세정보를 활용하여 수행할 수 있지만 SAR 센서의 궤도 및 시스템 오차, 대상지형 특성에 의한 왜곡으로 인해 추가적인 보정이 필요하게 된다. SAR 영상을 통한 변화탐지나 타 영상과의 융합에 적용하기 위해서는 기하 오차 보정이 반드시 선행되어야 한다. 이를 위해 다수의 지상 기준점을 선정하고 이를 포함하는 기준 영상과 비교하여 원본 영상에서 대응점을 찾는 방식으로 정밀 기하보정을 수행할 수 있다. Speeded Up Robust Feature (SURF) 기법은 쉽고 빠르게 영상의 기준점을 찾을 수 있지만 상대적으로 해상도가 낮고 스펙클 잡음에 영향을 받는 SAR 영상에서는 활용하기가 어렵다고 알려져 있다. 본 논문에서는 SURF 기법을 위성 SAR 영상에 적용할 때 발생할 수 있는 오차를 추출하고 영상 특성에 따른 성능 변화를 분석하였다. SURF 알고리즘의 적용이 가능한 입력 변수의 적정 범위를 제시하고 그에 따른 영상 정합의 오차를 분석하여 중저해상도의 위성 SAR 영상에 대해서도 SURF 기법을 통한 기하 보정 및 영상 정합이 적용될 수 있음을 검증하였다. As applications of spaceborne SAR imagery are extended, there are increased demands for accurate registrations for better understanding and fusion of radar images. It becomes common to adopt multi-resolution SAR images to apply for wide area reconnaissance. Geometric correction of the SAR images can be performed by using satellite orbit and attitude information. However, the inherent errors of the SAR sensor's attitude and ground geographical data tend to cause geometric errors in the produced SAR image. These errors should be corrected when the SAR images are applied for multi-temporal analysis, change detection applications and image fusion with other sensor images. The undesirable ground registration errors can be corrected with respect to the true ground control points in order to produce complete SAR products. Speeded Up Robust Feature (SURF) technique is an efficient algorithm to extract ground control points from images but is considered to be inappropriate to apply to SAR images due to high speckle noises. In this paper, an attempt is made to apply SURF algorithm to SAR images for image registration and fusion. Matched points are extracted with respect to the varying parameters of Hessian and SURF matching thresholds, and the performance is analyzed by measuring the imaging matching accuracies. A number of performance measures concerning image registration are suggested to validate the use of SURF for spaceborne SAR images. Various simulations methodologies are suggested the validate the use of SURF for the geometric correction and image registrations and it is shown that a good choice of input parameters to the SURF algorithm should be made to apply for the spaceborne SAR images of moderate resolutions.

Investigation of near-field jet stability of a single-hole injector based on fast X-ray phase contrast imaging and image feature matching

Image stitching is one of the branches of computer vision. It combines two or more images for a scene to acquire a high-resolution panoramic image. An invariant local function often uses to stitch two images together. Since the flat plate of a digital radiography (DR) system does not cover all parts of the body, the whole bone structure image cannot seize in a single scan. To solved this problem, image stitching is broadly utilized by medical systems to stitch DR images, which can be helpful for scoliosis or lower extremity deformities in the diagnosis, and pre-operative planning are of great importance. In this paper, the stitching and retrieval of medical images planned. To conquer the background noise in medical images, and improve the recovery of quality and stitching rapidity of medical images, a random sample consensus (RANSAC) algorithm is useful to stitching the images of Chest digital radiography by scale-invariant feature transform (SIFT) and speeded-up robust features (SURF) feature extraction. Down-sampling utilizes to lessen the size of the images and reduction the measure of calculation. In the interim, the phase correlation is engaged to discover the overlapping region. After feature matching and perspective transformation, the stitched image is gotten dependent on the homography. At last, experimentation has finished showing the presentation.

In this paper, we proposed an accurate and robust method for absolute pose estimation with UAV (unmanned aerial vehicle) using RANSAC (random sample consensus). Because the artificial 3D control points with high accuracy are time-consuming and the small point set may lead low measuring accuracy, we designed a customized UAV to efficiently obtain mass 3D points. A light source was mounted on the UAV and used as a 3D point. The position of the 3D point was given by RTK (real-time kinematic) mounted on the UAV, and the position of the corresponding 2D point was given by feature extraction. The 2D–3D point correspondences exhibited some outliers because of the failure of feature extraction, the error of RTK, and wrong matches. Hence, RANSAC was used to remove the outliers and obtain the coarse pose. Then, we proposed a method to refine the coarse pose, whose procedure was formulated as the optimization of a cost function about the reprojection error based on the error transferring model and gradient descent to refine it. Before that, normalization was given for all the valid 2D–3D point correspondences to improve the estimation accuracy. In addition, we manufactured a prototype of a UAV with RTK and light source to obtain mass 2D–3D point correspondences for real images. Lastly, we provided a thorough test using synthetic data and real images, compared with several state-of-the-art perspective-n-point solvers. Experimental results showed that, even with a high outlier ratio, our proposed method had better performance in terms of numerical stability, noise sensitivity, and computational speed.

An increasing number of devices and their communication with each other generates huge amounts of data. The efficiency of processing such large and heterogeneous data is crucial for extracting the reliable and consistent information that is needed for the effective management of smart cities within the field of transport. Data heterogeneity and volume as well as its integration and analytics are big challenges for decision-makers. The development of urban agglomerations is largely dependent on the proper management of such data. Therefore, this paper explores the role of these data repositories, their acquisition from different sources, and the ways to combine them. The main goal of this paper is to propose a concept of Smart City management based on Big Data Analytics and technology related to UAVs (Unmanned Aerial Vehicle) which may reduce costs and resource consumption. The presented concept includes successive data generation and collection, data type identification, problem and requirement identification, filtering, classification, pre-processing, and data optimization, as well as decision support analysis. A key part of this analysis utilizes computer algorithms, such as Speeded Up Robust Features (SURF) and Thresholding and Blob detection, to develop a multi-camera image recognition system for freight transport management and logistics in smart cities. The objective is to design a system that optimizes the route planning and time of vehicle passage on selected road sections, ultimately leading to the reduction of emissions. During the study, data obtained from multiple sources were compared, and the analysis uncovered different results for the same assumptions. We discuss the reasons for these variances. Overall, the results obtained in the analysis indicated that it is necessary to correct the predictions of the multi-camera image recognition system with additional methods and algorithms.

Using a single sensor to determine the pose estimation of a device cannot give accurate results. This paper presents a fusion of an inertial sensor of six degrees of freedom (6-DoF) which comprises the 3-axis of an accelerometer and the 3-axis of a gyroscope, and a vision to determine a low-cost and accurate position for an autonomous mobile robot. For vision, a monocular vision-based object detection algorithm speeded-up robust feature (SURF) and random sample consensus (RANSAC) algorithms were integrated and used to recognize a sample object in several images taken. As against the conventional method that depend on point-tracking, RANSAC uses an iterative method to estimate the parameters of a mathematical model from a set of captured data which contains outliers. With SURF and RANSAC, improved accuracy is certain; this is because of their ability to find interest points (features) under different viewing conditions using a Hessain matrix. This approach is proposed because of its simple implementation, low cost, and improved accuracy. With an extended Kalman filter (EKF), data from inertial sensors and a camera were fused to estimate the position and orientation of the mobile robot. All these sensors were mounted on the mobile robot to obtain an accurate localization. An indoor experiment was carried out to validate and evaluate the performance. Experimental results show that the proposed method is fast in computation, reliable and robust, and can be considered for practical applications. The performance of the experiments was verified by the ground truth data and root mean square errors (RMSEs).

Automatic orientation and 3D modelling from markerless rock art imagery

How to construct compact and powerful feature descriptors is an important research subject in the fields of machine vision and pattern recognition. After the research on SURF, the issue that the Haar descriptor of Speeded Up Robust Features(SURF) algorithm can not make full use of the information around the neighborhood of the feature points is found. To resolve the issue, this paper proposes a improved SURF based on the original SURF algorithm. The algorithm makes full use of the information around the neighborhood of the sub-block by masking with 3*3 window templates and then constructs the descriptor which can obtain better discriminative power. In addition, aimed at the primary direction of the SURF depends too much on the local region, the paper improves the confirmation of the primary direction. At last, this paper combines the nearest distance and the ratio between the nearest distance and the second nearest distance to match the interest points. The experiment shows that the algorithm proposed in this paper has better discriminative power, and the face recognition rate is enhanced.