Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Broadcast Engineering
Journal Basic Information
Journal DOI :
The Korean Institute of Broadcast and Media Engineers
Editor in Chief :
Volume & Issues
Volume 6, Issue 3 - Dec 2001
Volume 6, Issue 2 - Sep 2001
Volume 6, Issue 1 - Jun 2001
Selecting the target year
Design and Implementation of An MP4 File Streaming System over IP Networks
Journal of Broadcast Engineering, volume 6, issue 3, 2001, Pages 205~214
In this Paper, we present an MP4 file streaming system over IP networks. Using the proposed system a user can access MP4 contents in the servers via H) networks and interact with the contents. The MP4 file format is designed to contain the media information of MPEG-4 and is object-oriented. The presented streaming server system contains GUI, session manager, splitter, SL- packetizer and transmitter. In addition, we knave implemented the client system based on the GUI -2D player, the MPEG-4 reference software. The Presented streaming system is designed use RTF for the media data requiring real-time streaming RTCP for QoS management and TCP for the data such as IOD(Initial Object Descriptor), OD(Object Descriptor) BIFS(Binary Format for Scene), which should be transmitted for the streaming and the data, such as still image and text, which can be entirely transmitted in a packet.
Implementation of A Multimedia Streaming System using MPEG-4
Journal of Broadcast Engineering, volume 6, issue 3, 2001, Pages 215~224
In recent days, research activities on multimedia services mainly focus on the multiplexing system with timing synchromization for media components, such as video, audio and text. The MPEG-4 standard emphasizes object-based coding which includes analysis and understanding of the Image content. Since in MPEG-4 we can define objects and encode them independently, we can manipulate and display each object for different applications. This feature of MPEG-4 is also vero useful for multimedia services, such as video streaming cia different network channels, digital versatile disc, internet TV, video E-mail, and so on. In this Paper, we implement a multimedia streaming system which is compliant with the MPEG-4 system and the MP4 file format.
Fine Granular Scalable Coding using Matching Pursuit with Multi-Step Search
Journal of Broadcast Engineering, volume 6, issue 3, 2001, Pages 225~233
Real-time video communication applications over Internet should be able to support such functionality as scalability because of the unpredictable and varying channel bandwidth between server and client. To accommodatethe wide variety of channel bitrates, a new scalable coding tool, namely the Fine Granular Scalability (FGS) coding tool has been reduce the adopted In the MPEG-4 video standard. This paper presentsa new FGS algorithm with matching Pursuit that can reduce the computational complexity of ordinal matching pursuit-based algorithm. The Proposed coding algorithm can make trade-off between Picture Quality and computationalcomplexity. Our simulation result shows that the proposed algorithm can reduce the computational cumplexity up to 1/5 compared to the conventional FGS method while retaining a similar picture quality.
Scalable Video Streaming over Quality-of-Service Guaranteed Internet based on RSVP/IntServ
Journal of Broadcast Engineering, volume 6, issue 3, 2001, Pages 234~245
According to market needs of better quality of service (QoS) for realtime multimedia services over Internet, they haute been standardizing RSVP, Intserv, and DiffiServ. This paper combines the benefits of RSVP/IntServ with scalable video encoding. We Propose that more important bit stream is given more priority such that limited network resources are reserved for the stream Various prioritizing approaches are proposed and compared to normal approach by using Netwo가 Simulator. The calculated QoS parameters such as Packet loss rate are used to calculate degree of degradation in video quality
File System Support for Multimedia Streaming in Internet Home Appliances
Journal of Broadcast Engineering, volume 6, issue 3, 2001, Pages 246~259
Due to recent rapid deployment of Internet streaming service and digital broadcasting service, the issue of how to efficiently support streaming workload in so called "Internet Home Appliance" receives prime interests from industry as well as academia. The underlying dilemma is that it may not be feasible to put cutting edge CPU, boards, disks and other peripherals into that type of device. The primary reason is its cost. Usually, Internet Home Appliances has its dedicated usage, e.g. Internet Radio, and thus it does not require high-end CPU nor high-end Va subsystem. The same reasoning applies to I/O subsystem. In Internet Home Appliances dedicated to handle compressed moving picture, it is not equipped with high end SCSI disk with fast rotational speed. Thus, it is mandatory to devise elaborate software algorithm to exploit the available hardware resources and maximize the efficiency of the system. This paper presents our experiences in the design and implementation of a new multimedia file system which can efficiently deliver the required disk bandwidth for a periodic I/O workload. We have implemented the file system on the Linux operating system, and examined itsperformance under streaming I/O workload. The results of the study show that the proposed file system exhibits superior performance than the Linux Ext2 file system under streaming I/O workload. The result of this work not only contribute to advance the state f art file system technology for multimedia streaming but also put forth the software which is readily available and can be deployed. deployed.
An Efficient Anchor Range Extracting Algorithm for The Unit Structuring of News Data
Journal of Broadcast Engineering, volume 6, issue 3, 2001, Pages 260~269
This paper proposes an efficient algorithm extracting anchor ranges that exist in news video for the unit structuring of news. To this purpose, this paper uses anchors face in the frame rather than the cuts where the scene changes are occurred. In anchor range, we find the end position (frame) of anchor range with the FRFD(Face Region Frame Difference). On the other hand, in not-anchor range, we find the start position of anchor range by extracting anchors face. The process of extracting anchors face is consists of two parts to enhance the computation time for WPEG decoding. The first pact is to find candidates of anchors face through rough analysis with partial decoding MPEG and the second part is to verify candidates of anchors face with fully decoding. It is possible to use the result of this process in basic step of news analysis. Especially, the fast processing and the high recall rate of this process are suitable to apply for the real news service.
Blind Watermarking Algorithms: A Tutorial
Journal of Broadcast Engineering, volume 6, issue 3, 2001, Pages 270~282
This paper Introduces three well-known blind watermarking algorithms in terms of signal processing aspects. Those three methods include correlation-based, echo-hiding, and patchwork algorithms. Those algorithms can be applied either in time-domain (or equivalently spatial-domain) or frequency-domain (or equivalently transform-domain). This paper describes watermark embedding and detection algorithms as well as basic ideas for those watermarking algorithms. In addition, we include some experimental results.