• Title/Summary/Keyword: 3D 특징 벡터

Search Result 108, Processing Time 0.028 seconds

Robust 3D Model Hashing Scheme Based on Shape Feature Descriptor (형상 특징자 기반 강인성 3D 모델 해싱 기법)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.6
    • /
    • pp.742-751
    • /
    • 2011
  • This paper presents a robust 3D model hashing dependent on key and parameter by using heat kernel signature (HKS), which is special shape feature descriptor, In the proposed hashing, we calculate HKS coefficients of local and global time scales from eigenvalue and eigenvector of Mesh Laplace operator and cluster pairs of HKS coefficients to 2D square cells and calculate feature coefficients by the distance weights of pairs of HKS coefficients on each cell. Then we generate the binary hash through binarizing the intermediate hash that is the combination of the feature coefficients and the random coefficients. In our experiment, we evaluated the robustness against geometrical and topological attacks and the uniqueness of key and model and also evaluated the model space by estimating the attack intensity that can authenticate 3D model. Experimental results verified that the proposed scheme has more the improved performance than the conventional hashing on the robustness, uniqueness, model space.

Content-based music retrieval using temporal characteristics (Temporal 특성을 이용한 내용기반 음악 정보 검색)

  • Park Chuleui;Park Mansoo;Kim Sungtak;Kim Hoi-Rin;Kang Kyeongok
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • autumn
    • /
    • pp.299-302
    • /
    • 2004
  • 본 논문에서는 내용 기반 음악 정보 검색에 음악의 temporal 특징을 이용한 검색 방법을 제안한다. 방송환경에 적용하기 위해 검색 범위를 드라마나 영화의 배경 음악으로 사용되는 OST 앨범으로 제한하였다. 오디오의 특징 벡터로써 UFCC(Mel Frequency Cepstral Coefficient)를 사용하였으며 이 특징 벡터를 이용하여 VQ(Vector Quantization)로 부호화한 codeword로 오디오 신호의 시변 특성을 표현한다. 본 논문에서는 제안한 음악의 temporal 특성을 반영한 codeword-sequence를 이용하는 방법을 pitch-histogram을 기반으로 하는 방법 및 MFCC codeword-histogram을 기반으로 하는 방법과 비교하고 성능 개선을 보여주었다.

  • PDF

A Study on the Deep Neural Network based Recognition Model for Space Debris Vision Tracking System (심층신경망 기반 우주파편 영상 추적시스템 인식모델에 대한 연구)

  • Lim, Seongmin;Kim, Jin-Hyung;Choi, Won-Sub;Kim, Hae-Dong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.45 no.9
    • /
    • pp.794-806
    • /
    • 2017
  • It is essential to protect the national space assets and space environment safely as a space development country from the continuously increasing space debris. And Active Debris Removal(ADR) is the most active way to solve this problem. In this paper, we studied the Artificial Neural Network(ANN) for a stable recognition model of vision-based space debris tracking system. We obtained the simulated image of the space environment by the KARICAT which is the ground-based space debris clearing satellite testbed developed by the Korea Aerospace Research Institute, and created the vector which encodes structure and color-based features of each object after image segmentation by depth discontinuity. The Feature Vector consists of 3D surface area, principle vector of point cloud, 2D shape and color information. We designed artificial neural network model based on the separated Feature Vector. In order to improve the performance of the artificial neural network, the model is divided according to the categories of the input feature vectors, and the ensemble technique is applied to each model. As a result, we confirmed the performance improvement of recognition model by ensemble technique.

A study on the lip shape recognition algorithm using 3-D Model (3차원 모델을 이용한 입모양 인식 알고리즘에 관한 연구)

  • 남기환;배철수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.5
    • /
    • pp.783-788
    • /
    • 2002
  • Recently, research and developmental direction of communication system is concurrent adopting voice data and face image in speaking to provide more higher recognition rate then in the case of only voice data. Therefore, we present a method of lipreading in speech image sequence by using the 3-D facial shape model. The method use a feature information of the face image such as the opening-level of lip, the movement of jaw, and the projection height of lip. At first, we adjust the 3-D face model to speeching face Image sequence. Then, to get a feature information we compute variance quantity from adjusted 3-D shape model of image sequence and use the variance quality of the adjusted 3-D model as recognition parameters. We use the intensity inclination values which obtaining from the variance in 3-D feature points as the separation of recognition units from the sequential image. After then, we use discrete HMM algorithm at recognition process, depending on multiple observation sequence which considers the variance of 3-D feature point fully. As a result of recognition experiment with the 8 Korean vowels and 2 Korean consonants, we have about 80% of recognition rate for the plosives md vowels.

A study on the lip shape recognition algorithm using 3-D Model (3차원 모델을 이용한 입모양 인식 알고리즘에 관한 연구)

  • 김동수;남기환;한준희;배철수;나상동
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1998.11a
    • /
    • pp.181-185
    • /
    • 1998
  • Recently, research and developmental direction of communication system is concurrent adopting voice data and face image in speaking to provide more higher recognition rate then in the case of only voice data. Therefore, we present a method of lipreading in speech image sequence by using the 3-D facial shape model. The method use a feature information of the face image such as the opening-level of lip, the movement of jaw, and the projection height of lip. At first, we adjust the 3-D face model to speeching face image sequence. Then, to get a feature information we compute variance quantity from adjusted 3-D shape model of image sequence and use the variance quality of the adjusted 3-D model as recognition parameters. We use the intensity inclination values which obtaining from the variance in 3-D feature points as the separation of recognition units from the sequential image. After then, we use discrete HMM algorithm at recognition process, depending on multiple observation sequence which considers the variance of 3-D feature point fully. As a result of recognition experiment with the 8 Korean vowels and 2 Korean consonants, we have about 80% of recognition rate for the plosives and vowels.

  • PDF

