• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.869-872
• /
• 2000

Although many content-based image retrieval systems using shape feature have tried to cover rotation-, position- and scale-invariance between images, there have been problems to cover three kinds of variance at the same time. In this paper, we introduce new approach to extract shape feature from image using MBR(Minimum Bounding Rectangle). The proposed method scans image for extracting MBR information and, based on MBR information, compute contour information that consists of 16 points. The extracted information is converted to specific values by normalization and rotation. The proposed method can cover three kinds of invariance at the same time. We implemented our method and carried out experiments. We constructed R*_tree indexing structure, perform k-nearest neighbor search from query image, and demonstrate the capability and usefulness of our method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.247-252
• /
• 2004

This paper proposes a matching algorithm using Voronoi diagram for rotation and translation invariant fingerprint identification. The proposed algorithm extracts geometrical structures that are derived from Voronoi diagram of a fingerprint image. Then two features, distances and angles are extracted from the geometrical structures and saved as indexing form for fingerprint matching. This matching algerian has a lower error rate than indexing based methods of old times.

• Speech Sciences
• /
• v.12 no.1
• /
• pp.135-142
• /
• 2005

An important aspect of video indexing is the ability to segment video into meaningful segments, i.e., content-based video segmentation. Since the audio signal in the sound track is synchronized with image sequences in the video program, a speech signal in the sound track can be used to segment video into meaningful segments. In this paper, we propose a new approach to content-based video segmentation. This approach uses closed caption to construct a recognition network for speech recognition. Accurate time information for video segmentation is then obtained from the speech recognition process. For the video segmentation experiment for TV news programs, we made 56 video summaries successfully from 57 TV news stories. It demonstrates that the proposed scheme is very promising for content-based video segmentation.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.3
• /
• pp.103-109
• /
• 2011

With the growing popularity of digital video applications, those areas of the efficient transmit, storage management, and search technology for video data are emerging as an important core technology. To be an effective video indexing system, users need to be able to find the video segments that they want. Unfortunately, video data is difficult to manage because of its unstructured data type and large volume with linear forms. This paper proposes a shot verification using visual rhythm and video retrieval system. The shot verification is designed to detect a segment from video easily and quickly, known as shot boundaries, just by changing the visual rhythm without playing the image. Therefore, this can decrease the false detected shots and generate the unidentified shots and key frames. The retrieval system is constructed in terms of visual descriptor from the list of MPEG-7. The effectiveness of the proposed shot verification process and video retrieval system is demonstrated.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.362-371
• /
• 2005

Similarity indexing and searching are well known to be difficult in high-dimensional applications such as multimedia databases. Especially, they become more difficult when multiple features have to be indexed together. In this paper, we propose a novel indexing method called the GB-index that is designed to efficiently handle complex similarity queries as well as relevance feedback in high-dimensional image databases. In order to provide the flexibility in controlling multiple features and query objects, the GB-index treats each dimension independently The efficiency of the GB-index is realized by specialized bitmap indexing that represents all objects in a database as a set of bitmaps. Main contributions of the GB-index are three-fold: (1) It provides a novel way to index high-dimensional data; (2) It efficiently handles complex similarity queries; and (3) Disjunctive queries driven by relevance feedback are efficiently treated. Empirical results demonstrate that the GB-index achieves great speedups over the sequential scan and the VA-file.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.112-114
• /
• 2011

On multimedia databases, in order to realize the fast access method, indexing methods for the multidimension data space are used. However, since it is a premise to use the Euclid distance as the distance measure, this method lacks in flexibility. On the other hand, there are metric indexing methods which require only to satisfy distance axiom. Since metric indexing methods can also apply for distance measures other than the Euclid distance, these methods have high flexibility. This paper proposes an improved method of VP-tree which is one of the metric indexing methods. VP-tree follows the node which suits the search range from a route node at searching. And distances between a query and all objects linked from the leaf node which finally arrived are computed, and it investigates whether each object is contained in the search range. However, search speed will become slow if the number of distance calculations in a leaf node increases. Therefore, we paid attention to the candidates selection method using the triangular inequality in a leaf node. As the improved methods, we propose a method to use the nearest neighbor object point for the query as the datum point of the triangular inequality. It becomes possible to make the search range smaller and to cut down the number of times of distance calculation by these improved methods. From evaluation experiments using 10,000 image data, it was found that our proposed method could cut 5%~12% of search time of the traditional method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.333-337
• /
• 2002

A content-based image retrieval method using color, texture, and shape features is proposed in this paper. A region segmentation technique using PIM(Picture Information Measure) entropy is used for similarity indexing. For segmentation, a color image is first transformed to a gray image and it is divided into n$\times$n non-overlapping blocks. Entropy using PIM is obtained from each block. Adequate variance to perform good segmentation of images in the database is obtained heuristically. As variance increases up to some bound, objects within the image can be easily segmented from the background. Therefore, variance is a good indication for adequate image segmentation. For high variance image, the image is segmented into two regions-high and low entropy regions. In high entropy region, hue-saturation-intensity and canny edge histograms are used for image similarity calculation. For image having lower variance is well represented by global texture information. Experiments show that the proposed method displayed similar images at the average of 4th rank for top-10 retrieval case.

• 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 Korea Society of Industrial Information Systems
• /
• v.5 no.2
• /
• pp.9-15
• /
• 2000

In this paper, we proposed a content-based image retrieval method using color and object's complexity for indexing of image database. Generally, the retrieval methods using color feature can not sufficiently include the spatial information in the image. So they are reduced retrieval efficiency. Then we combined object's complexity which extracted from chain code and the conventional color feature. As a result, experiments shooed that the proposed method which considers the shape feature improved performance in conducting content-based search.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3025-3035
• /
• 1998

In this paper, we describe the design and implementationof COIRS COncept,based Image Retricval System). It differs from extant content-based image retrieval systems in that it enables users to query based on concepts- it allows users to get images concepmally relevant. A concept is basically an aggregation of promitive objects in an image. For such a cencept based image retrieval functionality. COIRS aglopts an image descriptor called triple and includes a triple thesaurus used for capturing concepts. There are four facilities in COIRS: a visual image indeses a triple thesaurus, an inverted fiel, and a user query interface. The visnal image indeser facilitates object laeling and the percification of positionof objects. It is an assistant tool designed to minimize manual work when indexing images. The thesarrus captires the concepts by analyzing triples, thereby extracting image semantics. The triples are then for formalating queries as well as indexing images. The user query interiare enables users to formulate...