Results 1 
8 of
8
Efficient Similarity Join of Large Sets of Moving Object Trajectories
"... We address the problem of performing efficient similarity join for large sets of moving objects trajectories. Unlike previous approaches which use a dedicated index in a transformed space, our premise is that in many applications of locationbased services, the trajectories are already indexed in th ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We address the problem of performing efficient similarity join for large sets of moving objects trajectories. Unlike previous approaches which use a dedicated index in a transformed space, our premise is that in many applications of locationbased services, the trajectories are already indexed in their native space, in order to facilitate the processing of common spatiotemporal queries, e.g., range, nearest neighbor etc. We introduce a novel distance measure adapted from the classic Fréchet distance, which can be naturally extended to support lower/upper bounding using the underlying indices of moving object databases in the native space. This, in turn, enables efficient implementation of various trajectory similarity joins. We report on extensive experiments demonstrating that our methodology provides performance speedup of trajectory similarity join by more than 50 % on average, while maintaining effectiveness comparable to the wellknown approaches for identifying trajectory similarity based on timeseries analysis. 1
Journal of Structural Biology
, 2006
"... www.elsevier.com/locate/yjsbi Multiresolution anchorpoint registration of biomolecular assemblies and their components ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
www.elsevier.com/locate/yjsbi Multiresolution anchorpoint registration of biomolecular assemblies and their components
Learning of form models from exemplars
 Structural, Syntactic, and Statistical Pattern Recognition  Proceedings of the SSPR 2004, volume 3138 of Lecture Notes in Computer Science
, 2004
"... Abstract. Modelbased image recognition requires a general model of the object that should be detected in an image. In many applications such models are not known apriori instead of they must be learnt from examples. Real world applications such as the recognition of biological objects in images ca ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Modelbased image recognition requires a general model of the object that should be detected in an image. In many applications such models are not known apriori instead of they must be learnt from examples. Real world applications such as the recognition of biological objects in images cannot be solved by one general model but a lot of different models are necessary in order to handle the natural variations of the appearance of the objects of a certain class. Therefore we are talking about casebased object recognition. In this paper we describe how the shape of an object can be extracted from images and input into a case description. These acquired number of cases we mine for more general shapes so that at the end a case base of shapes can be constructed and applied for casebased object recognition.
Maximum LinePair Stabbing Problem and its Variations
, 2005
"... We study the Maximum LinePair Stabbing Problem: Given a planar point set S, find a pair of parallel lines within distance ɛ from each others such that the number of points of S that intersect (stab) the area in between the two lines is maximized. There exists an algorithm that computes maximum stab ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the Maximum LinePair Stabbing Problem: Given a planar point set S, find a pair of parallel lines within distance ɛ from each others such that the number of points of S that intersect (stab) the area in between the two lines is maximized. There exists an algorithm that computes maximum stabbing in O(S  2) time and space. We give a more spaceefficient solution; the time complexity increases to O(S  2 log S), but the space reduces to O(S). Our algorithm also extends to a dual problem where one searches for a line stabbing maximum number of variable size circles; as far as we know, this problem has previously been studied only on fixed size circles. A variant of the stabbing problem equals a onedimensional point set matching problem under translations, scalings, and errors. We study a version of this problem, where the matching has to be a onetoone mapping. Existing techniques based on incremental maintenance of maximum matching using augmenting paths yield O((mn)³) time solution, where m and n are the sizes of the point sets to be matched. Our new algorithm achieves O((mn)² (m + n)) time. The improvement is based on an observation that in our case the matchgraph has a regular shape, and the maximum matching can be updated more efficiently.
Distanzfunktionen für Polygone und ihre Anwendung . . .
, 1997
"... Unter Autonomie versteht man nicht nur die Fähigkeit, daÿ sich ein Fahrzeug nach einer Standortinitialisierung selbständig in einem abgegrenzten Gelände bewegt. Es gehört ebenso dazu, daÿ es diese anfängliche Positionsbestimmung ohne fremde Hilfe durchführen kann. Dabei hat das autonome System zun ..."
Abstract
 Add to MetaCart
Unter Autonomie versteht man nicht nur die Fähigkeit, daÿ sich ein Fahrzeug nach einer Standortinitialisierung selbständig in einem abgegrenzten Gelände bewegt. Es gehört ebenso dazu, daÿ es diese anfängliche Positionsbestimmung ohne fremde Hilfe durchführen kann. Dabei hat das autonome System zunächst meist keinerlei Information über den aktuellen Standort auÿer einer Karte, in der das Gelände eingezeichnet ist. Derartige Situationen treten nicht nur zu Beginn des Einsatzes eines Roboters auf, sondern auch nach technischen Ausnahmesituationen, wie Stromausfällen oder einem Versagen der Sensorik. Selbst wenn das autonome System seinen Standort kennt und nun bei allen Bewegungen die Veränderung der Koordinaten seiner Position protokolliert, sind nach einer gewissen Zeit groÿe Abweichungen des berechneten Standorts vom tatsächlich zutreenden mit den heutigen Mitteln der Technik nicht zu verhindern. Durch unebene oder weiche Böden, aber auch Ungenauigkeiten im Bewegungsapparat des Fahrzeugs kommt es unweigerlich zu einem Abdriften von der beabsichtigten Bahn. Auch dieses Problem kann durch eine regelmäÿige StandortNeubestimmung zumindest gelindert werden. Indiskutabel ist jedenfalls der Eingri eines Menschen in immer wiederkehrenden Abständen, der die Position des Roboters korrigiert. Zur Lokalisation gibt es vor allem zwei wesentliche Grundrichtungen. Die eine Möglichkeit benutzt Landmarken, d.h. Markierungen an Wänden oder auf dem Untergrund, die der Roboter erkennt und danach seinen Kartenstandort ermitteln kann. Die andere
An FPTAS for Computing the Similarity of Abstract. threedimensional Point Sets
"... We present an FPTAS for a combinatorial optimization problem which is motivated by a problem in drugdesign. The problem is as follows. One is given two finite subsets A, B of points in threedimensional space which represent the centers of atoms of two molecules. The objective function is large if ..."
Abstract
 Add to MetaCart
(Show Context)
We present an FPTAS for a combinatorial optimization problem which is motivated by a problem in drugdesign. The problem is as follows. One is given two finite subsets A, B of points in threedimensional space which represent the centers of atoms of two molecules. The objective function is large if there are an appropriate rigid motion M, subsets S ⊂ A and T ⊂ B of the same size and a bijective function f from S to M(T) such that S  is sufficiently large and the root mean squared distance between S and f(S) is small. The object is to find M and f such that the objective function is maximized. The corresponding maximum value defines the similarity score between two molecules.
A SpacesBased Platform Enabling Responsive Environments
"... Abstract—Space Integration Services is a software communication platform that enables the seamless integration of sensors, actuators, and applicationlogic components through a multispace model and a spacesbased publish/subscribe mechanism. The underlying model is based on finite spaces only, thu ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Space Integration Services is a software communication platform that enables the seamless integration of sensors, actuators, and applicationlogic components through a multispace model and a spacesbased publish/subscribe mechanism. The underlying model is based on finite spaces only, thus the applicationlogic components that need to reason on spaces like the geodetic or the Cartesian ones, are obliged to use a discretized version of those spaces and to maintain the correspondence between “real ” locations and their discretized representation if they are interested in exploiting the services offered by the platform. To compensate for these limitations, the platform has been extended in order to add support for spaces with an infinite number of locations, (e.g., spaces described by continuous coordinates, such as geodetic or Cartesian spaces). Such extension is essential for the use of SIS also as enabling platform for outdoor pervasive