• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.406-417
• /
• 2001

With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.59-60
• /
• 2009

기존의 임베디드 시스템 환경에서는 대용량의 미디어 컨텐츠를 재생하고, 사용자 이벤트를 받아 실시간으로 처리하는데에 제한된 리소스로 인해 한계점이 있었다. 압축률이 좋고, 전송 및 재생에 효과적인 MPEG-4 시스템의 표준을 따르면서 제한된 리소스에서 사용자와의 인터렉션이 가능한 멀티미디어를 디스플레이할 수 있는 효율적인 기법이 요구된다. 임베디드 시스템의 MPEG-4 장면 랜더링에서 사용자 이벤트 처리를 위해 불필요한 노드 파싱을 제거하고 이벤트 처리 절차를 간략히 함으로써 효율적인 객체 교체와 객체 속성 변환 방법을 제안한다.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.4
• /
• pp.186-193
• /
• 2005

The Terrestrial Digital Multimedia Broadcasting (T-DMB) system supplies high quality audio comparable with VCD in 7 inch display and high quality audio comparable CD at the mobile reception environment T-DMB will launch commercial service at the middle of 2005. However the bandwidth for audio data and the number of channels are restricted to 128 kbps and 2 respectively in the current T-DMB standard because of the limitation of available bandwidth for multimedia data. This Paper Proposes a novel media processor structure for providing multi-channel audio contents oyer T-DMB system allowing backward compatibility with the legacy T-DMB receiver. Furthermore. we also Propose an adaptive receiver structure to supply optimal audio contents on various speaker configuration in T-DMB receiver. To provide multi-channel audio contents allowing backward comaptilbity with the legacy T-DMB receiver, the additional data for multi-channel audio are defined as a dependent stream of main audio stream. The OD strucure for control an additional multi-channel audio elementary stream is proposed without changing the BIFS of the legacy T-DMB system.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3762-3774
• /
• 2000

The advances of computer hardware and information processing technologies raise the needs of multimedia information retrieval systems. Up to date. multimedia information systems have been developed for text information and image information. Nowadays. the multimedia information systems for video and audio information. especially for musical information have been grown up more and more. In recent music information retrieval systems. not only the information retrieval based on meta-information such like composer and title but also the content-based information retrieval is supported. The content-based information retrieval in music information retrieval systems utilize the similarity value between the user query and the music information stored in music database. In tbis paper. hence. we developed a similarity computation algorithm in which the pitches and lengths of each corresponding pair of notes are used as the fundamental factors for similarity computation between musical information. We also make an experiment of the proposed algorithm to validate its appropriateness. From the experimental results. the proposed similarity computation algorithm is shown to be able to correctly check whether two music files are analogous to each other or not based on melodies.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.1-7
• /
• 2002

Since multimedia data such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms could not be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm is a scheduling algorithm considered the time constraint of the multimedia data. This scheduling algorithm uses a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and the reduction in the number of context switching. Furthermore, a new evaluation method is proposed which can evaluate the flexibility of scheduling algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.6
• /
• pp.420-435
• /
• 2001

As multimedia technology has rapidly grown recently, many researches to process multimedia data efficiently using general-purpose processors have been studied. In this paper, we proposed multimedia instructions which can process multimedia data effectively, and suggested a processor architecture for those instructions. The processor was described with Verilog-HDL in the behavioral level and simulated with CADENCE$^{TM}$ tool. Proposed multimedia instructions are total 48 instructions which can be classified into 7 groups. Multimedia data have 64-bit format and are processed as parallel subwords of 8-bit 8 bytes, 16-bit 4 half words or 32-bit 2 words. Modeled processor is developed based on the Integer Unit of SPARC V.9. It has five-stage pipeline RISC architecture with Harvard principle.e.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.57-64
• /
• 2002

Few studies have been systematically pursued on a multimedia data mining in despite of the overwhelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.5
• /
• pp.1-11
• /
• 2011

As the use of mobile multimedia devices is increasing in the recent year, the needs for high-performance multimedia processors are increasing. In this regard, we propose a SIMD (Single Instruction Multiple Data) based parallel processor that supports high-performance multimedia applications with low energy consumption. The proposed parallel processor consists of 16 processing elements (PEs) and operates on a 3-stage pipelining. Experimental results indicated that the proposed parallel processor outperforms conventional parallel processors in terms of performance. In addition, our proposed parallel processor outperforms commercial high-performance TI C6416 DSP in terms of performance (1.4-31.4x better) and energy efficiency (5.9-8.1x better) with same 130nm technology and 720 clock frequency. The proposed parallel processor was developed with verilog HDL and verified with a FPGA prototype system.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1330-1340
• /
• 2000

Multimedia isn ow applied to various real world areas. In particular, the focus on multimedia system and CSCW(Computer Supported Cooperative Work) has increased. In spite of this current trend, however, the study of fault tolerance for CSCW has not yet fully progressed. We propose EDR_MSCW. It is a system that is suitable for detecting ad recovering software error based on multimedia computer supported cooperative work as DOORAE by using software techniques. DOORAE is a framwork for supporting development on multimedia applications for computer-based collaborative works. When an error occurs, EDR_MCSCW detects an error by using hooking methods in MS-Windows API(Application Program Interface) function. If an error is found, we present a checkpointing and recovery algorithm which has the removal function of the domino-effect for recovering multimedia and CSCW by using stack.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.10a
• /
• pp.401-406
• /
• 1998

본 연구에서는 SGML 문서의 포맷팅과 변환을 지원하는 DSSSL 처리기를 개발하였다. 본 논문에서는 DSSL의 문서 처리 과정과 이를 지원하는 처리기의 개발 방법을 소개한다. 또한 개발 결과를 다양한 문서처리 환경에 적용하여 DSSL의 우수성과 개선이 요구되는 부분에 대하여 기술한다. 그 결과 DSSL은 구조 기반 검색을 지원하는 질의 언어와 다양한 연산기능을 지원하는 수식 언어에 기반하기 때문에 강력한 포맷팅과 변환기능을 제공한다. 그러나 처리 방식의 특성상, DSSL은 사용자 인터랙션이 많으며 위지윅한 문서 환경보다는 일괄처리 방식의 문서 처리 분야에 더 적합하다.