VECTORIZATION APPROACH TO ISOLATING LOCAL MAXIMA IN AN N-DIMENSIONAL DATASET
First Claim
1. A local maxima detection system, the system comprising:
- an interface configured to receive at least one array of available candidate hits, each hit including a location in N dimensions and a power value, the array of candidate hits being sorted based on the power value;
a neighboring hits module configured to, for each candidate hit of the array, identify a plurality of neighboring hits of the candidate hit in the array of available candidate hits; and
a candidate hit removal module configured to remove a subset of the plurality of neighboring hits within an isolation region about the candidate hit from the array of available candidate hits.
1 Assignment
0 Petitions
Accused Products
Abstract
Identification of maximum power scatters in an N-dimensional dataset generally requires two basic steps. The first step is to identify the max power scatters of the dataset and the second step removes neighboring power scatters (e.g., “hits”) of lower power. Current naïve approaches utilize an inefficient and computationally intensive brute force implementation which requires multiple comparisons of each initial “hit” power to all “hits” of lesser power. Such brute force implementations require 2×N×(M−1)! comparisons, where N is the number of dimensions and M is the number of “hits.” Embodiments of the present disclosure utilize vectorization to identify a plurality of neighboring hits for each max power scatter and removes the neighboring hits of lesser power that are within a predetermined isolation region. Advantageously, embodiments of the present invention perform M−1 comparisons.
17 Citations
16 Claims
-
1. A local maxima detection system, the system comprising:
-
an interface configured to receive at least one array of available candidate hits, each hit including a location in N dimensions and a power value, the array of candidate hits being sorted based on the power value; a neighboring hits module configured to, for each candidate hit of the array, identify a plurality of neighboring hits of the candidate hit in the array of available candidate hits; and a candidate hit removal module configured to remove a subset of the plurality of neighboring hits within an isolation region about the candidate hit from the array of available candidate hits. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of maximum location detection, the method comprising:
-
receiving at least one array of available candidate hits, each hit including a location in N dimensions and a power value, the array of candidate hits being sorted based on the power value; for each candidate hit of the array, identifying a plurality of neighboring hits of the candidate hit in the array of available candidate hits; and removing a subset of the plurality of neighboring hits within an isolation region about the candidate hit from the array of available candidate hits. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
Specification