• Title/Summary/Keyword: Feature extraction algorithm

Search Result 877, Processing Time 0.029 seconds

Similar Movie Contents Retrieval Using Peak Features from Audio (오디오의 Peak 특징을 이용한 동일 영화 콘텐츠 검색)

  • Chung, Myoung-Bum;Sung, Bo-Kyung;Ko, Il-Ju
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1572-1580
    • /
    • 2009
  • Combing through entire video files for the purpose of recognizing and retrieving matching movies requires much time and memory space. Instead, most current similar movie-matching methods choose to analyze only a part of each movie's video-image information. Yet, these methods still share a critical problem of erroneously recognizing as being different matching videos that have been altered only in resolution or converted merely with a different codecs. This paper proposes an audio-information-based search algorithm by which similar movies can be identified. The proposed method prepares and searches through a database of movie's spectral peak information that remains relatively steady even with changes in the bit-rate, codecs, or sample-rate. The method showed a 92.1% search success rate, given a set of 1,000 video files whose audio-bit-rate had been altered or were purposefully written in a different codec.

  • PDF

Image Based Text Matching Using Local Crowdedness and Hausdorff Distance (지역 밀집도 및 Hausdorff 거리를 이용한 영상기반 텍스트 매칭)

  • Son, Hwa-Jeong;Kim, Ji-Soo;Park, Mi-Seon;Yoo, Jae-Myeong;Kim, Soo-Hyung
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.10
    • /
    • pp.134-142
    • /
    • 2006
  • In this paper, we investigate a Hausdorff distance, which is used for the measurement of image similarity, to see whether it is also effective for document retrieval. The proposed method uses a local crowdedness and a Hausdorff distance to locate text images by determining whether a pair of images scanned at different time comes from the same text or not. To reduce the processing time, which is one of the disadvantages of a Hausdorff distance algorithm, we adopt a local crowdedness for feature point extraction. We apply the proposed method to 190 pairs of the same class and 190 pairs of the different class collected from postal envelop images. The results show that the modified Hausdorff distance proposed in this paper performed well in locating the tort region and calculating the degree of similarity between two images. An improvement of accuracy by 2.7% and 9.0% has been obtained, compared to a binary correlation method and the original Hausdorff distance method, respectively.

  • PDF

A Technique for Image Processing of Concrete Surface Cracks (콘크리트 표면 균열의 영상 처리 기법)

  • Kim Kwang-Baek;Cho Jae-Hyun;Ahn Sang-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.7
    • /
    • pp.1575-1581
    • /
    • 2005
  • Recently, further study is being done on the affect of crack on concrete structure and many people have made every endeavor not to leave it unsettled but to minimize it by repair works. In this paper we propose the image processing method that do not remain manual but automatically process the length, the direction and e width of cracks on concrete surface. First, we calibrate light's affect from image by using closing operation, one of morphology methods that can extract the feature of oracle and we extract the edge of crack image by sobel mask. After it, crack image is binarized by iteration binarization. And we extract the edge of cracks using noise elimination method that use an average of adjacent pixels by 3${\times}$3 mask and Glassfire Labeling algorithm. on, in this paper we propose an image processing method which can automatically measure the length, the direction and the width of cracks using the extracted edges of cracks. The results of experiment showed that the proposed method works better on the extraction of concrete cracks. Also our method showed the possibility that inspector's decision is unnecessary.

Obstacle Recognition by 3D Feature Extraction for Mobile Robot Navigation in an Indoor Environment (복도환경에서의 이동로봇 주행을 위한 3차원 특징추출을 통한 장애물 인식)

  • Jin, Tae-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.1987-1992
    • /
    • 2010
  • This paper deals with the method of using the three dimensional characteristic information to classify the front environment in travelling by using the images captured by a CCD camera equipped on a mobile robot. The images detected by the three dimensional characteristic information is divided into the part of obstacles, the part of corners, and th part of doorways in a corridor. In designing the travelling path of a mobile robot, these three situations are used as an important information in the obstacle avoidance and optimal path computing. So, this paper proposes the method of deciding the travelling direction of a mobile robot with using input images based upon the suggested algorithm by preprocessing, and verified the validity of the image information which are detected as obstacles by the analysis through neural network.

One-Dimensional Radar Scattering Center for Target Recognition of Ground Target in W-Band Millimeter Wave Seeker Considering Missile Flight-Path Scenario (유도탄 조우 시나리오를 고려한 W-대역 밀리미터파 탐색기의 지상 표적 식별을 위한 1차원 산란점 추출에 관한 연구)

  • Park, Sungho;Kim, Jihyun;Woo, Seon-Keol;Kwon, Jun-Beom;Kim, Hong-Rak
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.28 no.12
    • /
    • pp.982-992
    • /
    • 2017
  • In this paper, we introduce a method of selection for the optimal transmission polarization of a W-band seeker through the extraction of the one-dimensional scattering center of a ground tank target. We calculated the surface scattering and edge scattering using the shooting and bouncing ray tracing method of the CST A-solver. Based on 4-channel RCS data, using the one-dimensional RELAX algorithm, which is a kind of spectral estimation technique, scattering centers of ground targets were extracted. According to the changes in the polarization state and look angle, we compared and analyzed the scattering center results. Through simulation, we verified that the scattering center results can be applied when feature vectors are used for target recognition.

