• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.1-7
• /
• 2002

In this paper, when users choose a query image, we implemented a content-based image retrieval system that users can simply choose and extract a object region of query wanted with not only a whole image but various objects in it. Histogram is obtained by improved HSV transformations from query image and then candidate images are retrieved rapidly by a 1st similarity measure with histogram intersection using representative colors of query image. And finally retrieved images are extracted since 2nd similarity measure with banded autocorrelogram is performed so that recall and precision are improved by combining two retrieval methods that can make up for respective weak points. Moreover images in the database are indexed automatically within feature library that makes possible to retrieve images rapidly.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.115-122
• /
• 2005

The sub-mage matching problem in which one image contains some part of the other image, has been mostly investigated on natural images. In this paper, we propose two sub-image matching techniques: mesh-based method and correlation-based method, that are efficiently used to match text images. Mesh-based method consists of two stages, box alignment and similarity measurement by extracting the mesh feature from the two images. Correlation-based method determines the similarity using the correlation of the two images based on FFT function. We have applied the two methods to the text verification in a postal automation system and observed that the accuracy of correlation-based method is $92.7\%$ while that of mesh-based method is $90.1\%$.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.255-264
• /
• 2008

This paper proposes a novel method using K-means and Non-negative matrix factorization (NMF) for topic -based multi-document summarization. NMF decomposes weighted term by sentence matrix into two sparse non-negative matrices: semantic feature matrix and semantic variable matrix. Obtained semantic features are comprehensible intuitively. Weighted similarity between topic and semantic features can prevent meaningless sentences that are similar to a topic from being selected. K-means clustering removes noises from sentences so that biased semantics of documents are not reflected to summaries. Besides, coherence of document summaries can be enhanced by arranging selected sentences in the order of their ranks. The experimental results show that the proposed method achieves better performance than other methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.705-708
• /
• 2010

An eigen color co-occurrence approach is proposed that exploits the correlation between color channels to identify the degree of image similarity. This method is based on traditional co-occurrence matrix method and histogram equalization. On the purpose of feature extraction, eigen color co-occurrence matrices are computed for extracting the statistical relationships embedded in color images by applying Principal Component Analysis (PCA) on a set of color co-occurrence matrices, which are computed on the histogram equalized images. That eigen space is created with a set of orthogonal axes to gain the essential structures of color co-occurrence matrices, which is used to identify the degree of similarity to classify an input image to be tested for various purposes. In this paper RGB, Gaussian color space are compared with grayscale image in terms of PCA eigen features embedded in histogram equalized co-occurrence features. The experimental results are presented.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.8
• /
• pp.385-392
• /
• 2016

Market analysis for a business plain is required for the success in the modern world. Most important part in this analysis is pedestrian traffic counting. A traditional way for this is counting it in person. However, it causes high labor costs and mistakes. This paper proposes an automatic algorithm to measure the pedestrian traffic count using images with webcam. The proposed algorithm is composed of two parts: pedestrian area detection and movement tracking. In pedestrian area detection, moving blobs are extracted and pedestrian areas are detected using HoG features and Adaboost algorithm. In movement tracking, multi-level matching and false positive removal are applied to track pedestrian areas and count the pedestrian traffic. Multi-level matching is composed of 3 steps: (1) the similarity calculation between HoG area, (2) the similarity calculation of the estimated position with Kalman filtering, and (3) the similarity calculation of moving blobs in the pedestrian area detection. False positive removal is to remove invalid pedestrian area. To analyze the performance of the proposed algorithm, a comparison is performed with the previous human area detection and tracking algorithm. The proposed algorithm achieves 83.6% accuracy in the pedestrian traffic counting, which is better than the previous algorithm over 11%.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.293-297
• /
• 2007

