• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.121-126
• /
• 2009

Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

• Journal of Broadcast Engineering
• /
• v.27 no.1
• /
• pp.13-19
• /
• 2022

Video Object Segmentation (VOS) task requires an amount of labeled sequence data, which limits the performance of the current VOS methods trained with public datasets. In this paper, we propose two effective data augmentation schemes for VOS. The first augmentation method is to swap the background segment to the background from another image, and the other method is to play the sequence in reverse. The two augmentation schemes for VOS enable the current VOS methods to robustly predict the segmentation labels and improve the performance of VOS.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.173-189
• /
• 2009

Recently, video data has attracted many interest. That is the reason why efficient indexing schemes are required to support the content-based retrieval of video data. But most indexing schemes are not suitable for indexing a high-dimensional data except Hybrid Spill-Tree. In this paper, we propose an efficient high-dimensional indexing scheme to support the content-based retrieval of video data. For this, we extend Hybrid Spill-Tree by using a newly designed clustering technique and by adopting a signature method. Finally, we show that proposed signature-based high dimensional indexing scheme achieves better retrieval performance than existing M-Tree and Hybrid Spill-Tree.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.8
• /
• pp.51-58
• /
• 2009

In this paper. we propose search algorithm using Low Peak Feature of audio and image color value by which similar movies can be identified. Combing through entire video files for the purpose of recognizing and retrieving matching movies requires much time and memory space. Moreover, 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 codec. Thus we present here a similar-video-retrieval method that relies on analysis of audio patterns, whose peak features are not greatly affected by changes in the resolution or codec used and image color values. which are used for similarity comparison. The method showed a 97.7% search success rate, given a set of 2,000 video files whose audio-bit-rate had been altered or were purposefully written in a different codec.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.76-78
• /
• 2005

본 교통사고 동영상 DB 설계의 연구 목적은 교통사고 자동기록장치에서 수집되는 교통사고 동영상 자료를 효율적으로 활용하기 위한 교통사고 동영상 DB 구축 방안에 관한 연구이며, 이를 위해 ISO/IEC 11179 표준인 MDR을 이용한 교통사고 동영상 DB 논리 모델을 제안하는 데 있다. 본 논문에서 제안하는 DB구조를 통해 실시간 대용량 교통사고 동영상 데이터에 대한 데이터의 생성, 관리 및 검색 성능을 향상시킬 수 있을 뿐만 아니라, MDR 표준 개념 적용으로 상호 이질적인 DB 간의 상호운용성(interoperability)이 증대된다.

• Journal of Korean Society of Archives and Records Management
• /
• v.22 no.4
• /
• pp.45-65
• /
• 2022

YouTube videos of public institutions are digital public records that need to be managed and preserved. As such, the video and the metadata describing the video should also be preserved. This study aims to select the key metadata elements necessary for archiving videos published on YouTube by public institutions. To this end, five high-level areas, namely the description, structure, management, preservation, and user participation, and the metadata elements of 10 subareas, were designed by referring to NAK 8, PREMIS, ISAD(G), and YouTube metadata. Afterward, the metadata elements designed by 14 experts were verified. Lastly, the validity and reliability of the evaluation results were verified. Of the 63 elements, 33 satisfied the validity and reliability criteria. Thus, these elements were selected as the core metadata for archiving YouTube videos in public institutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.615-623
• /
• 2003

This paper presents effective quality-of-service renegotiating schemes for streaming video. The conventional network supporting quality-of-service generally allows a negotiation at call setup. However, it is not efficient for the video application since the compressed video traffic is statistically non-stationary. Thus, we consider the network supporting quality-of-service renegotiations during the data transmission, and study effective quality-of-service renegotiating schemes for streaming video. Simple token bucket model, whose parameters are token filling rate and token bucket size, is adopted for the video traffic model. The renegotiating time instants and the parameters are determined by analyzing the statistical information of compressed video traffic. In this paper, two renegotiating approaches, i.e. fixed renegotiating interval case and variable renegotiating interval case, are examined. Finally, the experimental results are provided to show the performance of the proposed schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.691-693
• /
• 2001

현재 이동 통신 단말기에는 기존의 플랫폼들보다 나은 멀티미디어 서비스를 지원하는 다양한 무선 인터넷 플랫폼들이 채용되고 있지만, 동영상 처리에 밀접한 관련이 있는 이동 통신 단말기 자체의 계산 능력이 낮아 동영상 처리에 한계가 있다. 따라서 이동 통신 단말기에서 동영상을 처리하기 위해선 중간 데이터를 사용한 동영상 처리와 같은 새로운 모텔이 필요하다. 중간 데이터를 사용한 모델의 장점은 시스템 자체의 자원을 최소한으로 요구함으로써 이동 통신 단말기에서 동영상 서비스를 가능하게 한다는 점이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.598-600
• /
• 2001

대용량의 동영상 데이터 이용에 있어 효과적인 동영상 검색을 위해서는 동영상 데이터의 색인과정이 필요하다. 본 논문은 AVI영상에서 동여상 장면 전환점 검출에 관한 효과적인 방법을 제안한다. 제안된 방법은 프렝미을 대각선 방향의 픽셀 값을 추출하고 정지영상으로 변환하여 동영상의 전체 구조를 파악할 수 있으며, 장면 전한점을 한눈에 확인할 수 있다. 각각의 프레임에서 추추란 픽셀의 칼라 값을 A행렬 i(프레임 수)xj(프레임 영상 높이)로 저장하고, MSE(Mean Square Error)를 용해서 일정의 임계값에 도달하지 못할 경우 이 프레임을 장면 전환점으로 검출한다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.269-273
• /
• 2000

본 논문에서는 연속되는 동영상 시퀸스의 9개의 프레임에서 이웃하는 프레임간의 차분 프레임으로 이루어진 8개의 차분 데이터를 3D-DCT 처리 후 특성에 맞는 프레임 차분 체적 양자화기(FDVQ)를 설계하고, 이것으로 처리된 영상데이터를 부호화하여 복원영상 데이터의 압축 효과를 분석하였다. 여러가지 동영상 시퀀스를 시험 대상으로 사용한 결과, 제안한 FDVQ를 적용한 3D-DCT 방법은 유사한 해상도에서 차분 영상 데이터에 대한 압축률은 2D-DCT 방법에 비하여 평균 20.3% 향상된 압축 효율을 얻었다. 체적 양자화(VQ:Volume Quantizer)를 이용한 3D-DCT 방법과 비교했을 때는 유사한 압축률을 보였다. 특히, 움직임 성분이 많은 영상에 대해서는 제안한 FDVQ를 이용한 방법이 압축률을 높일수록 2D-DCT방법과 VQ를 이용한 방법보다 압축률 0.05bpp이하에서 약 1.0dB 개선된 결과를 나타내었다.