Due to the recent improvements in laser scanning technology, 3D visualization and modelling, there is an increasing need for tools supporting the automatic search for 3D objects in archives. In this paper we describe a new geometric approach to 3D shape comparison and retrieval for arbitrary objects described by 3D polyhedral models that may contain gaps. In contrast with existing approaches, o...

In this work, we introduce a novel decoding algorithm named “Reliability Ratio Weighted Bit Flipping–Sum Product” (RRWBFSP) is proposed for regular LDPC codes. “Sum [4] and Flipping” [6] are two separate methods that combined in the new algorithm. The simulations show to exceed Sum-Product algorithms by 0.34 dB. addition, when compared Sum-Product, RRWBFSP approach has about same computational ...

Arbitration is the process of settling a conflict between two or more persons[Liberatore and Schaerf, 1995; Revesz, 1993; 1997]. The first version of the arbitration operator between knowledge bases is proposed in [Revesz, 1993] via the socalled model-fitting operators. The postulates for modelfitting operators and the corresponding semantic characterization are presented. Arbitration is define...

We present a pseudo-metric for weighted point sets. There are numerous situations, for example in the shape description domain, where the individual points in a feature point set have an associated attribute, a weight. A distance function that incorporates this extra information apart from the points' position can be very useful for matching and retrieval purposes. There are two main approaches...

This paper proposes an algorithm for simplifying point features on maps based on the multiplicatively weighted Voronoi diagram (MWVD). To ensure statistical, thematic, metric, and topological information contained in the original point features can be transmitted correctly after simplification, the algorithm selects corresponding measures to quantify these four types of information, and integra...

A class of translation bounded complex measures, which have the form of weighted Dirac combs, on locally compact Abelian groups is investigated. Given such a Dirac comb, we are interested in its diffraction spectrum which emerges as the Fourier transform of the autocorrelation measure. We present a sufficient set of conditions to ensure that the diffraction measure is a pure point measure. Simu...

Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, there are only few works dealing with distributed evaluation of regular path queries. In this paper we present a message-efficient and truly distributed algorithm for computing the answer to regular path queries in a mult...