• Journal of IKEEE
• /
• v.9 no.2 s.17
• /
• pp.170-178
• /
• 2005

The video data corrupted by the transmission error due to packet loss induce error propagation in decoded video data, and cause poor video quality. To remedy these corrupted video data, there have been introduced two types of error concealment techniques: spatial or temporal error concealment algorithm. Computational overhead by using spatial error concealment algorithm is a serious disadvantage in mobile video data streaming environment. In this paper, we propose hybrid type error concealment technique recovering video quality of mobile device using MPEG-4 video streaming on error-prone wireless network. Our algorithm is implemented in MPEG-4 decoder. The algorithm adopts Intel Wireless MMX technology to provide high performance of portable embedded multimedia mobile device. It is proven that the proposed algorithm shows expected performance for a mobile streaming system(PDA) on IP channels. Our approach showed better processing speed and better video quality comparing with traditional error concealment algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.1
• /
• pp.21-35
• /
• 2000

MIDAS-II is the storage system for BADA DBMS developed at ETRI. This paper describes the extension of MIDAS-II for incorporating the tertiary storage device such as an optical disk jukebox or a tape library, enabling MIDAS-II to function as a storage system of the data server that stores a massive amount of multimedia data. The MIDAS-II disk volume structure is extended to efficiently function as a volume for the tertiary storage device with multiple platters, which canstore huge amount of data of the order of tera bytes. The storage structure of the LOB is changed to efficiently manage the LOB data in the tertiary storage device. The data structures of the shared memory, the process structure, and the utilities in MIDAS-II are also extended to efficiently incorporating the tertiary storage device. The functionalities of each MIDAS-II API function are expanded to handle the tertiary storage device, while the prototypes of those functions are intact in order not to affect the existing application programs. The performance evaluation shows that the extended MIDAS-II works effectively with the tertiary storage device. All these extensions and the performance evaluation are conducted in the SunOS 5.4 environment.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1374-1385
• /
• 2009

Recently, advances in speed of the CPU have for out-paced advances in memory speed. Main-memory access is increasingly a performance bottleneck for main-memory database systems. To reduce memory access speed, cache memory have incorporated in the memory subsystem. However cache memories can reduce the memory speed only when the requested data is found in the cache. We propose a new cache sensitive T-tree index structure called as $CST^*$-tree for range query search. The $CST^*$-tree reduces the number of cache miss occurrences by loading the reduced internal nodes that do not have index entries. And it supports the sequential access of index entries for range query by connecting adjacent terminal nodes and internal index nodes. For performance evaluation, we have developed a cost model, and compared our $CST^*$-tree with existing CST-tree, that is the conventional cache sensitive T-tree, and $T^*$-tree, that is conventional the range query search T -tree, by using the cost model. The results indicate that cache miss occurrence of $CST^*$-tree is decreased by 20~30% over that of CST-tree in a single value search, and it is decreased by 10~20% over that of $T^*$-tree in a range query search.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.239-248
• /
• 1998

Software reengineering is making various research for solutions against problem of maintain existing system. Reengineering has a meaning of development of softwares on existing systems through the reverse-engineering and the forward-engineering. It extracts classes from existing system's softwares to increase the comprehension of the system and enhance the maintenability of softwares. Most of the important concepts used in reengineering is composition that is restructuring of the existing objects from other components. The classes and clusters in storage have structural relationship with system's main components to reuse in the higher level. These are referenced as dynamic informations through structuring an architect for each of them. The classes are created by extractor, searcher and composer through representing existing object-oriented source code. Each of classes and clusters extract refined informations through optimization. New architecture is created from the cluster based on its classes' relationship in storage. This information can be used as an executable code later on. In this paper, we propose the tools, it presented by this thesis presents a new information to users through analysing, based on reengineering, Object-Oriented informations and practicing composition methodology. These composite classes will increase reusability and produce higher comprehension information to consist maintainability for existing codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.33-43
• /
• 2010

Recently, users want to use real-time multimedia services, such as internet, VoIP, etc., using their IEEE 802.11 wireless lan mobile stations. In order to provide such services, a handoff among access points is essential to support the mobility of a node, in such an wide area. However, the legacy handoff methods of IEEE 802.11 technology are easy to lose connections. Also, the recognition of a disconnection and channel re-searching time make the major delay of the next AP to connect. In addition, because IEEE 802.11 decides the selection of an AP depending only on received signal strength, regardless of a node direction, position, etc., it cannot guarantee a stable bandwidth for communication. Therefore, in order to provide a real-time multimedia service, a node must reduce the disconnection time and needs an appropriate algorithm to support a sufficient communication bandwidth. In this paper, we suggest an algorithm which predicts a handoff point of a moving node by using GPS location information, and guarantees a high transmission bandwidth according to the signal strength and the distance. We implemented the suggested algorithm, and confirmed the superiority of our algorithm by reducing around 3.7ms of the layer-2 disconnection time, and guaranteed 24.8% of the communication bandwidth.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.197-206
• /
• 2009

