• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.93-99
• /
• 2009

The color harmony in video was no way to know for giving pleasure. By identifying these color harmony, it gives order, clarity, similarity, contrast, etc. Therefore, to identify the color balance is very important. Color Harmony identify the color is whether the harmony by color harmony theory of Munsell, Ostwald, Firren, Moon & Spenser, Itten, Chevreul, and Judd etc. One of these methods, we identify color harmonies of 2 colors, 3 colors, 4 colors, 5 colors and 6 colors using Itten's color balance. Identification is using by Canny edge extraction, labeling and clustering, and color extraction and harmony etc. By identifying this color harmonies, we have laid the foundation of emotional database construction and emotional recognition.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.329-341
• /
• 2014

Kernel-based mean-shift object tracking has gained more interests nowadays, with the aid of its feasibility of reliable real-time implementation of object tracking. This algorithm calculates the best mean-shift vector based on the color histogram similarity between target model and target candidate models, where the color histograms are usually produced after uniform color-space quantization for the implementation of real-time tracker. However, when the image of target model has a reduced contrast, such uniform quantization produces the histogram model having large values only for a few histogram bins, resulting in a reduced accuracy of similarity comparison. To solve this problem, a non-uniform quantization algorithm has been proposed, but it is hard to apply to real-time tracking applications due to its high complexity. Therefore, this paper proposes a fast non-uniform color-space quantization method using the histogram equalization, providing an adjusted histogram distribution such that the bins of target model histogram have as many meaningful values as possible. Using the proposed method, the number of bins involved in similarity comparison has been increased, resulting in an enhanced accuracy of the proposed mean-shift tracker. Simulations with various test videos demonstrate the proposed algorithm provides similar or better tracking results to the previous non-uniform quantization scheme with significantly reduced computation complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1424-1440
• /
• 2015

It is a challenging problem to search the intended images from a large number of candidates. Content based image retrieval (CBIR) is the most promising way to tackle this problem, where the most important topic is to measure the similarity of images so as to cover the variance of shape, color, pose, illumination etc. While previous works made significant progresses, their adaption ability to dataset is not fully explored. In this paper, we propose a similarity learning method on the basis of probabilistic generative model, i.e., probabilistic latent semantic analysis (PLSA). It first derives Fisher kernel, a function over the parameters and variables, based on PLSA. Then, the parameters are determined through simultaneously maximizing the log likelihood function of PLSA and the retrieval performance over the training dataset. The main advantages of this work are twofold: (1) deriving similarity measure based on PLSA which fully exploits the data distribution and Bayes inference; (2) learning model parameters by maximizing the fitting of model to data and the retrieval performance simultaneously. The proposed method (PLSA-FK) is empirically evaluated over three datasets, and the results exhibit promising performance.

• 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 Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.972-980
• /
• 2022

The butterfly species recognition technology based on machine learning using images has the effect of reducing a lot of time and cost of those involved in the related field to understand the diversity, number, and habitat distribution of butterfly species. In order to improve the accuracy and time efficiency of butterfly species classification, various features used as the inputs of machine learning models have been studied. Among them, branch length similarity(BLS) entropy or color intensity entropy methods using the concept of entropy showed higher accuracy and shorter learning time than other features such as Fourier transform or wavelet. This paper proposes a feature extraction algorithm using RGB color intensity entropy for butterfly color images. In addition, we develop butterfly recognition systems that combines the proposed feature extraction method with representative ensemble models and evaluate their performance.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.992-1004
• /
• 2017

To assess image quality accurately, an image quality assessment (IQA) metric is required to reflect the human visual system (HVS) properly. In other words, the structure, color, and contrast ratio of the image should be evaluated in consideration of various factors. In addition, as mobile embedded devices such as smartphone become popular, a fast computing speed is important. In this paper, the proposed IQA metric combines color similarity, gradient similarity, and phase similarity synergistically to satisfy the HVS and is designed by using optimized pooling and quantization for fast computation. The proposed IQA metric is compared against existing 13 methods using 4 kinds of evaluation methods. The experimental results show that the proposed IQA metric ranks the first on 3 evaluation methods and the first on the remaining method, next to VSI which is the most remarkable IQA metric. Its computing speed is on average about 20% faster than VSI's. In addition, we find that the proposed IQA metric has a bigger amount of correlation with the HVS than existing IQA metrics.

• Proceedings of the KIEE Conference
• /
• 2006.07d
• /
• pp.1973-1974
• /
• 2006

