Interface NonMaxCandidate.Search
- All Known Implementing Classes:
NonMaxCandidate.Relaxed
,NonMaxCandidate.Strict
- Enclosing class:
- NonMaxCandidate
public static interface NonMaxCandidate.Search
Interface for local search algorithm around the candidates
-
Method Summary
Modifier and TypeMethodDescriptionvoid
initialize
(GrayF32 intensity) Create a new instance of this search algorithm.boolean
searchMax
(int x0, int y0, int x1, int y1, int centerIdx, float val) boolean
searchMin
(int x0, int y0, int x1, int y1, int centerIdx, float val) Verifies that the candidate is a local minimum
-
Method Details
-
initialize
-
searchMin
boolean searchMin(int x0, int y0, int x1, int y1, int centerIdx, float val) Verifies that the candidate is a local minimum- Parameters:
x0
- lower extent X. Inclusivey0
- lower extent Y. Inclusivex1
- upper extent X. Exclusivey1
- upper extent Y. ExclusivecenterIdx
- index of candidate pixel in the imageval
- value at the candidate pixel- Returns:
- true if it's a local min
-
searchMax
boolean searchMax(int x0, int y0, int x1, int y1, int centerIdx, float val) -
newInstance
NonMaxCandidate.Search newInstance()Create a new instance of this search algorithm. Useful for concurrent implementations
-