An algorithm for constructing edge-trees from hypergraphs.
Fanica GavrilRobert TamariPublished in: Networks (1983)
Keyphrases
- detection algorithm
- computational complexity
- high accuracy
- learning algorithm
- preprocessing
- improved algorithm
- convergence rate
- worst case
- experimental evaluation
- objective function
- np hard
- times faster
- tree structure
- clustering method
- theoretical analysis
- expectation maximization
- linear programming
- edge detection
- search space
- k means
- simulated annealing
- image registration
- segmentation algorithm
- optimal solution
- probabilistic model
- computational cost
- matching algorithm
- significant improvement
- cost function
- neural network