An experimental study of four variants of pose clustering from dense range data

Parameter clustering is a robust estimation technique based on location statistics in a parameter space where parameter samples are computed from data samples. This article investigates parameter clustering as a global estimator of object pose or rigid motion from dense range data without knowing correspondences between data points. Four variants of the algorithm are quantitatively compared regarding estimation accuracy and robustness: sampling poses from data points or from points with surface normals derived from them, each combined with clustering poses in the canonical or consistent parameter space, as defined in Hillenbrand (2007) [1]. An extensive test data set is employed: synthetic data generated from a public database of three-dimensional object models through various levels of corruption of their geometric representation; real range data from a public database of models and cluttered scenes. It turns out that sampling raw data points and clustering in the consistent parameter space yields the estimator most robust to data corruption. For data of sufficient quality, however, sampling points with normals is more efficient; this is most evident when detecting objects in cluttered scenes. Moreover, the consistent parameter space is always preferable to the canonical parameter space for clustering.