• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1155-1163
• /
• 2011

In this paper, we propose a new pre-processing algorithm applied to depth map to improve the coding efficiency. Now, 3DV/FTV group in the MPEG is working for standard of 3DVC(3D video coding), but compression method for depth map images are not confirmed yet. In the proposed algorithm, after dividing the histogram distribution of a given depth map by EM clustering method based on GMM, we classify the depth map into several layered images. Then, we apply different mean shift filter to each classified image according to the existence of background or foreground in it. In other words, we try to maximize the coding efficiency while keeping the boundary of each object and taking average operation toward inner field of the boundary. The experiments are performed with many test images and the results show that the proposed algorithm achieves bits reduction of 19% ~ 20% and computation time is also reduced.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.97-107
• /
• 2002

In general, under interactive broadcasting environment, user finds additional service using top-down menu. However, user can't know that additional service provides information until retrieval has finished and top-down menu requires multi-level retrieval. This paper proposes the new method for additional service providing not using top-down menu but using object selection. For the purpose of this method, the movie of a MPEG should be synchronized with the object information(position, size, shape) and object tracking technique is required. Synchronization technique uses the Directshow provided by the Microsoft. Object tracking techniques use a motion-based tracking and a model-based tracking together. We divide object into two parts. One is face and the other is substance. Face tracking uses model-based tracking and Substance uses motion-based tracking base on the block matching algorithm. To improve precise tracking, motion-based tracking apply the temporal prediction search algorithm and model-based tracking apply the face model which merge ellipse model and color model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.628-637
• /
• 2003

This paper describes a novel multiplexing scheme for delay-sensitive multiple VBR-coded bit streams in live multimedia service offered to high-speed networks. The primary goal of multiplexing in this paper is to keep delay limits of each bit streams and to enhance network resource utilization when they no multiplexed and transmitted over network. For this aim, this paper presents a dynamical control scheme which does not cause violation of any delay constraints to each bit steam. The scheme is based on the assumption that recent behavior of the each bit scream has high correlation with near-term future behavior. Such property is used to make as flat as possible by both temporal averaging on a stream-by-stream and spatial averaging is introduced when multiple VBR-coded bit streams are multiplexed. The effectiveness of the scheme is evaluated by several simulation using an MPEG-coded video trace of Star_wars and it is shown that the proposed scheme can effectively reduce the feat rate md coefficient of variation of the multiplexed transmission rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1115-1123
• /
• 2003

In this paper, a remote control system called TeleRemote system which can be applied to existing wireless mobile networks or public telephone networks for remote control is designed and implemented. The proposed design employs program technology based on the theory of signal detect control and enables the EPG(Electronic Program Guide) functions such as recording reservation of bidirectional video signals with TV reception card on PC. It can also control recording reservation using remote control program through telecommunication network The PC-EPG system is implemented in Web programs with Server/Clinet architecture and the server system that provides EPG functionalities is in charge of recording reservations and data communications by means of the scheduler program. Data storing to client PCs is performed through TCP/IP and finished by client programs implemented using Visual C++/MFC programs. As remote control system, the developed system can be used for unmanned security system using the Web camera. Building intranet and making connection to internet, the TeleRemote system is believed to create potential for commercial communication system.

• Journal of Broadcast Engineering
• /
• v.9 no.4 s.25
• /
• pp.345-356
• /
• 2004

In this paper, we present a design and implementation of a personalized broadcasting system using TV-Anytime metadata for providing personalized services. The TV-Anytime specifies metadata schema, metadata coding and delivery, and provides service models to provide personalized broadcasting content services at anytime when users want to consume using metadata, which includes ECG (Electronic Content Guide) and content descriptive information in a PDR (Personal Digital Recorder)-centric environment. The proposed personalized broadcasting system consists of a server that provides metadata binary-coding, encapsulation and multiplexing, and a client terminal that takes charge of de-multiplexing, metadata decoding, and metadata processing for personalized content accessing and consumption. This paper presents the details of the design of each functional module, and the evaluation results with a set of service scenarios in an end-to-end broadcasting test-bed.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.565-573
• /
• 2007

