• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.5
• /
• pp.603-609
• /
• 2010

This paper introduces an objects recognition algorithm based on SURF(Speeded Up Robust Features) and GP(Genetic Programming) based gaits generation. Combining both methods, a recognition based intelligent walking for quadruped robots is proposed. The gait of quadruped robots is generated by means of symbolic regression for each joint trajectories using GP. A position and size of target object are recognized by SURF which enables high speed feature extraction, and then the distance to the object is calculated. Experiments for objects recognition and autonomous walking for quadruped robots are executed for ODE based Webots simulation and real robot.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.586-591
• /
• 2010

In this paper, we propose the localization method of mobile robot using SURF(Speeded-Up Robust Features) and Particle filter. The proposed method is as follows: First, we seek the Landmark from the obtained image using SURF in order to find the first rigorous position of mobile robot. Second, we obtain the distance from obstacles using ultrasonic sensors in order to create the relative position of mobile robot. And then, we estimate the localization of mobile robot using Particle filter about movement of mobile robot. Finally, we show the feasibility of the proposed method through some experiments.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.44 no.2
• /
• pp.263-270
• /
• 2024

As unmanned aerial vehicles(UAVs) and sensors have been developed in a variety of ways, it has become possible to update information on the ground faster than existing aerial photography or remote sensing. However, acquisition and input of ground control points(GCPs) UAV photogrammetry takes a lot of time, and geometric distortion occurs if measurement and input of GCPs are incorrect. In this study, RGB-based orthophotos were generated to reduce GCPs measurment and input time, and comparison and evaluation were performed by applying feature point algorithms to target orthophotos from various sensors. Four feature point extraction algorithms were applied to the two study sites, and as a result, speeded up robust features(SURF) was the best in terms of the ratio of matching pairs to feature points. When compared overall, the accelerated-KAZE(AKAZE) method extracted the most feature points and matching pairs, and the binary robust invariant scalable keypoints(BRISK) method extracted the fewest feature points and matching pairs. Through these results, it was confirmed that the AKAZE method is superior when performing geometric correction of the objective orthophoto for each sensor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3782-3796
• /
• 2020

A three-dimensional (3D) reconstruction is an important research area in computer vision. The ability to detect and match features across multiple views of a scene is a critical initial step. The tracking matrix W obtained from a 3D reconstruction can be applied to structure from motion (SFM) algorithms for 3D modeling. We often fail to generate an acceptable number of features when processing face or medical images because such images typically contain large homogeneous regions with minimal variation in intensity. In this study, we seek to locate sufficient matching points not only in general images but also in face and medical images, where it is difficult to determine the feature points. The algorithm is implemented on an adaptive threshold value, a scale invariant feature transform (SIFT), affine SIFT, speeded up robust features (SURF), and affine SURF. By applying the algorithm to face and general images and studying the geometric errors, we can achieve quasi-dense matching points that satisfy well-functioning geometric constraints. We also demonstrate a 3D reconstruction with a respectable performance by applying a column space fitting algorithm, which is an SFM algorithm.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.388-399
• /
• 2012

In the paper, we propose enhanced feature extraction and matching methods for a mobile environment based on modified SURF. We propose three methods to reduce the computational complexity in a mobile environment. The first is to reduce the dimensions of the SURF descriptor. We compare the performance of existing 64-dimensional SURF with several other dimensional SURFs. The second is to improve the performance using the sign of the trace of the Hessian matrix. In other words, feature points are considered as matched if they have the same sign for the trace of the Hessian matrix, otherwise considered not matched. The last one is to find the best distance-ratio which is used to determine the matching points. We find the best distance-ratio through experiments, and it gives the relatively high accuracy. Finally, existing system which is based on normal SURF method is compared with our proposed system which is based on these three proposed methods. We present that our proposed system shows reduced response time while preserving reasonably good matching accuracy.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.107-113
• /
• 2016

Visual discomfort is a common problem in three-dimensional videos. Among the methods to overcome visual discomfort presented in current research, disparity adjustment methods provide little guidance in determining the condition for disparity control. We propose a diaprity adjustment based on the characteristics of disparity distribution on visual comfort, where the visual comfort level is used as the adjustment paramter, in parallax barrier type auto-stereoscopic 3D display. In this paper, we use the horizontal image shift method for disparity adjustment to enhance visual comfort. The speeded-up robust feature is used to estimate the disparity distribution of 3D sequences, and the required amount for disparity control is chosen based on the pre-defined characteristics of disparity distribution on visual comfort. To evaluate the performance of the proposed method, we used a 3D equipment. Subjective tests were conducted at the fixed optimal viewing distance. The results show that comfortable videos were generated based on the proposed disparity adjustment method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.1
• /
• pp.26-32
• /
• 2011

This paper proposes a new method to process panoramic image stitching using SURF(Speeded Up Robust Features). Panoramic image stitching is considered a problem of the correspondence matching. In computer vision, it is difficult to find corresponding points in variable environment where a scale, rotation, view point and illumination are changed. However, SURF algorithm have been widely used to solve the problem of the correspondence matching because it is faster than SIFT(Scale Invariant Feature Transform). In this work, we also describe an efficient approach to decreasing computation time through the homography estimation using RANSAC(random sample consensus). RANSAC is a robust estimation procedure that uses a minimal set of randomly sampled correspondences to estimate image transformation parameters. Experimental results show that our method is robust to rotation, zoom, Gaussian noise and illumination change of the input images and computation time is greatly reduced.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.6
• /
• pp.67-72
• /
• 2019

This paper proposes a computer vision-based banknote recognition system intended to assist the blind. This system is robust and fast in recognizing banknotes on videos recorded with a smartphone on real-life scenarios. To reduce the computation time and enable a robust recognition in cluttered environments, this study segments the banknote candidate area from the background utilizing a technique called Pixel-Based Adaptive Segmenter (PBAS). The Speeded-Up Robust Features (SURF) interest point detector is used, and SURF feature vectors are computed only when sufficient interest points are found. The proposed algorithm achieves a recognition accuracy of 98%, a 100% true recognition rate and a 0% false recognition rate. Although Korean banknotes are used as a working example, the proposed system can be applied to recognize other countries' banknotes.

• Korean Journal of Remote Sensing
• /
• v.34 no.6_2
• /
• pp.1215-1227
• /
• 2018

Sea ice motion is an important factor for assessing change of sea ice because the motion affects to not only regional distribution of sea ice but also new ice growth and thickness of ice. This study presents an application of multi-temporal high-resolution optical satellites images obtained from Korea Multi-Purpose Satellite-2 (KOMPSAT-2) and Korea Multi-Purpose Satellite-3 (KOMPSAT-3) to measure sea ice motion using SIFT (Scale-Invariant Feature Transform), SURF (Speeded Up Robust Features) and ORB (Oriented FAST and Rotated BRIEF) feature tracking techniques. In order to use satellite images from two different sensors, spatial and radiometric resolution were adjusted during pre-processing steps, and then the feature tracking techniques were applied to the pre-processed images. The matched features extracted from the SIFT showed even distribution across whole image, however the matched features extracted from the SURF showed condensed distribution of features around boundary between ice and ocean, and this regionally biased distribution became more prominent in the matched features extracted from the ORB. The processing time of the feature tracking was decreased in order of SIFT, SURF and ORB techniques. Although number of the matched features from the ORB was decreased as 59.8% compared with the result from the SIFT, the processing time was decreased as 8.7% compared with the result from the SIFT, therefore the ORB technique is more suitable for fast measurement of sea ice motion.