• Title/Summary/Keyword: matched image

Search Result 407, Processing Time 0.025 seconds

Performance Comparison and Analysis between Keypoints Extraction Algorithms using Drone Images (드론 영상을 이용한 특징점 추출 알고리즘 간의 성능 비교)

  • Lee, Chung Ho;Kim, Eui Myoung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.40 no.2
    • /
    • pp.79-89
    • /
    • 2022
  • Images taken using drones have been applied to fields that require rapid decision-making as they can quickly construct high-quality 3D spatial information for small regions. To construct spatial information based on drone images, it is necessary to determine the relationship between images by extracting keypoints between adjacent drone images and performing image matching. Therefore, in this study, three study regions photographed using a drone were selected: a region where parking lots and a lake coexisted, a downtown region with buildings, and a field region of natural terrain, and the performance of AKAZE (Accelerated-KAZE), BRISK (Binary Robust Invariant Scalable Keypoints), KAZE, ORB (Oriented FAST and Rotated BRIEF), SIFT (Scale Invariant Feature Transform), and SURF (Speeded Up Robust Features) algorithms were analyzed. The performance of the keypoints extraction algorithms was compared with the distribution of extracted keypoints, distribution of matched points, processing time, and matching accuracy. In the region where the parking lot and lake coexist, the processing speed of the BRISK algorithm was fast, and the SURF algorithm showed excellent performance in the distribution of keypoints and matched points and matching accuracy. In the downtown region with buildings, the processing speed of the AKAZE algorithm was fast and the SURF algorithm showed excellent performance in the distribution of keypoints and matched points and matching accuracy. In the field region of natural terrain, the keypoints and matched points of the SURF algorithm were evenly distributed throughout the image taken by drone, but the AKAZE algorithm showed the highest matching accuracy and processing speed.

Study on Improving Hyperspectral Target Detection by Target Signal Exclusion in Matched Filtering (초분광 영상의 표적신호 분리에 의한 Matched Filter의 표적물질 탐지 성능 향상 연구)

  • Kim, Kwang-Eun
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.5
    • /
    • pp.433-440
    • /
    • 2015
  • In stochastic hyperspectral target detection algorithms, the target signal components may be included in the background characterization if targets are not rare in the image, causing target leakage. In this paper, the effect of target leakage is analysed and an improved hyperspectral target detection method is proposed by excluding the pixels which have similar reflectance spectrum with the target in the process of background characterization. Experimental results using the AISA airborne hyperspectral data and simulated data with artificial targets show that the proposed method can dramatically improve the target detection performance of matched filter and adaptive cosine estimator. More studies on the various metrics for measuring spectral similarity and adaptive method to decide the appropriate amount of exclusion are expected to increase the performance and usability of this method.

A Multi-Stage Approach to Secure Digital Image Search over Public Cloud using Speeded-Up Robust Features (SURF) Algorithm

  • AL-Omari, Ahmad H.;Otair, Mohammed A.;Alzwahreh, Bayan N.
    • 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.

Development of Car Type Classification Algorithm on the UAV platform using NCC (NCC기법을 이용한 무인항공기용 차종 식별 알고리즘 개발)

  • Jeong, Jae-Won;Kim, Jeong-Ho;Heo, Jin-Woo;Han, Dong-In;Lee, Dae-Woo;Seong, Kie-Jeong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.40 no.7
    • /
    • pp.582-589
    • /
    • 2012
  • This paper describes the algorithm recognizing car type from the image received from UAV and the recognition results between three types of car images. Using the NCC(Normalized Cross-Correlation) algorithm, geometric information is matched from template images. Template images are obtained from UAV and satellite map and indoor experiment is performed using satellite map. After verification of the possibility, experiment for verification of same car type recognition is performed using small UAV. In the experiment, same type cars are matched with 0.6 point similarity and truck with similar color distribution is not matched with template image of a sedan.

