Search Results for author:
Found 4 papers, 0 papers with code
Peekaboo - Where are the Objects? Structure Adjusting Superpixels
This paper addresses the search for a fast and meaningful image segmentation in the context of $k$-means clustering.
Mirror, Mirror, on the Wall, Who's Got the Clearest Image of Them All? - A Tailored Approach to Single Image Reflection Removal
Removing reflection artefacts from a single image is a problem of both theoretical and practical interest, which still presents challenges because of the massively ill-posed nature of the problem.
Dynamic Spectral Residual Superpixels
We consider the problem of segmenting an image into superpixels in the context of $k$-means clustering, in which we wish to decompose an image into local, homogeneous regions corresponding to the underlying objects.
Delving Into Deep Walkers: A Convergence Analysis of Random-Walk-Based Vertex Embeddings
Firstly, we prove that, under some weak assumptions, vertex embeddings derived from random walks do indeed converge both in the single limit of the number of random walks $N \to \infty$ and in the double limit of both $N$ and the length of each random walk $L\to\infty$.
