• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.833-840
• /
• 2010

In this paper a method for detecting and extracting the face from the image in YCbCr spaceis proposed. The face region is obtained from the complex original image by using the difference method and the face color information is taken from the reduced face region throughthe Ellipse clustering method. The experimental results showed that the proposed method can efficiently detect and extract the face from the original image under the general light intensity except for low luminance.

• Journal of Broadcast Engineering
• /
• v.27 no.6
• /
• pp.923-935
• /
• 2022

This paper deals with detection and classification of leaf diseases for phenomics systems. As the smart farm systems of plants are increased, It is important to determine quickly the abnormal growth of plants without supervisors. This paper considers the color distribution and shape information of leaf diseases, and designs two deep leaning networks in training the leaf diseases. In the first step, color distribution of input image is analyzed for possible diseases. In the second step, the image is first partitioned into small segments using mean shift clustering, and the color information of each segment is inspected by the proposed Color Network. When a segment is determined as disease, the shape parameters of the segment are extracted and inspected by proposed Shape Network to classify the leaf disease types in the third step. According to the experiments with two types of diseases (frogeye/rust and tipburn) for apple leaves and iceberg, the leaf diseases are detected with 92.3% recall for a segment and with 99.3% recall for an input image where there are usually more than two disease segments. The proposed method is useful for detecting leaf diseases quickly in the smart farm environment, and is extendible to various types of new plants and leaf diseases without additional learning.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.6
• /
• pp.1203-1208
• /
• 2016

For young children who are not spontaneous or not accurate in verbal communication of their emotions and experiences, drawing is a good means of expressing their status in mind and thus drawing analysis with chromatics is a traditional tool for art therapy. Recently, children enjoy digital drawing via painting tools thus there is a growing needs to develop an automatic digital drawing analysis tool based on chromatics and art therapy theory. In this paper, we propose such an analyzing tool based on dominant color analysis. Technically, we use ART2 clustering and fuzzy logic to understand the fuzziness of subjects' status of mind expressed in their digital drawings. The frequency of color usage is fuzzified with respect to the membership functions. After applying fuzzy logic to this fuzzified central vector, we determine the dominant color and supporting colors from the digital drawings and children's status of mind is then analyzed according to the color-personality relationships based on Alschuler and Hattwick's historical researches.

• Journal of The Korean Astronomical Society
• /
• v.50 no.3
• /
• pp.61-70
• /
• 2017

We study the angular correlation function of bright ($K_s{\leq}19.5$) Extremely Red Objects (EROs) selected in the Subaru GTO 2$deg^2$ field. By applying the color selection criteria of $R-K_s$ > 5.0, 5.5, and 6.0, we identify 9055, 4270, and 1777 EROs, respectively. The number density is consistent with similar studies on the optical - NIR color selected red galaxies. The angular correlation functions are derived for EROs with different limiting magnitude and different $R-K_s$ color cut. When we assume that the angular correlation function $w({\theta})$ follows a form of a power-law (i.e., $w({\theta})=A{\theta}^{-{\delta}}$), the value of the amplitude A was larger for brighter EROs compared to the fainter EROs. The result suggests that the brighter, thus more massive high-redshift galaxies, are clustered more strongly compared to the less massive galaxies. Assuming that EROs have redshift distribution centered at ~ 1.1 with ${\sigma}_z=0.15$, the spatial correlation length $r_0$ of the EROs estimated from the observed angular correlation function ranges ${\sim}6-10h^{-1}Mpc$. A comparison with the clustering of dark matter halos in numerical simulation suggests that the EROs are located in most massive dark matter halos and could be progenitors of $L_{\ast}$ elliptical galaxies.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.76-90
• /
• 1999

In this paper, a color image retrieval algorithm is proposed based on color histogram and color texture. The representative color vectors of a color image are made from k-means clustering of its color histogram, and color texture is generated by centering around the color of pixels with its color vector. Thus the color texture means texture properties emphasized by its color histogram, and it is analyzed by Gaussian Markov Random Field (GMRF) model. The proposed algorithm can work efficiently because it does not require any low level image processing such as segmentation or edge detection, so it outperforms the traditional algorithms which use color histogram only or texture properties come from image intensity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2400-2419
• /
• 2014

Pre-segmented pixels can reduce the difficulty of segmentation and promote the segmentation performance. This paper proposes a novel segmentation method based on merging texture superpixels by computing inner similarity. Firstly, we design a set of Gabor filters to compute the amplitude responses of original image and compute the texture map by a salience model. Secondly, we employ the simple clustering to extract superpixles by affinity of color, coordinates and texture map. Then, we design a normalized histograms descriptor for superpixels integrated color and texture information of inner pixels. To obtain the final segmentation result, all adjacent superpixels are merged by the homogeneity comparison of normalized color-texture features until the stop criteria is satisfied. The experiments are conducted on natural scene images and synthesis texture images demonstrate that the proposed segmentation algorithm can achieve ideal segmentation on complex texture regions.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2002

In this paper, we propose an object tracking system which can be convinced of moving area shaped on objects through color sequential images, decided moving directions of foot messengers or vehicles of image sequences. In static camera, we suggests a new evaluating method extracting co-occurrence matrix with feature vectors of RGB after analyzing and blocking difference images, which is accessed to field of camera view for motion. They are energy, entropy, contrast, maximum probability, inverse difference moment, and correlation of RGB color vectors. we describe how to analyze and compute corresponding relations of objects between adjacent frames. In the clustering, we apply an algorithm of FCM(fuzzy c means) to analyze matching and clustering problems of adjacent frames of the featured vectors, energy and entropy, gotten from previous phase. In the matching phase, we also propose a method to know correspondence relation that can track motion each objects by clustering with similar area, compute object centers and cluster around them in case of same objects based on membership function of motion area of adjacent frames.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1731-1741
• /
• 1999

Color images are often corrupted by the noise due to noisy sensors or channel transmission errors. Some filters such as vector media and vector $\alpha$-trimmed mean filter have bee used for color noise removal. In this paper, We propose the fuzzy cluster filters based on the possibilistic c-means clustering, because the possibilistic c-means clustering can get robust memberships in noisy environments. Also, we propose weighted vector $\alpha$-trimmed mean filter to improve the conventional vector $\alpha$-trimmed mean filter. In this filter, the central data are more weighted than the outlying data. In this paper, we implemented the color noise generator to evaluate the performance of the proposed filters in the color noise environments. The NCD measure and visual measure by human observer are used for evaluation the performance of the proposed filters. In the experiment, proposed fuzzy cluster filters in the sense of NCD measure gave the best performance over conventional filters in the mixed noise. Simulation results showed that proposed weighted vector $\alpha$-trimmed mean filters better than the conventional vector $\alpha$-trimmed mean filter in any kinds of noise.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.649-651
• /
• 2012

In this paper, a method of segmenting color image using characteristics of superpixels is proposed. A superpixel is consist of several pixels with same features such as luminance, color, textures etc. The superpixel can be used for image processing and analysis with large scale image to get high speed processing. A color image can be transformed to $La^*b^*$ feature space having good characteristics, and the superpixels are grouped by clustering and gradient-based algorithm.