#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2003

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Gisela Klette
- IWCIA
- 2006

Branch indices of points on curves (introduced by Urysohn and Menger) are of basic importance in the mathematical theory of curves, defined in Euclidean space. This paper applies the concept of branch points in the 3D orthogonal grid, motivated by the need to analyze curve-like structures in digital images. These curve-like structures have been derived as… (More)

- Gisela Klette
- DGCI
- 2011

One version of the Euclidean shortest path problem (ESP) is to find the shortest path such that it starts at p and ends at q and it avoids passing through an unordered set of pairwise disjoint obstacles. This paper describes an approximate algorithm for solving this ESP problem for two points p and q and a finite set of pairwise disjoint spheres in R not… (More)

- Bodo Rosenhahn, Uwe G. Kersting, Katie Powell, Reinhard Klette, Gisela Klette, Hans-Peter Seidel
- Machine Vision and Applications
- 2006

In this paper an approach for motion capture of dressed people is presented. A cloth draping method is incorporated in a silhouette based motion capture system. This leads to a simultaneous estimation of pose, joint angles, cloth draping parameters and wind forces. An error functional is formalized to minimize the involved parameters simultaneously. This… (More)

- Rivindu Perera, Parma Nand, Gisela Klette
- International Semantic Web Conference
- 2015

Linked Open Data (LOD) is growing rapidly as a source of structured knowledge used in a variety of text processing applications. However, the applications using the LOD need to be able to mediate between the front end user interfaces and LOD. This often requires a natural language interpretation of this structured, linked data. We demonstrate a middle-tier… (More)

- Gisela Klette
- CAIP
- 2003

- Gisela Klette, Mian Pan
- IWCIA
- 2004

- Gisela Klette
- 2010 25th International Conference of Image and…
- 2010

The calculation of relative convex hulls is a special subject in computational geometry (shortest paths), in image analysis (calculation of features), in robotics (shortest path of a robot in a constrained environment), and so forth. The relative convex hull of a simple polygon A, that is contained in a second simple polygon B, is also the minimum perimeter… (More)

- Gisela Klette, Mian Pan
- 2005

This paper proposes algorithms for the analysis of sets of confocal microscope images of human brain tissue which constitute a 3D volume. The identification of suitable features for curve-like structures in these volumes is required for subsequent classification. The final goal is the distinction between brain tissues of patients with different degrees of… (More)

- Gisela Klette
- Computer Vision and Image Understanding
- 2013

The relative convex hull, or the minimum-perimeter polygon (MPP) of a simple polygon A, contained in a second polygon B, is a unique polygon in the set of nested polygons between A and B. The computation of the minimum-length polygon (MLP), as a special case for isothetic polygons A and B, is useful for various applications in image analysis and robotics.… (More)