Generic parallel data structures and algorithms to GPU superpixel image segmentation

Component-based 2-/3-dimensional nearest neighbor search based on Elias method to GPU parallel 2D/3D Euclidean Minimum Spanning Tree Problem

(2020) Wen-Bao Qiao et al.   APPLIED SOFT COMPUTING

k-means as a variational EM approximation of Gaussian mixture models

(2019) Jörg Lücke et al.   PATTERN RECOGNITION LETTERS

GPU implementation of Borůvka’s algorithm to Euclidean minimum spanning tree based on Elias method

(2018) Wen-Bao Qiao et al.   APPLIED SOFT COMPUTING

A GPU-accelerated parallel K-means algorithm

(2017) S. Cuomo et al.   COMPUTERS & ELECTRICAL ENGINEERING

Robust Superpixel Tracking

(2014) Fan Yang et al.   IEEE TRANSACTIONS ON IMAGE PROCESSING

SLIC Superpixels Compared to State-of-the-Art Superpixel Methods

(2012) R. Achanta et al.   IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE

A Database and Evaluation Methodology for Optical Flow

(2010) Simon Baker et al.   INTERNATIONAL JOURNAL OF COMPUTER VISION

The planar k-means problem is NP-hard

(2010) Meena Mahajan et al.   THEORETICAL COMPUTER SCIENCE

TurboPixels: Fast Superpixels Using Geometric Flows

(2009) A. Levinshtein et al.   IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE

Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle

(2009) J. Cousty et al.   IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE

Some links between extremum spanning forests, watersheds and min-cuts

(2009) Cédric Allène et al.   IMAGE AND VISION COMPUTING