• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.3
• /
• pp.103-116
• /
• 2013

This paper reviews various bitstream syntax and parser description (BSPD) languages used in MPEG multimedia standards. Traditionally, the bitstream syntax and semantics have been described in human-readable form. Several languages have been developed to describe the bitstream syntax using a computer-readable language and allow the automatic generation of bitstream parsing function from the description. The languages were designed for different objectives and applications but have a range of commonalities in functionality. The aim of this paper is to provide a historical overview of BSPD languages. The background and target application of the BSPD languages are reviewed. In addition, the technical features of each languages, including the linguistic basis (e.g., XML-based) and parser generation method, are discussed and evaluated. In addition, previous studies based on each language are introduced and categorized according to their objectives. Finally, the relevant technical issues that suggest the direction of the future researches are reported.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1560-1571
• /
• 2006

In order to transmit multimedia streams over the network with a timely changing channel bandwidth such as Internet, scalable video coding schemes have been studied to represent video in flexible bitstream. Much research has been made on how to represent encoded media(such as video) bitstream in scalable ways. In this paper, rte propose an optimal selection of the objects for MPEG-4 bitstream adaptation to meet a given constraint. We adopt a multiple choice knapsack problem with multi-step selection for the MPEG-4 objects with different bit-rate scaling levels in the MPEG-4 bitstream. The bitstream adaptation based on the optimal selection result is then to fetch the necessary parts of the MPEG-4 bitstream to constitute an adapted version of the original MPEG-4 binary resource. The experiment results show that the optimal selection of MPEG-4 objects for a given constraint can promisingly be made which meets the given constraint.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.269-272
• /
• 2007

The shortcut shot detection based on MPEG compressed video bitstream is presented in this paper. The detection algorithm is used the video picture frame from MPEG compressed video directly not to be decompressed the original image. For shortcut detection, I and P frame of MPEG video bitstream are classified. The changing scene cuts at I pictures are detected by the decompressed DC image and scene cuts at P picture frame by monitoring the percentage of intra-macroblocks per P picture are detected. Experimental results using test video bitstream QVGA results in average 92% detection rate, searching time is taken around 4.5 times faster in comparison with changing scene shot detection algorithm which is decompressed the compressed bitstream.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2052-2055
• /
• 2003

본 논문은 MDC의 전송 중 발생한 에러를 검출하고, 그 에러를 정정하는 알고리즘을 제안한다. 이 알고리즘은 기존의 MDC 와 같이 약간의 redundancy를 가지는 두 개의 sub-bitstream 을 생성하는데, 한쪽 sub-bitstream에 에러가 발생하였을 때, 다른 한쪽의 sub-bitstream을 이용하여, 발생한 비트 에러를 정정한다. 제안된 알고리즘에 대한 BER-SNR실험은 Generalized Gaussian source를 임의적으로 발생시켜서 결과를 얻어내었다. sub-bitstream에서 에러가 발생하였을 때 우리가 제안한 알고리즘은 BER<10/sup -3/에서 기존 알고리즘보다 약 12㏈ 높은 성능을 얻을 수 있었다.

• The Journal of the Korea Contents Association
• /
• v.18 no.1
• /
• pp.10-18
• /
• 2018

This paper presents a method to resynthesize logic of a programmed FPGA from a bitstream file that is a downloaded file for Xilinx FPGA (Field Programmable Gate Array). It focuses on reconfiguring the LUT (Look Up Table) logic. The bitstream data is compared and analyzed considering various situations and various input variables such as composing other logics using the same netlist or synthesizing the same logic at various positions to find a structure of the bitstream. Based on the analyzed bitstream, we construct a truth table of the LUT by implementing various logic for one LUT. The proposed algorithm extracts the logic of the LUT based on the truth table of the generated LUT and the bitstream. The algorithm determines the input and output pins used to implement the logic in the LUT. As a result, we extract a gate level logic from a bitstream file for the targeted Xillinx FPGA.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.3
• /
• pp.87-99
• /
• 2006

In this paper, we propose a method of conditional access control for encrypted SVC(scalable video coding) bitstream. The main purpose of the proposition is to provide a SVC suitable encryption algorithm and a efficient method for conditional access control using encrypted SVC bitstream. We analyzed requirements for conditional access control of a SVC bitstream. And based on the analysis, we proposed encryption algorithm suitable for SVC bitstream and a method of conditional access control of the encryped bitstream. The proposed conditional access control for encrypted SVC bitstream is performed by bitsream extraction and selective decryption. We verified the usefulness of the proposed method through experiments.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.513-516
• /
• 2005

SVC(Scalable Video coding) is the standardization of MPEG that aims to support multi spatial, temporal, and quality layers. We can support the video service guaranteeing the QoS in varied network circumstance by using SVC bitstream. In this paper, we propose the real-time SVC bitstream extractor that is able to extract the bitstream with varied frame rate and SNR quality in real-time. To do, extraction processing needs to be performed by GOP unit. As well , essential bitstream information for real-time extraction is aquired before doing extraction process. The proposed method is implemented by using JSVM 2.0. Experimental results show that the proposed method is valid.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.6
• /
• pp.91-99
• /
• 2004

This paper proposed two transcodiing methods, which maintain the same spatio-temporal resolution and reduce a spatial resolution, to convert a H.264 video bitstream into an MPEG-4 video bitstream. When the H.264 video bitstream is transformed into the MPEG-4 video bitstream, the conversions between H.264 block types and MPEG-4 block types are performed by minimizing distortion and the ${\times}4$ block-based motion vector mapping is performed. The proposed two transcoding methods run 4.14～5.1 times as fast as the cascaded transcoding methods in MPEG-4 encoder side, while the PSNR (peak-signal-to ratio) is slightly degrade with maximum 0.3dB.

• Proceedings of the IEEK Conference
• /
• 2000.06b
• /
• pp.181-184
• /
• 2000

In this paper, we described a design of the input buffer system for efficiently dealing with MPEG audio bitstream to demux header and side information, audio data. In order to overcome the limitations of fixed-word manipulation in bitstream demuxing, we proposed a new variable length bit retrieval system with FSM sequencer supporting MPEG audio frame format, and serial buffer demuxing audio stream, FIFO circular buffer including header and side information.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.561-564
• /
• 2005

In this paper, we present a new JPEG (Joint Photograph Experts Group) compression architecture which compresses still image into fixed size of bitstream to use restricted system memory efficiently. The size of bitstream is determined by the complexity of image and the quantization table. But the quantization table is set in advance the complexity of image is the essential factor. Therefore the size of bitstream for high complexity image is large and the size for low complexity image is small. This means that the management of restricted system memory is difficult. The proposed JPEG encoder estimates the size of bitstream using the correlation between consecutive frames and selects the quantization table suited to the complexity of image. This makes efficient use of system memory.