The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local maxima of a similarity measure between the color histograms of the target and candidate image. However, the mean shift tracking algorithm using only color histograms has a serious defect. It doesn't use the spatial information of the target. Thus, it is difficult to model the target more exactly. And it is likely to lose the target during the occlusions of other objects which have similar color distributions. To deal with these difficulties we use both color information and spatial information of the target. Our proposed algorithm is robust to occlusions and scale changes in front of dynamic, unstructured background. In addition, our proposed method is computationally efficient. Therefore, it can be executed in real-time.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.402-404
• /
• 1998

최근 영상 정보를 저장하는 시스템의 급증으로, 영상의 특징 요소들의 유사성(similarity)에 근거하여 영상을 분류.검색하는 기술에 많은 관심을 보이고 있다. 본 논문에서는 칼라영상의 분류를 위해 기존의 N$\times$M-grams를 변형한 Color N$\times$M-grams를 제안한다. Color N$\times$M-grams는 영상의 칼라정보를 이용하여 영상고유의 구조 정보를 추출한 후 유사성을 측정하여 영상을 분류한다. 제안된 방법의 성능 평가를 위하여 39쌍의 Benchmark 영상을 사용하여 실험하였다. 실험결과, 제안한 Color N$\times$M-grams를 사용한 방법이 기존의 N$\times$M-grams를 사용하여 칼라 영상을 분류하는 방법보다 1순위로 분류되는 비율에 있어서 약 19% 더 좋은 결과를 보였다.

• International Journal of Advanced Culture Technology
• /
• v.9 no.3
• /
• pp.265-270
• /
• 2021

VR and AR contents provide a rich user experience [1]. Realistic content with human computer interaction and immersion provides an improved user experience, but there is a limit to producing all elements realistically. In this study, we propose a method to advance the rendering of immersive content using background color information [2]. First, the elements necessary for Kelvin temperature rendering are derived from the color and background as context elements, and the rendering effect has been realized in the soap bubble. For soap bubbles Kelvin temperature rendering, the average color of the background is extracted and the color with the highest similarity is applied by comparing the main color and Kelvin temperature.

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.47-60
• /
• 2012

Video data comes in the form of the unstructured and the complex structure. As the importance of efficient management and retrieval for video data increases, studies on the video parsing based on the visual features contained in the video contents are researched to reconstruct video data as the meaningful structure. The early studies on video parsing are focused on splitting video data into shots, but detecting the shot boundary defined with the physical boundary does not cosider the semantic association of video data. Recently, studies on structuralizing video shots having the semantic association to the video scene defined with the semantic boundary by utilizing clustering methods are actively progressed. Previous studies on detecting the video scene try to detect video scenes by utilizing clustering algorithms based on the similarity measure between video shots mainly depended on color features. However, the correct identification of a video shot or scene and the detection of the gradual transitions such as dissolve, fade and wipe are difficult because color features of video data contain a noise and are abruptly changed due to the intervention of an unexpected object. In this paper, to solve these problems, we propose the Scene Detector by using Color histogram, corner Edge and Object color histogram (SDCEO) that clusters similar shots organizing same event based on visual features including the color histogram, the corner edge and the object color histogram to detect video scenes. The SDCEO is worthy of notice in a sense that it uses the edge feature with the color feature, and as a result, it effectively detects the gradual transitions as well as the abrupt transitions. The SDCEO consists of the Shot Bound Identifier and the Video Scene Detector. The Shot Bound Identifier is comprised of the Color Histogram Analysis step and the Corner Edge Analysis step. In the Color Histogram Analysis step, SDCEO uses the color histogram feature to organizing shot boundaries. The color histogram, recording the percentage of each quantized color among all pixels in a frame, are chosen for their good performance, as also reported in other work of content-based image and video analysis. To organize shot boundaries, SDCEO joins associated sequential frames into shot boundaries by measuring the similarity of the color histogram between frames. In the Corner Edge Analysis step, SDCEO identifies the final shot boundaries by using the corner edge feature. SDCEO detect associated shot boundaries comparing the corner edge feature between the last frame of previous shot boundary and the first frame of next shot boundary. In the Key-frame Extraction step, SDCEO compares each frame with all frames and measures the similarity by using histogram euclidean distance, and then select the frame the most similar with all frames contained in same shot boundary as the key-frame. Video Scene Detector clusters associated shots organizing same event by utilizing the hierarchical agglomerative clustering method based on the visual features including the color histogram and the object color histogram. After detecting video scenes, SDCEO organizes final video scene by repetitive clustering until the simiarity distance between shot boundaries less than the threshold h. In this paper, we construct the prototype of SDCEO and experiments are carried out with the baseline data that are manually constructed, and the experimental results that the precision of shot boundary detection is 93.3% and the precision of video scene detection is 83.3% are satisfactory.