• 한국멀티미디어학회논문지
• /
• 제15권6호
• /
• pp.693-700
• /
• 2012

The effective extraction of key frames from a video stream is an essential task for summarizing and representing the content of a video. Accordingly, this paper proposes a new and fast method for extracting key frames from a compressed video. In the proposed approach, after the entire video sequence has been segmented into elementary content units, called shots, key frame extraction is performed by first assigning the number of key frames to each shot, and then distributing the key frames over the shot using a probabilistic approach to locate the optimal position of the key frames. The main advantage of the proposed method is that no time-consuming computations are needed for distributing the key frames within the shots and the procedure for key frame extraction is completely automatic. Furthermore, the set of key frames is independent of any subjective thresholds or manually set parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4533-4551
• /
• 2014

The effective extraction of key frames from a video stream is an essential task for summarizing and representing the content of a video. Accordingly, this paper proposes a new and fast method for extracting key frames from a compressed video. In the proposed approach, after the entire video sequence has been segmented into elementary content units, called shots, key frame extraction is performed by first assigning the number of key frames to each shot, and then distributing the key frames over the shot using a probabilistic approach to locate the optimal position of the key frames. Moreover, we implement our proposed framework in Android to confirm the validity, availability and usefulness. The main advantage of the proposed method is that no time-consuming computations are needed for distributing the key frames within the shots and the procedure for key frame extraction is completely automatic. Furthermore, the set of key frames is independent of any subjective thresholds or manually set parameters.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(3)
• /
• pp.137-140
• /
• 2000

In this paper, we propose as new algorithm for the selection of key frames in a given video. For the selected key frames to be well defined, the selected key frames need to spread out on the whole temporal domain of the given video and guaranteed not to be duplicate. For this purpose, we take the first frame of each shot of the video as the candidate key frame to represent the video. To reduce the overall processing time, we eliminate some candidate key frames which are visually indistinct in the histogram difference. The key frames are then selected using a clustering processing based on the singly linked hierarchical tree. To make the selected key frames be distributed evenly on the whole video, the deviation and time difference between the selected key frames are used. The simulation results demonstrate that our method provides the better performance compared with previous methods.

• International journal of advanced smart convergence
• /
• 제5권4호
• /
• pp.1-9
• /
• 2016

In order to reconstruct a 3D model in video sequences, to select key frames that are easy to estimate a geometric model is essential. This paper proposes a method to easily extract informative frames from a handheld video. The method combines selection criteria based on appropriate-baseline determination between frames, frame jumping for fast searching in the video, geometric robust information criterion (GRIC) scores for the frame-to-frame homography and fundamental matrix, and blurry-frame removal. Through experiments with videos taken in indoor space, the proposed method shows creating a more robust 3D point cloud than existing methods, even in the presence of motion blur and degenerate motions.

• 한국정보전자통신기술학회논문지
• /
• 제2권1호
• /
• pp.43-50
• /
• 2009

This paper caters the need of acquiring the principal objects, characters, and scenes from a video in order to entertain the image based query. The movie frames are divided into frames with 2D representative images called "key frames". Various regions in a key frame are marked as key objects according to their textures and shapes. These key objects serve as a catalogue of regions to be searched and matched from rest of the movie, using viewpoint invariant regions calculation, providing the location, size, and orientation of all the objects occurring in the movie in the form of a set of structures collaborating as video profile. The profile provides information about occurrences of every single key object from every frame of the movie it exists in. This information can further ease streaming of objects over various network-based viewing qualities. Hence, the method provides an effective reduced profiling approach of automatic logging and viewing information through query by example (QBE) procedure, and deals with video streaming issues at the same time.

• 한국전자통신학회논문지
• /
• 제8권4호
• /
• pp.595-604
• /
• 2013

