Login / Signup

A systolic algorithm for extracting regions from a planar graph.

Zen-Chung ShihRichard C. T. LeeS. N. Yang
Published in: Comput. Vis. Graph. Image Process. (1989)
Keyphrases
  • optimal solution
  • dynamic programming
  • computational complexity
  • probabilistic model
  • worst case
  • segmentation algorithm
  • objective function
  • k means
  • expectation maximization
  • parameter estimation