2007
DOI: 10.1109/tip.2006.884951
|View full text |Cite
|
Sign up to set email alerts
|

A Nonparametric Approach for Histogram Segmentation

Abstract: In this work, we propose a method to segment a 1-D histogram without a priori assumptions about the underlying density function. Our approach considers a rigorous definition of an admissible segmentation, avoiding over and under segmentation problems. A fast algorithm leading to such a segmentation is proposed. The approach is tested both with synthetic and real data. An application to the segmentation of written documents is also presented. We shall see that this application requires the detection of very sma… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
69
0
2

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 101 publications
(71 citation statements)
references
References 18 publications
0
69
0
2
Order By: Relevance
“…The neighborhood is centered on each point location and its size is proportional to the scale of the point. We extract the main orientations of this histogram with the non parametric analysis proposed in [10]. A polar localization grid as in [30] is then used to segment the neighborhood into M non overlapping regions.…”
Section: Methodsmentioning
confidence: 99%
“…The neighborhood is centered on each point location and its size is proportional to the scale of the point. We extract the main orientations of this histogram with the non parametric analysis proposed in [10]. A polar localization grid as in [30] is then used to segment the neighborhood into M non overlapping regions.…”
Section: Methodsmentioning
confidence: 99%
“…For each u R s , a 210 depth histogram h s of B bins is built. This histogram is automatically segmented into C s classes using the a-contrario technique presented in Delon et al (2007). This technique presents the advantage of segmenting a 1D-histogram without any prior assumption, e.g.…”
Section: Range Histogram Segmentation Techniquementioning
confidence: 99%
“…For each u R s , a depth histogram hs of B bins is built. This histogram is automatically segmented into Cs classes using the a-contrario technique presented in (Delon et al, 2007). This technique presents the advantage of segmenting a 1D-histogram without any prior assumption, e.g.…”
Section: Point Cloud Segmentationmentioning
confidence: 99%