• Journal of the Korea Computer Graphics Society
• /
• v.7 no.2
• /
• pp.21-28
• /
• 2001

As a result of the recent explosive growth of scientific data, extremely large volume datasets have become increasingly commonplace. While several texture-based volume rendering algorithms have been proposed, most of them focused on volumes smaller than the hardware's available texture memory. This paper presents a new parallel volume rendering scheme for very large static and time-varying data on a multipipe system architecture. Our scheme subdivides large volumes dynamically into smaller bricks, and assigns them adaptively to graphics pipes to minimize the costs of texture swapping. With the new method, Phong shaded images can be easily created by computing the gradients on the fly and using the color matrix feature of OpenGL. We report experimental results on an SGI Onyx2 for the various large datasets.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.353-360
• /
• 2004

The study on scene change detection in the compressed MPEG videos has been done by various approaches. However, most of these approacher accomplished scene change detection by carrying out decoding processes and then by comparing pixels with pixels. This approach it not suitable for real time applications owing to much computing time of decoding processes. Recently, the study on scene change detection algorithms using only information of compressed domain is becoming Increasingly important. In this paper, we propose a sequential access method as an efficient scene change detection algorithm in the compressed domain. According to the type of pictures in the compressed MPEG video streams (divided in I-blocks and each I-block into P-blocks), the proposed algorithm provides effective scene change detection by applying sequential access and block by block mechanism. The proposed sequential access method provides fast and accurate detection operation by reducing checking procedures of unnecessary pictures due to molt of operations in compressed domain and checking by block units. Also, this approach uses optimal algorithm to provide fast and accurate detection operation.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.607-616
• /
• 2005

Due to the limited resources in thin-client and the large amount of computation for decoding MPEG media, it is not easy to support the QoS stream media to clients. To solve the problems, the terminal servers would be charged for decoding the MPEG media and thin-clients have a role to update only the changed areas in their screen. However, these previous approaches cause severely low video quality. In addition, since servers perform all procedures to decode MPEG media, they are easily saturated even under a small number of clients. In this paper, the sources of the low video duality are investigated in the previous thin-clients' solutions working in wireless and wired environments. From the detailed experiments, an intelligent media player is proposed to achieve the QoS streams by supporting both the enhanced video duality and the audio synchronized with video frames.

• Journal of Wetlands Research
• /
• v.16 no.3
• /
• pp.383-392
• /
• 2014

The purpose of this study is to simulate inundation and evaluate the applicability of LISFLOOD model to the streams in South Korea by comparing with the inundation map using FLUMEN. The suggested levee breaching scenarios were applied to the LISFLOOD model, and the results obtained from scenarios were evaluated. The modeling results using LISFLOOD by appling the levee breaching scenarios showed 0.2% ~ 42% relative error with FLUMEN model in inundation area. But the relative error of maximum inundation area by overlapping all the flood analysis results from levee breaching scenarios such as the way making flood risk map was approximately 1.2% between two models. Meanwhile, LISFLOOD model was easy to construct input data, DEM as topographic data and discharge hydrograph as upper boundary conditions. And computing time of LISFLOOD was shorter than FLUMEN. Therefore LISFLOOD model can be applied usefully in the region that needs immediate inundation modeling.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.145-152
• /
• 2010

With the recent development of the ubiquitous computing technology, there are increasing interest and research in technologies such as sensors and RFID related to information recognition and location positioning in various ubiquitous fields. Especially, RTLS(Real-Time Locating Services) dealing with spatio-temporal data is emerging as a promising technology. For these reasons, the ISO/IEC published the RTLS standard specification for compatibility and interoperability in RTLS. Therefore, in this paper, we designed and implemented Spatio-temporal Query Processing Systems for efficiently managing and searching the incoming Spatio-temporal data stream of moving objects. Spatio-temporal Query Processing Systems's spatio-temporal middleware maintains interoperability among heterogeneous devices and guarantees data integrity in query processing through real time processing of unceasing spatio-temporal data streams and two way synchronization of spatio-temporal DBMSs. Web Server uses the SOAP(Simple Object Access Protocol) message between client and server for interoperability and translates client's SOAP message into CQL(Continuous Query Language) of the spatio-temporal middleware. Finally, this thesis proved the utility of the system by applying the spatio-temporal Query Processing Systems to a real-time Locating Services.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.45-50
• /
• 2017

Micro-service Architecture is a service architecture optimized for large-scale distributed systems such as real-time realistic broadcasting systems, so that are fiercely adopted by Global leading service platform vendors such as Netflix and Twitter due to the merit of horizontal performance scalability enabling the scale-out technique. In addition, micro-service architecture makes it possible to execute image processing and real-time data analysis using an asynchronous-based processing that are difficult to handle in Web API such as REST. In this paper, an event stream processing framework applicable to asynchronous based micro services is proposed in the sense that the accountability of event processing order is not guaranteed in the events such as IoT sensor data analysis or cloud-based image editing because these are the situations where the real-time media editing generates multiple event streams and asynchronous processes in the platform.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.755-760
• /
• 2005

To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.5
• /
• pp.520-529
• /
• 2002

Though BIFS is a complex description language that represents MPEG-4 content as text or bit streams, most traditional MPEG-4 content authoring tools are developed for a BIFS expert. Before using these tools, many authors must invest much time and energy in acquiring knowledge of BIFS. In this paper, we suggest a new manner for saving these efforts. Our proposal supplies the convenient user interface of traditional multimedia authoring tools for MPEG-4 authors and interprets the authored information and transforms it into BIFS. In our user interface, the author generates the minimal authoring information requested for generating BIFS; the BIFS generation module then transforms the information into BIFS format using predefined BIFS construction rules. The resulting BIFS consists of the Scene Tree and the Object Descriptor and Route; they are used for constructing MP4 standard files by mixing with the Elementary Stream.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.435-447
• /
• 2004

For VOD systems, it is important to provide QoS to more users under the limited resources. To analyze QoS issues in real environment, we implement clustered VOD server and embedded client system based on the Linux open source platform. The parallel processing of MPEG data, load balancing for nodes and VCR like functions are implemented in the server side. To provide more user friendly interface, the general TV is used for a VOD client's terminal and the embedded board is used supporting for VCR functions. In this paper, we measure the performance of the implemented VOD system under the various user requirement features and evaluate the sources of performance limitations. From these analyses, we propose the dynamic admission control method based on the availability memory and network bandwidth. The proposed method enhances the utilization of the system resource for the more QoS media streams.

• KIISE Transactions on Computing Practices
• /
• v.21 no.8
• /
• pp.513-523
• /
• 2015

A complex event processing system, becoming useful in real life domains, efficiently processes stream of continuous events like sensor data from IoT systems. However, those systems do not work well on some types of queries yet, so that programmers should be careful about that. For instance, they do not sufficiently provide detailed guide to choose efficient queries among the almost same meaning queries. In this paper, we propose an query preprocessing tool for event stream processing systems, which helps programmers by giving them the hints to improve performance whenever their queries fall in any possible bad formats in the performance sense. We expect that our proposed module would be a big help to increases productivity of writing programs where debugging, testing, and performance tuning are not straightforward.