• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.551-562
• /
• 2000

Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.25-34
• /
• 2006

In this paper, we propose the new Cellular Ethernet System that supports faster handovers than IP layer handover scheme for WiBro Networks and analyze the performance of the proposed scheme. In WiBro Networks, it is very important for service providers that supports fast handovers for mobile users who want superior service. But in case of Mobile IPv6, which supports IP layer handovers, there exists very long latency for detecting movement and duplicated IP address. And besides, handovers in wired area must be carried out after completing handovers in wireless area. So, Mobile IPv6 cannot provide superior service to mobile users. To remedy these problems, we here propose the new Cellular Ethernet System that consists of MAC layer bridges for WiBro Networks and analyze the performance of Cellular Ethernet System handover scheme and show that it has better performance than Mobile IPv6.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.986-991
• /
• 2017

In this paper, we present a method for synthesizing imperative programs from input-output examples. Given (1) a set of input-output examples, (2) an incomplete program, and (3) variables and integer constants to be used, the synthesizer outputs a complete program that satisfies all of the given examples. The basic synthesis algorithm enumerates all possible candidate programs until the solution program is found (enumerative search). However, it is too slow for practical use due to the huge search space. To accelerate the search speed, our approach uses code optimization and avoids unnecessary search for the programs that are syntactically different but semantically equivalent. We have evaluated our synthesis algorithm on 20 introductory programming problems, and the results show that our method improves the speed of the basic algorithm by 10x on average.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.549-556
• /
• 2008

To achieve flexible visual content adaption for multimedia communications, the ISO/IEC MPEG & ITU-T VCEG form the JVT to develop SVC amendment for the H.264/AVC standard. JVT uses inter-layer prediction as well as inter prediction and intra prediction that are provided in H.264/AVC to remove the redundancy among layers. The main goal consists of designing inter-layer prediction tools that enable the usage of as much as possible base layer information to improve the rate-distortion efficiency of the enhancement layer. But inter layer prediction causes the computational complexity to be increased. In this paper, we proposed an efficient residual prediction. In order to reduce the computational complexity while maintaining the high coding efficiency. The proposed residual prediction uses modified interpolation that is defined in H.264/AVC SVC.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.181-185
• /
• 2008

Layered video multicast such as RLM Receiver-driven layered multicast) is a premising technique for delivering streaming video to a set of heterogeneous receivers over ALM(Application Layer Multicast) as well as over IP multicast. However, this approach may suffer from unnecessary fluctuation of video quality due to overlapped and failed join-experiments. Though a shared teaming scheme was introduced to resolve these problems, it may cause high control overhead and slow convergence problem when used with ALM. In this paper, we propose a new shared learning scheme for ALM-based layered video multicast which reduces control overhead and convergence latency while keeping the number of fluctuation reasonably small. The simulation results show that the proposed scheme performs better than an ALM-based layered video multicast with shared learning in terms of control overhead and convergence latency.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.122-134
• /
• 2010

With the rapidly increasing demand of traffic applications, the need to support seamless and robust multimedia services in the Vehicular Ad hoc Network is growing. Fast handover for the MIPv6 (FMIPv6) developed to solve the MIPv6's problem as well as Mobile IPv6 (MIPv6) for basic mobility protocol have been developed to support seamless handover in mobile environment. However, MIPv6 and FMIPv6 are useless for Quality-of-Service (QoS) services such as multimedia applications due to the long handover latency and the packet loss problem. In this paper, we propose a seamless and robust handover scheme that supports multimedia services in Vehicular Ad hoc Network using oCoA and background DAD. Through performance evaluation, we show that the proposed scheme is more proper for Vehicular Ad hoc Network than other schemes.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.605-610
• /
• 2014

Now, virtualization is no more emerging research area, and we can easily find its application in our circumstance. Nevertheless, I/O workloads are reluctant to be applied in virtual environment since they still suffer from unacceptable performance degradation due to virtualization latency. Many previous papers identified that virtual I/O overhead is mainly caused by exits and redundant I/O stack, and proposed several techniques to reduce them. However, they still have some limitations. In this paper, we introduce a novel I/O virtualization framework which improves I/O performance by exploiting multicore architecture. We applied our framework to the virtual network, and it improves TCP throughput up to 169%, and decreases UDP latency up to 38% on the network with the 10Gbps NIC.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.460-468
• /
• 2004

Quality of Service (QoS)-constrained policy has an advantage to guarantee QoS requirements requested by users. Quorum systems can ensure the consistency and availability of replicated data despite the benign failure of data repositories. We propose a Quorum based resource management scheme, which includes a system resource and network resource, both of which can satisfy the requirements of application QoS. We also propose the resource reconfiguration algorithm based on temporal execution time estimation method. Resource reconfiguration means that reshuffling the current available resource set for maintaining the quality level of the resources. We evaluate the effectiveness of resource reconfiguration mechanism with a Heart Hemodynamics analysis. Our approach shows the increase of the stability of execution environment as well as decrease the completion time compare to the method that is not adapted the resource reconfiguration.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.80-87
• /
• 2013

This paper proposes a CW (Contention window) allocation scheme for real-time data transmission of emergency data on VANET (Vehicle to vehicle Ad hoc Network, V2V) protocol. The proposed scheme reduces the probability of packet collisions on V2V protocol and provides bandwidth efficiency with short delay of emergency sporadic data. In the case of high density traffic, the proposed scheme provides a decrease of recollision probability using dynamic CW adjustments. For the performance analysis, a throughput, end-to-end delays, and network loads were investigated on highway traffic. Simulation results show the performance enhancements in terms of the throughput, end-to-end delays, and network loads.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.1-12
• /
• 2009

An RFID application needs to collect product's information scattered over the RFID network efficiently according to the globalization of RFID applied enterprises. To be informed of the stock status of products promptly in the supply chain network, especially, it is necessary to support queries that retrieve statistical information of tagged products. Since existing RFID network does not provide these kinds of queries, however, an application should request a query to several RFID middleware systems and analyze collected data directly. This process makes an application do a heavy computation for retrieving statistical information. To solve this problem, we define a new Distributed Continuous Query that finds information of tagged products from the global RFID network and provides statistical information to RFID applications. We also propose a Distributed Continuous Query System to process the distributed continuous query efficiently. To find out the movement of products via multiple RFID systems in real time, our proposed system uses Pedigree which represents trade information of items. Our system can also reduce the cost of query processing for removing duplicated data from multiple middleware systems by using Pedigree.