• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

There have been studied with activity about color standard due to extention of digital contents' application area. Therefore the studies in relation to the standard are needed to represent image's feature as color. Also the methods to extract color's feature to be apt to various application are needed. In this paper, we set the base color as 50 colors from Munsell color system, get the color histogram to show the characteristics of colors's distribution of a image, and propose the method to extract representative colors from the histogram. Firstly, we convert a input image of RGB color space to a image of HSI color space and split the image into hue area and non-hue area. To split hue area and non-hue area, we use a fixed threshold and a perception-function of color area function to reflect the subjective vision of human-being. We compute histograms from each area and then make a total histogram from the histogram of hue area and the histogram of hue area, and extract the representative colors from the histogram. To evaluate the proposed method, we made 18 test images, applied conventional methods and proposed method to them Also the methods are applied to public images and the results are analyzed. The proposed method represents well the characteristics of the colors' distribution of images and piles up colors' frequency to representative colors. Therefore the representative colors can be applied to various applications

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.45-52
• /
• 2008

In this paper, we describe the Perceptually Weighted Histogram(PWH) and the Gaussian Weighted Histogram Intersection(GWHI) algorithms. These algorithms are able to provide positive results in image retrieval. But these histogram methods alter the histogram of an image by using particular lighting conditions. Even two pictures with little differences in lighting are not easily matched. Therefore, we propose that the Histogram Matching Algorithm(HMA) is able to overcome the problem of an image being changed by the intensity or color in the image retrieval. The proposed algorithm is insensitive to changes in the lighting. From the experiment results, the proposed algorithm can achieve up to 32% and up to 30% more recall than the PWH and GWHI algorithms, respectively. Also, it can achieve up to 38% and up to 34% more precision than PWH and GWHI, respectively Therefore, with our experiments, we are able to show that the proposed algorithm shows limited variation to changes in lighting.

• Journal of information and communication convergence engineering
• /
• v.17 no.1
• /
• pp.67-73
• /
• 2019

In the current era of digital technology, and with the help of existing software, digital photo manipulation is becoming easier and faster. One example of this is the development of powerful image processing software that makes it easy for a digital image to be manipulated and edited. It is therefore very important to protect and maintain public trust in digital images. Several methods have been developed to detect image manipulation. In this paper, we compare two methods for detecting image duplication due to copy-move actions, namely the polar coordinate system and the histogram of oriented gradients methods. The former is a method based on the transfer of a Cartesian image to a polar form, making it easy to tell whether there are objects that have undergone a copy/move in an image, while the latter is a method for retrieving information related to the distribution, which uses a target in the local area as a tool to represent the shape of the target. We compare the accuracy, speed and memory usage of these two methods.

• Journal of Korean Society for Quality Management
• /
• v.46 no.3
• /
• pp.509-522
• /
• 2018

Purpose: The purpose of this study was to propose more accurate mathematical model which can represent result of government quality assurance activity, especially corrective action and flaw. Methods: The collected data during government quality assurance activity was represented through histogram. To find out which distributions (Poisson distribution, Zero-Inflated Poisson distribution) could represent the histogram better, this study applied Pearson's correlation coefficient. Results: The result of this study is as follows; Histogram of corrective action during past 3 years and Zero-Inflated Poisson distribution had strong relationship that their correlation coefficients was over 0.94. Flaw data could not re-parameterize to Zero-Inflated Poisson distribution because its frequency of flaw occurrence was too small. However, histogram of flaw data during past 3 years and Poisson distribution showed strong relationship that their correlation coefficients was 0.99. Conclusion: Zero-Inflated Poisson distribution represented better than Poisson distribution to demonstrate corrective action histogram. However, in the case of flaw data histogram, Poisson distribution was more accurate than Zero-Inflated Poisson distribution.

• Journal of Broadcast Engineering
• /
• v.14 no.4
• /
• pp.397-408
• /
• 2009

In this paper, we present a non-static color histogram method to retrieve clothing images that are similar to a query clothing. Given clothing area, our method automatically extracts major colors by using the octree-based quantization approach[16]. Then, a color palette that is composed of the major colors is generated. The feature of each clothing, which can be either a query or a database clothing image, is represented as a color histogram based on its color palette. We define the match color bins between two possibly different color palettes, and unify the color palettes by merging or deleting some color bins if necessary. The similarity between two histograms is measured by using the weighted Euclidean distance between the match color bins, where the weight is derived from the frequency of each bin. We compare our method with previous histogram matching methods through experiments. Compared to HSV cumulative histogram-based approach, our method improves the retrieval precision by 13.7 % with less number of color bins.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.369-377
• /
• 2007

Histogram is one of tools that efficiently summarize data, and it is widely used for selectivity estimation and approximate query answering. Existing histogram construction algorithms are applicable to point data represented by a set of values. As often as point data, we can meet interval data such as daily temperature and daily stock prices. In this paper, we thus propose the histogram construction algorithms for interval data by extending several methods used in existing histogram construction algorithms. Our experiment results, using synthetic data, show our algorithms outperform naive extension of existing algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.466-471
• /
• 2007

Conventional thresholding methods including Otsu's thresholding method are based on the gray levels frequency histogram. But the gray levels frequency histogram is obtained by recomposing only frequency information from an input image, where frequency histogram dose not contain any other informations such as the distribution of gray levels and relation between gray levels. Therefore the methods using the gray levels frequency histogram occasionally present inappropriate threshold values because it cannot reflect informations of the given image sufficiently. In this paper, we define a correlation function of gray levels and propose a novel thresholding method using the gray levels frequency histogram and the spatial correlation information. The effectiveness of the proposed method will be shown through comparison with Otsu's thresholding method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.46-54
• /
• 2003

In this paper, we propose segmentation algorithm for MR brain images using the histogram of T1-weighted, T2-weighted and PD images. Segmentation algorithm is composed of 3 steps. The first step involves the extraction of cerebrum images by ram a cerebrum mask over three input images. In the second step, peak ranges are determined from the histogram of the cerebrum image. In the final step, cerebrum images are segmented using coarse to fine clustering technique. We compare the segmentation result and processing time according to peak ranges. Also compare with the other segmentation methods. The proposed algorithm achieved better segmentation results than the other methods.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.4
• /
• pp.190-194
• /
• 2009

Iris recognition is a biometric technology which can identify a person using the iris pattern. Recently, using iris information is used in many fields such as access control and information security. But Perform complex operations to extract features of the iris. Because high-end hardware for real-time iris recognition is required. This paper is appropriate for the embedded environment using local gradient histogram embedded system with iris feature extraction methods based on USN(Ubiquitous Sensor Network). Experimental results show that the performance of proposed method is comparable to existing methods using Gabor transform noticeably improves recognition performance and it is noted that the processing time of the local gradient histogram transform is much faster than that of the existing method and rotation was also a strong attribute.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.649-654
• /
• 2003

Most of the conventional image thresholding methods are based on the histogram function of the gray values. In this paper, we present a simple but effective example showing that the histogram-based thresholding methods do not perform well. To overcome the difficulty, the authors propose a new gray level threshold selection method based on the distribution of gray levels in images. Finally, we provide simulation results showing the effectiveness of the proposed threshold selection method through several examples.