This paper presents an alternative approach to the image segmentation problem. Similar to other recent proposals a graph theoretic framework is used: Given an image a weighted undirected graph is constructed, where each pixel becomes a vertex of the graph and edges measure a relationship between pixels. Our approach differs from previous work in the way we define the edge weights. Typically the...

In this paper, we present a structure for two-channel spline graph filter bank with spectral sampling (SGFBSS) on arbitrary undirected graphs. Our proposed has many desirable properties; namely, perfect reconstruction, critical in domain, flexibility choice of shape and cut-off frequency the filters, low complexity implementation synthesis section, thanks to our closed-form derivation its spars...

The graph Laplacian plays key roles in information processing of relational data, and has analogies with the Laplacian in differential geometry. In this paper, we generalize the analogy between graph Laplacian and differential geometry to the hypergraph setting, and propose a novel hypergraph pLaplacian. Unlike the existing two-node graph Laplacians, this generalization makes it possible to ana...

This paper presents a general analytical model for studying the effect of cut-through switching on buffered MIN (multistage interconnection network) switches. We consider two types of MIN switches: input-buffered MIN and output-buffered MIN. Previous studies of cut-through switching assumed the use of 2 × 2 switching elements as a building block for the MIN; and they are not applicable to MINs ...

We have developed a program, GENECUT, for analysing datasets from gene expression profiling. GENECUT is based on a pairwise clustering method known as Normalized Cut [Shi and Malik, 1997]. GENECUT extracts global structures by progressively partitioning datasets into well-balanced groups, performing an intuitive k-way partitioning at each stage in contrast to commonly used 2-way partitioning sc...

We implement two-class classification model for image segmentation. This project draws loosely on [1]. In a preprocessing stage an image is oversegmented into superpixels by normalized cut algorithm. For a segment as a mergence of superpixels, we define two features based on similarity in brightness. We train a logistic regression classifier to combine these features. As a ground truth segmenta...

The classical approach of using minimum cut criterion for clustering is often ineffective due to the existence of outliers in the data. This paper presents a novel normalized graph sampling algorithm for clustering that improves the solution of clustering via the incorporation of a priori constraint in a stochastic graph sampling procedure. The quality of the proposed algorithm is empirically e...

Possible CP violating effects in Z → 3 jet decays are investigated. The analysis assumes the presence of CP violating Zq ¯ qG couplings. The contribution of these couplings to the Z → q ¯ qG decay width is calculated for different cut algorithms, including nonzero quark masses. Various CP–odd observables are discussed and it is shown that their sensitivity can change significantly if one uses n...

We propose a motion segmentation algorithm that aims to break a scene into its most prominent moving groups. Instead of identifying point correspondences between the image frames, the idea to nd what groups of pixels are transformed from one image frame to another. To do this, we treat the image sequence as a three dimensional spatiotemporal data set and construct a weighted graph by taking eac...

AI161380 0 Transcribed sequence with weak similarity to protein sp:P39188 (H.sapiens) ALU1_HUMAN Alu subfamily J sequence contamination warning entry