• Journal of the Korean Society for information Management
• /
• v.25 no.2
• /
• pp.25-48
• /
• 2008

The purpose of this study is to suggest retrieval interfaces for Korean paintings which support users to retrieve specific digitalized images of them through various access points and to widely browse based on unique features Korean paintings. The study, first, develops a set of descriptive elements suitable for Korean Paintings. Twenty-six core elements and one hundred seventy-two attributes are selected as descriptive items for Korean paintings based on the opinion of 8 experts. Then, to gam realistic evidence of what descriptive elements of image serve users as access points, it is investigated which elements are used as retrieval access points among 26 core elements by 300 peered users who are consisted with two groups such as common users and domain specialists. The study, in final, designs two(general and advanced) types of search interfaces and display interfaces based on the most popular top 15 descriptive elements. This access-enhanced platform which enables user-oriented searches will satisfy users in image retrieving.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.50-59
• /
• 2007

This paper describes a question analysis and expansion based on semantics for on efficient information retrieval. Results of all information retrieval systems include many non-relevant documents because the index cannot naturally reflect the contents of documents and because queries used in information retrieval systems cannot represent enough information in user's question. To solve this problem, we analyze user's question semantically, determine the answer type, and extract semantic features. And then we expand user's question using them and syntactic structures which are used to represent the answer. Our similarity is to rank documents which include expanded queries in high position. Especially, we found that an efficient document retrieval is possible by a question analysis and expansion based on semantics on natural language questions which are comparatively short but fully expressing the information demand of users.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.703-712
• /
• 2003

With the explosive growth n the numbers and sizes of imaging technologies, Content-Based Image Retrieval (CBIR) has been attacked the interests of researchers in the fields of digital libraries, image processing, and database systems. In general, in the case of query-by-image, in user has to select an image from database to query, even though it is not his completely desired one. However, since query-by-sketch approach draws a query shape according to the user´s desire it can provide more high-level searching interface to the user compared to the query-b-image. As a result, query-by-sketch has been widely used. In this paper, we propose a Java-based image retrieval system that consists of sketch query and image classification. We use two features such as color histogram and Haar wavelets coefficients to search similar images. Then the Leave-One-Out method is used to classify database images. The categories of classification are photo & painting, city & nature, and sub-classification of nature image. By using the sketch query and image classification, w can offer convenient image retrieval interface to user and we can also reduce the searching time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.5
• /
• pp.1-11
• /
• 2007

As the availability of an image information has been significantly increasing, necessity of system that can manage an image information is increasing. Accordingly, we proposed the region-based content retrieval(CBIR) algorithm based on an efficient combination of an image segmentation, an image texture, a color feature and an image's shape and position information. As a color feature, a HSI color histogram is chosen which is known to measure spatial of colors well. We used active contour and CWT(complex wavelet transform) to perform an image segmentation and extracting an image texture. And shape and position information are obtained using Hu invariant moments in the luminance of HSI model. For efficient similarity computation, the extracted features(color histogram, Hu invariant moments, and complex wavelet transform) are combined and then precision and recall are measured. As a experimental result using DB that was supported by www.freefoto.com. the proposed image retrieval engine have 94.8% precision, 82.7% recall and can apply successfully image retrieval system.

• The Journal of Society for e-Business Studies
• /
• v.13 no.2
• /
• pp.213-223
• /
• 2008

The efficient discovery of services from a large scale collection of services has become an important issue[7, 24]. We studied a syntactic method for Web service discovery, rather than a semantic method. We regarded a service discovery as a retrieval problem on the proprietary XML formats, which were service descriptions in a registry DB. We modeled services and queries as probabilistic values and devised similarity-based retrieval techniques. The benefits of our way are follows. First, our system supports ranked service retrieval by keyword search. Second, we considers both of UDDI data and WSDL definitions of services amid query evaluation time. Last, our technique can be easily implemented on the off-theshelf DBMS and also utilize good features of DBMS maintenance.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.27-34
• /
• 1998

In this paper we present a method for automatic motion vector and brightness based video indexing and retrieval. We extract a representational frame from each shot and compute some motion vector and brightness based features. For each R-frame we compute the optical flow field; motion vector features are then derived from this flow field, BMA(block matching algorithm) is used to find motion vectors and Brightness features are related to the cut detection of method brightness histogram. A video database provided contents based access to video. This is achieved by organizing or indexing video data based on some set of features. In this paper the index of features is based on a B+ search tree. It consists of internal and leaf nodes stores in a direct access a storage device. This paper defines the problem of video indexing based on video data models.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.99-108
• /
• 2008

This paper proposes an image retrieval system which integrates metadata, contents, and emotions in textile images. First, the proposed system searches images using metadata. Among searched images, the system retrieves similar images based on color histogram, color sketch, and emotion histogram. To extract emotion features, this paper uses emotion colors which was proposed on 160 emotion words by H. Nagumo. To enhance the user's convenience, the proposed textile image retrieval system provides additional functions as like enlarging an image, viewing color histogram, viewing color sketch, and viewing repeated patterns.

• Journal of Broadcast Engineering
• /
• v.23 no.3
• /
• pp.403-408
• /
• 2018

Generally, a large data set is required for learning of deep learning. However, since it is not easy to create large data sets, there are a lot of techniques that make small data sets larger through data expansion such as rotation, flipping, and filtering. However, these simple techniques have limitation on extendibility because they are difficult to escape from the features already possessed. In order to solve this problem, we propose a method to acquire new image data by using existing data. This is done by retrieving and acquiring similar images using existing image data as a query of the content-based image retrieval (CBIR). Finally, we compare the performance of the base model with the model using CBIR.

• The KIPS Transactions:PartB
• /
• v.12B no.1 s.97
• /
• pp.31-38
• /
• 2005

This paper proposes an object-based image retrieval scheme using color adjacency and clustering method. Color adjacency features in boundary regions are utilized to extract candidate blocks of interest from image database and a clustering method is used to extract the regions of interest(ROI) from candidate blocks of interest. To measure the similarity between the query and database images, the histogram intersection technique is used. The color pair information used in the proposed method is robust against translation, rotation, and scaling. Consequently, experimental results have shown that the proposed scheme is superior to existing methods in terms of ANMRR.