• Title/Summary/Keyword: color clustering

Search Result 220, Processing Time 0.027 seconds

On-line Inspection Algorithm of Brown Rice Using Image Processing (영상처리를 이용한 현미의 온라인 품위판정 알고리즘)

  • Kim, Tae-Min;Noh, Sang-Ha
    • Journal of Biosystems Engineering
    • /
    • v.35 no.2
    • /
    • pp.138-145
    • /
    • 2010
  • An on-line algorithm that discriminates brown rice kernels on their echelon feeder using color image processing is presented for quality inspection. A rapid color image segmentation algorithm based on Bayesian clustering method was developed by means of the look-up table which was made from the significant clusters selected by experts. A robust estimation method was presented to improve the stability of color clusters. Discriminant analysis of color distributions was employed to distinguish nine types of brown rice kernels. Discrimination accuracies of the on-line discrimination algorithm were ranged from 72% to 85% for the sound, cracked, green-transparent and green-opaque, greater than 93% for colored, red, and unhulled, about 92% for white-opaque and 67% for chalky, respectively.

Palette-based Color Attribute Compression for Point Cloud Data

  • Cui, Li;Jang, Euee S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.3108-3120
    • /
    • 2019
  • Point cloud is widely used in 3D applications due to the recent advancement of 3D data acquisition technology. Polygonal mesh-based compression has been dominant since it can replace many points sharing a surface with a set of vertices with mesh structure. Recent point cloud-based applications demand more point-based interactivity, which makes point cloud compression (PCC) becomes more attractive than 3D mesh compression. Interestingly, an exploration activity has been started to explore the feasibility of PCC standard in MPEG. In this paper, a new color attribute compression method is presented for point cloud data. The proposed method utilizes the spatial redundancy among color attribute data to construct a color palette. The color palette is constructed by using K-means clustering method and each color data in point cloud is represented by the index of its similar color in palette. To further improve the compression efficiency, the spatial redundancy between the indices of neighboring colors is also removed by marking them using a flag bit. Experimental results show that the proposed method achieves a better improvement of RD performance compared with that of the MPEG PCC reference software.

Color image segmentation based on clustering using color space distance and neighborhood relation among pixels (픽셀간의 칼라공간에서의 거리와 이웃관계를 고려하는 클러스터링을 통한 칼라영상 분할)

  • 김황수;이화정
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10c
    • /
    • pp.532-534
    • /
    • 1998
  • 본 논문에서는 칼라공간상의 거리와 이웃정보를 이용한 클러스터링을 통한 칼라영상 분할 방법을 제안한다. 영상의 픽셀들을 이웃관계를 유지하여 칼라공간으로 매핑한다. 칼라공간상에서 이웃하는 픽셀들을 클러스터링하여 영상의 세그먼트들을 찾는다. 클러스터링 방법으로서 인력을 모방하는 클러스터링(gravitational clustering)을 사용하였다. 이 방법으로 클러스터의 중심값과 클러스터 수를 미리 정해주지 않아도 자동적으로 결정할 수 있는 장점이 있다. gravitational 클러스터링에서 찾은 클러스터 수를 가지고 다른 클러스터링 방법에 입력으로 주어 결과를 비교해 본다. 본 논문에서는 이웃관계를 따라 클러스터링하는 것이 정확한 경계선을 찾는데 효과적임을 보여준다.

  • PDF

An Automatic Object Extraction Method Using Color Features Of Object And Background In Image (영상에서 객체와 배경의 색상 특징을 이용한 자동 객체 추출 기법)

  • Lee, Sung Kap;Park, Young Soo;Lee, Gang Seong;Lee, Jong Yong;Lee, Sang Hun
    • Journal of Digital Convergence
    • /
    • v.11 no.12
    • /
    • pp.459-465
    • /
    • 2013
  • This paper is a study on an object extraction method which using color features of an object and background in the image. A human recognizes an object through the color difference of object and background in the image. So we must to emphasize the color's difference that apply to extraction result in this image. Therefore, we have converted to HSV color images which similar to human visual system from original RGB images, and have created two each other images that applied Median Filter and we merged two Median filtered images. And we have applied the Mean Shift algorithm which a data clustering method for clustering color features. Finally, we have normalized 3 image channels to 1 image channel for binarization process. And we have created object map through the binarization which using average value of whole pixels as a threshold. Then, have extracted major object from original image use that object map.

