Computer Vision - ECCV 2004

DOI10.1007/B97866zbMATH Open1098.68883OpenAlexW4246908616MaRDI QIDQ5712969FDOQ5712969

Authors:

Publication date: 27 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b97866

Recommendations

• KDE paring and a faster mean shift algorithm
• Mean shift research and applications
• Mean shift-based clustering
• Mean shift spectral clustering
• A fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45)

Cited In (9)

• The mean shift algorithm and its relation to kernel regression
• Nonlinear mean shift over Riemannian manifolds
• Interactive image segmentation by maximal similarity based region merging
• Asymptotic stability of equilibrium points of mean shift algorithm
• On some convergence properties of the subspace constrained mean shift
• KDE paring and a faster mean shift algorithm
• Title not available (Why is that?)
• A sufficient condition for the convergence of the mean shift algorithm with Gaussian kernel
• Signature-based perceptual nearness: application of near sets to image retrieval

Uses Software

• KernSmooth

This page was built for publication: Computer Vision - ECCV 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712969)