Paper
2 November 2011 Unsupervised color image segmentation using a lattice algebra clustering technique
Author Affiliations +
Abstract
In this paper we introduce a lattice algebra clustering technique for segmenting digital images in the Red-Green- Blue (RGB) color space. The proposed technique is a two step procedure. Given an input color image, the first step determines the finite set of its extreme pixel vectors within the color cube by means of the scaled min-W and max-M lattice auto-associative memory matrices, including the minimum and maximum vector bounds. In the second step, maximal rectangular boxes enclosing each extreme color pixel are found using the Chebychev distance between color pixels; afterwards, clustering is performed by assigning each image pixel to its corresponding maximal box. The two steps in our proposed method are completely unsupervised or autonomous. Illustrative examples are provided to demonstrate the color segmentation results including a brief numerical comparison with two other non-maximal variations of the same clustering technique.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gonzalo Urcid and Gerhard X. Ritter "Unsupervised color image segmentation using a lattice algebra clustering technique", Proc. SPIE 8011, 22nd Congress of the International Commission for Optics: Light for the Development of the World, 80117D (2 November 2011); https://doi.org/10.1117/12.902214
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

RGB color model

Matrices

Algorithm development

Color image segmentation

Image processing

Image processing algorithms and systems

Back to Top