• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.141-155
• /
• 2005

It is very important that sellers provide reasonable reserve prices for auction items in internet auction systems. Recently, an agent has been proposed to generate reserve prices automatically based on the case similarity of information retrieval theory and the moving average of time series analysis. However, one problem of the previous approaches is that the recent trend of auction prices is not well reflected on the generated reserve prices, because it simply provides the bid price of the most similar item or an average price of some similar items using the past auction data. In this paper. in order to overcome the problem. we propose a method that generates reserve prices based on the moving average. the exponential smoothing, and the least square of time series analysis. Through performance experiments. we show that the successful bid rate of the new method can be increased by preventing sellers from making unreasonable reserve prices compared with the previous methods.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.45-54
• /
• 2009

In this paper we propose a new approach that recognizes the similar categories by weighting distinctive features. The approach is based on the PLSA that is one of the effective methods for the object categorization. PLSA is introduced from the information retrieval of text domain. PLSA, unsupervised method, shows impressive performance of category recognition. However, it shows relatively low performance for the similar categories which have the analog distribution of the features. In this paper, we consider the effective object categorization for the similar categories by weighting the mainly distinctive features. We present that the proposed algorithm, weighted PLSA, recognizes similar categories. Our method shows better results than the standard PLSA.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.233-236
• /
• 2003

In this paper, we propose a method to search the evidence such as a knife found in the crime scene based on GHT from an image database Such objects like knives are simitar in shape. The proposed method utilizes the small shape differences among objects as much as possible to distinguish an object from similar shaped objects. It consists of the GHT based candidate generation and top-down candidate verification. For the fast generation of the candidate 1ist, the GHT operation is performed un the down sampled edge list. The test results show that it can retrieve the correct object even with a pan of object in reasonable time.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.259-262
• /
• 2002

We propose a new algorithm to detect shot change, which is necessary in retrieval of video data. In order to solve the problems of abrupt brightness change and similar brightness between frames in the typical shot change methods, we propose the hi-polarity histogram method which takes into account the distribution and magnitude of brightness changes in consecutive frames. We evaluate our algorithm with compressed and uncompressed video data and demonstrate its improved performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.3
• /
• pp.33-41
• /
• 2007

Owing to the development of multimedia and communication technologies, multimedia data become a common feature of the information systems and are on the increase. This has led to the need of 3D shape retrieval systems that, given a query object, retrieve similar 3D objects. Therefore, shape descriptor required to describe a 3D object effectively and efficiently. In this paper, a new descriptor for 3D model retrieval based on shape information is proposed. The proposed descriptor utilizes the curvedness together with the shape index that provides local geometry information. The existing 3D Shape Spectrum Descriptor (3D SSD), which is defined as the histogram of shape index values, represents the characteristics of local shapes of the 3D surface. However, it does not properly represent the local shape characteristics, because many points with different curvedness may have the same shape index value. Therefore, we add a new feature that represents the degree of curvedness, thereby improving the discriminating power of the shape descriptor. We evaluate the performance of the proposed method, compared with the previous method. The experimental results have shown that the performance of retrieval has been improved by 23.6%.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.117-128
• /
• 2011

In this paper, we present a novel approach for contents-based medication image retrieval from a medication image database using the shape classification and color information of the medication. One major problem in developing a contents-based drug image retrieval system is there are too many similar images in shape and color and it makes difficult to identify any specific medication by a single feature of the drug image. To resolve such difficulty in identifying images, we propose a hybrid approach to retrieve a medication image based on shape and color features of the medication. In the first phase of the proposed method we classify the medications by shape of the images. In the second phase, we identify them by color matching between a query image and preclassified images in the first phase. For the shape classification, the shape signature, which is unique shape descriptor of the medication, is extracted from the boundary of the medication. Once images are classified by the shape signature, Hue and Saturation(HS) color model is used to retrieve a most similarly matched medication image from the classified database images with the query image. The proposed system is designed and developed especially for specific population- seniors to browse medication images by using visual information of the medication in a feasible fashion. The experiment shows the proposed automatic image retrieval system is reliable and convenient to identify the medication images.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.775-782
• /
• 2001

Until recently Web retrieval engine has presented a demanded document to users according to the amount and the frequency of inquired key words in each document under the assumption that the more key words a document has, the more accessible it is. This method of searching doesn't matter to a normal document such as HTML Web data in which structural information is not involved. However, Web data realized in XML contains structural information and modeling of graphic forms is also available. Therefore, in the case of XML, this method leads to no less trouble since it depends only on the frequency of key words. We consider that this problem can be resolved by way of inquiry which is similar to SQL. This form of inquiry enables us to snatch an exact data we want in a quick and clear way with a full advantage of structural quality of XML, overcoming the shortcomings of frequency-based engine. In this paper, We aim to design a model of information retrieval system of XML data using XML DOM and consider its algorithm related with it.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1331-1341
• /
• 1999

This paper propose WebDBs(Web Database system) which retrieves information registered in web using query language similar to SQL. This proposed system automatically extracts information which is needed to retrieve from HTML documents dispersed in web. Also, it has an ability to process SQL based query intended for the extracted information. Web database system takes the most of query processing time for capturing documents going through network line. And so, the information previously retrieved is reused in similar applications after stored in cache in perceiving that most of the web retrieval depends on web locality. In this case, we propose cache mechanism adapted to user applications by storing cached information associated with retrieved query. And, Web search engine is implemented based on these concepts.

• Journal of the Korean Society for information Management
• /
• v.14 no.1
• /
• pp.77-105
• /
• 1997

The study confirmed that the methods for expanding headings and combined structures among the headings, subdivisions, qualifiers and inverted terms were diverse, and that the headings used for similar purposes do not have identical structural forms. It is also found that the standard symbols representing generic relationship in theasurus, which are introduced in the list of subject headings, do not show precisely the hiearchical relationship of phrase headings. MeSH in pre-coordinated system will be available for retrieval in the computer environment because it can make a link between headings and subdivisions in searching stage. The changes in retrieval circumstances and the seeking behaviors of the users demand that a new structure of subject headings be developed. It was proposed that the modification of the structure in the Hangul subject headings be essential.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1819-1826
• /
• 2010

This paper proposes the image segmentation algorithm to extracts a fish object from a fish image for fish image retrieval. The conventional algorithm using gray level similarity causes wrong image segmentation result in the boundary area of the object and the background with similar gray level. The proposed algorithm uses the reinforced edge and the adaptive block-based threshold for the boundary area with weak contrast and the virtual object to improve the eroded or disconnected object in the boundary area without contrast. The simulation results show that the percentage of extracting the visual-fine object from the test images is under 90% in the conventional algorithm while it is 97.7% in the proposed algorithms.