• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.534-542
• /
• 1999

A sell-designed rate control strategy can improve overall picture quality for video transmission over a constant bit rate channel and the rate control method is not a normative part of MPEG-video standard, the performance of MPEG video codec can be quite different depends on how to implement the rate control scheme. The rate control scheme proposed in MPEG show good results when scene changes is not occurred. But it has weakness that it does not properly handle scene-changed pictures. Therefore picture quality after scene change is deteriorated, and possibility of overflow occurrence becomes high. In this paper, a new method for detection of scene change occurrence using local variance and a new determination scheme for adaptive quantization parameter, mqunt, which can consider local characteristic of an image by using previously computed the local variance from the scene change detection part are proposed. IN addition, and adaptive rate control scheme which can handles scene changed picture very efficiently by scene-changed picture is proposed. Computer simulations are performed to verify the performance of the proposed algorithm. The suggested detection algorithm precisely detected scene change. And the proposed rate control scheme shows better rate control performance as compared with that of the conventional MPEG scheme.

• Journal of Advanced Navigation Technology
• /
• v.27 no.3
• /
• pp.306-313
• /
• 2023

Realistic and graphics-based virtual reality content is based on 360-degree videos, and viewport extraction through the viewer's intention or automatic recommendation function is essential. This paper designs a viewport extraction system based on multiple object tracking in 360-degree videos and proposes a parallel computing structure necessary for multiple viewport extraction. The viewport extraction process in 360-degree videos is parallelized by composing pixel-wise threads, through 3D spherical surface coordinate transformation from ERP coordinates and 2D coordinate transformation of 3D spherical surface coordinates within the viewport. The proposed structure evaluated the computation time for up to 30 viewport extraction processes in aerial 360-degree video sequences and confirmed up to 5240 times acceleration compared to the CPU-based computation time proportional to the number of viewports. When using high-speed I/O or memory buffers that can reduce ERP frame I/O time, viewport extraction time can be further accelerated by 7.82 times. The proposed parallelized viewport extraction structure can be applied to simultaneous multi-access services for 360-degree videos or virtual reality contents and video summarization services for individual users.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.345-354
• /
• 2003

IP Multicast is required of more little network resources than one in unicast. Furthermore, reliable multicast has been researched for supporting reliability at IP Multicast mechanism. Although these studies are carried out, they only have focused on general data. In other words, in case that realtime packet, they can not support reliability since they do not consider realtime properties such as dependency of interframe and playback in time. Besides, we also request to support scalability because we are based on Mobile IP network together with internet. Thus, we need a mechanism to guarantee reliability and scalability of realtime stream data. In this paper, we propose PER (Preceding Error Recovery) that reflect characteristics of the realtime data, especially for H.323. PER provides scalable reliability because it is based on tree-based multicast basically and helps to support scalable relibility as reducing control packet and recovers stream buffer space from underflow status as soon as possible. PER shows much better scalable and reliable than existing works.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.832-837
• /
• 2014

Application loading speed can be improved by timely prefetching disk blocks likely to be needed by an application. However, existing prefetchers -- if they are not specialized to a particular application -- incur high overheads and are poor at identifying the blocks that will actually be required. There are many sequences in which blocks may be needed and, even if two access sequences are identical, block tracing and access timings can be affected significantly by the state of the buffer cache. We propose a new application-independent software-based prefetching technique, in which breakpoints are inserted at appropriate places in an application to collect the information on correlations between the blocks and to prefetch the potential blocks ahead of their schedule based on it. Experiments on an HDD-based desktop PC demonstrated an average 30% reduction in application launch time and 15% in general I/O, while reducing the wasted overhead.

• Journal of Broadcast Engineering
• /
• v.16 no.2
• /
• pp.293-304
• /
• 2011

In this paper, we proposed a new hardware architecture for motion estimation (ME) which is the most time-consuming unit among H.264 algorithms and designed to the type of intellectual property (IP). The proposed ME hardware consists of buffer, processing unit (PU) array, SAD (sum of absolute difference) selector, and motion vector (MVgenerator). PU array is composed of 16 PUs and each PU consists of 16 processing elements (PUs). The main characteristics of the proposed hardware are that current and reference frames are re-used to reduce the number of access to the external memory and that there is no clock loss during SAD operation. The implemented ME hardware occupies 3% hardware resources of StatixIII EP3SE80F1152C2 which is a FPGA of Altera Inc. and can operate at up to 446.43MHz. Therefore it can process up to 50 frames of 1080p in a second.

• Journal of Internet of Things and Convergence
• /
• v.9 no.2
• /
• pp.11-17
• /
• 2023

Smoothing is to creating a transmission plan consisting of sections of frames that can be sent at the same transmission rate for compressed and stored video data. Various algorithms have been studied for the smoothing to minimize the number of transmission rate changes, the number of transmission rate changes, and the amount of transmission rate increase. This study evaluates the performance of a smoothing algorithm that minimizes the increase in transmission rates and maximizes the increase in transmission rates when the transmission rate is required to maximize the excess bandwidth to be secured by the server in an environment with limited server bandwidth. The available transmission rates and buffer sizes available in the server are set in various ways and evaluated by the number of fps changes, the minimum fps, the average fps, and fps variability. As a result of the comparison, the proposed algorithm showed excellent average fps and fps variability.