#### Filter Results:

#### Publication Year

1989

2006

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Thinning on binary images is an iterative layer by layer erosion until only the " skeletons " of the objects are left. This paper presents an efficient parallel thinning algorithm which produces either curve skeletons or surface skeletons from 3D binary objects. It is important that a curve skeleton is extracted directly (i.e., without creating a surface… (More)

Thinning is a frequently used method for extracting skeletons in discrete spaces. This paper presents an efficient parallel Ž thinning algorithm that directly extracts medial lines from elongated 3D binary objects i.e., without creating medial. surface. Our algorithm provides good results, preserves topology and it is easy to implement. q 1998 Elsevier… (More)

The uniqueness problem is considered when binary matrices are to be reconstructed from their absorbed row and column sums. Let the absorption coefficient µ be selected such that e µ = (1 + √ 5)/2. Then it is proved that if a binary matrix is non-uniquely determined, then it contains a special pattern of 0s and 1s called composition of alternatively… (More)

- Kálmán Palágyi, Erich Sorantin, Emese Balogh, Attila Kuba, Csongor Halmai, Balázs Erdöhelyi +1 other
- IPMI
- 2001

Skeleton is a frequently applied shape feature to represent the general form of an object. Thinning is an iterative object reduction technique for producing a reasonable approximation to the skeleton in a topology preserving way. This paper describes a sequential 3D thinning algorithm for extracting medial lines of objects in (26, 6) pictures. Our algorithm… (More)

Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techniques have been proposed. One of them is the directional (or border sequential) approach in which each iteration step is subdivided into subiterations where only border points of… (More)

The reconstruction of 8-connected but not 4-connected hv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mn min{m, n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the… (More)

The reconstruction problem is considered in those classes of discrete sets where the reconstruction can be performed from two projections in polynomial time. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex 8-connected sets, hv-convex polyominoes, and directed h-convex sets. As new results some… (More)

Discrete tomography concerns the reconstruction of functions with a finite number of values from few projections. For a number of important real-world problems, this tomography problem involves thousands of variables. Applicability and performance of discrete tomography therefore largely depend on the criteria used for reconstruction and the optimization… (More)

- Attila Kuba
- DGCI
- 1999

The problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex polyominoes, hv-convex 8-connected sets, and directed h-convex sets. We show that the reconstruction algorithms used in the… (More)

- László G. Nyúl, Judit Kanyó, Eörs Máté, Géza Makay, Emese Balogh, Márta Fidrich +1 other
- CAIP
- 2005

We present two approaches for automatically segmenting the spinal cord/canal from native CT images of the thorax region containing the spine. Different strategies are included to handle images where only part of the spinal column is visible. The algorithms require one seed point given on a slice located in the middle region of the spine, and the rest is… (More)