Object Recogniton for Markerless Augmented Reality Embodiment (마커 없는 증강 현실 구현을 위한 물체인식)

  • Paul, Anjan Kumar;Lee, Hyung-Jin;Kim, Young-Bum;Islam, Mohammad Khairul;Baek, Joong-Hwan
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.1
    • /
    • pp.126-133
    • /
    • 2009
  • In this paper, we propose an object recognition technique for implementing marker less augmented reality. Scale Invariant Feature Transform (SIFT) is used for finding the local features from object images. These features are invariant to scale, rotation, translation, and partially invariant to illumination changes. Extracted Features are distinct and have matched with different image features in the scene. If the trained image is properly matched, then it is expected to find object in scene. In this paper, an object is found from a scene by matching the template images that can be generated from the first frame of the scene. Experimental results of object recognition for 4 kinds of objects showed that the proposed technique has a good performance.

  • PDF

Detection of Retinal Vessels of Fundus Photograph Using Hessian Algorithm (안저 영상에서 헤이지안 알고리즘을 이용한 혈관 검출)

  • Kang, Ho-Chul;Kim, Kwang-Gi;Oh, Whi-Vin;Hwang, Jeong-Min
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.8
    • /
    • pp.1082-1088
    • /
    • 2009
  • Fundus images are highly useful in evaluating patients' retinal conditions in diagnosing eye diseases. In particular, vessel regions are essential in diagnosing diabetes and hypertension. In this paper, we used top-hat filter to compensate for non-uniform background. Image contrast was enhanced by using contrast limited adaptive histogram equalization (CLAHE) method. Hessian matrix was next applied to detect vessel regions. Results indicate that our method is 1.3% more accurate than matched filter method. Our proposed method is expected to contribute to diagnosing eye diseases.

  • PDF

A Fast Algorithm for Fractal Image Coding

  • Kim, Jeong-Il;Kwak, Seung-Uk;Jeong, Keun-Won;Song, In-Keun;Yoo, Choong-Yeol;Lee, Kwang-Bae;Kim, Hyen-Ug
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 1998.06a
    • /
    • pp.521-525
    • /
    • 1998
  • In this paper, we propose a fast algorithm for fractal image coding to shorten long time to take on fractal image encoding. For its performance evaluation, the algorithm compares with other traditional fractal coding methods. In the traditional fractal image coding methods, an original image is contracted by a factor in order to make an image to be matched. Then, the whole area of the contracted image is searched in order to find contractive transformation point of the original image corresponding to the contacted image. It needs a lot of searching time on encoding and remains limitation in the improvement of compression ratio. However, the proposed algorithm not only considerably reduces encoding tin e by using scaling method and limited search area method but also improves compression ratio by using bit-plane. When comparing the proposed algorithm with Jacquin's method, the proposed algorithm provides much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

  • PDF

Keypoints-Based 2D Virtual Try-on Network System

  • Pham, Duy Lai;Ngyuen, Nhat Tan;Chung, Sun-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.2
    • /
    • pp.186-203
    • /
    • 2020
  • Image-based Virtual Try-On Systems are among the most potential solution for virtual fitting which tries on a target clothes into a model person image and thus have attracted considerable research efforts. In many cases, current solutions for those fails in achieving naturally looking virtual fitted image where a target clothes is transferred into the body area of a model person of any shape and pose while keeping clothes context like texture, text, logo without distortion and artifacts. In this paper, we propose a new improved image-based virtual try-on network system based on keypoints, which we name as KP-VTON. The proposed KP-VTON first detects keypoints in the target clothes and reliably predicts keypoints in the clothes of a model person image by utilizing a dense human pose estimation. Then, through TPS transformation calculated by utilizing the keypoints as control points, the warped target clothes image, which is matched into the body area for wearing the target clothes, is obtained. Finally, a new try-on module adopting Attention U-Net is applied to handle more detailed synthesis of virtual fitted image. Extensive experiments on a well-known dataset show that the proposed KP-VTON performs better the state-of-the-art virtual try-on systems.

Post Processing to Reduce Wrong Matches in Stereo Matching

  • Park, Hee-Ju;Lee, Suk-Bae
    • Korean Journal of Geomatics
    • /
    • v.1 no.1
    • /
    • pp.43-49
    • /
    • 2001
  • Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.

  • PDF