Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ulrich Eckhardt

dblp:65/4122 · DBLP profile ↗
← Back
11ranked-venue papers
8as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 6 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorTheory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Geometric modeling and processing · 87% Multimedia analysis and retrieval · 13%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape matching
non-rigid shape matching
0.012000
Shape Descriptors for Non-Rigid Shapes with a Single Closed Contour · CVPR 2000
Geometric modeling and processing
shape descriptor
0.012000
Shape Descriptors for Non-Rigid Shapes with a Single Closed Contour · CVPR 2000
Multimedia analysis and retrieval › multimedia analysis › multimedia content description
MPEG-7
0.012000
Shape Descriptors for Non-Rigid Shapes with a Single Closed Contour · CVPR 2000

Methods — techniques the papers use, named apart from their topics

shape descriptor comparison · 0.0
YearPublicationVenuePosition
2004 Polygonal Representations of Digital Sets
Ulrich Eckhardt, Helene Reiter
Algorithmica1
2003 Topologies for the digital spaces Z2 and Z3
Ulrich Eckhardt, Longin Jan Latecki
Comput. Vis. Image Underst.1
2000 Shape Descriptors for Non-Rigid Shapes with a Single Closed Contour
abstract
The Core Experiment CE-Shape-1 for shape descriptors performed for the MPEG-7 standard gave a unique opportunity to compare various shape descriptors for non-rigid shapes with a single closed contour. There are two main differences with respect to other comparison results reported in the literature: (1) For each shape descriptor the experiments were carried out by an institute that is in favor of this descriptor. This implies that the parameters for each system were optimally determined and the implementations were thoroughly rested. (2) It was possible to compare the performance of shape descriptors based on totally different mathematical approaches. A more theoretical comparison of these descriptors seems to be extremely hard. In this paper we report on the MPEG-7 Core Experiment CE-Shape.
Longin Jan Latecki, Rolf Lakämper, Ulrich Eckhardt
CVPR3
1999 The Euler Characteristics of Discrete Objects and Discrete Quasi-Objects
Atsushi Imiya, Ulrich Eckhardt
Comput. Vis. Image Underst.2
1995 Well-Composed Sets
Longin Jan Latecki, Ulrich Eckhardt, Azriel Rosenfeld
Comput. Vis. Image Underst.2
1993 Invariant Thinning
abstract
One of the most widely used methods for preprocessing binary images is thinning. The popularity of this method rests on the fact that considerable data reduction is achieved while retaining “essential” properties of the original image. Moreover, topological features, which cannot be verified by a genuinely parallel method (by Minsky and Papert22) are more easily treated in thinned images. For these reasons, many articles on this topic were published in the literature. Most of them are concerned with modifications of existing methods in order to yield “nicer” results out of the thinning process. Also, many results of numerical experiments are available in different publications. The aim of this paper is to show that the quite natural requirement of invariance of the results obtained by thinning leads nearly automatically to a method proposed by the authors in different publications. Moreover, this method is genuinely parallel and well-defined so that it is possible to investigate it theoretically. The practical feasibility of the method is also discussed.
Ulrich Eckhardt, Gerd Maderlechner
Int. J. Pattern Recognit. Artif. Intell.1
1992 Thinning binary pictures by a labeling procedure
abstract
Demonstrates that a specific method for thinning binary pictures which was proposed by the authors can be formulated as a labeling process thus leading to an invertible result. This can be interpreted that the 'form' of an object is retained under application of the method.>
Ulrich Eckhardt, Gerd Maderlechner
ICPR (3)1
1990 A general approach for parametrizing the Hough transform
abstract
A general parametrization for lines which is based on homogeneous coordinates is presented. It is shown that various parametrizations published in the literature can be obtained from this general scheme. By suitable parametrization of the Hough transform, favorable properties can be achieved. They include insights into the geometry of the parameter (or Hough) space, its boundedness, and consistent discretization of both image and Hough space.>
Ulrich Eckhardt, Gerd Maderlechner
ICPR (1)1
1988 The Structure of Irreducible Digital Sets Obtained by Thinning Algorithms
abstract
There exist very complex sets that contain interior points and that are irreducible under thinning. The authors investigate the structure of such irreducible sets. It is shown that irreducible sets containing interior points have essentially the structure of a counterexample given by C. Arcelli (1981). Finally the question is raised of under which conditions irreducible sets that have a large kernel of interior points are not possible. It turns out that a very simple condition will suffice.< >
Ulrich Eckhardt, Gerd Maderlechner
ICPR1
1988 A note on Rutovitz' method for parallel thinning
Ulrich Eckhardt
Pattern Recognit. Lett.1
1980 Algorithm 549: Weierstrass' Elliptic Functions [S21]
abstract
Weierstrass' ~-function and its derivative can be approximated in the complex plane by a rational expression as described in [3,4].The following programs evaluate these approximations for the case of a unit period parallelogram.They are written according to the rules given in [2].Programs PEQ and PEQ1 evaluate Weierstrass' ~-function in the equianharmonic case for a unit period parallelogram defined by the complex numberssee [1, Sec.18.13] for notation).Because of the periodicity of Weierstrass' functions it is sufficient to calculate them only in the fundamental rectangle of all z = x +/y with 1 1 ,/5 J5 --<x_~ -__<y
Ulrich Eckhardt
ACM Trans. Math. Softw.1