• Journal of Korean Library and Information Science Society
• /
• v.34 no.1
• /
• pp.351-378
• /
• 2003

This study has been examined in information service in related aspect of its user. Also this subject is researching of information itself attribution and relationship with end user And, in information facilities of library and information center it has been studied how to develope satisfaction service for user, along with fur causing both theory and practical application. For this object it has been also reviewed theoretically through out 5 fields as below; 1) information need and using 2) information storage and retrieval 3) information property and value 4) bibliometrics and citation analysis 5) administration and management.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.74-83
• /
• 1996

In this paper, an effective color image retrieval algorithm is proposed based on the graph representation. Also we propose a color constancy algorithm to remove the effect of illumination change. Illumination condition of an image can be transformed to that of reference image using the proposed color constancy algorithm, so that the effect of dirrerent lighting is significantly alleviated. Then, we represent a color image as a graph with several nodes and edges in the histogram space, and finally two images are matched by compared two graphs representing them. The simulation results show that the proposed 3-step algorithm performs well for various conditions, including different lighting, translation, rotation, and scaling of the object in the image. In addition, the proposed algorithm is very fast compared to the geometry-based matching technique.

• Journal of Information Management
• /
• v.24 no.3
• /
• pp.31-56
• /
• 1993

In order to respond to the public needs to utilize the newspapers as high-valued information resources, the number of the commercially available news items which are transformed into a form of database has been remarkably increased by the introduction of CTS into the newspaper companies. As for the domestically available Japanese and foreign newspaper article database, explanations are given to the following items. 1) Characteristics of database, such as date of coverage, frequency updating, time-lag, news sources, search terms, available information, etc. 2) Matters to be noticed at the utilization. 3) Pattern of utilization depending on the object of the investigation, such as the investigation of company, market trend, etc. Since the newspaper article database will be available in a form of digitized information, making the combination with the inter-company LAN system possible, increased opportunities to use it in near future are expected.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1542-1552
• /
• 1996

This paper presents a design and implementation of an extended directory system in manage and provide an effective search operation of the DFR(Document Filing and Retrieval) Object's attributes. For this, the design and implementation of a configuration model for interworking between the DFR and directory systems, an association mechanisms between two application's operation, extended directory schema and extended DIT(Directory Information Tree) are described. In a distributed environment, the interworking between the DFR and directory system implemented by using QUIPU 8.0 of ISODE(ISO Development Environment) directory system is tested. based on the result of this paper, an extended model of the directory system is proposed for proving search operation of various application's objects.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.683-695
• /
• 1996

In this paper, we implemented the content-based image retrieval system that indexes and retrieves the images by acquiring contour information of images and by extracting lines from the object. For this purpose, we proposed the advanced line extraction algorithm called FSLHT(Flexible SLHT) which covers drawback of SLHT(Straight Line Hough Transform)andapplied aDP(Dynamic Programming)algorithm to getadesirable similarity ofimages by lines. We estimated the contour features as a key value of sampled region to compensate for the problem that image contours are heavily depend on the noise. When performing the Hough transform we calculated the directionality based on the perceptual organization and transformed according to this direction to overcome the problem of time consuming and discontinuity.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.3
• /
• pp.260-272
• /
• 2001

In this paper, we have designed a region-based image retrieval system, FRIP(Finding Region In the Pictures). This system includes a robust image segmentation scheme using color and texture direction and retrieval scheme based on features of each region. For image segmentation, by using a circular filter, we can protect the boundary of round object and merge stripes or spots of objects into body region. It also combines scaled and shifted color coordinate and texture direction. After image segmentation, in order to improve the storage management effectively and reduce the computation time, we extract compact features from each region and store as index. For user interface, by the user specified constraints such as color-care / don't care. scale-care / dont care, shape-care / dont care and location-care / dont care, the overal/ matching score is estimated and the top Ie nearest images are reported in the ascending order of the final score.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.779-788
• /
• 2002

There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.547-558
• /
• 2003

From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.34-43
• /
• 2010

Texture information plays an important role in object recognition and classification. To perform an accurate classification, the texture feature used in the classification must be highly discriminative. This paper presents a novel texture descriptor for texture-based image retrieval and its application in Computer-Aided Diagnosis (CAD) system for Emphysema classification. The texture descriptor is based on the combination of local surrounding neighborhood difference and centralized neighborhood difference and is named as Combined Neighborhood Difference (CND). The local differences of surrounding neighborhood difference and centralized neighborhood difference between pixels are compared and converted into binary codewords. Then binomial factor is assigned to the codewords in order to convert them into high discriminative unique values. The distribution of these unique values is computed and used as the texture feature vectors. The texture classification accuracies using Outex and Brodatz dataset show that CND achieves an average of 92.5%, whereas LBP, LND and Gabor filter achieve 89.3%, 90.7% and 83.6%, respectively. The implementations of CND in the computer-aided diagnosis of Emphysema is also presented in this paper.

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.263-272
• /
• 2007

This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.