Keywords
Mean-shiftMedoidCluster analysisComputer scienceEuclidean distanceKernel (algebra)LocalityBounded functionAlgorithmPattern recognition (psychology)MathematicsArtificial intelligenceCombinatorics
Affiliated Institutions
Related Publications
Single-Image Super-Resolution Using Sparse Regression and Natural Image Prior
This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...
Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
In this letter, we show a direct relation between spectral embedding methods and kernel principal components analysis and how both are special cases of a more general learning p...
Kernel k-means
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have ...
ORB: An efficient alternative to SIFT or SURF
Feature matching is at the base of many computer vision problems, such as object recognition or structure from motion. Current methods rely on costly descriptors for detection a...
Deep convolutional neural fields for depth estimation from a single image
We consider the problem of depth estimation from a sin- gle monocular image in this work. It is a challenging task as no reliable depth cues are available, e.g., stereo corre- s...
Publication Info
- Year
- 2008
- Type
- book-chapter
- Pages
- 705-718
- Citations
- 875
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
875
OpenAlex
Cite This
Andrea Vedaldi,
Stefano Soatto
(2008).
Quick Shift and Kernel Methods for Mode Seeking.
Lecture notes in computer science
, 705-718.
https://doi.org/10.1007/978-3-540-88693-8_52
Identifiers
- DOI
- 10.1007/978-3-540-88693-8_52