현재 수입차 차량의 등록대수가 해를 거듭할수록 증가하는 추세이다. 그에 맞춰 수입차와 같은 고급 차량을 정비하기 위한 차량 정비 업체의 환경 개선이 지속적으로 이루어지고 있다. 본 논문에서는 정비 차량의 고객 신뢰도를 제공하기 위한 스마트 차량 관리 시스템을 구현하기 위해 HSV 색상모델 기반의 키 프레임 추출 기법을 제안한다. 수리 차량의 입고 시 차량 번호판 인식 프로세스를 통해 차량의 번호판을 자동으로 인식 후, 이를 기준으로 차량의 수리 이력 확인 및 수리 요청을 처리한다. 차량 수리 동영상을 토대로 차량 수리 키 프레임을 추출하여 사용자의 스마트폰으로 제공하는 서비스를 구현한다. 아울러 제안하는 기법을 스마트 차량 관리 시스템에 적용함으로써 서비스의 우수성을 검증한다. 마지막으로 키 프레임 추출 기법의 성능을 향상시키기 위해 RGB 색상을 HSV 색상으로 변환하여 처리한다. 그 결과 제안된 방법의 키 프레임 추출을 위한 성능 평가에서 기존의 RGB 색상모델보다 HSV 색상모델이 재현율 측면에서 약 30% 더 우수함을 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 제14회 신호처리 합동 학술대회 논문집
• /
• pp.179-182
• /
• 2001

In this paper. a key frame extraction algorithm for browsing and searching the summary of a video is proposed. Toward this end, important frames representing a shot are selected according to the correlations among frames. by using the Fourier descriptor which is useful for the shot boundary detection. To quantitatively evaluate the importance of selected frames. a new measure based on correlation coefficients of frames is proposed. If there are several frames with a same importance. another criteria is introduced to break the tie. by computing the partial moment of subframes including each candidate key frame so that the distortion rate is minimized Since a key frame extraction algorithm can be evaluated subjectively. the performance of the proposed algorithm has been verified by a statistical test. Experiments show that more than 20% improvement has been obtained by the proposed algorithm compared to existing methods.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.457-469
• /
• 2003

In this paper, we have proposed the efficient algorithm that can segment the video scene change using a various statistical characteristics obtained from by applying the wavelet transformation for each frames. Our method firstly extracts the histogram features from low frequency subband of wavelet-transformed image and then uses these features to detect the abrupt scene change. Second, it extracts the edge information from applying the mesh method to the high frequency subband of transformed image. We quantify the extracted edge information as the values of variance characteristic of each pixel and use these values to detect the gradual scene change. And we have also proposed an algorithm how extract the proper key frame from segmented video scene. Experiment results show that the proposed method is both very efficient algorithm in segmenting video frames and also is to become the appropriate key frame extraction method.

• 한국게임학회 논문지
• /
• 제16권4호
• /
• pp.97-104
• /
• 2016

이 연구는 단편 애니메이션 'Drip'을 통해 키 프레임 애니메이션과 모션 캡처 애니메이션을 융합하여 애니메이션 제작을 실현하는 기법을 제안한다. 상호 유기적 연결을 통해 효율적인 프로세스 관리가 가능할 뿐만 아니라 키 프레임 애니메이션과 모션 캡처 애니메이션의 단점을 서로 보완하는 과정을 처리함으로써 제작 기간을 단축 시켰다. 이를 통해 키 프레임 애니메이션과 모션 캡처 애니메이션의 한계를 극복하고 복합적인 프로세스를 인지하고 응용하여 효율적인 애니메이션 제작에 도움이 되고자 한다.

• 방송공학회논문지
• /
• 제8권4호
• /
• pp.501-504
• /
• 2003

본 논문에서는 프레임간 움직임 차를 이용한 워터마킹 방법을 제안한다. 이를 위하여 프레임차의 최대치를 양자화한 값을 계산하여 워터마크 삽입과 검출시에 사용되는 키값을 구한다. 실험 결과, 이 방법은 전체 프레임 중에서 l~3% 정도의 프레임에서 워터마크 삽입시에 계산한 키 값과 워터마크 검출시에 계산한 키 값이 ${\pm}1$ 정도의 오차가 발생하는데 이것은 검출된 워터마크의 BER(bit error rate)에 따라 키값을 다시 정하여 워터마크를 검출하면 해결됨을 알 수 있다. 본 논문에서 제안하는 방법은 각각의 프레임에 다른 워터마크 키를 사용하므로 프레임 삭제와 평균화 공격(averaging attack)에 강함을 보인다.