Weighted microscopic image reconstruction
From MaRDI portal
Publication:831836
DOI10.1007/978-3-030-67731-2_27zbMath1490.68270OpenAlexW3124361479MaRDI QIDQ831836
Zvi Lotker, Toni Böhnlein, Amotz Bar-Noy, Dror Rawitz, David Peleg
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_27
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (5)
Vertex-weighted graphs: realizable and unrealizable domains ⋮ The generalized microscopic image reconstruction problem for hypergraphs ⋮ \textsc{Minimum Surgical Probing} with convexity constraints ⋮ On vertex-weighted graph realizations ⋮ Weighted microscopic image reconstruction
Cites Work
- Unnamed Item
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- The smallest eigenvalue of the signless Laplacian
- Spectra of graphs
- 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.
- Discrete tomography. Foundations, algorithms, and applications
- Homogeneous subsets of \(\mathbb Z^2\) and plane tilings
- 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
- 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
- The Generalized Microscopic Image Reconstruction Problem
This page was built for publication: Weighted microscopic image reconstruction
