Clustering complexity
•
n pixels.
•
Initializing:
–
O(n) time to compute regions.
•
Loop:
–
O(n) time to find closest neighbors (could speed
up).
–
O(n) time to update distance to all neighbors.
•
At most n times through loop so O(n*n) time
total.
–
•