Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints
From MaRDI portal
Publication:1932818
DOI10.1007/s10851-010-0223-5zbMath1255.68171OpenAlexW2121694680MaRDI QIDQ1932818
Fredrik Kahl, Carl Olsson, Anders B. Eriksson
Publication date: 22 January 2013
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://eprints.qut.edu.au/108206/1/108206.pdf
Related Items (7)
Exhaustive and efficient constraint propagation: a graph-based learning approach and its applications ⋮ Grouping objects in multi-band images using an improved eigenvector-based algorithm ⋮ Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints ⋮ \textit{Kernel cuts}: kernel and spectral clustering meet regularization ⋮ A Variational Image Segmentation Model Based on Normalized Cut with Adaptive Similarity and Spatial Regularization ⋮ A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere ⋮ A fast constrained image segmentation algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints
- A Truncated RQ Iteration for Large Scale Eigenvalue Calculations
- Nonlinear Programming
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Contour and texture analysis for image segmentation
This page was built for publication: Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints