• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1045-1055
• /
• 2007

Latent topic models are statistical models which automatically captures salient patterns or correlation among features underlying a data collection in a probabilistic way. They are gaining an increased popularity as an effective tool in the application of automatic semantic feature extraction from text corpus, multimedia data analysis including image data, and bioinformatics. Among the important issues for the effectiveness in the application of latent topic models to the massive data set is the efficient learning of the model. The paper proposes an accelerated learning technique for PLSA model, one of the popular latent topic models, by an incremental EM algorithm instead of conventional EM algorithm. The incremental EM algorithm can be characterized by the employment of a series of partial E-steps that are performed on the corresponding subsets of the entire data collection, unlike in the conventional EM algorithm where one batch E-step is done for the whole data set. By the replacement of a single batch E-M step with a series of partial E-steps and M-steps, the inference result for the previous data subset can be directly reflected to the next inference process, which can enhance the learning speed for the entire data set. The algorithm is advantageous also in that it is guaranteed to converge to a local maximum solution and can be easily implemented just with slight modification of the existing algorithm based on the conventional EM. We present the basic application of the incremental EM algorithm to the learning of PLSA and empirically evaluate the acceleration performance with several possible data partitioning methods for the practical application. The experimental results on a real-world news data set show that the proposed approach can accomplish a meaningful enhancement of the convergence rate in the learning of latent topic model. Additionally, we present an interesting result which supports a possible synergistic effect of the combination of incremental EM algorithm with parallel computing.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.109-122
• /
• 2000

As the full-motion videos in MPEG are widely available nowadays, an editor that could easily edit such kind of media data is required to develop various multimedia applications. In order to concatenate and apply a transition effect to two video streams encoded in MPEG, they should be decoded first since there are dependencies in the frames in MPEG-encoded video stream. Since this decode-edit-encode process requires a huge amount of computing/storage resources, a new editing scheme that could apply various transition effects to MPEG video streams directly while keeping the quality of video data is strongly required. This paper proposes a new editing scheme that could apply three transition effects (such as fade-in, fade-out, and dissolve) to MPEG video streams in a compressed domain. In the proposed scheme, an extension of previous method in which the frames are partially decompressed and transition effects are applied is adopted for I- and P-frames. In addition, a new processing scheme for B-frame that could apply the transition effects in DCT domain directly using an approximation of motion compensation based on the motion vector to reference frames. Since this processing scheme could apply the transition effects in a compressed domain directly, the editing process could be speed-up about $3{\sim}4$ times faster than previous decode-edit-encoding method while keeping the quality of video data as good as the source data. The proposed scheme could be used to build a software-only MPEG video editing system that helps to edit MPEG video data even on a low-cost desk-top computer.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.3
• /
• pp.153-164
• /
• 2007

The Access Grid (AG) provides collaboration environments over the IP multicast networks by enabling efficient exchange of multimedia contents among remote users; however, since lots of current networks are still multicast-disabled, it is not easy to deploy this multicast-based multi-party AG. For this problem, the AG provides multicast bridges as a solution by putting a relay server into the multicast networks. Multicast-disabled clients make UDP connections with this relay server and receive forwarded multicast traffics in unicast UDP packets. This solution is facing several limitations since it requires duplicate forwarding of the same packet for each unicast peer. Thus, in this paper, we propose an alternate solution for the multicast connectivity problem of the AG based on the UMTP (UDP multicast tunneling protocol). By taking advantage of flexibilities of UMTP, the proposed solution is designed to improve the efficiency of network and system utilization, to allow reuse of multicast-based AG applications without modification, and to partially address the NAT/firewall traversal issues. To verify the feasibility of proposed solution, we have implemented a prototype AG connectivity tool based on the UMTP, named as the AG Connector.

• The Journal of the Korea Contents Association
• /
• v.7 no.8
• /
• pp.31-40
• /
• 2007

Recently, Embedded systems are different with the past as loading of a simple application program that executed specific functions according to the use and are evolved in the digital convergence integrated multimedia functions and then the complication of the application program is remarkably increased. This application program is combined and evolved with many application program in accordance with the demand of the age. For develope and manage this developing application is necessary standardized interface between developer and manager. POSIX was developed as the standard of the operating system in the standard interface which has the open system structure in computing system, and there is a posix.4 to standard for the system demands the loading of real-time operating system like a digital convergence devices. In this paper, we present the contents of designing and implementing the real-time operating system UbiFOSTM to wrapper for supporting the POSIX.4. Also, Experimental results show that implemented wrapper to application program standardizing POSIX.4 in linux and UbiFOSTM is slight only $3{\sim}9{\mu}s$.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.6
• /
• pp.25-31
• /
• 2014

When the public key e and the composite number n=pq are disclosed but not the private key d in an asymmetric-key RSA, message decryption is carried out by obtaining ${\phi}(n)=(p-1)(q-1)=n+1-(p+q)$ and subsequently computing $d=e^{-1}(mod{\phi}(n))$. The most commonly used decryption algorithm is integer factorization of n/p=q or $a^2{\equiv}b^2$(mod n), a=(p+q)/2, b=(q-p)/2. But many of the RSA numbers remain unfactorable. This paper therefore applies baby-step giant-step discrete logarithm and $2^k$-ary modular exponentiation to directly obtain ${\phi}(n)$. The proposed algorithm performs a reverse baby-step and $2^k$-ary adult-step. As a results, it reduces the execution time of basic adult-step to $1/2^k$ times and the memory $m={\lceil}\sqrt{n}{\rceil}$ to l, $a^l$ > n, hence obtaining ${\phi}(n)$ by executing within l times.

