Abstract

BackgroundIn the context of biomarker discovery and molecular characterization of diseases, laser capture microdissection is a highly effective approach to extract disease-specific regions from complex, heterogeneous tissue samples. For the extraction to be successful, these regions have to satisfy certain constraints in size and shape and thus have to be decomposed into feasible fragments.ResultsWe model this problem of constrained shape decomposition as the computation of optimal feasible decompositions of simple polygons. We use a skeleton-based approach and present an algorithmic framework that allows the implementation of various feasibility criteria as well as optimization goals. Motivated by our application, we consider different constraints and examine the resulting fragmentations. We evaluate our algorithm on lung tissue samples in comparison to a heuristic decomposition approach. Our method achieved a success rate of over 95% in the microdissection and tissue yield was increased by 10–30%.ConclusionWe present a novel approach for constrained shape decomposition by demonstrating its advantages for the application in the microdissection of tissue samples. In comparison to the previous decomposition approach, the proposed method considerably increases the amount of successfully dissected tissue.

Highlights

  • Laser capture microdissection (LCM) [1] is a highly effective approach to extract specific cell populations from complex, heterogeneous tissue samples

  • Experimental setup For the evaluation of our algorithms, we conducted LCM experiments on shapes obtained from infrared microscopic images of 10 thin sections of Formalin-fixed paraffin-embedded (FFPE) lung tissue samples from patients with non-small-cell lung carcinoma

  • In this paper, we presented a skeleton-based decomposition method for simple polygons as a novel approach to decompose disease-specific regions in tissue samples while aiming to optimize the amount of tissue obtained by laser capture microdissection (LCM)

Read more

Summary

Results

We model this problem of constrained shape decomposition as the computation of optimal feasible decompositions of simple polygons. We use a skeleton-based approach and present an algorithmic framework that allows the implementation of various feasibility criteria as well as optimization goals. We consider different constraints and examine the resulting fragmentations. We evaluate our algorithm on lung tissue samples in comparison to a heuristic decomposition approach. Our method achieved a success rate of over 95% in the microdissection and tissue yield was increased by 10–30%

Conclusion
Introduction
Experimental results
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call