• Title/Summary/Keyword: feature similarity

Search Result 595, Processing Time 0.031 seconds

CNN-based Opti-Acoustic Transformation for Underwater Feature Matching (수중에서의 특징점 매칭을 위한 CNN기반 Opti-Acoustic변환)

  • Jang, Hyesu;Lee, Yeongjun;Kim, Giseop;Kim, Ayoung
    • The Journal of Korea Robotics Society
    • /
    • v.15 no.1
    • /
    • pp.1-7
    • /
    • 2020
  • In this paper, we introduce the methodology that utilizes deep learning-based front-end to enhance underwater feature matching. Both optical camera and sonar are widely applicable sensors in underwater research, however, each sensor has its own weaknesses, such as light condition and turbidity for the optic camera, and noise for sonar. To overcome the problems, we proposed the opti-acoustic transformation method. Since feature detection in sonar image is challenging, we converted the sonar image to an optic style image. Maintaining the main contents in the sonar image, CNN-based style transfer method changed the style of the image that facilitates feature detection. Finally, we verified our result using cosine similarity comparison and feature matching against the original optic image.

Object Feature Extraction Using Double Rearrangement of the Corner Region

  • Lee, Ji-Min;An, Young-Eun
    • Journal of Integrative Natural Science
    • /
    • v.12 no.4
    • /
    • pp.122-126
    • /
    • 2019
  • In this paper, we propose a simple and efficient retrieval technique using the feature value of the corner region, which is one of the shape information attributes of images. The proposed algorithm extracts the edges and corner points of the image and rearranges the feature values of the corner regions doubly, and then measures the similarity with the image in the database using the correlation of these feature values as the feature vector. The proposed algorithm is confirmed to be more robust to rotation and size change than the conventional image retrieval method using the corner point.

Full face recognition using the feature extracted gy shape analyzing and the back-propagation algorithm (형태분석에 의한 특징 추출과 BP알고리즘을 이용한 정면 얼굴 인식)

  • 최동선;이주신
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.10
    • /
    • pp.63-71
    • /
    • 1996
  • This paper proposes a method which analyzes facial shape and extracts positions of eyes regardless of the tilt and the size of input iamge. With the extracted feature parameters of facial element by the method, full human faces are recognized by a neural network which BP algorithm is applied on. Input image is changed into binary codes, and then labelled. Area, circumference, and circular degree of the labelled binary image are obtained by using chain code and defined as feature parameters of face image. We first extract two eyes from the similarity and distance of feature parameter of each facial element, and then input face image is corrected by standardizing on two extracted eyes. After a mask is genrated line historgram is applied to finding the feature points of facial elements. Distances and angles between the feature points are used as parameters to recognize full face. To show the validity learning algorithm. We confirmed that the proposed algorithm shows 100% recognition rate on both learned and non-learned data for 20 persons.

  • PDF

SVM based Clustering Technique for Processing High Dimensional Data (고차원 데이터 처리를 위한 SVM기반의 클러스터링 기법)

  • Kim, Man-Sun;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.7
    • /
    • pp.816-820
    • /
    • 2004
  • Clustering is a process of dividing similar data objects in data set into clusters and acquiring meaningful information in the data. The main issues related to clustering are the effective clustering of high dimensional data and optimization. This study proposed a method of measuring similarity based on SVM and a new method of calculating the number of clusters in an efficient way. The high dimensional data are mapped to Feature Space ones using kernel functions and then similarity between neighboring clusters is measured. As for created clusters, the desired number of clusters can be got using the value of similarity measured and the value of Δd. In order to verify the proposed methods, the author used data of six UCI Machine Learning Repositories and obtained the presented number of clusters as well as improved cohesiveness compared to the results of previous researches.

Content-Based Image Retrieval using Histogram Area Calculation (히스토그램 영역계산을 이용한 내용기반 영상검색)

  • Park, Min-Sheik;Yoo, Gi-Hyoung;Kwak, Hoon-Sung
    • Journal of the Korea Computer Industry Society
    • /
    • v.6 no.2
    • /
    • pp.265-270
    • /
    • 2005
  • Histogram is very sensitive in lighting because of feature between color space. When it has intensity of moved light, It may be possibility that similarity drop down, So In this paper, introduce new image retrieval method that calls HAC (Histogram Area Calculation). This method divides area of Histogram by a few area and calculate areas. The proposed method is to calculate area of Histogram and compare similarity based on feature that histogram has presently. Performance of our proposed method was verified more excellent than other Conventional method and Merged Color Histogram.

  • PDF

