We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Abstract. Bottom-up approaches, which rely mainly on continuity principles, are often insufficient to form accurate segments in natural images. In order to improve performance, rec...
Network Coding (NC) can be efficiently combined with the "physical layer broadcast" property of wireless mediums to facilitate mutual exchange of independent information...
In this paper we propose an error control scheme for video communications over lossy channels. The proposed algorithm uses stochastic frame buffers(SFB) to determine the expected ...
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...