Exploiting data redundancy in computational optical imaging

    Research output: Contribution to journalArticle

    7 Citations (Scopus)

    Abstract

    We present an algorithm which exploits data redundancy
    to make computational, coherent, optical imaging more computationally
    efficient. This algorithm specifically addresses the computation of how
    light scattered by a sample is collected and coherently detected. It is of
    greatest benefit in the simulation of broadband optical systems employing
    coherent detection, such as optical coherence tomography. Although also
    amenable to time-harmonic data, the algorithm is designed to be embedded
    within time-domain electromagnetic scattering simulators such as the
    psuedo-spectral and finite-difference time domain methods. We derive the
    algorithm in detail as well as criteria which ensure accurate execution of the
    algorithm. We present simulations that verify the developed algorithm and
    demonstrate its utility. We expect this algorithm to be important to future
    developments in computational imaging.
    Original languageEnglish
    Pages (from-to)30603-30617
    Number of pages15
    JournalOptics Express
    Volume23
    Issue number24
    DOIs
    Publication statusPublished - 16 Nov 2015

    Fingerprint

    redundancy
    electromagnetic scattering
    finite difference time domain method
    simulators
    simulation
    tomography
    broadband
    harmonics

    Cite this

    @article{90d6d7ef53f842d69c6baf33ca6d612c,
    title = "Exploiting data redundancy in computational optical imaging",
    abstract = "We present an algorithm which exploits data redundancyto make computational, coherent, optical imaging more computationallyefficient. This algorithm specifically addresses the computation of howlight scattered by a sample is collected and coherently detected. It is ofgreatest benefit in the simulation of broadband optical systems employingcoherent detection, such as optical coherence tomography. Although alsoamenable to time-harmonic data, the algorithm is designed to be embeddedwithin time-domain electromagnetic scattering simulators such as thepsuedo-spectral and finite-difference time domain methods. We derive thealgorithm in detail as well as criteria which ensure accurate execution of thealgorithm. We present simulations that verify the developed algorithm anddemonstrate its utility. We expect this algorithm to be important to futuredevelopments in computational imaging.",
    author = "Peter Munro",
    year = "2015",
    month = "11",
    day = "16",
    doi = "10.1364/OE.23.030603",
    language = "English",
    volume = "23",
    pages = "30603--30617",
    journal = "Optics Express",
    issn = "1094-4087",
    publisher = "Optical Soc Amer",
    number = "24",

    }

    Exploiting data redundancy in computational optical imaging. / Munro, Peter.

    In: Optics Express, Vol. 23, No. 24, 16.11.2015, p. 30603-30617.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Exploiting data redundancy in computational optical imaging

    AU - Munro, Peter

    PY - 2015/11/16

    Y1 - 2015/11/16

    N2 - We present an algorithm which exploits data redundancyto make computational, coherent, optical imaging more computationallyefficient. This algorithm specifically addresses the computation of howlight scattered by a sample is collected and coherently detected. It is ofgreatest benefit in the simulation of broadband optical systems employingcoherent detection, such as optical coherence tomography. Although alsoamenable to time-harmonic data, the algorithm is designed to be embeddedwithin time-domain electromagnetic scattering simulators such as thepsuedo-spectral and finite-difference time domain methods. We derive thealgorithm in detail as well as criteria which ensure accurate execution of thealgorithm. We present simulations that verify the developed algorithm anddemonstrate its utility. We expect this algorithm to be important to futuredevelopments in computational imaging.

    AB - We present an algorithm which exploits data redundancyto make computational, coherent, optical imaging more computationallyefficient. This algorithm specifically addresses the computation of howlight scattered by a sample is collected and coherently detected. It is ofgreatest benefit in the simulation of broadband optical systems employingcoherent detection, such as optical coherence tomography. Although alsoamenable to time-harmonic data, the algorithm is designed to be embeddedwithin time-domain electromagnetic scattering simulators such as thepsuedo-spectral and finite-difference time domain methods. We derive thealgorithm in detail as well as criteria which ensure accurate execution of thealgorithm. We present simulations that verify the developed algorithm anddemonstrate its utility. We expect this algorithm to be important to futuredevelopments in computational imaging.

    U2 - 10.1364/OE.23.030603

    DO - 10.1364/OE.23.030603

    M3 - Article

    VL - 23

    SP - 30603

    EP - 30617

    JO - Optics Express

    JF - Optics Express

    SN - 1094-4087

    IS - 24

    ER -