Keywords
Mean-shiftMedoidCluster analysisComputer scienceEuclidean distanceKernel (algebra)LocalityBounded functionAlgorithmPattern recognition (psychology)MathematicsArtificial intelligenceCombinatorics
Affiliated Institutions
Related Publications
Shape Classification Using the Inner-Distance
Part structure and articulation are of fundamental importance in computer and human vision. We propose using the inner-distance to build shape descriptors that are robust to art...
Mean shift: a robust approach toward feature space analysis
A general non-parametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational...
Clustering appearances of objects under varying illumination conditions
We introduce two appearance-based methods for clustering a set of images of 3D (three-dimensional) objects, acquired under varying illumination conditions, into disjoint subsets...
Cross-Domain Person Reidentification Using Domain Adaptation Ranking SVMs
This paper addresses a new person reidentification problem without label information of persons under nonoverlapping target cameras. Given the matched (positive) and unmatched (...
Similarity Searching in Databases of Flexible 3D Structures Using Autocorrelation Vectors Derived from Smoothed Bounded Distance Matrices
This paper presents an exploratory study of a novel method for flexible 3-D similarity searching based on autocorrelation vectors and smoothed bounded distance matrices. Althoug...
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