TV-Anytime metadata can be delivered by unidirectional or bi-directional network. In bi -directional environment, the special request of a client is sent to metadata service providers and then the providers provide the personalized metadata back to the client. In this paper. we introduce the design and implementation of a broadcasting receiver for personalized broadcasting service in bi-directional environment. We describe actual system configuration and usage examples for bi-directional personalized service. The implemented receiver provides various functions for a digital broadcasting recorder and is based on TV-Anytime specification and UDDI specification to provide the metadata service discovery.

TV-Anytime specification provides metadata standards for personalized broadcasting service. For personalized broadcasting service, the metadata is transmitted through the specific way to the employed broadcasting system. In an MPEG-2 environment. the metadata can be transmitted using Sections, objects within a DSM-CC Object Carousel or modules within a DSM-CC Data Carousel. In this paper, we introduce a TV-Anytime metadata delivery method within Object Carousel which is used in ATSC-ACAP and DVB-MHP, We describe an actual example of unidirectional personalized broadcasting which is implemented on an ATSC-ACAP data broadcasting receiver, where the metadata is delivered as objects within a DSM-CC Object Carousel.

With the advent of the digital broadcasting, the audiences can access a large number of TV programs and their information through the multiple channels on various media devices. The access to a large number of TV programs can support a user for many chances with which he/she can sort and select the best one of them. However, the information overload on the user inevitably requires much effort with a lot of patience for finding his/her favorite programs. Therefore, it is useful to provide the persona1ized broadcasting service which assists the user to automatically find his/her favorite programs. As the growing requirements of the TV personalization, we introduce our automatic user preference learning algorithm which 1) analyzes a user's usage history on TV program contents: 2) extracts the user's watching pattern depending on a specific time and day and shows our automatic TV program recommendation system using MPEG-7 MDS (Multimedia Description Scheme: ISO/IEC 15938-5) and 3) automatically calculates the user's preference. For our experimental results, we have used TV audiences' watching history with the ages, genders and viewing times obtained from AC Nielson Korea. From our experimental results, we observed that our proposed algorithm of the automatic user preference learning algorithm based on the Bayesian network can effectively learn the user's preferences accordingly during the course of TV watching periods.

In this paper, a package, that is a new type of contents providing new consumer experience under digital broadcasting environments. is introduced. To present various advantages of package that is in standardization process of TV-Anytime Phase-2, a service scenario for personalized educational content is proposed. Then, TV-Anytime Packaging technology to support the scenario is described. It is also shown that the personalized service that provides interactive and personalized consuming experience independent of the types of content and delivery channels is feasible by using TV-Anytime Packaging technology.

The convergence of metadata service and the PDR with digital storage device enables new services. Among which, providing dynamic commercials make it possible for the commercials stored in the PDR to be a beneficial information source instead of a dull and not-so-interesting time-consuming content. It also improves consumer concentration and makes the commercials more effective. This paper provides list of various functionality provided by dynamic personalized commercials based on metadata and PDR. The proposed information structure supporting these functionality is based on the digital item concept of MPEG-2I. This paper also provides brief description on how the proposed information structure can be used to implement the listed functionality of dynamic persona1ized commercials.

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.

In this paper we propose Digital Signal Processing (DSP) techniques for the Equalization Digital On-Channel Repeater(EDOCR) in the ATSC digital TV (DTV) System. DSP techniques consist of demodulation. baseband equalization, and remodulation. Since the time delay caused by signal processing in the EDOCR can seriously affect the performance of ATSC legacy receivers, it is required that the processing time should be minimized as much as possible. To achieve this goal, we focus on the reduction of the EDOCR's time delay with the minimization of its performance degradation. In addition, we present recommended proper parameters for hardware implementation based on extensive simulation result.

In this paper we consider technological requirements to broadcast digital television signals using single frequency networks (SFN) in the Advanced Television Systems Committee (ATSC) transmission systems and propose equalization digital on-channel repeater (EDOCR) that overcomes the limitations of conventional digital on-channel repeaters (DOCRs). Since there are no forward error correction (FEC) decoder and encoder, the EDOCR does not have an ambiguity problem. In addition, since an adaptive equalizer in the EDOCR removes multi-path signals, additive white Gaussian noise (A WGN), and feedback signal due to low antenna isolation, the EDOCR may have good output signal quality with high power.

In this paper we compare the performance of 4 different algorithms for converting the sampling frequency of an audio from 44.1KHz to 48KHz. The algorithms considered here include the basic polyphase method. sine function based method. multi-stage method. and B-spline based method. For a fair comparison, the sampling rate converters using the 4 algorithms are redesigned under a high fidelity condition. Then, their H/W complexities are compared in terms of the computational complexity and the memory size. As a result, it is shown that the basic polyphase method and sine function based method outperform the other two in terms of the computational complexity, while the B-spline based method requires less memory than the others.

