Assembling partial views is an attractive means to extend the field of view of microscope images. In this paper, we propose a semi-automated solution to achieve this goal. Its intended audience is the microscopist who desires to scan a large area while acquiring a series of partial views, but who does not wish to--or cannot--planify the path of the scan. In a first stage, this freedom is dealt with by interactive manipulation of the resulting partial views, or tiles. In a second stage, the position of the tiles is refined by a fully automatic pairwise registration process. The contribution of this paper is a strategy that determines which pairs of tiles to register, among all possible pairs.
The central tenet of our proposed strategy is that two tiles that happen to possess a large common area will register with higher accuracy than two tiles with a smaller overlap. Our strategy is then to minimize the number of pairwise registrations while maximizing the global amount of overlap, and while ensuring that the local registration efforts are sufficient to link all tiles together to yield a global mosaic. By stating this requirement in a graph-theoretic context, we are able to derive the optimal solution thanks to Kruskal's algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.