Earticle

현재 위치 Home

A Graph-Based Matching Algorithm on Sub-Sequence of Near Duplicated Video

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJSIP) 바로가기
  • 간행물
    International Journal of Signal Processing, Image Processing and Pattern Recognition 바로가기
  • 통권
    Vol.8 No.11 (2015.11)바로가기
  • 페이지
    pp.339-354
  • 저자
    Liao Ruihua, Zhao Kai
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A270023

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
As to solving the effectiveness and efficiency problem in the process of detecting the near duplicated video, we the thesis proposes a graph-based matching algorithm on sub-sequence of near duplicated video. The method will built similarity researching results based on the features of key frames feature into the query matching diagram, and then the near duplicated video detection is converted into a problem of searching the longest path in the matching results graph. As for its main advantage, firstly, it can find the best matching sequence in many cluttered matching results, which can effectively exclude a lot of noises brought by certain false “high similarity” matching, thus to some extent it can compensate the deficiencies of the underlying characterization force. Secondly, because it fully understands and uses the timing characteristics of the video sequences, the positioning accuracy of near duplicated video is with a high degree. Finally, multiple discrete paths existing in the matching results graphs are automatically detected, thus the situation where two video segments may exist several near duplicated videos can be detected once time. Experimental results show that the graph-based matching algorithm on video sub sequence improve the detection accuracy, at the same time improve the detection efficiency, which achieved good practice effect.

목차

Abstract
 1. Introduction
 2. A Graph-based Matching Algorithm on Sub-sequence of Near Duplicated Video
  A. Algorithm Framework
  B. Algorithm Realization
 3. Experiments and Analysis
  A. Experimental Procedure
  B. Experiment Results
  c. Experimental Analyses
 4. Conclusions
 References

키워드

figure near duplicated video subsequence matching key frames path scatter

저자

  • Liao Ruihua [ School of Information Science and Engineering, Hunan First Normal University, Changsha, China ]
  • Zhao Kai [ Teaching Affairs Division, Pingdingshan University, Henan Pingdingshan, China ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJSIP) [Science & Engineering Research Support Center, Republic of Korea(IJSIP)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Signal Processing, Image Processing and Pattern Recognition
  • 간기
    격월간
  • pISSN
    2005-4254
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Signal Processing, Image Processing and Pattern Recognition Vol.8 No.11

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장