6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Segmentation Based Sparse Reconstruction of Optical Coherence Tomography Images

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          <p class="first" id="P1">We demonstrate the usefulness of utilizing a segmentation step for improving the performance of sparsity based image reconstruction algorithms. In specific, we will focus on retinal optical coherence tomography (OCT) reconstruction and propose a novel segmentation based reconstruction framework with sparse representation, termed segmentation based sparse reconstruction (SSR). The SSR method uses automatically segmented retinal layer information to construct layer-specific structural dictionaries. In addition, the SSR method efficiently exploits patch similarities within each segmented layer to enhance the reconstruction performance. Our experimental results on clinical-grade retinal OCT images demonstrate the effectiveness and efficiency of the proposed SSR method for both denoising and interpolation of OCT images. </p>

          Related collections

          Most cited references59

          • Record: found
          • Abstract: not found
          • Article: not found

          Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Image super-resolution via sparse representation.

            This paper presents a new approach to single-image super-resolution, based on sparse signal representation. Research on image statistics suggests that image patches can be well-represented as a sparse linear combination of elements from an appropriately chosen over-complete dictionary. Inspired by this observation, we seek a sparse representation for each patch of the low-resolution input, and then use the coefficients of this representation to generate the high-resolution output. Theoretical results from compressed sensing suggest that under mild conditions, the sparse representation can be correctly recovered from the downsampled signals. By jointly training two dictionaries for the low- and high-resolution image patches, we can enforce the similarity of sparse representations between the low resolution and high resolution image patch pair with respect to their own dictionaries. Therefore, the sparse representation of a low resolution image patch can be applied with the high resolution image patch dictionary to generate a high resolution image patch. The learned dictionary pair is a more compact representation of the patch pairs, compared to previous approaches, which simply sample a large amount of image patch pairs, reducing the computational cost substantially. The effectiveness of such a sparsity prior is demonstrated for both general image super-resolution and the special case of face hallucination. In both cases, our algorithm generates high-resolution images that are competitive or even superior in quality to images produced by other similar SR methods. In addition, the local sparse modeling of our approach is naturally robust to noise, and therefore the proposed algorithm can handle super-resolution with noisy inputs in a more unified framework.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              A Review of Image Denoising Algorithms, with a New One

                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Medical Imaging
                IEEE Trans. Med. Imaging
                Institute of Electrical and Electronics Engineers (IEEE)
                0278-0062
                1558-254X
                February 2017
                February 2017
                : 36
                : 2
                : 407-421
                Article
                10.1109/TMI.2016.2611503
                5363080
                27662673
                33f7cbc5-ffad-4d3f-aa7b-453b7e380913
                © 2017
                History

                Comments

                Comment on this article