• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.260-262
• /
• 2004

Spatial database system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to visit unnecessary node by applying pruning technique. But this method access more disk than necessary while pruning unnecessary node. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN object using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit fewer disks than MINMAX method by the factor of maximum $22\%\;and\;average\;6\%.$

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.272-275
• /
• 2004

Recently, the services using position information of moving objects is embossed. Theses services needs the moving objects databases to manage moving object data with efficiency. To build the moving object databases, we must develop the moving object engine to mange, store, and search the spatio temporal data of moving object. The moving object engine has to support query syntax to search data that suitable for user need like LBS, Telematics, ITS, vehicle management system. In this paper, we design and implement the moving object engine to support service with moving object data. The moving object engine is able to support system environment that users are able to get the moving object data easily even they don't know complex data structure.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.101-110
• /
• 2009

Multi-agent systems are mostly used to integrate the intelligent and distributed approaches to various systems for effective sharing of resources and dynamic system reconfigurations. Object replication is usually used to implement fault tolerance and solve the problem of unexpected failures to the system. This paper presents the intelligent multi-agent distributed platform based on the dynamic object group management and proposes an object search technique based on the proposed filtered k-means (Fk-means). We propose Fk-means for the search mechanism to find alternative objects in the event of object failures and transparently reconnect client to the object. The filtering range of Fk-means value is set only to include relevant objects within the group to perform the search method efficiently. The simulation result shows that the proposed mechanism provides fast and accurate search for the distributed object groups.

• Journal of the Korean Society for information Management
• /
• v.29 no.1
• /
• pp.175-190
• /
• 2012

This study aims to investigate the current status of mobile search functions of Korean search portals, namely Google Korea, Naver, Nate, Daum, and Yahoo Korea. This study focuses on unique mobile search functionalities, such as voice search, music search, code search, and visual/ object search. In particular, this study analyzed characteristics of these search functions and evaluated their performances based on the accuracy and the speed of recognition. The results of this study show that both Naver and Daum support various mobile searching functions, whereas Google only supports voice search. Nate and Yahoo do not offer any unique function. The results of this study can be applied to the portal's effective development of mobile search functionalities.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.135-135
• /
• 2001

In recent years there have been increasing interests in real-time object tracking with image information. Since image information is affected by illumination, this paper presents the real-time object tracking method based on neural networks that have robust characteristics under various illuminations. This paper proposes three steps to track the object and the fast tracking method. In the first step the object color is extracted using neural networks. In the second step we detect the object feature information based on invariant moment. Finally the object is tracked through a shape recognition using neural networks. To achieve the fast tracking performance, we have a global search for entire image and then have tracking the object through local search when the object is recognized.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2358-2361
• /
• 2001

In recent years there have been increasing interests in real-time object tracking with image information. Since image information is affected by illumination, this paper presents the real-time object tracking method based on neural networks which have robust characteristics under various illuminations. This paper proposes three steps to track the object and the fast tracking method. In the first step the object color is extracted using neural networks. In the second step we detect the object feature information based on invariant moment. Finally the object is tracked through a shape recognition using neural networks. To achieve the fast tracking performance, this paper first has a global search of entire image and tracks the object through local search when the object is recognized.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.75-82
• /
• 2010

The paper proposed CBIRS/EFI with contents based search technique using edge feature information of the object from image information of the object which is uncertain. In order to search specially efficiently case of partial image information of the object, we used the search technique which extracts outline information and color information in feature information of object. In order to experiment this, we extracted side edge feature information of the vehicle for feature information of the object after capture the car image of the underground garage. This is the system which applies a contents base search by the result which analyzes the image which extracts a feature, an original image to search and a last similar measurement result. This system compared in FE-CBIRS systems which are an existing feature extraction contents base image retrieval system and the function which improves the accuracy and an effectiveness of search rate was complemented. The performance appraisal of CBIRS/EFI systems applied edge extraction feature information and color information of the cars. And we compared a color feature search time, a shape characteristic search time and a search rate from the process which searches area feature information. We extracted the case 91.84% of car edge feature extraction rate. And a average search time of CBIRS/EFI is showing a difference of average 0.4-0.9 seconds than FE-CBIRS from vehicle. color search time, shape characteristic search time and similar search time. So, it was proven with the fact that is excellent.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.227-240
• /
• 2003

When we develop and use the java-based distributed object system, the system developer must deploy distributed object, which is implemented to predefined interface, to network and the system user acquires reference about distributed object and changes reference to interface type. Sharing of interface is essential for these works In this paper, we propose the IRSJ(interface repository service based on jim) to improve efficiency of interface sharing at the JINI system development. the IRSJ is consisted of the java classes for JINI system and interface sharing service. If development teams perform collaborative work in short distance, the IRSJ can search interface file without information of lookup server or interface writer If development teams perform collaborative work in long distance, the IRJS can search interface with only an address of server that executes lookup service. Although the interface object not requires additional search, the interface object that failed search interface can download interface and use interface using remote event model. When the message service fails in interface search, the message service sends interface request message to a development team member who use the IRSJ automatically, so that interface sharing may be possible in short time.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.3 no.2
• /
• pp.119-125
• /
• 2008

This paper presents the polygon-based Q-leaning and Cascade Support Vector Machine algorithm for object search with multiple robots. We organized an experimental environment with ten mobile robots, twenty five obstacles, and an object, and then we sent the robots to a hallway, where some obstacles were lying about, to search for a hidden object. In experiment, we used four different control methods: a random search, a fusion model with Distance-based action making (DBAM) and Area-based action making (ABAM) process to determine the next action of the robots, and hexagon-based Q-learning and dodecagon-based Q-learning and Cascade SVM to enhance the fusion model with DBAM and ABAM process.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.381-385
• /
• 2003

We suggest a method which reduces the search space of a model-base on multiple-view approach for polyhedral object recognition using the ART-1 neural network. In this approach, the model-base is consisted of extracted features from two-dimensional projections observed at the predetermined viewpoints of a viewing sphere enclosing the object.