Realtime Hierarchical Clustering based on Boundary and Surface Statistics

09/22/2016
by   Dominik Alexander Klein, et al.
0

Visual grouping is a key mechanism in human scene perception. There, it belongs to the subconscious, early processing and is key prerequisite for other high level tasks such as recognition. In this paper, we introduce an efficient, realtime capable algorithm which likewise agglomerates a valuable hierarchical clustering of a scene, while using purely local appearance statistics. To speed up the processing, first we subdivide the image into meaningful, atomic segments using a fast Watershed transform. Starting from there, our rapid, agglomerative clustering algorithm prunes and maintains the connectivity graph between clusters to contain only such pairs, which directly touch in the image domain and are reciprocal nearest neighbors (RNN) wrt. a distance metric. The core of this approach is our novel cluster distance: it combines boundary and surface statistics both in terms of appearance as well as spatial linkage. This yields state-of-the-art performance, as we demonstrate in conclusive experiments conducted on BSDS500 and Pascal-Context datasets.

READ FULL TEXT

page 2

page 4

page 13

page 14

research
06/05/2018

Hierarchical Graph Clustering using Node Pair Sampling

We present a novel hierarchical graph clustering algorithm inspired by m...
research
06/27/2019

Clustering by the way of atomic fission

Cluster analysis which focuses on the grouping and categorization of sim...
research
08/21/2020

ConiVAT: Cluster Tendency Assessment and Clustering with Partial Background Knowledge

The VAT method is a visual technique for determining the potential clust...
research
01/31/2022

Hydra: A Real-time Spatial Perception Engine for 3D Scene Graph Construction and Optimization

3D scene graphs have recently emerged as a powerful high-level represent...
research
06/19/2019

Supervised Hierarchical Clustering with Exponential Linkage

In supervised clustering, standard techniques for learning a pairwise di...
research
10/22/2020

Cluster-and-Conquer: When Randomness Meets Graph Locality

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data min...

Please sign up or login with your details

Forgot password? Click here to reset