Abstract

The dynamic range and fluctuations of fluorescence intensities and lifetimes in biological samples are large, demanding fast, precise, and versatile techniques. Among the high-speed fluorescence lifetime imaging microscopy (FLIM) techniques, directly sampling the output of analog single-photon detectors at GHz rates combined with computational photon counting can handle a larger range of photon rates. Traditionally, the laser clock is not sampled explicitly in fast FLIM; rather the detection is synchronized to the laser clock so that the excitation pulse train can be inferred from the cumulative photon statistics of several pixels. This has two disadvantages for sparse or weakly fluorescent samples: inconsistencies in inferring the laser clock within a frame and inaccuracies in aligning the decay curves from different frames for averaging. The data throughput is also very inefficient in systems with repetition rates much larger than the fluorescence lifetime due to significant silent regions where no photons are expected. We present a method for registering the photon arrival times to the excitation using time-domain multiplexing for fast FLIM. The laser clock is multiplexed with photocurrents into the silent region. Our technique does not add to the existing data bottleneck, has the sub-nanosecond dead time of computational photon counting based fast FLIM, works with various detectors, lasers, and electronics, and eliminates the errors in lifetime estimation in photon-starved conditions. We demonstrate this concept on two multiphoton setups of different laser repetition rates for single and multichannel FLIM multiplexed into a single digitizer channel for real-time imaging of biological samples.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.