### Abstract

A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is supposed. It is mathematically interesting when the absorbed projection of a matrix element is the same as the absorbed projection of the next two consecutive elements together. We show that, in this special case, the non-uniquely determined matrices contain a certain configuration of 0s and 1s, called alternatively corner-connected components. Furthermore, such matrices can be transformed into each other by switchings the 0s and 1s of these components.

Original language | English |
---|---|

Title of host publication | Discrete Geometry for Computer Imagery - 9th International Conference, DGCI 2000, Proceedings |

Pages | 137-148 |

Number of pages | 12 |

Publication status | Published - Dec 1 2000 |

Event | 9th International Conference on Discrete Geometry for Computer Imagery, DGCI 2000 - Uppsala, Sweden Duration: Dec 13 2000 → Dec 15 2000 |

### Publication series

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

Volume | 1953 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 9th International Conference on Discrete Geometry for Computer Imagery, DGCI 2000 |
---|---|

Country | Sweden |

City | Uppsala |

Period | 12/13/00 → 12/15/00 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Reconstruction of discrete sets with absorption'. Together they form a unique fingerprint.

## Cite this

*Discrete Geometry for Computer Imagery - 9th International Conference, DGCI 2000, Proceedings*(pp. 137-148). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1953 LNCS).