• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.117-123
• /
• 2006

Recently with the development of 3D modeling and digitizing tools, more and more models have been created, which leads to the necessity of the technique of 3D mode retrieval system. In this paper we investigate a new method for 3D model retrieval based on orthogonal projections. We assume that 3D models are composed of trigonal meshes. Algorithms process first by a normalization step in which the 3D models are transformed into the canonical coordinates. Then each model is orthogonally projected onto six surfaces of the projected cube which contains it. A following step is feature extraction of the projected images which is done by Moment Invariants and Polar Radius Fourier Transform. The feature vector of each 3D model is composed of the features extracted from projected images with different weights. Our System validates that this means can distinguish 3D models effectively. Experiments show that our method performs quit well.

• Smart Media Journal
• /
• v.2 no.3
• /
• pp.17-22
• /
• 2013

The growth of the propagated NFC provides the various services with respect to internet applications, which it can be predicted from the simple internet services to the privated services. This paper proposes the clustering of information retrieval system model using NFC tag of access information for utilizing the similar information of the tag. The proposed model can search the similar information of the tag using the access information of NFC tag. In addition, it can cluster the similar retrieval information into topic cluster for utilizaing users.

• Journal of the Korean Society for information Management
• /
• v.16 no.3
• /
• pp.49-63
• /
• 1999

The purpose of this study is to investigate whether the terms in queries are distributed according to the 2-Poisson model in the documents represented by abstract/title or full-text. In this study, retrieval experiments using Binary independence and 2-Poisson independence model, which are based on the probabilistic theory, were conducted to see if the 2-Poisson distribution of the query terms has an influence on the retrieval effectiveness, particularly of full-text information retrieval system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.2
• /
• pp.169-175
• /
• 2001

Most of studies on automated storage/retrieval (AS/R) system assumed that storage capacity is given, although it is a very important decision variable in the design phase. We propose a simple algorithm to estimate the required storage capacity, i.e., number of aisles and number of openings in vertical and horizontal directions in each aisle, of an AS/R system under stochastic demand, in which storage requests occur endogenously and exogenously while the retrieval requests occur endogenously from the machines. Two design criteria, maximum permissible overflow probability and maximum allowable storage/retrieval (S/R) machine utilization, are used to compute the storage capacity. This model can be effectively used in the design phase of new AS/R systems.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.95-104
• /
• 2009

This paper proposes the noise robust algorithm to detect the starting point of music. Detection of starting point of music is necessary to solve computational-waste problem and retrieval-comparison problem with inconsistent input data in music content based retrieval system. In particular, such detection is even more necessary in time sequential retrieval method that compares data in the sequential order of time in contents based music retrieval system. Whereas it has the long point that the retrieval is fast since it executes simple comparison in the order of time, time sequential retrieval method has the short point that data starting time to be compared should be the same. However, digitalized music cannot guarantee the equity of starting time by bit rate conversion. Therefore, this paper ensured that recognition rate shall not decrease even while executing high speed retrieval by applying time sequential retrieval method through detection of music starting point in the pre-processing stage of retrieval. Starting point detection used minimum wave model that can detect effective sound, and for strength against noise, the noises existing in mute sound were swapped. The proposed algorithm was confirmed to produce about 38% more excellent performance than the results to which starting point detection was not applied, and was verified for the strength against noise.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.209-223
• /
• 2000

As the importance and utilization of multimedia data increases, it becomes necessary to represent and manage multimedia data within database systems. In this paper, we designed and implemented an image retrieval system which support efficient management and intelligent retrieval of image data using concept hierarchy and data mining techniques. We stored the image information intelligently in databases using concept hierarchy. To support intelligent retrievals and efficient web services, our system automatically extracts and stores the user information, the user's query information, and the feature data of images. The proposed system integrates user metadata and image metadata to support various retrieval methods on image data.

• Journal of Korea Multimedia Society
• /
• v.11 no.8
• /
• pp.1169-1178
• /
• 2008

Most of information in Web2.0 is constructed by users and can be classified by tags which are also constructed and added by users. However, as we known, referring by the related works such as automatic tagging techniques and tag cloud's construction techniques, the research to be classified information and resources by tags effectively is to be given users which is still up to the mark. In this paper, we propose and implement a clustering system that does mapping each other according to relationships of the resource's tags collected from Web and then makes the mapping result into clusters to retrieve images. Tn addition, we analyze our system's efficiency by comparing our proposed system's image retrieval result with the image retrieval results searched by Flickr website.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.58-63
• /
• 2015

In this work, we present a novel fountain code-based hybrid P2P storage system that combines cloud storage with P2P storage. The proposed hybrid storage system minimizes data transmission time while guaranteeing high data retrieval and data privacy. In order to guarantee data privacy and storage efficiency, the user transmits encoded data after performing fountain code-based encoding. Also, the proposed algorithm guarantees the user's data retrieval by storing the data while considering each peer's survival probability. The simulation results show that the proposed algorithm enables fast completion of the upload transmission while satisfying the required data retrieval and supporting the privacy of user data under the system parameters.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.570-570
• /
• 1992

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.237-245
• /
• 2001

Automated essay grading has been proposed for over thirty years. Only recently have practical implementations been constructed and tested. This paper investigated the role of the nearest-neighbour algorithm within the information retrieval as a way of grading the essay automatically called Automated Essay Grading System. It intended to offer teachers an individualized assistance in grading the student\`s essay. The system involved several processes, which are the indexing, the structuring of the model answer and the grade processing. The indexing process comprised the document indexing and query processing which are mainly used for representing the documents and the query. Structuring the model answer is actually preparing the marking scheme and the grade processing is the process of assessing the essay. To test the effectiveness of the developed algorithms, the algorithms are tested against the History text in Malay. The result showed that th information retrieval and the nearest-neighbour algorithm are practical combination that offer acceptable performance for grading the essay.