Contains and Inside relationships within combinatorial Pyramids

01/24/2007
by   Luc Brun, et al.
0

Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of partitions. The different graph models used within the irregular pyramid framework encode different types of relationships between regions. This paper compares different graph models used within the irregular pyramid framework according to a set of relationships between regions. We also define a new algorithm based on a pyramid of combinatorial maps which allows to determine if one region contains the other using only local calculus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2009

Combinatorial pyramids and discrete geometry for energy-minimizing segmentation

This paper defines the basis of a new hierarchical framework for segment...
research
12/12/2007

Hierarchy construction schemes within the Scale set framework

Segmentation algorithms based on an energy minimisation framework often ...
research
03/29/2018

Iterative Visual Reasoning Beyond Convolutions

We present a novel framework for iterative visual reasoning. Our framewo...
research
12/24/2019

Maximum independent sets in (pyramid, even hole)-free graphs

A hole in a graph is an induced cycle with at least 4 vertices. A graph ...
research
08/11/2021

Person Re-identification via Attention Pyramid

In this paper, we propose an attention pyramid method for person re-iden...
research
07/18/2020

Combinatorial and computational investigations of Neighbor-Joining bias

The Neighbor-Joining algorithm is a popular distance-based phylogenetic ...
research
12/16/2012

Visual Objects Classification with Sliding Spatial Pyramid Matching

We present a method for visual object classification using only a single...

Please sign up or login with your details

Forgot password? Click here to reset