• Journal of Internet Computing and Services
• /
• v.5 no.3
• /
• pp.99-108
• /
• 2004

We have designed and implemented a Voice Messenger System(VMS) for sending and receiving voice data in order to measure and analyze the performance of a multimedia data transfer system using PDAs(Personal Digital Assistants) in a fast wireless LAN environment. The VMS has been configured as an infrastructure network by integrating a wireless intra-network based on IEEE 802,11 b standard with a wired network based on Ethernet. A sending time, a receiving time and a round-trip time(RTT) have been measured by varying its pecket size from 256 to 6656 bytes, Besides, we have performed the experiments to see which NIC is more stable between CF and PCMCIA type in such a wireless LAN environment, The results of such experiments show that the NIC with PCMClA type is better than that with CF type from the points of both efficiency and stability. The performance of a notebook computer with the attachment of a wireless NIC that is used as a VMS client is almost constant by varying its packet size when transferring voice data. However, with PDA client, in the case of receiving packets from the VMS server, the performance is the best when the pecket size is 6656 bytes, In addition, in the case of sending packets from PDA client to the VMS server, the performance is the best when the packet size is 4096 bytes. Even with the same pecket size, the time of receiving packets from the VMS server to PDA is longer than the time of sending packets from PDA to the VMS Server, Thus, we conclude that when PDA is used as a client by applying different pecket size when sending and receiving packets should be achieved a better performance over a wireless LAN environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.3
• /
• pp.101-112
• /
• 2007

Hard disks have been the most prevalent secondary storage devices and these days their usage is becoming more important in mobile computing systems due to I/O intensive applications such as multimedia applications and games. However, significant power consumption in the disk drives still limits battery lifetimes of mobile systems critically. In this paper, we show that using several smaller disks (instead of one large disk) can be an energy-efficient secondary storage solution on typical mobile platforms without a significant performance delay. Also, we propose a novel energy-efficient technique, which clusters related data into groups and migrates the correlated groups to the same disk. We compare this method with the existing data concentration scheme, and also combine them. The experiments show that our technique saves the energy consumption up to 34% when a pair of 1.8' disks is used instead of a single 2.5' disk with a negligible increase in the average response time. The results also show that our method also saves up to 14.8% of disk energy consumption and improve the average I/O response time by up to 10 times over the existing scheme.

• Journal of the Korean Society for Library and Information Science
• /
• v.48 no.1
• /
• pp.53-73
• /
• 2014

Given that emotion-based computing environment has grown recently, it is necessary to focus on emotional access and use of multimedia resources including images. The purpose of this study aims to identify the visual cues for emotion in images. In order to achieve it, this study selected five basic emotions such as love, happiness, sadness, fear, and anger and interviewed twenty participants to demonstrate the visual cues for emotions. A total of 620 visual cues mentioned by participants were collected from the interview results and coded according to five categories and 18 sub-categories for visual cues. Findings of this study showed that facial expressions, actions / behaviors, and syntactic features were found to be significant in terms of perceiving a specific emotion of the image. An individual emotion from visual cues demonstrated distinctive characteristics. The emotion of love showed a higher relation with visual cues such as actions and behaviors, and the happy emotion is substantially related to facial expressions. In addition, the sad emotion was found to be perceived primarily through actions and behaviors and the fear emotion is perceived considerably through facial expressions. The anger emotion is highly related to syntactic features such as lines, shapes, and sizes. Findings of this study implicated that emotional indexing could be effective when content-based features were considered in combination with concept-based features.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.100-108
• /
• 2003

By choosing Multicast for transmission of educational contents in the Remote Educational System, we can reduce the server load and increase network bandwidth utilization. We design and implement Multicast Middleware for the Remote Educational System in this paper. There are three characteristics in this Multicast Middleware: 1) Through Centralized Multicast Group Management for passive members, it allows a host to make multicast group, which is composed of receivers, called Group Member and who are chosen by the host, called group Maker. Because, all groups are created by the Group Maker in Centralized Group Management, Group Member's join action will be passive 2) Maintenance and recovery of multicast group information in order to restore from exception and crash; the maintenance and recovery mechanism of Group Maker is distinct from that of Group Member. 3) The mechanism which enables to transmit large size multimedia data through multicasting and remove additional copy operation through shared buffer. Fragmentation/de-fragmentation for large data delivery results in additional copy operation in user level. But by using user level shared buffer, it can be done without user Bevel copy operation. By applying to Remote Educational environment which consists of 30 PCs and Fast Ethernet, we can examine the efficiency of this middleware, which can transmit 18frames/sec movie which resolution 320 $\times$ 120 pixels, 128Kbps encoded sound data and some text data.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.13-24
• /
• 2003

MPEG-4 is a standard for multimedia applications and provides a set of technologies to satisfy the needs of authors, service providers and end users alike. In this paper, we suggest a Real-time Multiple Circular Buffer (M4RM Buffer) model, which is suitable for streaming these MPEG-4 contents efficiently. M4RM buffer generates each structure of the buffer, which matches well with each object composing an MPEG-4 content, according to the transferred information, and manipulates multiple read/write operations only by its reference. It divides the decoder buffer and the composition buffer, which are described in the standard, by the unit of frame allocated to minimize the range of access. This buffer unit of a frame is allocated according to the object description. Also, it processes the objects synchronization within the buffer and provides APIs for an efficient buffer management to process the real-time user events. Based on the performance evaluation, we show that M4RM buffer model decreases the waiting time in a buffer frame, and so allows the real-time streaming of an MPEG-4 content using the smaller size of the memory block than IM1-2D and Window Media Player.