• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.2
• /
• pp.138-142
• /
• 2007

This paper presents an algorithm which extends the rapidly-exploring random tree (RRT) framework to deal with change of the task environments. This algorithm called the Retrieval RRT Strategy (RRS) combines a support vector machine (SVM) and RRT and plans the robot motion in the presence of the change of the surrounding environment. This algorithm consists of two levels. At the first level, the SVM is built and selects a proper path from the bank of RRTs for a given environment. At the second level, a real path is planned by the RRT planners for the: given environment. The suggested method is applied to the control of $KUKA^{TM}$, a commercial 6 DOF robot manipulator, and its feasibility and efficiency are demonstrated via the cosimulatation of $MatLab^{TM}\;and\;RecurDyn^{TM}$.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.57-60
• /
• 2001

In this paper, we propose a new 3D object retrieval system using the shape information of 2D silhouette images. 2D images at different view points are derived from a 3D model and linked to the model. Shape feature of 2D image is extracted by a region-based descriptor. In the experiment, we compare the results of the proposed system with those of the system using curvature scale space(CSS) to show the efficiency of our system.

• Journal of Information Management
• /
• v.36 no.4
• /
• pp.91-115
• /
• 2005

While the amount of information exchanged through internet has dramatically increased recently, certain inefficiencies still exist with regard to the storage, distribution, and retrieval of information. As a means of improving efficiency in accessing information, many search portals provide directory services to present organized guidance to information, based on the classification schemes. This study examines the classification activities practiced by the major search portals in Korea and makes some suggestions to improve the quality of directory services.

• Annual Conference on Human and Language Technology
• /
• 1997.10a
• /
• pp.227-232
• /
• 1997

이 논문은 인터넷 홈페이지를 검색하는 정보검색시스템인 미리내 시스템을 제시한다. 웹 문서의 특성을 고려하여 로봇의 기능을 확장하고, 색인, 등록, 수정, 삭제, 분류의 자동화를 구현하여 관리효율을 높인다. 자동화에 따른 문제점과 해결방법을 제시하고, 불리언질의검색 외에 자연언어질의 검색에서 질의어 확장의 방법으로 웹페이지 링크속성검색, Relevance feedback을 통한 검색효율을 높인다.

• Asia pacific journal of information systems
• /
• v.25 no.4
• /
• pp.626-641
• /
• 2015

Conventional case-based reasoning (CBR) does not perform efficiently for high-volume datasets because of case retrieval time. To overcome this problem, previous research suggested clustering a case base into several small groups and retrieving neighbors within a corresponding group to a target case. However, this approach generally produces less accurate predictive performance than the conventional CBR. This paper proposes a new case-based reasoning method called the clustering-merging CBR (CM-CBR). The CM-CBR method dynamically indexes a search pool to retrieve neighbors considering the distance between a target case and the centroid of a corresponding cluster. This method is applied to three real-life medical datasets. Results show that the proposed CM-CBR method produces similar or better predictive performance than the conventional CBR and clustering-CBR methods in numerous cases with significantly less computational cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3520-3537
• /
• 2014

Video copy detection methods have emerged in recent years for a variety of applications. However, the lack of efficiency in the usual retrieval systems restricts their use. In this paper, we propose a parallel implementation strategy for content based video copy detection (CBCD) by using a multi-core processor. This strategy can support video copy detection effectively, and the processing time tends to decrease linearly as the number of processors increases. Experiments have shown that our approach is successful in speeding up computation and as well as in keeping the performance.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.437-440
• /
• 2003

When we search database with a query image, the retrieval efficiency will vary from each kind of descriptor. Even the best representative descriptor, it results a few useless images that don't match with query image. This type of error can be reduced by adopting another descriptor which extracts features in different way. At present, the choice of descriptors is base on intuitive and experimental method. By theoretic accessing to the problem of descriptor choice, we can solve the given problem in the objective and rational way. In this study, we intend to make a composite of descriptors that can reduce retrieval error by adopting principal component analysis.

• Journal of the Korean Society for Library and Information Science
• /
• v.25
• /
• pp.233-264
• /
• 1993

The authorized form is called the heading must be unique and consistent. Without both uniqueness and cosistency, retrieval from the bibliographic database will not be optimal and in some cases may even be impossible. But the authority control is extremely expensive, because it is labour-intensive and dependent on professional investigation and judgement. In fact, it is by far the most expensive function in all of bibliographic control. The processes used to determine the form of access points. maintain. use. and evaluate very accurate authority records reduce the efficiency to generate or merge bibliographic items without modification from any national level bibliographic utilities as well as individual library. In this paper non-authority control system was suggested to solve the disadvantages of authority work. The apparent advantages of the non-authority control system are it is easy to determine the heading, input the bibliographic data. integrate the access points into an existing file, and generate and merge bibliographic data without modification. In addition, non-authority control system can be transmitted into online information retrieval system conducted with a mixture of controlled vocabularies and natural language.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.1-13
• /
• 2005

In distributed replicating server model, providing replicated services is able to improve the performance of providing a service and efficiency for several clients. And, the composition of the server selection algorithm is efficiently able to decrease the retrieval time for replicated data. In this paper, we define the system model that selects and connects the replicated server that provides optimal service using server-side downstream measurement and proposes an applicable algorithm.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1357-1366
• /
• 2004

As the importance or XML is increasing to manage information and exchange data efficiently in the web, there are on going works about structural integration and retrieval. The XML. document with the defined structure can retrieve the structure through the DTD or XML schema, but the existing method can't apply to XML. documents which haven't the structure information. Therefore. in this paper we propose a new clus-tering technique at a basic research which make it possible to retrieve structure fast about the XML documents that haven't the structure information. We first estract the feature of frequent structure from each XML document. And we cluster based on the similar structure by con-sidering the frequent structure as representative structure of the XML document, which makes it possible to retrieve the XML document raster than dealing with the whole documents that have different structure. And also we perform the structure retrieval about XML documents based on the clusters which is the group of similar structure. Moreover, we show efficiency of proposed method to describe how to apply the structure retrieval as well as to display the example of application result.