Authors:
Darshan Batavia
1
;
Rocio Gonzalez-Diaz
2
and
Walter G. Kropatsch
1
Affiliations:
1
TU Wien, Pattern Recognition and Image Processing Group 193/03, Vienna, Austria
;
2
University of Seville, Department of Applied Math I, Seville, Spain
Keyword(s):
Cost of Contraction Kernels, Dictionary for Contraction Kernel, Irregular Image Pyramid, Slope Region.
Abstract:
A structure preserving irregular image pyramid can be computed by applying basic graph operations (contraction and removal of edges) on the 4-adjacent neighbourhood graph of an image. In this paper, we derive an objective function that classifies the edges as contractible or removable for building an irregular graph pyramid. The objective function is based on the cost of the edges in the contraction kernel (sub-graph selected for contraction) together with the size of the contraction kernel. Based on the objective function, we also provide an algorithm that decomposes a 2D image into monotonically connected regions of the image surface, called slope regions. We proved that the proposed algorithm results in a graph-based irregular image pyramid that preserves the structure and the topology of the critical points (the local maxima, the local minima, and the saddles). Later we introduce the concept of the dictionary for the connected components of the contraction kernel, consisting of s
ub-graphs that can be combined together to form a set of contraction kernels. A favorable contraction kernel can be selected that best satisfies the objective function. Lastly, we show the experimental verification for the claims related to the objective function and the cost of the contraction kernel. The outcome of this paper can be envisioned as a step towards learning the contraction kernel for the construction of an irregular image pyramid.
(More)