Iterative Radix-2 FHT Algorithm with DIF that Minimizes Number of Computed Twiddle Factors.
Pawel TarasiukAdam WojciechowskiMykhaylo YatsymirskyyPublished in: CSIT (1) (2021)
Keyphrases
- computational complexity
- experimental evaluation
- execution times
- computational effort
- detection algorithm
- simulated annealing
- memory requirements
- theoretical analysis
- computational cost
- significant improvement
- space complexity
- worst case
- linear programming
- optimal solution
- dynamic programming
- improved algorithm
- recognition algorithm
- convergence rate
- similarity measure
- tree structure
- clustering method
- preprocessing
- computationally efficient
- learning algorithm
- small number
- probabilistic model
- search space
- k means
- ant colony optimization
- matching algorithm
- times faster
- high accuracy
- image sequences
- iterative process
- image segmentation