Weighted Microscopic Image Reconstruction

Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Assume that we inspect a specimen represented as a collection of points. The points are typically organized on a grid structure in 2D- or 3D-space, and each point has an associated physical value. The goal of the inspection is to determine these values. Yet, measuring these values directly (by surgical probes) may damage the specimen or is simply impossible. The alternative is to employ aggregate measuring techniques (e.g., CT or MRI), whereby measurements are taken over subsets of points, and the exact values at each point are subsequently extracted by computational methods. In the Minimum Surgical Probing problem (MSP) the inspected specimen is represented by a graph G and a vector ℓ∈ Rn that assigns a value ℓi to each vertex i. An aggregate measurement (called probe) centered at vertex i captures its entire neighborhood, i.e., the outcome of a probe centered at i is Pi= ∑ jN(i){i}j where N(i) is the open neighborhood of vertex i. Bar-Noy et al. [4] gave a criterion whether the vector ℓ can be recovered from the collection of probes P={Pv|v∈V(G)} alone. However, there are graphs where P is inconclusive, i.e., there are several vectors ℓ that are consistent with P. In these cases, we are allowed to use surgical probes. A surgical probe at vertex i returns ℓi. The objective of MSP is to recover ℓ from P and G using as few surgical probes as possible. In this work, we introduce the Weighted Minimum Surgical Probing (WMSP) problem in which a vertex i may have an aggregation coefficient wi, namely Pi= ∑ jN(i)j+ wii. We show that WMSP can be solved in polynomial time. Moreover, we analyze the number of required surgical probes depending on the weight vector w. For any graph, we give two boundaries outside of which no surgical probes are needed to recover the vector ℓ. The boundaries are connected to the (Signless) Laplacian matrix. In addition, we focus on the special case, where. We explore the range of possible behaviors of WMSP by determining the number of surgical probes necessary in certain graph families, such as trees and various grid graphs. Finally, we analyze higher dimensional grids graphs. For the hypercube, when, we only need surgical probes if the dimension is odd, and when, we only need surgical probes if the dimension is even. The number of surgical probes follows the binomial coefficients.

Original languageEnglish
Title of host publicationSOFSEM 2021
Subtitle of host publicationTheory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Proceedings
EditorsTomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. Wong
PublisherSpringer Science and Business Media Deutschland GmbH
Pages373-386
Number of pages14
ISBN (Print)9783030677305
DOIs
StatePublished - 2021
Event47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021 - Bolzano-Bozen, Italy
Duration: 25 Jan 202129 Jan 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12607 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021
Country/TerritoryItaly
CityBolzano-Bozen
Period25/01/2129/01/21

Bibliographical note

Publisher Copyright:
© 2021, Springer Nature Switzerland AG.

Keywords

  • Graph realization
  • Graph spectra
  • Graph theory
  • Grid graphs
  • Image reconstruction
  • Realization algorithm

Fingerprint

Dive into the research topics of 'Weighted Microscopic Image Reconstruction'. Together they form a unique fingerprint.

Cite this