Fast local invariant feature using intensity rank order = 밝기 순위를 이용한 고속 지역 불변 특징량

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 242
  • Download : 0
then compute those on a pyramid scale space built without smoothing. Moreover, we apply CPU-based parallel processing, SIMD (Single Instruction Multiple Data) in order to speed up the keypiont detection without additional requirement of hardware resources. Second, we present a floating-point descriptor which is based on intensity rank orders. Intensities have enough distinctiveness, however it could not be used as descriptors directly due to the lack of the robustness for brightness changes. We reinforce the robustness of the intensity by a rank-order normalization. The computational requirement for intensity rank orders is reduced by using the histogram equalization instead of sorting algorithms. Finally, we propose an intensity-rank-order-based binary descriptor. A previous intensity-rank-order-based binary descriptor shows poor recognition rates and high computational complexity. Fixed threshold for intensity rank orders on a rotation-normalized image patch causes poor recognition rates. The proposed binary descriptor resolves the recognition problem by adaptive binning, and has lower computational complexity than intensity-difference-based binary descriptors due to the histogram equalization and the lookup table. We evaluated the performance of the proposed local invariant features extensively using the publicly available evaluation toolkits and databases. The experiment results of the proposed methods are compared to those of state-of-the-art methods, and show high performance. Real image sequences, which are captured under various image acquisition conditions, and synthetic image sequences, which are generated by finer-level deformations, are used to evaluate the features. Features are compared in terms of the repeatability for detection, and the recall and precision for matching. In order to analyze the computational complexity of each part of the feature, we compared the timings of the detection, the description, and the direction respectively. Moreover, we applied the proposed method to recognition tests to prove the usefulness of the proposed method.; Local invariant feature may be the most efficient method for finding correspondences of image patches. Feature detects regions called keypoint in an image, then encode information of a local neighbor of the keypoint into a vector called descriptor. Correspondences of detected keypoints in two or several images could be found by comparing similarities of descriptors. Correspondences of image regions are very basic and core information for various computer vision techniques, such as image retrieval, object recognition, motion estimation, 3D reconstruction, and SLAM (Simultaneous Localization and Mapping). As a basic element technology, local invariant feature needs to have high performance in terms of the precision and the computational efficiency. In this dissertation, we present a fast and robust local invariant feature using intensity rank order. First, we introduce a fast and robust method to detect blob-like structures. For that, we approximate the determinant of the Hessian matrix, which is known as the blob measure, by a small number of pixels
Advisors
Kweon, In Soresearcher권인소researcher
Description
한국과학기술원 :전기및전자공학부,
Publisher
한국과학기술원
Issue Date
2017
Identifier
325007
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학부, 2017.8,[vi, 87 p. :]

Keywords

local invariant feature▼akeypoint▼adetection▼adescriptor▼abinary descriptor▼ablob▼aintensity rank order▼arank-order normalization▼ahistogram equalization▼aadaptive binning; 지역 불변 특징량▼a키포인트▼a검출▼a기술자▼a이진 기술자▼a블랍▼a밝기값 순위▼a순위 정규화▼a히스토그램 평활화▼a적응적 구간 분할

URI
http://hdl.handle.net/10203/242052
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=718932&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0