Reconstruction in different classes of 2D discrete sets

Research output: Chapter in Book/Report/Conference proceedingConference contribution

21 Citations (Scopus)

Abstract

The problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes. The re- construction 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 al- gorithms used in the class of hv-convex 4-connected sets (polyominoes) can be used, with small modifications, for reconstructing hv-convex 8- connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to the row and column sum vectors.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages153-163
Number of pages11
Volume1568
ISBN (Print)3540656855, 9783540656852
DOIs
Publication statusPublished - 1999
Event8th International Conference on Discrete Geometry for Computer Imagery, DGCI 1999 - Marne-la-Vallee, France
Duration: Mar 17 1999Mar 19 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1568
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Conference on Discrete Geometry for Computer Imagery, DGCI 1999
CountryFrance
CityMarne-la-Vallee
Period3/17/993/19/99

Fingerprint

Convex Sets
Connected Set
Polyominoes
Reconstruction Algorithm
Class
Projection

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kuba, A. (1999). Reconstruction in different classes of 2D discrete sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1568, pp. 153-163). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1568). Springer Verlag. https://doi.org/10.1007/3-540-49126-0_12

Reconstruction in different classes of 2D discrete sets. / Kuba, A.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1568 Springer Verlag, 1999. p. 153-163 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1568).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kuba, A 1999, Reconstruction in different classes of 2D discrete sets. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1568, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1568, Springer Verlag, pp. 153-163, 8th International Conference on Discrete Geometry for Computer Imagery, DGCI 1999, Marne-la-Vallee, France, 3/17/99. https://doi.org/10.1007/3-540-49126-0_12
Kuba A. Reconstruction in different classes of 2D discrete sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1568. Springer Verlag. 1999. p. 153-163. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-49126-0_12
Kuba, A. / Reconstruction in different classes of 2D discrete sets. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1568 Springer Verlag, 1999. pp. 153-163 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{18d642b288bc4744ae80c57eda27fa64,
title = "Reconstruction in different classes of 2D discrete sets",
abstract = "The problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes. The re- construction 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 al- gorithms used in the class of hv-convex 4-connected sets (polyominoes) can be used, with small modifications, for reconstructing hv-convex 8- connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to the row and column sum vectors.",
author = "A. Kuba",
year = "1999",
doi = "10.1007/3-540-49126-0_12",
language = "English",
isbn = "3540656855",
volume = "1568",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "153--163",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Reconstruction in different classes of 2D discrete sets

AU - Kuba, A.

PY - 1999

Y1 - 1999

N2 - The problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes. The re- construction 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 al- gorithms used in the class of hv-convex 4-connected sets (polyominoes) can be used, with small modifications, for reconstructing hv-convex 8- connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to the row and column sum vectors.

AB - The problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes. The re- construction 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 al- gorithms used in the class of hv-convex 4-connected sets (polyominoes) can be used, with small modifications, for reconstructing hv-convex 8- connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to the row and column sum vectors.

UR - http://www.scopus.com/inward/record.url?scp=22644452342&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=22644452342&partnerID=8YFLogxK

U2 - 10.1007/3-540-49126-0_12

DO - 10.1007/3-540-49126-0_12

M3 - Conference contribution

AN - SCOPUS:22644452342

SN - 3540656855

SN - 9783540656852

VL - 1568

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 153

EP - 163

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -