RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • A Graph-Based Matching Algorithm on Sub-Sequence of Near Duplicated Video

        Liao Ruihua,Zhao Kai 보안공학연구지원센터 2015 International Journal of Signal Processing, Image Vol.8 No.11

        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.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