Book ChapterDOI
A Novel Graph Theoretic Image Segmentation Technique.
Sushmita Chandel,Gaurav Bhatnagar +1 more
- pp 323-333
Reads0
Chats0
TLDR
A novel graph theoretic image segmentation technique is proposed, which utilizes forest concept for clustering, and the core idea is to obtain a forest from the image followed by construction of average value super pixels.Abstract:
In this paper, a novel graph theoretic image segmentation technique is proposed, which utilizes forest concept for clustering. The core idea is to obtain a forest from the image followed by construction of average value super pixels. Thereafter, a merging criterion is proposed to merge these super pixels into two big classes thereby binarizing and thresholding the image separating background from foreground. Extensive experimentation and comparative analysis are finally performed on a diverse set of images to validate the technique and have noted the significant improvements.read more
Citations
More filters
Journal ArticleDOI
Image Thresholding Using the Complement Feature
TL;DR: A new feature (the complement feature) is proposed in an Eigen formulations for performing global image thresholding and the results are promising on a wide range of images as demonstrated by comparison with the well-known Otsu method.
References
More filters
Journal ArticleDOI
A Computational Approach to Edge Detection
TL;DR: There is a natural uncertainty principle between detection and localization performance, which are the two main goals, and with this principle a single operator shape is derived which is optimal at any scale.
Journal ArticleDOI
Theory of Edge Detection
David Marr,Ellen C. Hildreth +1 more
TL;DR: The theory of edge detection explains several basic psychophysical findings, and the operation of forming oriented zero-crossing segments from the output of centre-surround ∇2G filters acting on the image forms the basis for a physiological model of simple cells.
Journal ArticleDOI
Efficient Graph-Based Image Segmentation
TL;DR: An efficient segmentation algorithm is developed based on a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image and it is shown that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties.
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Related Papers (5)
Efficient graph-based image segmentation via speeded-up turbo pixels
Cevahir Cigla,A. Aydin Alatan +1 more