We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz