2016
DOI: 10.1109/tpami.2015.2513407
|View full text |Cite
|
Sign up to set email alerts
|

Joint Color-Spatial-Directional Clustering and Region Merging (JCSD-RM) for Unsupervised RGB-D Image Segmentation

Abstract: Recent advances in depth imaging sensors provide easy access to the synchronized depth with color, called RGB-D image. In this paper, we propose an unsupervised method for indoor RGB-D image segmentation and analysis. We consider a statistical image generation model based on the color and geometry of the scene. Our method consists of a joint color-spatial-directional clustering method followed by a statistical planar region merging method. We evaluate our method on the NYU depth database and compare it with ex… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(22 citation statements)
references
References 38 publications
0
22
0
Order By: Relevance
“…The membership formula obtained by substituting (22) into (19) is as follows: (23) where:ȳ r is the mean value of the bias field in the neighborhood of the pixel point x k .…”
Section: Kernel-induced Distance Based Kbfwcm With Dpatial Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…The membership formula obtained by substituting (22) into (19) is as follows: (23) where:ȳ r is the mean value of the bias field in the neighborhood of the pixel point x k .…”
Section: Kernel-induced Distance Based Kbfwcm With Dpatial Constraintsmentioning
confidence: 99%
“…Image segmentation has always been one of the most challenging tasks in image processing and computer vision [20,21]. Nowadays, there have been many types of methods for image segmentation [22][23][24][25], however, these methods are all not robust and effective enough for a large number of different images.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, it is necessary to merge the over-segmented regions to obtain the constitutive elements of the image. The iterative scheme proposed in [10] requires, first of all, the construction of an adjacency graph RAG = (V, E) for region merging. This graph takes each segmented…”
Section: Region Mergingmentioning
confidence: 99%
“…The strategy to merge the regions proposed in [10] consists of an iterative procedure that evaluates a merging predicate between the adjacent nodes. The candidacy of a region defines if the region is valid to be merged with its neighboring nodes.…”
Section: Merging Strategymentioning
confidence: 99%
“…Algorithms based on edges [7,9,10] achieve good performance on images where the boundary of the object is distinct, but these methods are less resistant to noise and require higher image quality. Region-based [11][12][13] and threshold-based [14][15][16] segmentation methods merge pixels into regions by their features like color, texture, or their combination. However, for a certain image, there are some redundant features which do not play a role in segmentation.…”
Section: Introductionmentioning
confidence: 99%