Face Recognition Under Ubiquitous Environments (유비쿼터스 환경을 이용한 얼굴인식)

  • Go, Hyoun-Joo;Kim, Hyung-Bae;Yang, Dong-Hwa;Park, Jang-Hwan;Chun, Myung-Geun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.4
    • /
    • pp.431-437
    • /
    • 2004
  • This paper propose a facial recognition method based on an ubiquitous computing that is one of next generation intelligence technology fields. The facial images are acquired by a mobile device so-called cellular phone camera. We consider a mobile security using facial feature extraction and recognition process. Facial recognition is performed by the PCA and fuzzy LDA algorithm. Applying the discrete wavelet based on multi-resolution analysis, we compress the image data for mobile system environment. Euclidean metric is applied to measure the similarity among acquired features and then obtain the recognition rate. Finally we use the mobile equipment to show the efficiency of method. From various experiments, we find that our proposed method shows better results, even though the resolution of mobile camera is lower than conventional camera.

Flower Recognition System Using OpenCV on Android Platform (OpenCV를 이용한 안드로이드 플랫폼 기반 꽃 인식 시스템)

  • Kim, Kangchul;Yu, Cao
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.1
    • /
    • pp.123-129
    • /
    • 2017
  • New mobile phones with high tech-camera and a large size memory have been recently launched and people upload pictures of beautiful scenes or unknown flowers in SNS. This paper develops a flower recognition system that can get information on flowers in the place where mobile communication is not even available. It consists of a registration part for reference flowers and a recognition part based on OpenCV for Android platform. A new color classification method using RGB color channel and K-means clustering is proposed to reduce the recognition processing time. And ORB for feature extraction and Brute-Force Hamming algorithm for matching are used. We use 12 kinds of flowers with four color groups, and 60 images are applied for reference DB design and 60 images for test. Simulation results show that the success rate is 83.3% and the average recognition time is 2.58 s on Huawei ALEUL00 and the proposed system is suitable for a mobile phone without a network.

Design of Biometrics System Using ECG Lead III Signals (심전도 신호의 리드 III 파형을 이용한 바이오인식)

  • Min, Chul-Hong;Kim, Tae-Seon
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.48 no.6
    • /
    • pp.43-50
    • /
    • 2011
  • Currently, conventional security methods including IC card or password type method are quickly switched into biometric security systems in various applications and the electrocardiogram (ECG) has been considered as one of novel biometrics way. However, conventional ECG based biometrics used lead II signal which conventionally used for formulaic signal to heart disease diagnosis and it is not suitable for biometrics since it is rather difficult to find consistent features for heart disease patents. To overcome this problem, we developed new biometrics system using ECG lead III signals. For wave extraction, signal peak points are extracted through AAV algorithm. For feature selection, extracted waves are categorized into one of four wave types and total twenty two features including number of vertices, wave shapes, amplitude information and interval information are extracted based on their wave types. Experimental results for thirty-six people showed 100% specificity, 95.59% sensitivity and 99.17% of overall identification accuracy.

Door Recognition using Visual Fuzzy System in Indoor Environments (시각 퍼지 시스템을 이용한 실내 문 인식)

  • Yi, Chu-Ho;Lee, Sang-Heon;Jeong, Seung-Do;Suh, Il-Hong;Choi, Byung-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.1
    • /
    • pp.73-82
    • /
    • 2010
  • Door is an important object to understand given environment and it could be used to distinguish with corridors and rooms. Doors are widely used natural landmark in mobile robotics for localization and navigation. However, almost algorithm for door recognition with camera is difficult real-time application because feature extraction and matching have heavy computation complexity. This paper proposes a method to recognize a door in corridor. First, we extract distinguished lines which have high possibility to comprise of door using Hough transformation. Then, we detect candidate of door region by applying previously extracted lines to first-stage visual fuzzy system. Finally, door regions are determined by verifying knob region in candidate of door region suing second-stage visual fuzzy system.

Face and Its Components Extraction of Animation Characters Based on Dominant Colors (주색상 기반의 애니메이션 캐릭터 얼굴과 구성요소 검출)

  • Jang, Seok-Woo;Shin, Hyun-Min;Kim, Gye-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.93-100
    • /
    • 2011
  • The necessity of research on extracting information of face and facial components in animation characters have been increasing since they can effectively express the emotion and personality of characters. In this paper, we introduce a method to extract face and facial components of animation characters by defining a mesh model adequate for characters and by using dominant colors. The suggested algorithm first generates a mesh model for animation characters, and extracts dominant colors for face and facial components by adapting the mesh model to the face of a model character. Then, using the dominant colors, we extract candidate areas of the face and facial components from input images and verify if the extracted areas are real face or facial components by means of color similarity measure. The experimental results show that our method can reliably detect face and facial components of animation characters.