Object-Based Image Search Using Color and Texture Homogeneous Regions (유사한 색상과 질감영역을 이용한 객체기반 영상검색)

  • 유헌우;장동식;서광규
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.6
    • /
    • pp.455-461
    • /
    • 2002
  • Object-based image retrieval method is addressed. A new image segmentation algorithm and image comparing method between segmented objects are proposed. For image segmentation, color and texture features are extracted from each pixel in the image. These features we used as inputs into VQ (Vector Quantization) clustering method, which yields homogeneous objects in terns of color and texture. In this procedure, colors are quantized into a few dominant colors for simple representation and efficient retrieval. In retrieval case, two comparing schemes are proposed. Comparing between one query object and multi objects of a database image and comparing between multi query objects and multi objects of a database image are proposed. For fast retrieval, dominant object colors are key-indexed into database.

The Binarization of Text Regions in Natural Scene Images, based on Stroke Width Estimation (자연 영상에서 획 너비 추정 기반 텍스트 영역 이진화)

  • Zhang, Chengdong;Kim, Jung Hwan;Lee, Guee Sang
    • Smart Media Journal
    • /
    • v.1 no.4
    • /
    • pp.27-34
    • /
    • 2012
  • In this paper, a novel text binarization is presented that can deal with some complex conditions, such as shadows, non-uniform illumination due to highlight or object projection, and messy backgrounds. To locate the target text region, a focus line is assumed to pass through a text region. Next, connected component analysis and stroke width estimation based on location information of the focus line is used to locate the bounding box of the text region, and each box of connected components. A series of classifications are applied to identify whether each CC(Connected component) is text or non-text. Also, a modified K-means clustering method based on an HCL color space is applied to reduce the color dimension. A text binarization procedure based on location of text component and seed color pixel is then used to generate the final result.

  • PDF

Psychology Analysis using Color Histogram Clustering (색상히스토그램 클러스터링을 이용한 심리분석)

  • Cho, Jae-Hyun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.3
    • /
    • pp.415-420
    • /
    • 2013
  • In recent, many researches have been studying sensitivity and psychology of human on color. Among them, a picture of children can be a tool to represent their emotion. Information of colors and direction on a child's picture often represent his internal psychological states unconsciously. In this paper, we propose the method that extract the color and direction information in order to analyze the psychology in the picture of children. Histogram clustering is used for color information detection. Direction information extract from inner edge value. In the result of experiments, we shows that our method is similar to the pattern classification of the general method.

A Comparison of Superpixel Characteristics based on SLIC(Simple Linear Iterative Clustering) for Color Feature Spaces (칼라특징공간별 SLIC기반 슈퍼픽셀의 특성비교)

  • Lee, Jeong Hwan
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.4
    • /
    • pp.151-160
    • /
    • 2014
  • In this paper, a comparison of superpixel characteristics based on SLIC(simple linear iterative clustering) for several color feature spaces is presented. Computer vision applications have come to rely increasingly on superpixels in recent years. Superpixel algorithms group pixels into perceptually meaningful atomic regions, which can be used to replace the rigid structure of the pixel grid. A superpixel is consist of pixels with similar features such as luminance, color, textures etc. Thus superpixels are more efficient than pixels in case of large scale image processing. Generally superpixel characteristics are described by uniformity, boundary precision and recall, compactness. However previous methods only generate superpixels a special color space but lack researches on superpixel characteristics. Therefore we present superpixel characteristics based on SLIC as known popular. In this paper, Lab, Luv, LCH, HSV, YIQ and RGB color feature spaces are used. Uniformity, compactness, boundary precision and recall are measured for comparing characteristics of superpixel. For computer simulation, Berkeley image database(BSD300) is used and Lab color space is superior to the others by the experimental results.

