The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Edge detection in images has been a fundamental problem
in computer vision from its early days. Edge detection
on surfaces, on the other hand, has received much less attention.
...
In signal processing, the approach of the analytic signal is a capable and often used method. For signals of finite length, quadrature filters yield a bandpass filtered approxim...
The Non-Local Means (NLM) method of denoising has received considerable attention in the image processing community due to its performance, despite its simplicity. In this paper, ...
— We present a global vector field computation algorithm in configuration spaces for smooth feedback motion planning. Our algorithm performs approximate cell decomposition in t...