12 citations · 19 across the 4 of their papers we have counts for
4 papers
Smooth and iteratively Restore: A simple and fast edge-preserving smoothing model
Philipp Kniefacz, Walter Kropatsch
In image processing, it can be a useful pre-processing step to smooth away small structures, such as noise or unimportant details, while retaining the overall structure of the imag…
The Minimum Spanning Tree of Maximum Entropy
Samuel de Sousa, Walter G. Kropatsch
In computer vision, we have the problem of creating graphs out of unstructured point-sets, i.e. the data graph. A common approach for this problem consists of building a triangulat…
Invariant Representative Cocycles of Cohomology Generators using Irregular Graph Pyramids
Rocio Gonzalez-Diaz, Adrian Ion, Mabel Iglesias-Ham +1
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the struc…
Contains and Inside relationships within combinatorial Pyramids
Luc Brun, Walter G. Kropatsch
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 parti…