Grouping and Recognition of Dot Patterns with Straight Offset Polygons

03/02/2015
by   Toshiro Kubota, et al.
0

When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has not been reproduced algorithmically on computers. We introduce a new algorithm that groups a set of dots into multiple non-disjoint subsets. It connects the dots into a spanning tree using the proximity cue. It then applies the straight polygon transformation to an initial polygon derived from the spanning tree. The straight polygon divides the space into polygons recursively and each polygon can be viewed as grouping of a subset of the dots. The number of polygons generated is O(n). We also introduce simple shape selection and recognition algorithms that can be applied to the grouping result. We used both natural and synthetic images to show effectiveness of these algorithms.

READ FULL TEXT
research
02/19/2020

The Tree Stabbing Number is not Monotone

Let P ⊆ℝ^2 be a set of points and T be a spanning tree of P. The stabbin...
research
03/29/2012

Global preferential consistency for the topological sorting-based maximal spanning tree problem

We introduce a new type of fully computable problems, for DSS dedicated ...
research
10/04/2022

Spanning tree methods for sampling graph partitions

In the last decade, computational approaches to graph partitioning have ...
research
05/26/2020

ALBA : Reinforcement Learning for Video Object Segmentation

We consider the challenging problem of zero-shot video object segmentati...
research
04/02/2021

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

This paper presents new parallel algorithms for generating Euclidean min...
research
09/24/2013

Solving OSCAR regularization problems by proximal splitting algorithms

The OSCAR (octagonal selection and clustering algorithm for regression) ...
research
08/12/2023

Optimal FIFO grouping in public transit networks

This technical report is about grouping vehicles (so-called trips) in pu...

Please sign up or login with your details

Forgot password? Click here to reset