In this paper, we propose a method to select motion vector predictor by considering prediction structure of a multi view content for coding efficiency of multi view coding which is being standardized in JVT. Motion vector of a different tendency is happened while carrying out temporal and view reference prediction of multi-view video coding. Also, due to the phenomena of motion vectors being searched in both temporal and view order, the motion vectors do not agree with each other resulting a decline in coding efficiency. This paper is about how the motion vector predictor are selected with information of prediction structure. By using the proposed method, a compression ratio of the proposed method in multi-view video coding is increased, and finally $0.03{\sim}0.1$ dB PSNR(Peak Signal-to-Noise Ratio) improvement was obtained compared with the case of JMVM 3.6 method.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1002-1012
• /
• 2019

360VR content requires short latency, such as immediate response to viewers' viewport changes and high quality video delivery. It is necessary to consider efficient transmission that guarantees the QoE(Quality of Experience) of the 360VR contents with limited bandwidth. Several research has been introduced to reduce overall bandwidth consumption by predicting a user's viewport and allocating different bit rates to the area corresponding to the viewport. In this paper, we propose novel viewport prediction scheme that uses sound source location information of 360VR contents as auditory recognition information along with visual recognition information. Also, we propose efficient transmission algorithm by allocating a bit rate properly based on improved viewport prediction. The proposed scheme improves the accuracy of the viewport prediction and provides high quality videos to tiles corresponding to the user's viewpoint within the limited bandwidth.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.372-375
• /
• 2008

IEEE 802.11e standardized the EDCA mechanism to support the priority based QoS. And the virtual collision handler schedules the transmission time of each MAC frame using the internal back-off window according to the access category(AC). This can provides the differentiated QoS to real-time services at the medium traffic load condition. However, the transmission delay of MAC frame for real-time services may be increased as the traffic load of best effort service increases. It becomes more critical when the real-time service uses a compressed mode video codec such as moving picture experts group(MPEG) 4 codec. That is because each frame has the different importance. That is, the I-frame has more information as compared with the P- and the B-frame. In this paper, we proposed a buffer management algorithm based on the frame importance and the delay bound. The proposed algorithm is consisted of the traffic regulator based on the dual token bucket algorithm and the active queue management algorithm. The traffic regulator reduces the transmission rate of lower AC until that the virtual collision handler can transmit an I-frame. And the active queue management discards frame based on the importance of each frame and the delay bound of head of line(HoL) frame when the channel resource is insufficient.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.386-392
• /
• 2015

Data in a image compression codec are processed with a specific regular block size. The processing order of block sized data is changed in specific function blocks and the data is packed in memory and read by a new sequence. To maintain a regular throughput rate, double buffering is normally used that interleaving two block sized memory to do concurrent read and write operations. Single buffering using only one block sized memory can be adopted to the simple data reordering, but when a complicate reordering occurs, irregular address changes prohibit from implementing adequate address generating for single buffering. This paper shows that there is a predictable and recurring regularity of changing address access orders within a finite updating counts and suggests an effective method to implement. The data reordering function using suggested idea is designed with HDL and implemented with TSMC 0.18 CMOS process library. In various scan blocks, it shows more than 40% size reduction compared with a conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1484-1489
• /
• 2004

Given a video frame in terms of its 8${\times}$8 block-DCT coefncients, we wish to obtain a downsized or upsized version of this Dame also in terms of 8${\times}$8 block DCT coefficients. The DCT being a linear unitary transform is distributive over matrix multiplication. This fact has been used for downsampling video frames in the DCT domains in Dugad's, Mukherjee's, and Park's methods. The downsampling and upsampling schemes combined together preserve all the low-frequency DCT coefficients of the original image. This implies tremendous savings for coding the difference between the original frame (unsampled image) and its prediction (the upsampled image).This is desirable for many applications based on scalable encoding of video. In this paper, we extend the earlier works to various DCT sizes, when we downsample and then upsample of an image by a factor of two. Through experiment, we could improve the PSM values whenever we increase the DCT block size. However, because the complexity will be also increase, we can say there is a tradeoff. The experiment result would provide important data for developing fast algorithms of compressed-domain image/video resizing.