Efficient output-pruning of the 2-D FFT algorithm.
Saad BouguezelM. Omair AhmadM. N. S. SwamyPublished in: ISCAS (3) (2004)
Keyphrases
- theoretical analysis
- preprocessing
- np hard
- high efficiency
- computational cost
- pruning strategy
- pruning algorithm
- search space
- k means
- improved algorithm
- times faster
- dynamic programming
- experimental evaluation
- high accuracy
- matching algorithm
- detection algorithm
- input data
- computationally efficient
- learning algorithm
- tree construction
- segmentation algorithm
- simulated annealing
- optimal solution
- similarity measure
- feature selection
- optimization algorithm
- linear programming
- cost function
- recognition algorithm
- significant improvement
- highly efficient
- exhaustive search
- single pass
- objective function