Logarithmic Tapering Graph Pyramid
نویسندگان
چکیده
We present a new method to determine contraction kernels for the construction of graph pyramids. The new method works with undirected graphs and yields a reduction factor of at least 2.0. This means that with our method the number of vertices in the subgraph induced by any set of contractible edges is reduced to half or less by a single parallel contraction. Our method yields better reduction factors than the stochastic decimation algorithm, in all tests. The lower bound of the reduction factor becomes crucial with large images.
منابع مشابه
Irregular Laplacian Graph Pyramid
This paper presents a novel image representation, which incorporates the principles of Laplacian Pyramid into the irregular graph pyramid. The drawback of the regular Laplacian Pyramid is their lack to keep the topological structure of the image, due to the contraction process in building the Gaussian Pyramid. Irregular graph pyramid is able to hierarchically represent the topological structure...
متن کاملThe pyramid quantized Weisfeiler-Lehman graph representation
Graphs are flexible and powerful representations for non-vectorial data with inherited structure. Exploiting these data requires the ability to efficiently represent and compare graphs. Unfortunately, standard solutions to these problems are either NP-hard, hard to parametrize or not expressive enough. Graph kernels, that have been introduced in the machine learning community the last decade, i...
متن کاملWavelet Speckle Reduction for Sar Imagery Based on Edge Detection
This paper introduces a wavelet transform speckle reduction algorithm for Synthetic Aperture Radar (SAR) imagery based on edge detection. Existing speckle algorithm can efficiently reduce the speckle effect but unfortunately also, to some degree, smear edges and blur images. In this paper, the original image is firstly logarithmic transformed and decomposed with multi-scale wavelet transform. F...
متن کاملConnectionist Pyramid Powered Perceptual Organization: Visual Grouping with Hierarchical Structures of Neural Networks
This paper describes a new approach for organizing image data. Perceptual organization in biological vision is the process of pre-attentively grouping and structuring perceptual information into shapes and forms. In computer vision, processes like these are required in order to transform pixels into structural forms that can be used in higher-level interpretation. Pyramidal structures have been...
متن کاملPaths Lengths in Stochastic Graph Image Pyramid1)
In many applications some parts of an image are of special interest. We present in this paper results of the analysis of the vertical path lengths in stochastic graph image pyramids. Such path lengths evaluate the efficiency of the pyramid structure needed e.g. for algorithms which derive object properties from the object pixels in the image. Our aim is to build stochastic image pyramid locally...
متن کامل