In a standard cluster analysis, such as k-means, in addition to clusters locations and distances between them, it’s important to know if they are connected or well separated from each other. The main focus of this paper is discovering the relations between the resulting clusters. We propose a new method which is based on pairwise overlapping k-means clustering, that in addition to means of clus...

This study investigated the generalizability across time of a cluster analysis that identified five groups with differing motivations for visiting a National Historic Landmark. Replication of the initial study after a one-year time period suggested the same visitor types (i.e., clusters) were present in both study years; however, the relative size of the clusters varied by up to ten percent. A ...

Abstract. This paper introduces a novel 3-D geometry enhanced superpixels for RGB-D data. First, we reconstruct the 3-D geometry of the scene by projecting the depth map into 3-D coordinates. Then, a distance metric for superpixel clustering is constructed using 3-D geometry and color information. Finally, pixels are iteratively clustered into superpixels using the proposed distance metric. The...

This paper describes the construction of a layered scene model, based on a single hazy image that has sufficient depth variation. A depth map and radiance image are estimated by standard dehazing methods. The radiance image is then segmented into a small number of clusters, and a corresponding scene plane is estimated for each. This provides the basic structure of a layered scene model, without...

The video-plus-depth data representation uses a regular texture video enriched with the so-called depth map, providing the depth distance for each pixel. The compression efficiency is usually higher for smooth, gray level data representing the depth map than for classical video texture. However, improvements of the coding efficiency are still possible, taking into account the fact that the vide...