A 3D TEXTURE SYNTHESIS APPROACH

  • Su, Ya-Lin;Chang, Chin-Chen;Shih, Zen-Chung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.28-31
    • /
    • 2009
  • In this paper, a new approach for solid texture synthesis from input volume data is presented. In the pre-process, feature vectors and a similarity set were constructed for input volume data. The feature vectors were used to construct neighboring vectors for more accurate neighborhood matching. The similarity set which recorded 3 candidates for each voxel helped more effective neighborhood matching. In the synthesis process, the pyramid synthesis method was used to synthesize solid textures from coarse to fine level. The results of the proposed approach were satisfactory.

  • PDF

Image Feature Representation Using Code Vectors for Retrieval

  • Nishat, Ahmad;Zhao, Hui;Park, Jong-An;Park, Seung-Jin;Yang, Won-II
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.3
    • /
    • pp.122-130
    • /
    • 2009
  • The paper presents an algorithm which uses code vectors to represent comer geometry information for searching the similar images from a database. The comers have been extracted by finding the intersections of the detected lines found using Hough transform. Taking the comer as the center coordinate, the angles of the intersecting lines are determined and are represented using code vectors. A code book has been used to code each comer geometry information and indexes to the code book are generated. For similarity measurement, the histogram of the code book indexes is used. This result in a significant small size feature matrix compared to the algorithms using color features. Experimental results show that use of code vectors is computationally efficient in similarity measurement and the comers being noise invariant produce good results in noisy environments.

  • PDF

Improvement of ASIFT for Object Matching Based on Optimized Random Sampling

  • Phan, Dung;Kim, Soo Hyung;Na, In Seop
    • International Journal of Contents
    • /
    • v.9 no.2
    • /
    • pp.1-7
    • /
    • 2013
  • This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

Quality Benchmark of 360 Panoramic Image Generation (360 도 파노라마 영상 생성 기법의 품질 측정 기법 비교)

  • Kim, Soo Jie;Park, In Kyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2021.06a
    • /
    • pp.212-215
    • /
    • 2021
  • 본 논문에서는 6 Fisheye lens 원본 영상에 대하여 Insta360 stitcher, AutoStitch[4], As-Projective-AsPossible(APAP)[5] 스티칭 방법으로 360 도 파노라마 영상을 생성하고 기하학적 왜곡과 컬러 왜곡을 비교 평가한다. 360 도 파노라마 Image Quality Assessment(IQA) 메트릭으로 Natural Image Quality Evaluator(NIQE)[6], Blind/Referenceless Image Spatial Quality Evaluator (BRISQUE)[7], Perception based Image Quality Evaluator(PIQE)[8], Feature Similarity(FSIM)[9] 그리고 high frequency feature 에 대한 Structural Similarity(SSIM)[10]을 측정하여 정량적 평가를 하며 정성적인 비교를 통하여 파노라마 영상의 품질과 평가 메트릭에 대한 벤치마크를 제공한다.

  • PDF

Combining Different Distance Measurements Methods with Dempster-Shafer-Theory for Recognition of Urdu Character Script

  • Khan, Yunus;Nagar, Chetan;Kaushal, Devendra S.
    • International Journal of Ocean System Engineering
    • /
    • v.2 no.1
    • /
    • pp.16-23
    • /
    • 2012
  • In this paper we discussed a new methodology for Urdu Character Recognition system using Dempster-Shafer theory which can powerfully estimate the similarity ratings between a recognized character and sampling characters in the character database. Recognition of character is done by five probability calculation methods such as (similarity, hamming, linear correlation, cross-correlation, nearest neighbor) with Dempster-Shafer theory of belief functions. The main objective of this paper is to Recognition of Urdu letters and numerals through five similarity and dissimilarity algorithms to find the similarity between the given image and the standard template in the character recognition system. In this paper we develop a method to combine the results of the different distance measurement methods using the Dempster-Shafer theory. This idea enables us to obtain a single precision result. It was observed that the combination of these results ultimately enhanced the success rate.