Mechanical Fault Classification of an Induction Motor using Texture Analysis (질감 분석을 이용한 유도 전동기의 기계적 결함 분류)

  • Jang, Won-Chul;Park, Yong-Hoon;Kang, Myeong-Su;Kim, Jong-Myon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.12
    • /
    • pp.11-19
    • /
    • 2013
  • This paper proposes an algorithm using vibration signals and texture analysis for mechanical fault diagnosis of an induction motor. We analyze characteristics of contrast and pattern of an image converted from vibration signal and extract three texture features using gray-level co-occurrence model(GLCM). Then, the extracted features are used as inputs of a multi-level support vector machine(MLSVM) which utilizes the radial basis function(RBF) kernel function to classify each fault type. In addition, we evaluate the classification performance with varying the parameter from 0.3 to 1.0 for the RBF kernel function of MLSVM, and the proposed algorithm achieved 100% classification accuracy with the parameter of the RBF from 0.3 to 1.0. Moreover, the proposed algorithm achieved about 98% classification accuracy with 15dB and 20dB noise inserted vibration signals.

Acceleration of 2D Image Based Flow Visualization using GPU (GPU를 이용한 2차원 영상 기반 유동 가시화 기법의 가속)

  • Lee, Joong-Youn
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.543-546
    • /
    • 2007
  • Flow visualization is one of visualization techniques and it means a visual expression of vector data using 2D or 3D graphics. It aims for human to easily find and understand a special feature of the vector data. The Image Based Flow Visualization (IBFV) is one of the fastest technique in the dense integration based flow visualization techniques. In this paper, IBFV is accelerated and implemented using commodity GPU. Especially, mesh advection is accelerated at the vertex program.

  • PDF

Study of Traffic Sign Auto-Recognition (교통 표지판 자동 인식에 관한 연구)

  • Kwon, Mann-Jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.9
    • /
    • pp.5446-5451
    • /
    • 2014
  • Because there are some mistakes by hand in processing electronic maps using a navigation terminal, this paper proposes an automatic offline recognition for traffic signs, which are considered ingredient navigation information. Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which have been used widely in the field of 2D face recognition as computer vision and pattern recognition applications, was used to recognize traffic signs. First, using PCA, a high-dimensional 2D image data was projected to a low-dimensional feature vector. The LDA maximized the between scatter matrix and minimized the within scatter matrix using the low-dimensional feature vector obtained from PCA. The extracted traffic signs under a real-world road environment were recognized successfully with a 92.3% recognition rate using the 40 feature vectors created by the proposed algorithm.

A Study on NPC Grouping of 3D Game using Gabor Characteristics (가버 특성을 이용한 3D 게임의 NPC 그룹핑에 관한 연구)

  • Park, Chang-Min
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.12
    • /
    • pp.2836-2842
    • /
    • 2010
  • An NPC grouping method is proposed for various 3D games depending on their characteristics. Immovable objects tend to have particular orientation features in their Gabor filtering results whereas the movable objects controlled by AI appearing as a human or an animal do not. First of all, We analyzed directional and frequency domain features in the NPC object and configured them as 24 Gabor filter banks. Then, 24-dimensional feature vectors according to the scale and direction of the filter are calculated. Each extracted vector represents the energy of a certain direction. This energy indicates the particular direction strength of the object texture. Thus, using this property, NPCs could be grouped as artificial objects and natural objects effectively and it draws the game more speed and strategic actions as a result.

SPVD based Dimension Reduction Algorithm using Vector Angle of Spectral Curve for Material Classification (물질분류를 위한 분광곡선의 벡터 각을 이용한 SPVD 차원축소 알고리즘)

  • Yu, Jae-Hwan;Kim, Deok-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.387-389
    • /
    • 2012
  • 초분광영상은 사람이 볼 있는 가시광선 영역부터 자외선 파장 대역까지 수십에서 수천 개의 데이터를 가지고 있는 고차원 데이터이다. 그렇기 때문에 초분광영상을 이용한 연구에는 많은 저장 공간과 고사양의 성능을 필요로 한다. 따라서 초분광영상의 차원을 감소시켜 데이터용량을 줄이고, 처리속도를 향상시키기 위한 연구들이 이루어지고 있다. 기존에 자주 사용되던 방법인 PCA와 ICA는 차원축소를 위하여 고유벡터를 계산하고 이를 이용하여 축을 변경하여 차원축소를 한다. 하지만 초분광영상에서는 이러한 방법으로 차원을 축소할 시 정확도가 감소한다. 따라서 본 논문에서는 특징 밴드를 추출하고 이를 이용하여 차원축소를 하는 SPVD 알고리즘을 제안한다. SPVD(Spectral pair vector decomposition) 알고리즘은 d개의 그룹으로 나누고 각 그룹들의 양벡터 각과 음벡터 각을 계산한 후 이를 이용하여 차원축소를 한다. 실험 결과 PCA는 61차원에서 70.05%, ICA는 71차원에서 63.03% 정확도를 보이는데 비해 SPVD 알고리즘은 3차원에서 83% 정확도를 보였다.