• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.372-383
• /
• 2006

Among the approaches to image database management, content-based image retrieval (CBIR) is viewed as having the best support for effective searching and browsing of large digital image libraries. Typical CBIR systems allow a user to provide a query image, from which low-level features are extracted and used to find 'similar' images in a database. However, there exists the semantic gap between human visual perception and low-level representations. An effective methodology for overcoming this semantic gap involves relevance feedback to perform feature re-weighting. Current approaches to feature re-weighting require the number of components for a feature representation to be the same for every image in consideration. Following this assumption, they map each component to an axis in the n-dimensional space, which we call the metric space; likewise the feature representation is stored in a fixed-length vector. However, with the emergence of features that do not have a fixed number of components in their representation, existing feature re-weighting approaches are invalidated. In this paper we propose a feature re-weighting technique that supports features regardless of whether or not they can be mapped into a metric space. Our approach analyses the feature distances calculated between the query image and the images in the database. Two-sided confidence intervals are used with the distances to obtain the information for feature re-weighting. There is no restriction on how the distances are calculated for each feature. This provides freedom for how feature representations are structured, i.e. there is no requirement for features to be represented in fixed-length vectors or metric space. Our experimental results show the effectiveness of our approach and in a comparison with other work, we can see how it outperforms previous work.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.209-215
• /
• 2005

Conventional ORDBMS vendors provide extension mechanisms for adding user-defined types and functions to their own DBMSs. Here, the extension mechanisms are implemented using a high-level interface. We call this technique loose-coupling. The advantage of loose-coupling is that it is easy to implement. However, it is not preferable for implementing new data types and operations in large databases when high Performance is required. In this paper, we propose to use the notion of tight-coupling to satisfy this requirement. In tight-coupling, new data types and operations are integrated into the core of the DBMS engine. Thus, they are supported in a consistent manner with high performance. This tight-coupling architecture is being used to incorporate information retrieval(IR) features and spatial database features into the Odysseus/IR ORDBMS that has been under development at KAIST/AITrc. In this paper, we introduce Odysseus/IR and explain its tightly-coupled IR features (U.S. patented). We then demonstrate a web search engine that is capable of managing 20 million web pages in a non-parallel configuration using Odysseus/IR.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.11
• /
• pp.44-52
• /
• 2011

In this article, we present a QoS-guaranteed IP mobility management scheme of Internet service for fast moving vehicles with multiple wireless network interfaces. The idea of the proposed mechanism consists of two things. One is that new wireless connections are established to available wireless channels whenever the measured data rate at the vehicle equipped with mobile gateway drops below to the required data rate of the user requirement. The other is that parallel distribution packet tunnels between an access router and the mobile gateway are dynamically constructed using multiple wireless network interfaces in order to guarantee the required data rate during the mobile gateway's movement. By doing these methods, the required data rate of the mobile gateway can be preserved while eliminating the possible delay and packet loss during handover operation, thus resulting in the guaranteed QoS. The architecture of the IETF standard HMIPv6 has been extended to realize the proposed scheme, and detailed algorithms for the extension of HMIPv6 has been designed. Finally, simulation has been done for performance evaluation, and the simulation results show that the proposed mechanism demonstrates guaranteed QoS during the handover with regard to the handover delay, packet loss and throughput.

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

We need a component-based system to reflect software changes in user's requirements, to implement a system at a rapid speed as well as to efficiently manage the system in a maintenance phase and to easily change software. Moreover, the component-based system has a merit in development cost. However, existing component development methodology for implement of component-based system is inefficient in object identification for component identification. Moreover, the existing component development methodology also fails to provide any method to identify system component. It merely provides procedures and methods to identify business component focused on a whole system domain. In addition, it has another problem that it considerably relies on developer's experiences and intuitions for component identification. Therefore, according to this paper, RUP (Rational Unified Process) is applied from a requirement analysis phase to an object identification phase in order to improve the inefficiency of object identification. In addition, this paper procedures and methods for system component identification, and identifies business components based on the identified system component, rather than on the whole system domain. This paper also provides and applies cohesion metric and coupling metric so as to overcome the problem that component identification depends on developer's intuitions and experiences. Accordingly, the component identification method proposed in this paper, may identify components more effectively based on facility of object identification, functional reusability of components, traceability, and independence of components.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.513-522
• /
• 2008

Service-Oriented Architecture(SOA) is an method to develop applications by developing and publishing reusable services which potentially be used in various applications, and discovering and composing right services dynamically. SOA adopts a paradigm of publish-discover-invoke, which is considerably different from object-oriented and component-based development(CBD) approaches. The service in SOA is different from function in procedural programming, object in object-oriented programming, and component in CBD, and its fundamental requirement is a high level of reusability and applicability. In SOA, service providers and service consumers are loosely coupled since the providers try to develop reusable services and the consumers try to locate right services without knowing much about the providers and their published services. Moreover, the process of searching, choosing and invoking right services is not presented in conventional programming paradigms. Therefore, conventional approaches to developing user interfaces and invoking the functionality on servers through JSP, and RMI in object-oriented programming cannot well be applicable to designing clients’ programs in SOA. Therefore, there is a high demand for a practical and systematic process for developing clients’ applications, and the such a process should be devised by considering key characteristics of services and SOA. However, little work on this area is known to date, and there has not a process for client side just except few guide lines for developing service client. In this paper, we propose a practical and systematic development process for developing clients' applications in SOA. Then, we define instructions for carrying out each activity in the process. To show the applicability of the proposed work, we show the result of applying our process in developing a services application for searching and booking hotels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3A
• /
• pp.129-139
• /
• 2003

