Weighted microscopic image reconstruction
From MaRDI portal
Publication:6145805
DOI10.1016/j.dam.2023.11.004zbMath1530.05184MaRDI QIDQ6145805
Amotz Bar-Noy, Dror Rawitz, Toni Böhnlein, David Peleg, Zvi Lotker
Publication date: 9 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Applications of graph theory (05C90) Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- The smallest eigenvalue of the signless Laplacian
- Weighted microscopic image reconstruction
- Binary matrices under the microscope: A tomographical problem
- Signless Laplacians of finite graphs
- Scanning integer matrices by means of two rectangular windows
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Homogeneous subsets of \(\mathbb Z^2\) and plane tilings
- The generalized microscopic image reconstruction problem
- Sudoku graphs are integral
- Bipartite subgraphs and the signless Laplacian matrix
- Uniqueness in Discrete Tomography: Three Remarks and a Corollary
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Trigonometric diophantine equations (On vanishing sums of roots of unity)
- A characterization of the smallest eigenvalue of a graph
- On Double-Resolution Imaging and Discrete Tomography
- Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums
- Dynamic discrete tomography
- Towards a spectral theory of graphs based on the signless Laplacian, III
- A textbook of graph theory
This page was built for publication: Weighted microscopic image reconstruction
