Contains and Inside relationships within combinatorial Pyramids
Luc Brun, Walter G. Kropatsch
Abstract
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.
Create a lesson
Related papers
FlowSGS: Improving Flow Matching Priors for Inverse Imaging with Stochastic Interpolants
Tianao Li, Xinhui Qian, Emma Alexander
Should This Case Be Adapted? Prediction Fragmentation Controls Test-Time Adaptation
Lili Wang, Jing Li, Xiaowen Sun et al.
FunArt: Decoding Functional Structure and Articulation from Generative 3D Latents
Dennis Rotondi, Abdelrhman Werby, Kai O. Arras
Earth Surface Immune System for Rapid Monitoring of Unknown Anomalies
Jingtao Li, Qian Zhu, Xinyu Wang et al.
PROVIA: Procedure State Tracking for Online Mistake Detection in Egocentric Videos
Di Wen, Kailun Yang, Jimmy Weissert et al.
Refinement Is Inherently Editable: Training-Free Prompt-to-Prompt Image Editing with Generative Refinement Network
Yulong Chen, Ziqian Zhang, Haoyu Zhang et al.