Uploaded image for project: 'Data Management'
  1. Data Management
  2. DM-6993

Use KD Tree for matching in MatchOptimisticB

    Details

    • Templates:
    • Team:
      Alert Production

      Description

      The current matchOptimisticB algorithm uses a sophisticated search to initially solve for the mapping between the source catalog and the reference catalog using only the brightest ~hundred stars, but then verifies this solution by matching the entire contents of the source and reference catalogs by a brute-force search. This search is repeated several times as the fit converges. In crowded fields these catalogs can be very large, and matching overall can take ~30 minutes per CCD.

      Replacing this brute force search with a KD tree should provide a functionally identical result at greatly reduced computational cost.

        Attachments

          Activity

            People

            • Assignee:
              ctslater Colin Slater
              Reporter:
              ctslater Colin Slater
              Watchers:
              Colin Slater, Russell Owen, Simon Krughoff
            • Votes:
              0 Vote for this issue
              Watchers:
              3 Start watching this issue

              Dates

              • Created:
                Updated:
                Resolved:

                Summary Panel