• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.50-54
• /
• 1999

This paper is proposed to image retrieval system using color and shape feature. Color feature used to four maximum value feature among the maximum value extracted from local color distribution histogram. The preprocessing of shape feature consist of edge extraction and weight central point extraction and angular sampling. The sum of distance from weight central point to contour and variation and max/min used to shape feature. The similarity is estimated compare feature of query image with the feature of images in database and the candidate of image is retrieved in order of similarity. We evaluate the effectiveness of shape feature and color feature in experiment used to two hundred of the closed image. The Recall and the Precision is each 0.72 and 0.53 in the result of average experiment. So the proposed method is presented useful method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.113-120
• /
• 2004

In this paper, we propose an efficient feature extraction and image retrieval algorithm for content-based retrieval method. First, we extract the object using Gaussian edge detector for input image which is key frames of MPEG video and extract the object features that are location feature, distributed dimension feature and invariant moments feature. Next, we extract the characteristic color feature using the proposed HAQ(Histogram Analysis md Quantization) algorithm. Finally, we implement an retrieval of four features in sequence with the proposed matching method for query image which is a shot frame except the key frames of MPEG video. The purpose of this paper is to propose the novel content-based image retrieval algerian which retrieves the key frame in the shot boundary of MPEG video belonging to the scene requested by user. The experimental results show an efficient retrieval for 836 sample images in 10 music videos using the proposed algorithm.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1474-1479
• /
• 2015

With mobile devices showing marked improvement in performance in the age of the Internet of Things (IoT), there is demand for rapid processing of the extensive amount of multimedia big data. However, because research on image searching is focused mainly on increasing accuracy despite environmental changes, the development of fast processing of high-resolution multimedia data queries is slow and inefficient. Hence, we suggest a new distributed image search algorithm that ensures both high accuracy and rapid response by using feature extraction of distributed images based on MapReduce, and solves the problem of memory scalability based on BIRCH indexing. In addition, we conducted an experiment on the accuracy, processing time, and scalability of this algorithm to confirm its excellent performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.368-391
• /
• 2018

Face recognition (FR) with a single sample per person (SSPP) is common in real-world face recognition applications. In this scenario, it is hard to predict intra-class variations of query samples by gallery samples due to the lack of sufficient training samples. Inspired by the fact that similar faces have similar intra-class variations, we propose a virtual sample generating algorithm called k nearest neighbors based virtual sample generating (kNNVSG) to enrich intra-class variation information for training samples. Furthermore, in order to use the intra-class variation information of the virtual samples generated by kNNVSG algorithm, we propose image set based multimanifold discriminant learning (ISMMDL) algorithm. For ISMMDL algorithm, it learns a projection matrix for each manifold modeled by the local patches of the images of each class, which aims to minimize the margins of intra-manifold and maximize the margins of inter-manifold simultaneously in low-dimensional feature space. Finally, by comprehensively using kNNVSG and ISMMDL algorithms, we propose k nearest neighbor virtual image set based multimanifold discriminant learning (kNNMMDL) approach for single sample face recognition (SSFR) tasks. Experimental results on AR, Multi-PIE and LFW face datasets demonstrate that our approach has promising abilities for SSFR with expression, illumination and disguise variations.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1057-1066
• /
• 2013

Personal verification using finger-knuckle-print(FKP) uses lines and creases at the finger-knuckle area, so the orientation information of texture is an important feature. In this paper, we propose an effective FKP verification method which extracts keypoints using SIFT algorithm and matches the keypoints by vector similarity. The vector is defined as a direction vector which connects a keypoint extracted from a query image and a corresponding keypoint extracted from a reference image. Since the direction vector is created by a pair of local keypoints, the direction vector itself represents only a local feature. However, it has an advantage of expanding a local feature to a global feature by comparing the vector similarity among vectors in two images. The experimental results show that the proposed method is superior to the previous methods based on orientation codes.

• Journal of Digital Contents Society
• /
• v.19 no.8
• /
• pp.1555-1564
• /
• 2018

In recent years, In recent years, research on geo-tagged image contents has defined a view frustum based on filming location and direction data and has studied indexes and various query search techniques for efficient search. The existing view frustum model has a limit of using the static visible distance and provides a simple service that displays the huge image contents on the digital map. We show a method to acquire filming location and attitude data and propose a view frustum model that can change the visible distance using geospatial object data. In addition, we describe the augmented reality service that combines the image matching technique so that it can be mapped in the scene where the image contents are captured.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.434-441
• /
• 2001

We present an image retrieval method for improving retrieval performance by the effective fusion of spatial histogram and wavelet moments. In this method, the similarity for spatial histograms and the similarity for wavelet moment are effectively fused in the computation of the similarity between a query image and DB image. That is, the wavelet moments feature represented in multi-resolution and the spatial histogram feature robust to translation and rotation are used to improve retrieval performance. In order to evaluate the performance of the proposed method, we use Brodatz texture DB, MPEG-7 T1 DB, and Corel Draw Photo DB. Experimental results show that the proposed method yields 5.3% and 13.8% better Performances for Brodatz DB, and 15.5% and 3.2% better Performances for Corel Draw Photo DB over the histogram method and the wavelet moment method, respectively.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.464-475
• /
• 2003

few sample objects and compressed histogram information of image databases. The histogram information is used to estimate the selectivity of spherical range queries and a small number of sample objects is used to compensate the selectivity error due to the difference of the similarity measures between meta server and local image databases. An extensive experiment on a large number of image data demonstrates that our proposed method performs well in the distributed heterogeneous environment.

• Convergence Security Journal
• /
• v.18 no.4
• /
• pp.19-25
• /
• 2018

In this paper, we propose an user-centered integrated lost-goods management system through a ranking system based on weight and a hierarchical image classification system based on Deep Learning. The proposed system consists of a hierarchical image classification system that automatically classifies images through deep learning, and a ranking system modules that listing the registered lost property information on the system in order of weight for the convenience of the query process.In the process of registration, various information such as category classification, brand, and related tags are automatically recognized by only one photograph, thereby minimizing the hassle of users in the registration process. And through the ranking systems, it has increased the efficiency of searching for lost items by exposing users frequently visited lost items on top. As a result of the experiment, the proposed system allows users to use the system easily and conveniently.

• Journal of Intelligence and Information Systems
• /
• v.15 no.2
• /
• pp.49-59
• /
• 2009

Contents-based image retrieval methods are in general more objective and effective than text-based image retrieval algorithms since they use color and texture in search and avoid annotating all images for search. SIM(Self-organizing Image browsing Map) is one of contents-based image retrieval algorithms that uses only browsable mapping results obtained by SOM(Self Organizing Map). However, SOM may have an error in selecting the right BMU in learning phase if there are similar nodes with distorted color information due to the intensity of light or objects' movements in the image. Such images may be mapped into other grouping nodes thus the search rate could be decreased by this effect. In this paper, we propose an improved SIM that uses HSV color model in extracting image features with color quantization. In order to avoid unexpected learning error mentioned above, our SOM consists of two layers. In learning phase, SOM layer 1 has the color feature vectors as input. After learning SOM Layer 1, the connection weights of this layer become the input of SOM Layer 2 and re-learning occurs. With this multi-layered SOM learning, we can avoid mapping errors among similar nodes of different color information. In search, we put the query image vector into SOM layer 2 and select nodes of SOM layer 1 that connects with chosen BMU of SOM layer 2. In experiment, we verified that the proposed SIM was better than the original SIM and avoid mapping error effectively.