CAC is a very important issue in CDMA system in order to protect the required QoS(quality of service) and increase the system's capacity. In this paper, we proposed and analyzed a call admission control scheme using multiple thresholds, which can provide quick processing time and better performance. There are two effective thresholds used to decide call admission. One is the number of active users, and the other is the signal to interference ratio(SIR). If the threshold of active users are lower than the low number of users threshold, we accept the new call without any other conditions. Otherwise, we check the current SIR to guarantee the quality of our service. System then accepts the new call when the SIR satisfies system requirement. Otherwise, the call will be rejected. Multiple threshold schemes are investigated and their performance is compared with the number of user and power based CAC's. simulation results are provided to evaluate the performance.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.53-61
• /
• 2008

Public Key Broadcast Encryption (PKBE) allows a sender to distribute a message to a changing set of users over an insecure channel. PKBE schemes should be able to dynamically exclude (i.e., revoke) a certain subset of users from decrypting a ciphertext, so that only remaining users can decrypt the ciphertext. Another important requirement is for the scheme to be forward-secrecy. A forward-secure PKBE (fs-PKBE) enables each user to update his private key periodically. This updated private key prevents an adversary from obtain the private key for certain past period, which property is particularly needed for pay-TV systems. In this paper, we present a fs-PKBE scheme where both ciphertexts and private keys are of $O(\sqrt{n})$ size. Our PKBE construction is based on Boneh-Boyen-Goh's hierarchical identity-based encryption scheme. To provide the forward-secrecy with our PKBE scheme, we again use the delegation mechanism for lower level identities, introduced in the BBG scheme. We prove chosen ciphertext security of the proposed scheme under the Bilinear Diffie-Hellman Exponent assumption without random oracles.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1546-1553
• /
• 2015

In cognitive radio technology, the overall capacity of communications systems can be improved without allocating additional bands by allowing secondary system to utilize the band when a primary system who has right to use the band does not utilize it. Therefore, spectrum sensing to determine the existence of primary system is utmost important in the cognitive radio technology. In this work, we consider a novel cooperative spectrum sensing in cognitive cellular systems. Especially, we consider the case in which heterogeneous primary systems coexist, i.e., heterogenous transmission power and sensing requirement of primary system, such that only portion of users in cognitive cellular systems are able to detect the primary system. In this case, we propose new cooperative spectrum sensing with multiple sensing stages to properly detect the existence of primary systems in this kind of situations. Moreover, we analyze the performance of conventional cooperative spectrum sensing schemes such as OR-rule, AND-rule and MAJORITY-rule under the existence of heterogeneous primary systems. Finally, we investigate the performance of the proposed scheme through computer based simulations and show that the existence of primary systems can be determined accurately by using our proposed scheme.

• Journal of Advanced Navigation Technology
• /
• v.10 no.3
• /
• pp.275-281
• /
• 2006

Simple-relay aided resource allocation (SRARA) schemes are incorporated with throughput guarantee scheduling (TGS) in IEEE 802.16 type time division duplex - orthogonal frequency division multiple access (TDD-OFDMA) downlink in order to enhance service coverage, where the amount of resources for relaying at each relay is limited due to either its available power which is much smaller than base station (BS) power or the overhead required for exchanging feedback information. The performance of SRARA schemes is evaluated with schedulers such as proportional fair (PF) and TGS at 64kbps and 128kbps user throughput requirements when total MS power is set to 500mW or 1 W. For 64kbps throughput requirement level, more improvement comes from relay than scheduler design. For 128kbps case, it comse from scheduler design than relay due to the fact that simple relay can't help using strictly limited amount of resources for relaying function.

• Korean Journal of Remote Sensing
• /
• v.26 no.2
• /
• pp.239-249
• /
• 2010

The Geostationary Ocean Color Imager (GOCI) data-processing system (GDPS), which is a software system for satellite data processing and analysis of the first geostationary ocean color observation satellite, has been developed concurrently with the development of th satellite. The GDPS has functions to generate level 2 and 3 oceanographic analytical data, from level 1B data that comprise the total radiance information, by programming a specialized atmospheric algorithm and oceanic analytical algorithms to the software module. The GDPS will be a multiversion system not only as a standard Korea Ocean Satellite Center(KOSC) operational system, but also as a basic GOCI data-processing system for researchers and other users. Additionally, the GDPS will be used to make the GOCI images available for distribution by satellite network, to calculate the lookup table for radiometric calibration coefficients, to divide/mosaic several region images, to analyze time-series satellite data. the developed GDPS system has satisfied the user requirement to complete data production within 30 minutes. This system is expected to be able to be an excellent tool for monitoring both long-term and short-term changes of ocean environmental characteristics.