54
views
0
recommends
+1 Recommend
0 collections
    4
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Crowded Cluster Cores: Algorithms for Deblending in Dark Energy Survey Images

      Preprint

      Read this article at

      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

          Deep optical images are often crowded with overlapping objects. This is especially true in the cores of galaxy clusters, where images of dozens of galaxies may lie atop one another. Accurate measurements of cluster properties require deblending algorithms designed to automatically extract a list of individual objects and decide what fraction of the light in each pixel comes from each object. We present new software called the Gradient And INterpolation based deblender (GAIN) as a secondary deblender to improve deblending the images of cluster cores. This software relies on using image intensity gradient and using an image interpolation technique usually used to correct flawed terrestrial digital images. We test this software on Dark Energy Survey coadd images. GAIN helps extracting unbiased photometry measurement for blended sources. It also helps improving detection completeness while introducing only a modest amount of spurious detections. For example, when applied to deep images simulated with high level of deblending difficulties, this software improves detection completeness from 91% to 97% for sources above the 10? limiting magnitude at 25.3 mag. We expect this software to be a useful tool for cluster population measurements.

          Related collections

          Most cited references2

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

          A fast marching level set method for monotonically advancing fronts.

          A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential equation for a propagating level set function and use techniques borrowed from hyperbolic conservation laws. Topological changes, corner and cusp development, and accurate determination of geometric properties such as curvature and normal direction are naturally obtained in this setting. This paper describes a particular case of such methods for interfaces whose speed depends only on local position. The technique works by coupling work on entropy conditions for interface motion, the theory of viscosity solutions for Hamilton-Jacobi equations, and fast adaptive narrow band level set methods. The technique is applicable to a variety of problems, including shape-from-shading problems, lithographic development calculations in microchip manufacturing, and arrival time problems in control theory.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            An Image Inpainting Technique Based on the Fast Marching Method

              Bookmark

              Author and article information

              Journal
              2014-09-09
              2015-12-02
              Article
              10.1086/684053
              1409.2885
              d8fcb318-b9f3-40c5-8be8-0b77c4530886

              http://arxiv.org/licenses/nonexclusive-distrib/1.0/

              History
              Custom metadata
              Published on PASP
              astro-ph.IM

              Instrumentation & Methods for astrophysics
              Instrumentation & Methods for astrophysics

              Comments

              Comment on this article