Puzzle imaging: Using large-scale dimensionality reduction algorithms for localization

5Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

Abstract

Current high-resolution imaging techniques require an intact sample that preserves spatial relationships. We here present a novel approach, "puzzle imaging," that allows imaging a spatially scrambled sample. This technique takes many spatially disordered samples, and then pieces them back together using local properties embedded within the sample. We show that puzzle imaging can efficiently produce high-resolution images using dimensionality reduction algorithms. We demonstrate the theoretical capabilities of puzzle imaging in three biological scenarios, showing that (1) relatively precise 3-dimensional brain imaging is possible; (2) the physical structure of a neural network can often be recovered based only on the neural connectivity matrix; and (3) a chemical map could be reproduced using bacteria with chemosensitive DNA and conjugative transfer. The ability to reconstruct scrambled images promises to enable imaging based on DNA sequencing of homogenized tissue samples. Copyright:

Cite

CITATION STYLE

APA

Glaser, J. I., Zamft, B. M., Church, G. M., & Kording, K. P. (2015). Puzzle imaging: Using large-scale dimensionality reduction algorithms for localization. PLoS ONE, 10(7). https://doi.org/10.1371/journal.pone.0131593

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free