• Title/Summary/Keyword: Representative Frame

Search Result 185, Processing Time 0.024 seconds

Scene Change Detection with 3-Step Process (3단계 과정의 장면 전환검출)

  • Yoon, Shin-Seong;Won, Rhee-Yang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.6
    • /
    • pp.147-154
    • /
    • 2008
  • First, this paper compute difference value between frames using the composed method of $X^2$ histogram and color histogram and the normalization. Next, cluster representative frame was decided by using the clustering for distance and the k-mean grouping. Finally, representative frame of group was decided by using the likelihood ratio. Proposed method can be known by experiment as outstanding of detection rather than other methods, due to computing of difference value, clustering and grouping, and detecting of representative frame.

  • PDF

A new approach for content-based video retrieval

  • Kim, Nac-Woo;Lee, Byung-Tak;Koh, Jai-Sang;Song, Ho-Young
    • International Journal of Contents
    • /
    • v.4 no.2
    • /
    • pp.24-28
    • /
    • 2008
  • In this paper, we propose a new approach for content-based video retrieval using non-parametric based motion classification in the shot-based video indexing structure. Our system proposed in this paper has supported the real-time video retrieval using spatio-temporal feature comparison by measuring the similarity between visual features and between motion features, respectively, after extracting representative frame and non-parametric motion information from shot-based video clips segmented by scene change detection method. The extraction of non-parametric based motion features, after the normalized motion vectors are created from an MPEG-compressed stream, is effectively fulfilled by discretizing each normalized motion vector into various angle bins, and by considering the mean, variance, and direction of motion vectors in these bins. To obtain visual feature in representative frame, we use the edge-based spatial descriptor. Experimental results show that our approach is superior to conventional methods with regard to the performance for video indexing and retrieval.

Edit Method Using Representative Frame on Video (비디오에서의 대표 프레임을 이용한 편집기법)

  • 유현수;이지현
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.420-423
    • /
    • 1999
  • In this paper, we propose the method which efficiently obtain information through edit and retrieval of video data easily and rapidly. To support this method, extract the candidate representative frame using existing scene change detection method and the user selects representative frame for video segmentation at his desire, and then visualization indexing methods supported by logical-links enable users to freely merge and split each scene.

  • PDF

Shot Group and Representative Shot Frame Detection using Similarity-based Clustering

  • Lee, Gye-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.9
    • /
    • pp.37-43
    • /
    • 2016
  • This paper introduces a method for video shot group detection needed for efficient management and summary of video. The proposed method detects shots based on low-level visual properties and performs temporal and spatial clustering based on visual similarity of neighboring shots. Shot groups created from temporal clustering are further clustered into small groups with respect to visual similarity. A set of representative shot frames are selected from each cluster of the smaller groups representing a scene. Shots excluded from temporal clustering are also clustered into groups from which representative shot frames are selected. A number of video clips are collected and applied to the method for accuracy of shot group detection. We achieved 91% of accuracy of the method for shot group detection. The number of representative shot frames is reduced to 1/3 of the total shot frames. The experiment also shows the inverse relationship between accuracy and compression rate.

Efficient Tracking of a Moving Object Using Representative Blocks Algorithm

  • Choi, Sung-Yug;Hur, Hwa-Ra;Lee, Jang-Myung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.678-681
    • /
    • 2004
  • In this paper, efficient tracking of a moving object using optimal representative blocks is implemented by a mobile robot with a pan-tilt camera. The key idea comes from the fact that when the image size of moving object is shrunk in an image frame according to the distance between the camera of mobile robot and the moving object, the tracking performance of a moving object can be improved by changing the size of representative blocks according to the object image size. Motion estimation using Edge Detection(ED) and Block-Matching Algorithm(BMA) is often used in the case of moving object tracking by vision sensors. However these methods often miss the real-time vision data since these schemes suffer from the heavy computational load. In this paper, the optimal representative block that can reduce a lot of data to be computed, is defined and optimized by changing the size of representative block according to the size of object in the image frame to improve the tracking performance. The proposed algorithm is verified experimentally by using a two degree-of-freedom active camera mounted on a mobile robot.

  • PDF