In this paper, we introduce a novel coding method to efficiently enable spatial random access for high resolution video. In terms of resolution and display size, standard display devices (such as cathode-ray tubes. monitors. PDAs, and LCDs) do not sufficiently support high resolution video such as digital cinema and panoramic video. Currently, users have no choice but to view video at lower resolution as a result of down-sampling, or only a partial region of the video due to display size limitations. Our proposed method. which we call the B-map, represents the set of starting locations of the coded segments in a picture frame. This information, or B-map, is first sent to the decoder prior to the coded data stream of the frame and is then used for fast local decoding. To test our method, we compare our B-map with JPEG tiling and the JPEG Resynchronization marker. Experimental results show that the proposed coding method requires less overhead than existing methods during the same decoding time. The results show promise for future panoramic or digital cinema applications.

Recently, there has been much interest in realistic broadcasting that is a new field following HDTV and 3DTV. In general. the realistic broadcasting is composed of diverse components such as aquisition, authoring, compression, transmission and display, posing many challenging tasks. It is necessary that the types of realistic contents need to be defined prior to the development of realistic broadcasting systems. Based upon them, other components need to be designed and developed. In this paper, we propose some realistic contents suitable to the realistic broadcasting as well as techniques of generating them. Our proposed contents consist of stereoscopic multiview sequences, object-based stereoscopic images, depth map-based image compositing and the composition of stereoscopic real and graphics images. Content generation techniques and their associated software modules are presented with realistic images produced from our experiments. Those contents are produced to deliver stereoscopic perception, immersion and realism to the users as shown in our experimental results.

In Korea, Eureka-147 DAB (Digital Audio Broadcasting) temporarily decided as the standard system for digital audio broadcasting was evolved into DMB (Digital Multimedia Broadcasting) to complement the technical vulnerability in mobile reception of terrestrial DTV. According to introducing video service in T-DMB (Terrestrial DMB), 'Terrestrial DMB Experimental Broadcasting for Video Service', a national project of the MIC (Ministry of Information and Communication), was done for verifying the possibility of video service via T-DMB. The main objective of the project is computing the effective field strength and coverage for making a plan to build T-DMB broadcasting network and developing transmitting and receiving equipment. In case of digital broadcasting, it is absolutely essential to measure BER (Bit Error Rate) and electric field strength in order to evaluate coverage and quality of received signal. In this paper, we implement an integrated mobile measurement system for T-DMB. For this purpose, we propose efficient data structure and algorithm for BER measurement. By adding GPS (Global Positioning System) and electric field strength measurement parts into BER measurement part, we complete the integrated mobile measurement system, and then verify it by experiments and field tests. The developed system was used in a national project, 'Terrestrial DMB Experimental Broadcasting for Video Service' and measurement results will be used as fundamental data for building T-DMB broadcasting network.

Jing(gong) is one of the most well known Korean traditional Samulnori instruments to the general public. Samulnori is consisted of four instruments, them being : the jingo the janggu (hour-glass drum). the kkwaenggwari, and the buk(drum). Of the four instruments, the jing with its deep, and yet soft and beautiful long lingering sound embraces the sounds of the other three. The jing is a brassware instrument, a compound of \;A high quality brassware is used when the jing is made. The jing is shaped with a 39-40cm circular plate and a rim that gives 7.0-7.5cm of depth to the instrument. Even with its most simple structure, when the circular plate is hit during performance, the rim which supports the circular plate gives resonance to the sound making low-frequency sounds. Therefore the range of the representative frequency of the full rim jing is between \;the lingering sound lasts for more than 20 seconds afterwards. When the jing with half of its rim cut off is hit the basic frequency is \;And the sound lasted for ten more seconds. The jing of its rimless frequencies are distributed between \;And the lingering sound lasts for 5seconds afterwards. Therefore, different thickness and depth of the rim may give new resonance frequencies and alter the longing time of the sound. This thesis paper will try to reveal the relationship between the thickness or depth of the rim (which holds the bending circular plate) and the frequency or the lasting time of the sound.

Motion Estimation is an essential module in video encoders based on international standards such as H.263 and MPEG. Many fast motion estimation algorithms have been proposed in order to reduce the computational complexity of a well-known full search algorithms(FS). However, these fast algorithms can not work efficiently in DSP processors recently developed for video processing. To solve for this. we propose an efficient motion estimation scheme optimized in the DSP processor like Philips TM1300. A motion vector predictor is pre-estimated and a small search range is chosen in the proposed scheme using strong motion vector correlation between a current macro block (MB) and its neighboring MB's to reduce computation time. An MPEG-4 SP@L3(Simple Profile at Level 3) encoding system is implemented in Philips TM1300 to verify the effectiveness of the proposed method. In that processor, we can achieve better performance using our method than other conventional ones while keeping visual quality as good as that of the FS.

With the growth of multimedia systems, compressing image data has become more important in the area of multimedia services. Since a compressed image bitstream can often be seriously distorted by various types of channel noise, an error concealment algorithm becomes a very important issue. In order to solve this problem, Hsia proposed the error concealment algorithm where he recovered lost block data using 1D boundary matching vectors. His algorithm, however, requires high computational complexity since each matching vector needs MAD (Mean Absolute Difference) values of all pixels, which is either a boundary line top or a boundary line bottom of a damaged block. We propose a hierarchical search-based fast error concealment scheme as well as its approximated version to reduce computational time. In the proposed scheme, a hierarchical search is applied to reduce the number of checking points for searching a vector. The error concealment schemes proposed in this paper can be about 3 times faster than Hsia's with keeping visual quality and PSNR.