The Topology of Galaxy Clustering in the Sloan Digital Sky Survey Main Galaxy Sample: a Test for Galaxy Formation Models

  • Choi, Yun-Young;Park, Chang-Bom;Kim, Ju-Han;Weinberg, David H.;Kim, Sung-Soo S.;Gott III, J. Richard;Vogeley, Michael S.
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.35 no.1
    • /
    • pp.82-82
    • /
    • 2010
  • We measure the topology of the galaxy distribution using the Seventh Data Release of the Sloan Digital Sky Survey (SDSS DR7), examining the dependence of galaxy clustering topology on galaxy properties. The observational results are used to test galaxy formation models. A volume-limited sample defined by Mr<-20.19 enables us to measure the genus curve with amplitude of G=378 at 6h-1Mpc smoothing scale, with 4.8% uncertainty including all systematics and cosmic variance. The clustering topology over the smoothing length interval from 6 to 10h-1Mpc reveals a mild scale-dependence for the shift and void abundance (A_V) parameters of the genus curve. We find strong bias in the topology of galaxy clustering with respect to the predicted topology of the matter distribution, which is also scale-dependent. The luminosity dependence of galaxy clustering topology discovered by Park et al. (2005) is confirmed: the distribution of relatively brighter galaxies shows a greater prevalence of isolated clusters and more percolated voids. We find that galaxy clustering topology depends also on morphology and color. Even though early (late)-type galaxies show topology similar to that of red (blue) galaxies, the morphology dependence of topology is not identical to the color dependence. In particular, the void abundance parameter A_V depends on morphology more strongly than on color. We test five galaxy assignment schemes applied to cosmological N-body simulations to generate mock galaxies: the Halo-Galaxy one-to-one Correspondence (HGC) model, the Halo Occupation Distribution (HOD) model, and three implementations of Semi-Analytic Models (SAMs). None of the models reproduces all aspects of the observed clustering topology; the deviations vary from one model to another but include statistically significant discrepancies in the abundance of isolated voids or isolated clusters and the amplitude and overall shift of the genus curve. SAM predictions of the topology color-dependence are usually correct in sign but incorrect in magnitude.

  • PDF

Automatic Classification Algorithm for Raw Materials using Mean Shift Clustering and Stepwise Region Merging in Color (컬러 영상에서 평균 이동 클러스터링과 단계별 영역 병합을 이용한 자동 원료 분류 알고리즘)

  • Kim, SangJun;Kwak, JoonYoung;Ko, ByoungChul
    • Journal of Broadcast Engineering
    • /
    • v.21 no.3
    • /
    • pp.425-435
    • /
    • 2016
  • In this paper, we propose a classification model by analyzing raw material images recorded using a color CCD camera to automatically classify good and defective agricultural products such as rice, coffee, and green tea, and raw materials. The current classifying agricultural products mainly depends on visual selection by skilled laborers. However, classification ability may drop owing to repeated labor for a long period of time. To resolve the problems of existing human dependant commercial products, we propose a vision based automatic raw material classification combining mean shift clustering and stepwise region merging algorithm. In this paper, the image is divided into N cluster regions by applying the mean-shift clustering algorithm to the foreground map image. Second, the representative regions among the N cluster regions are selected and stepwise region-merging method is applied to integrate similar cluster regions by comparing both color and positional proximity to neighboring regions. The merged raw material objects thereby are expressed in a 2D color distribution of RG, GB, and BR. Third, a threshold is used to detect good and defective products based on color distribution ellipse for merged material objects. From the results of carrying out an experiment with diverse raw material images using the proposed method, less artificial manipulation by the user is required compared to existing clustering and commercial methods, and classification accuracy on raw materials is improved.