27992571
Segmentation of SAR images
Abstract This paper presents a new algorithm for segmentation of SAR images based on threshold estimation using the histogram. The speckle distribution in the SAR image is modeled by a Gamma function. Thus, the SAR image histogram exhibits a combination of Gamma distributions. The maximum likelihood technique is therefore used to estimate the histogram parameters. This technique requires knowledge of the number of modes of the histogram, the number of looks of the SAR image, and the initial parameters of the histogram. The second derivative of the histogram is used to estimate the number of modes. We use two methods to estimate the number of looks. Initial parameters are estimated at the maximum of the Gamma function. Thresholds are selected at the valleys of a multi-modal histogram by minimizing the discrimination error between the classes of pixels in the image. The algorithm is applied to several RADARSAT SAR images with different number of looks. The results obtained are promising.
1160887
An objective approach to cluster validation
Cluster validation is a major issue in cluster analysis. Many existing validity indices do not perform well when clusters overlap or there is significant variation in their covariance structure. The contribution of this paper is twofold. First, we propose a new validity index for fuzzy clustering. Second, we present a new approach for the objective evaluation of validity indices and clustering algorithms. Our validity index makes use of the covariance structure of clusters, while the evaluation approach utilizes a new concept of overlap rate that gives a formal measure of the difficulty of distinguishing between overlapping clusters. We have carried out experimental studies using data sets containing clusters of different shapes and densities and various overlap rates, in order to show how validity indices behave when clusters become less and less separable. Finally, the effectiveness of the new validity index is also demonstrated on a number of real-life data sets.
2622680
A direct approach to graph clustering
9573239
A new algorithm for inexact graph matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact graph matching is the process of finding the best possible matching between two graphs when exact matching is impossible. We propose a new algorithm for the inexact matching problem. The new algorithm decomposes the matching process into K phases, where the value of K ranges from 1 to the minimum of the numbers of nodes in the two graphs to be matched. The efficiency of the new algorithm results from the use of small values of K, significantly reducing the search space while still producing very good matchings (most of them optimal) between graphs. The algorithm is compared with the error-correcting subgraph isomorphism algorithm based on A*.
11278363
A Distributed Artificial Network Solving Complex and Multiple Causal Associations
Causal reasoning (known also as abduction) is a hard task that cognitive agents perform reliably and quickly. A particular class of causal reasoning that raises several difficulties is the cancellation class. Cancellation occurs when a set of causes (hypotheses) cancel each other's explanation with respect to a given effect (observation). For example, a cloudy sky may suggest a rainy weather; whereas a shiny sky may suggest the absence of rain. In the current paper, we extend a recent neural model to handle cancellation interactions. We conduct a sensitivity analysis of this proposal on ad hoc problems put at extreme cases. Finally, we test the model on a large database and propose objective criteria to quantitatively evaluate its performance. Simulation results are very satisfactory and should encourage research.
14423228
A New Median Graph Algorithm
Median graph is an important new concept introduced to represent a set of graphs by a representative graph. Computing the median graph is an NP-Complete problem. In this paper, we propose an approximate algorithm for computing the median graph. Our algorithm performs in two steps. It first carries out a node reduction process using a clustering method to extract a subset of most representative node labels. It then searches for the median graph candidates from the reduced subset of node labels according to a deterministic strategy to explore the candidate space. Comparison with the genetic search based algorithm will be reported. This algorithm can be used to build a graph clustering algorithm.
15462956
Generalized Histogram Equalization Based on Local Characteristics
Histogram equalization (HE) and its variations have been widely used in image enhancement. Even though these approaches may enhance image contrast in an effective and efficient way, they usually face some undesired drawbacks, like loss of image details, noise amplification and over-enhancement. In this paper, we propose a generalized histogram equalization technique based on localized image analysis. Starting from designing two measures f1 and f2 to measure local characteristics around each pixel, the global statistics of these two local measures are then recorded into an extended histogram. Based on this extended histogram, we develop a procedure to generate suitable intensity transfer functions for various applications, like contrast enhancement and shadow enhancement. Experimental results show that the proposed algorithm provides a flexible and efficient way for image enhancement.
16031876
Shape deformation: SVM regression and application to medical image segmentation
This paper presents a novel landmark-based shape deformation method. This method effectively solves two problems inherent in landmark-based shape deformation: (a) identification of landmark points from a given input image, and (b) regularized deformation the shape of an an object defined in a template. The second problem is solved using a new constrained support vector machine (SVM) regression technique, in which a thin-plate kernel is utilized to provide non-rigid shape deformations. This method offers several advantages over existing landmark-based methods. First, it has a unique capability to detect and use multiple candidate landmark points in an input image to improve landmark detection. Second, it can handle the case of missing landmarks, which often arises in dealing with occluded images. We have applied the proposed method to extract the scalp contours from brain cryosection images with very encouraging results.
6620052
ScatterType: a legible but hard-to-segment CAPTCHA
The ScatterType CAPTCHA (completely automated public Turing tests to tell computers and humans apart), designed to resist character-segmentation attacks and shown to be highly legible to human readers, is analyzed for vulnerabilities and is offered for experiments in automatic attack. As introduced in Baird and Riopka (2005), 'ScatterType' challenges are images of machine-print text whose characters are cut into pieces which then drift apart, in an attempt to frustrate segment-then-recognize computer vision attacks. Analysis of experimental human legibility data has shown that better than 95% correct legibility can be achieved through judicious choice of the pseudorandom generating parameters (Baird et al., 2005). That analysis is summarized and discussed here as motivation for a discussion of potential vulnerabilities. An invitation to attack ScatterType is offered.
15695627
Representing images using points on image surfaces
This paper presents a new approach to represent an image by "verge points," which are defined as high-curvature points on the image surface. This representation offers a compact and reversible way to preserve the essence of the original image. Various applications, such as compression, edge detection, image enhancement, and image editing, can be achieved based on this representation. In this paper, the whole procedure for verge point representation is presented. Based on these verge points, image reconstruction can be easily achieved via iterative linear interpolation. These extracted verge points with compatible properties are further linked into verge curves to offer more compact representation. Progressive representation is also developed based on a multiscale extraction scheme. Some potential applications are then presented to demonstrate the versatility of this representation.
3077189
Image Segmentation with Ratio Cut
This paper proposes a new cost function, cut ratio, for segmenting images using graph-based methods. The cut ratio is defined as the ratio of the corresponding sums of two different weights of edges along the cut boundary and models the mean affinity between the segments separated by the boundary per unit boundary length. This new cost function allows the image perimeter to be segmented, guarantees that the segments produced by bipartitioning are connected, and does not introduce a size, shape, smoothness, or boundary-length bias. The latter allows it to produce segmentations where boundaries are aligned with image edges. Furthermore, the cut-ratio cost function allows efficient iterated region-based segmentation as well as pixel-based segmentation. These properties may be useful for some image-segmentation applications. While the problem of finding a minimum ratio cut in an arbitrary graph is NP-hard, one can find a minimum ratio cut in the connected planar graphs that arise during image segmentation in polynomial time. While the cut ratio, alone, is not sufficient as a baseline method for image segmentation, it forms a good basis for an extended method of image segmentation when combined with a small number of standard techniques. We present an implemented algorithm for finding a minimum ratio cut, prove its correctness, discuss its application to image segmentation, and present the results of segmenting a number of medical and natural images using our techniques.