Fuzzy image segmentation of generic shaped clusters

The segmentation performance of any clustering algorithm is very sensitive to the features in an image, which ultimately restricts their generalisation capability. This limitation was the primary motivation in our investigation into using shape information to improve the generality of these algorithms. Fuzzy shape-based clustering techniques already consider ring and elliptical profiles in segmentation, though most real objects are neither ring nor elliptically shaped. This paper addresses this issue by introducing a new shape-based algorithm called fuzzy image segmentation of generic shaped clusters (FISG) that incorporates generic shape information into the framework of the fuzzy c-means (FCM) algorithm. Both qualitative and quantitative analyses confirm the superiority of FISG compared to other shape-based fuzzy clustering methods including, Gustafson-Kessel algorithm, ring-shaped, circular shell, c-ellipsoidal shells and elliptic ring-shaped clusters. The new algorithm has also been shown to be application independent so it can be applied in areas such as video object plane segmentation in MPEG-4 based coding

A generic fuzzy rule based technique for image segmentation

Many fuzzy clustering based techniques do not incorporate the spatial relationships of the pixels, while all fuzzy rule based image segmentation techniques tend to be very much application dependent. In most techniques, the structure of the membership functions are predefined and their parameters are either automatically or manually determined. This paper addresses the aforementioned problems by introducing a general fuzzy rule based image segmentation technique, which is application independent and can also incorporate the spatial relationships of the pixels. It also proposes the automatic defining of the structure of the membership functions. A qualitative comparison is made between the segmentation results using this method and the popular fuzzy c-means (FCM) applied to two types of images: light intensity (LI) and an X-ray of the human vocal tract. The results clearly show that this method exhibits significant improvements over FCM for both types of image

Object-based Image Ranking using Neural Networks

In this paper an object-based image ranking is performed using both supervised and unsupervised neural networks. The features are extracted based on the moment invariants, the run length, and a composite method. This paper also introduces a likeness parameter, namely a similarity measure using the weights of the neural networks. The experimental results show that the performance of image retrieval depends on the method of feature extraction, types of learning, the values of the parameters of the neural networks, and the databases including query set. The best performance is achieved using supervised neural networks for internal query set

Fuzzy rule for image segmentation incorporating texture features

The generic fuzzy rule-based image segmentation algorithm (GFRIS) does not produce good results for images containing non-homogeneous regions, as it does not directly consider texture. In this paper a new algorithm called fuzzy rules for image segmentation incorporating texture features (FRIST) is proposed, which includes two additional membership functions to those already defined in GFRIS. FRIST incorporates the fractal dimension and contrast features of a texture by considering image domain specific information. Quantitative evaluation of the performance of FRIST is discussed and contrasted with GFRIS using one of the standard segmentation evaluation methods. Overall, FRIST exhibits considerable improvement in the results obtained compared with the GFRIS approach for many different image types

Fuzzy image segmentation combining ring and elliptic shaped clustering algorithms

Results from any existing clustering algorithm that are used for segmentation are highly sensitive to features that limit their generalization. Shape is one important attribute of an object. The detection and separation of an object using fuzzy ring-shaped clustering (FKR) and elliptic ring-shaped clustering (FKE) already exists in the literature. Not all real objects however, are ring or elliptical in shape, so to address these issues, this paper introduces a new shape-based algorithm, called fuzzy image segmentation combining ring and elliptic shaped clustering algorithms (FCRE) by merging the initial segmented results produced by FKR and FKE. The distribution of unclassified pixels is performed by connectedness and fuzzy c-means (FCM) using a combination of pixel intensity and normalized pixel location. Both qualitative and quantitative analysis of the results for different varieties of images proves the superiority of the proposed FCRE algorithm compared with both FKR and FKE

Passive source localization using power spectral analysis and decision fusion in wireless distributed sensor networks

Source localization is a challenging issue for multisensor multitarget detection, tracking and estimation problems in wireless distributed sensor networks. In this paper, a novel source localization method, called passive source localization using power spectral analysis and decision fusion in wireless distributed sensor networks is presented. This includes an energy decay model for acoustic signals. The new method is computationally efficient and requires less bandwidth compared with current methods by making localization decisions at individual nodes and performing decision fusion at the manager node. This eliminates the requirement of sophisticated synchronization. A simulation of the proposed method is performed using different numbers of sources and sensor nodes. Simulation results confirmed the improved performance of this method under ideal and noisy conditions

New Dynamic Enhancements to the Vertex-Based Rate-Distortion Optimal Shape Coding Framework

Existing vertex-based operational rate-distortion (ORD) optimal shape coding algorithms use a vertex band around the shape boundary as the source of candidate control points (CP) usually in combination with a tolerance band (TB) and sliding window (SW) arrangement, as their distortion measuring technique. These algorithms however, employ a fixed vertex-band width irrespective of the shape and admissible distortion (AD), so the full bit-rate reduction potential is not fulfilled. Moreover, despite the causal impact of the SW-length upon both the bit-rate and computational-speed, there is no formal mechanism for determining the most suitable SW-length. This paper introduces the concept of a variable width admissible CP band and new adaptive SW-length selection strategy to address these issues. The presented quantitative and qualitative results analysis endorses the superior performance achieved by integrating these enhancements into the existing vertex-based ORD optimal algorithms

A generic shape descriptor using Bezier curves

Bezier curves are robust tool for a wide array of applications ranging from computer-aided design to calligraphic character, outlining and object shape description. In terms of the control point generation process, existing shape descriptor techniques that employ Bezier curves do not distinguish between regions where an object's shape changes rapidly and those where the change is more gradual or flat. This can lead to an erroneous shape description, particularly where there are significantly sharp changes in shape, such as at sharp corners. This paper presents a novel shape description algorithm called a generic shape descriptor using Bezier curves (SDBC), which defines a new strategy for Bezier control point generation by integrating domain specific information about the shape of an object in a particular region. The strategy also includes an improved dynamic fixed length coding scheme for control points. The SDBC framework has been rigorously tested upon a number of arbitrary shapes, and both quantitative and qualitative analyses have confirmed its superior performance in comparison with existing algorithms

Fuzzy image segmentation using shape information

Results of any clustering algorithm are highly sensitive to features that limit their generalization and hence provide a strong motivation to integrate shape information into the algorithm. Existing fuzzy shape-based clustering algorithms consider only circular and elliptical shape information and consequently do not segment well, arbitrary shaped objects. To address this issue, this paper introduces a new shape-based algorithm, called fuzzy image segmentation using shape information (FISS) by incorporating general shape information. Both qualitative and quantitative analysis proves the superiority of the new FISS algorithm compared to other well-established shape-based fuzzy clustering algorithms, including Gustafson-Kessel, ring-shaped, circular shell, c-ellipsoidal shells and elliptic ring-shaped clusters

Extended states in 1D lattices: application to quasiperiodic copper-mean chain

The question of the conditions under which 1D systems support extended electronic eigenstates is addressed in a very general context. Using real space renormalisation group arguments we discuss the precise criteria for determining the entire spertrum of extended eigenstates and the corresponding eigenfunctions in disordered as well as quasiperiodic systems. For purposes of illustration we calculate a few selected eigenvalues and the corresponding extended eigenfunctions for the quasiperiodic copper-mean chain. So far, for the infinite copper-mean chain, only a single energy has been numerically shown to support an extended eigenstate [ You et al. (1991)] : we show analytically that there is in fact an infinite number of extended eigenstates in this lattice which form fragmented minibands.Comment: 10 pages + 2 figures available on request; LaTeX version 2.0