Color image segmentation using a spatial k-means clustering algorithm

This paper details the implementation of a new adaptive technique for color-texture segmentation that is a generalization of the standard K-Means algorithm. The standard K-Means algorithm produces accurate segmentation results only when applied to images defined by homogenous regions with respect to texture and color since no local constraints are applied to impose spatial continuity. In addition, the initialization of the K-Means algorithm is problematic and usually the initial cluster centers are randomly picked. In this paper we detail the implementation of a novel technique to select the dominant colors from the input image using the information from the color histograms. The main contribution of this work is the generalization of the K-Means algorithm that includes the primary features that describe the color smoothness and texture complexity in the process of pixel assignment. The resulting color segmentation scheme has been applied to a large number of natural images and the experimental data indicates the robustness of the new developed segmentation algorithm

A Fully Unsupervised Texture Segmentation Algorithm

This paper presents a fully unsupervised texture segmentation algorithm by using a modified discrete wavelet frames decomposition and a mean shift algorithm. By fully unsupervised, we mean the algorithm does not require any knowledge of the type of texture present nor the number of textures in the image to be segmented. The basic idea of the proposed method is to use the modified discrete wavelet frames to extract useful information from the image. Then, starting from the lowest level, the mean shift algorithm is used together with the fuzzy c-means clustering to divide the data into an appropriate number of clusters. The data clustering process is then refined at every level by taking into account the data at that particular level. The final crispy segmentation is obtained at the root level. This approach is applied to segment a variety of composite texture images into homogeneous texture areas and very good segmentation results are reported

Pilot investigation of remote sensing for intertidal oyster mapping in coastal South Carolina: a methods comparison

South Carolina’s oyster reefs are a major component of the coastal landscape. Eastern oysters Crassostrea virginica are an important economic resource to the state and serve many essential functions in the environment, including water filtration, creek bank stabilization and habitat for other plants and animals. Effective conservation and management of oyster reefs is dependent on an understanding of their abundance, distribution, condition, and change over time. In South Carolina, over 95% of the state’s oyster habitat is intertidal. The current intertidal oyster reef database for South Carolina was developed by field assessment over several years. This database was completed in the early 1980s and is in need of an update to assess resource/habitat status and trends across the state. Anthropogenic factors such as coastal development and associated waterway usage (e.g., boat wakes) are suspected of significantly altering the extent and health of the state’s oyster resources. In 2002 the NOAA Coastal Services Center’s (Center) Coastal Remote Sensing Program (CRS) worked with the Marine Resources Division of the South Carolina Department of Natural Resources (SCDNR) to develop methods for mapping intertidal oyster reefs along the South Carolina coast using remote sensing technology. The objective of this project was to provide SCDNR with potential methodologies and approaches for assessing oyster resources in a more efficiently than could be accomplished through field digitizing. The project focused on the utility of high-resolution aerial imagery and on documenting the effectiveness of various analysis techniques for accomplishing the update. (PDF contains 32 pages

Statistical Analysis of Dynamic Actions

Real-world action recognition applications require the development of systems which are fast, can handle a large variety of actions without a priori knowledge of the type of actions, need a minimal number of parameters, and necessitate as short as possible learning stage. In this paper, we suggest such an approach. We regard dynamic activities as long-term temporal objects, which are characterized by spatio-temporal features at multiple temporal scales. Based on this, we design a simple statistical distance measure between video sequences which captures the similarities in their behavioral content. This measure is nonparametric and can thus handle a wide range of complex dynamic actions. Having a behavior-based distance measure between sequences, we use it for a variety of tasks, including: video indexing, temporal segmentation, and action-based video clustering. These tasks are performed without prior knowledge of the types of actions, their models, or their temporal extents