Matching algorithms between a phonetic lattice and two types of templates - Lattice and graph.
Yutaka KobayashiYasuhisa NiimiPublished in: ICASSP (1985)
Keyphrases
- significant improvement
- graph theory
- graph matching
- data structure
- minimum spanning tree
- computationally efficient
- optimization problems
- directed graph
- computational complexity
- lattice structure
- partitioning algorithm
- graph matching algorithm
- feature points
- knn
- computational cost
- concept lattice
- learning algorithm
- stereo correspondence
- maximum flow
- association graph
- maximum clique
- graph properties