Normalized Cuts And Image Segmentation
Download Normalized Cuts And Image Segmentation PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Normalized Cuts And Image Segmentation book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Normalized Cuts and Image Segmentation
Abstract: "We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups. We show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion. We have applied this approach to segmenting static images as well as motion sequences and found results very encouraging."
Compassionately Conservative Normalized Cuts for Image Segmentation
"Image segmentation is a process used in computer vision to partition an image into regions with similar characteristics. One category of image segmentation algorithms is graph-based, where pixels in an image are represented by vertices in a graph and the similarity between pixels is represented by weighted edges. A segmentation of the image can be found by cutting edges between dissimilar groups of pixels in the graph, leaving different clusters or partitions of the data. A popular graph-based method for segmenting images is the Normalized Cuts (NCuts) algorithm, which quantifies the cost for graph partitioning in a way that biases clusters or segments that are balanced towards having lower values than unbalanced partitionings. This bias is so strong, however, that the NCuts algorithm avoids any singleton partitions, even when vertices are weakly connected to the rest of the graph. For this reason, we propose the Compassionately Conservative Normalized Cut (CCNCut) objective function, which strikes a better compromise between the desire to avoid too many singleton partitions and the notion that all partitions should be balanced. We demonstrate how CCNCut minimization can be relaxed into the problem of computing Piecewise Flat Embeddings (PFE) and provide an overview of, as well as two efficiency improvements to, the Splitting Orthogonality Constraint (SOC) algorithm previously used to approximate PFE. We then present a new algorithm for computing PFE based on iteratively minimizing a sequence of reweighted Rayleigh quotients (IRRQ) and run a series of experiments to compare CCNCut-based image segmentation via SOC and IRRQ to NCut-based image segmentation on the BSDS500 dataset. Our results indicate that CCNCut-based image segmentation yields more accurate results with respect to ground truth than NCut-based segmentation, and IRRQ is less sensitive to initialization than SOC."--Abstract.
Advances in Visual Computing
Author: George Bebis
language: en
Publisher: Springer Science & Business Media
Release Date: 2008-11-13
The two volume set LNCS 5358 and LNCS 5359 constitutes the refereed proceedings of the 4th International Symposium on Visual Computing, ISVC 2008, held in Las Vegas, NV, USA, in December 2008. The 102 revised full papers and 70 poster papers presented together with 56 full and 8 poster papers of 8 special tracks were carefully reviewed and selected from more than 340 submissions. The papers are organized in topical sections on computer graphics, visualization, shape/recognition, video analysis and event recognition, virtual reality, reconstruction, motion, face/gesture, and computer vision applications. The 8 additional special tracks address issues such as object recognition, real-time vision algorithm implementation and application, computational bioimaging and visualization, discrete and computational geometry, soft computing in image processing and computer vision, visualization and simulation on immersive display devices, analysis and visualization of biomedical visual data, as well as image analysis for remote sensing data.