Alternative Architectures for the 2-D DCT Algorithm.
Chrissavgi DreAnna TatsakiThanos StouraitisConstantinos E. GoutisPublished in: ISCAS (1995)
Keyphrases
- learning algorithm
- experimental evaluation
- cost function
- computationally efficient
- dynamic programming
- single pass
- objective function
- computational cost
- computational complexity
- path planning
- matching algorithm
- theoretical analysis
- linear programming
- genetic algorithm
- input data
- expectation maximization
- detection algorithm
- times faster
- recognition algorithm
- selection algorithm
- high accuracy
- k means
- optimal solution
- neural network
- simulated annealing
- particle swarm optimization
- np hard
- significant improvement
- search space
- lower bound
- preprocessing
- memory requirements
- similarity measure
- clustering algorithm
- reduces the computational complexity