In speckle-tracking echocardiography, block-matching searches neighboring pixels to find the best-matching tissue pattern. What is the time complexity of an exhaustive block-matching search over a search window of n×n candidates?
-
A
O(log n)
-
B
O(n)
-
C
O(n²)
-
D
O(n log n)