Efficient Tracking of a Moving Object using Optimal Representative Blocks

  • Kim, Wan-Cheol;Hwang, Cheol-Ho;Lee, Jang-Myung
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.4
    • /
    • pp.495-502
    • /
    • 2003
  • This paper focuses on the implementation of an efficient tracking method of a moving object using optimal representative blocks by way of a pan-tilt camera. The key idea is derived from the fact that when the image size of a moving object is shrunk in an image frame according to the distance between the mobile robot camera and the object in motion, the tracking performance of a moving object can be improved by reducing the size of representative blocks according to the object image size. Motion estimations using Edge Detection (ED) and Block-Matching Algorithm (BMA) are regularly employed to track objects by vision sensors. However, these methods often neglect the real-time vision data since these schemes suffer from heavy computational load. In this paper, a representative block able to significantly reduce the amount of data to be computed, is defined and optimized by changing the size of representative blocks according to the size of the object in the image frame in order to improve tracking performance. The proposed algorithm is verified experimentally by using a two degree-of- freedom active camera mounted on a mobile robot.

Improved Similarity Detection Algorithm of the Video Scene (개선된 비디오 장면 유사도 검출 알고리즘)

  • Yu, Ju-Won;Kim, Jong-Weon;Choi, Jong-Uk;Bae, Kyoung-Yul
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.2
    • /
    • pp.43-50
    • /
    • 2009
  • We proposed similarity detection method of the video frame data that extracts the feature data of own video frame and creates the 1-D signal in this paper. We get the similar frame boundary and make the representative frames within the frame boundary to extract the similarity extraction between video. Representative frames make blurring frames and extract the feature data using DOG values. Finally, we convert the feature data into the 1-D signal and compare the contents similarity. The experimental results show that the proposed algorithm get over 0.9 similarity value against noise addition, rotation change, size change, frame delete, frame cutting.

Key Frame Extraction using Shot Coverage and Distortion (샷 기여도와 왜곡률을 고려한 키 프레임 추출 알고리즘)

  • 이중용;문영식
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.3
    • /
    • pp.137-143
    • /
    • 2003
  • Key frame extraction has been recognized as one of tile important research issues in video information retrieval. Although progress has been made in key frame extraction, the existing approaches do not evaluate the importance of extracted frame Quantitatively, and Dey are computationally expensive or ineffective. In this Paper, we introduce a new 미해rithm for key frame extraction using shot coverage and distortion. The algorithm finds significant key frames from candidate key frames. When selecting the candidate frames, the coverage rate to the total frames from each frame is computed by using the difference between the adjacent frames in tile shot. The frames within 10$\%$ from the top are selected as the candidates. Then, by comfuting the distortion rate of the candidates against all frames, pick the frames which arc most representative are selected. The performance of the proposed algorithm has been verified by a statistical test. Experiments show that more than 13-50$\%$ improvement has been obtained by the proposed algorithm compared to the existing methods.

A simplified evaluation method of skeleton curve for RC frame with URM infill

  • Jin, Kiwoong;Choi, Ho
    • Earthquakes and Structures
    • /
    • v.13 no.3
    • /
    • pp.309-322
    • /
    • 2017
  • In this paper, a simplified evaluation method of the skeleton curve for reinforced concrete (RC) frame with unreinforced masonry (URM) infill is proposed in a practical form, based on the previous studies. The backbone curve for RC boundary frame was modeled by a tri-linear envelope with cracking and yielding points. On the other hand, that of URM infill was modeled by representative characteristic points of cracking, maximum, and residual strength; also, the interaction effect between RC boundary frame and the infill was taken into account. The overall force-displacement envelopes by the sum of RC boundary frame and URM infill, where the backbone curves of the infill from other studies were also considered, were then compared with the previous experimental results. The simplified estimation results from this study were found to almost approximate the overall experimental results with conservative evaluations, and they showed much better agreement than the cases employing the infill envelopes from other studies.

Segmented Video Coding Using Variable Block-Size Segmentation by Motion Vectors (움직임벡터에 의한 가변블럭영역화를 이용한 영역기반 동영상 부호화)

  • 이기헌;김준식;박래홍;이상욱;최종수
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.62-76
    • /
    • 1994
  • In this paper, a segmentation-based coding technique as applied to video sequences is proposed. A proposed method separates an image into contour and texture parts, then the visually-sensitive contour part is represented by chain codes and the visually-insensitive texture part is reconstructed by a representative motion vector of a region and mean of the segmented frame difference. It uses a change detector to find moving areas and adopts variable blocks to represent different motions correctly. For better quality of reconstructed images, the displaced frame difference between the original image and the motion compensated image reconstructed by the representative motion vector is segmented. Computer simulation with several video sequences shows that the proposed method gives better performance than the conventional ones in terms of the peak signal to noise ratio(PSNR) and compression ration.

  • PDF