Complexity of discrete surfaces in the dividing-cubes algorithm.
Fatima BoumgharSerge MiguetJean-Marc NicodPublished in: DGCI (1996)
Keyphrases
- worst case
- preprocessing
- space complexity
- learning algorithm
- computational complexity
- segmentation algorithm
- expectation maximization
- recognition algorithm
- experimental evaluation
- dynamic programming
- computational cost
- cost function
- linear complexity
- lower bound
- optimization algorithm
- matching algorithm
- three dimensional
- surface fitting
- memory requirements
- detection algorithm
- high accuracy
- probabilistic model
- significant improvement
- surface registration
- continuous optimization
- k means
- real valued time series