This thesis suggests a new algorithm to detects multiple moving objects using a CMODE(Correct Multiple Object DEtection) method in the color images acquired in real-time and to track the interested pedestrian using motion and hue information. The multiple objects are detected, and then shaking trees or moving cars are removed using structural characteristics and shape information of the man , the interested pedestrian can be detected, The first similarity judgment for tracking an interested pedestrian is to use the distance between the previous interested pedestrian's centroid and the present pedestrian's centroid. For the area where the first similarity is detected, three feature points are calculated using k-mean algorithm, and the second similarity is judged and tracked using the average hue value for the $3{\times}3$ area of each feature point. The zooming of camera is adjusted to track an interested pedestrian at a long distance easily and the FOV(Field of View) of camera is adjusted in case the pedestrian is not situated in the fixed range of the screen. As a experiment results, comparing the suggested CMODE method with the labeling method, an average approach rate is one fourth of labeling method, and an average detecting time is faster three times than labeling method. Even in a complex background, such as the areas where trees are shaking or cars are moving, or the area of shadows, interested pedestrian detection is showed a high detection rate of average 96.5%. The tracking of an interested pedestrian is showed high tracking rate of average 95% using the information of situation and hue, and interested pedestrian can be tracked successively through a camera FOV and zooming adjustment.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.73-83
• /
• 2009

In this paper we propose an object similarity matching method based on shape characteristics of an object in an image. The proposed method extracts edge points from edges of objects and generates a log polar histogram with respect to each edge point to represent the relative placement of extracted points. It performs the matching in such a way that it compares polar histograms of two edge points sequentially along with edges of objects, and uses a well-known k-NN(nearest neighbor) approach to retrieve similar objects from a database. To verify the proposed method, we've compared it to an existing Shape-Context method. Experimental results reveal that our method is more accurate in object matching than the existing method, showing that when k=5, the precision of our method is 0.75-0.90 while that of the existing one is 0.37, and when k=10, the precision of our method is 0.61-0.80 while that of the existing one is 0.31. In the experiment of rotational transformation, our method is also more robust compared to the existing one, showing that the precision of our method is 0.69 while that of the existing one is 0.30.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.15 no.5
• /
• pp.64-74
• /
• 2019

Although a non-rigid registration has high demands in clinical practice, it has a high computational complexity and it is very difficult for ensuring the accuracy and robustness of registration. This study proposes a method of applying a non-rigid registration to 3D magnetic resonance images of brain in an unsupervised learning environment by using a deep-learning network. A feature vector between two images is produced through the network by receiving both images from two different patients as inputs and it transforms the target image to match the source image by creating a displacement vector field. The network is designed based on a U-Net shape so that feature vectors that consider all global and local differences between two images can be constructed when performing the registration. As a regularization term is added to a loss function, a transformation result similar to that of a real brain movement can be obtained after the application of trilinear interpolation. This method enables a non-rigid registration with a single-pass deformation by only receiving two arbitrary images as inputs through an unsupervised learning. Therefore, it can perform faster than other non-learning-based registration methods that require iterative optimization processes. Our experiment was performed with 3D magnetic resonance images of 50 human brains, and the measurement result of the dice similarity coefficient confirmed an approximately 16% similarity improvement by using our method after the registration. It also showed a similar performance compared with the non-learning-based method, with about 10,000 times speed increase. The proposed method can be used for non-rigid registration of various kinds of medical image data.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.938-943
• /
• 2003

In this paper, we Propose a method using the Tikhonov-Miller process to improve the robustness of watermarking under various attacks. A visually recognizable pattern watermark is embedded in the LH2, HL2 and HH2 subband of wavelet transformed domain using threshold and besides watermark is embeded by utilizing HVS(Human Visual System) feature. The pattern watermark was interlaced after random Permutation for a security and an extraction rate. To demonstrate the improvement of robustness and similarity of the proposed method, we applied some basic algorithm of image processing such as scaling, filtering, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method was able to embed robust watermark invisibility and extract with an excellent normalized correlation of watermark under various attacks.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.167-174
• /
• 2009

Music evokes human emotions or creates music moods through various low-level musical features. Typical music clip consists of one or more moods and this can be used as an important criteria for determining the similarity between music clips. In this paper, we propose a new music retrieval scheme based on the mood change patterns of music clips. For this, we first divide music clips into segments based on low level musical features. Then, we apply K-means clustering algorithm for grouping them into clusters with similar features. By assigning a unique mood symbol for each cluster, we can represent each music clip by a sequence of mood symbols. Finally, to estimate the similarity of music clips, we measure the similarity of their musical mood sequence using the Longest Common Subsequence (LCS) algorithm. To evaluate the performance of our scheme, we carried out various experiments and measured the user evaluation. We report some of the results.