The medical information system is an effective medical diagnosis assistance system which offers an environment in which medial images and diagnosis information can be shared. However, this system can only stored and transmitted information without other functions. To resolve this problem and to enhance the efficiency of diagnostic activities, a medical image classification and retrieval system is necessary. The medical image classification and retrieval system can improve efficiency in a medical diagnosis by providing disease-related images and can be useful in various medical practices by checking diverse cases. However, it is difficult to understand the meanings contained in images because the existing image classification and retrieval system has handled superficial information only. Therefore, a medical image classification system which can classify medical images by analyzing the relation among the elements of the image as well as the superficial information has been required. In this paper, we propose the method for learning and classification of brain MRI, in which the superficial information as well as the spatial information extracted from images are used. The superficial information of images, which is color, shape, etc., is called low-level image information and the logical information of the image is called high-level image information. In extracting both low-level and high-level image information in this paper, the anatomical names and structure of the brain have been used. The low-level information is used to give an anatomical name in brain images and the high-level image information is extracted by analyzing the relation among the anatomical parts. Each information is used in learning and classification. In an experiment, the MRI of the brain including disease have been used.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.127-136
• /
• 2010

With rapid growth of information and computer communication technologies, the numbers of digital documents including multimedia data have been recently exploded. In particular, news video database and news video mining have became the subject of extensive research, to develop effective and efficient tools for manipulation and analysis of news videos, because of their information richness. However, many research focus on browsing, retrieval and summarization of news videos. Up to date, it is a relatively early state to discover and to analyse the plentiful latent semantic knowledge from news videos. In this paper, we propose the news video mining system based on multi-modal approach and text mining, which uses the visual-textual information of news video clips and their scripts. The proposed system systematically constructs a taxonomy of news video stories in automatic manner with hierarchical clustering algorithm which is one of text mining methods. Then, it multilaterally analyzes the topics of news video stories by means of time-cluster trend graph, weighted cluster growth index, and network analysis. To clarify the validity of our approach, we analyzed the news videos on "The Second Summit of South and North Korea in 2007".

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.924-942
• /
• 2005

Recently, large-scale directories have been developed for LINUX cluster file systems to store and retrieve huge amount of data. One of them, GFS directory, has attracted much attention because it is based on extendible hashing, one of dynamic hashing techniques, to support fast access to files. One distinctive feature of the GFS directory is the flat structure where all the leaf nodes are located at the same level of the tree. Hut one disadvantage of the mode structure is that the height of the mode tree has to be increased to make the tree flat after a byte is inserted to a full tree which cannot accommodate it. Thus, one byte addition makes the height of the whole mode tree grow, and each data block of the new tree needs one more link access than the old one. Another dynamic hashing technique which can be used for directories is linear hashing and a couple of researches have shown that it can get better performance at file access times than extendible hashing. [n this research, we have designed and implemented an extendible hashing directory and a linear hashing directory for large-scale LINUX cluster file systems and have compared performance between them. We have used the semi-flat structure which is known to have better access performance than the flat structure. According to the results of the performance evaluation, the linear hashing directory has shown slightly better performance at file inserts and accesses in most cases, whereas the extendible hashing directory is somewhat better at space utilization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1574-1581
• /
• 2007

DVB-H (Digital Video Broadcasting for Handhold) is a new standard, currently being developed for a portable digital broadcasting, which enhance the multimedia broadcasting service in the Euroapean standard DVB-T (DVB-Terrestrial). Seamless mobility and power saving are essential requirements in the DVB-H system. To support seamless mobility, DVB-H system should provides seamless handover for mobile stations in the MFN (multi frequency network). For seamless handover, the receiver should monitor neighboring cells and it increases the power consumption. And so, power efficient sell searching algorithm for seamless handover is required. In this paper, we propose hypothesis feeling based handover algorithm to enhance the power efficiency by using the fast cell searching, and analyze the performance of handover schemes through the numerical evaluation and simulation.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.28-39
• /
• 2011

While the broadband multimedia technologies have been developing, the commercial market of digital contents has also been widely spreading. Most of all, digital cartoon market like internet cartoon has been rapidly large so video cartooning continuously has been researched because of lack and variety of cartoon. Until now, video cartooning system has been focused in non-photorealistic rendering and word balloon. But the meaningful frame extraction must take priority for cartooning system when applying in service. In this paper, we propose new automatic frame extraction method for video cartooning system. At frist, we separate video and audio from movie and extract features parameter like MFCC and ZCR from audio data. Audio signal is classified to speech, music and speech+music comparing with already trained audio data using GMM distributor. So we can set speech area. In the video case, we extract frame using general scene change detection method like histogram method and extract meaningful frames in the cartoon using face detection among the already extracted frames. After that, first of all existent face within speech area image transition frame extract automatically. Suitable frame about movie cartooning automatically extract that extraction image transition frame at continuable period of time domain.