2000
DOI: 10.1109/83.841950
|View full text |Cite
|
Sign up to set email alerts
|

Regions adjacency graph applied to color image segmentation

Abstract: The aim of this paper is to present different algorithms, based on a combination of two structures of graph and of two color image processing methods, in order to segment color images. The structures used in this study are the region adjacency graph and the line graph associated.We will see how these structures can enhance segmentation processes such as region growing or watershed transformation. The principal advantage of these structures is that they give more weight to adjacency relationships between region… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
98
0
3

Year Published

2006
2006
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 210 publications
(101 citation statements)
references
References 12 publications
0
98
0
3
Order By: Relevance
“…Second, the region adjacency graph (RAG) was built to simplify the evaluation processing. The RAG is an undirected graph, which is used to express the spatial relationship between adjacent segments, with nodes representing segments and arcs representing their adjacency [40,41]. Third, the JM distance of each pair of segments was calculated based on the RAG as follows:…”
Section: Area-weighted Variance (Wv) and Jeffries-matusita (Jm) Distamentioning
confidence: 99%
“…Second, the region adjacency graph (RAG) was built to simplify the evaluation processing. The RAG is an undirected graph, which is used to express the spatial relationship between adjacent segments, with nodes representing segments and arcs representing their adjacency [40,41]. Third, the JM distance of each pair of segments was calculated based on the RAG as follows:…”
Section: Area-weighted Variance (Wv) and Jeffries-matusita (Jm) Distamentioning
confidence: 99%
“…• Region Adjacency Graphs (RAG) [19] which provide very useful and common ways of describing the structure of a picture: vertices represent regions and edges represent region adjacency relationship.…”
Section: Representation Of Images By Graphsmentioning
confidence: 99%
“…Two approaches were developed to deal with this problem. The first one involves merging adjacent regions according to some criterion after the use of the watershed algorithm (Courses & Surveys 1999;Haris et al 1998;Tremeau & Colantoni 2000). The second one uses markers to reduce over-segmentation (Salembier & Pardas 1994;Salembier & Marques 1999).…”
Section: Magnetic Element Segmentation With the Marker-controlled Watmentioning
confidence: 99%
“…This method is generalized from watersheds, which is a popular segmentation method for separating touching or adjacent objects (Beucher & Meyer 1993;Courses & Surveys 1999;Haris et al 1998;Tremeau & Colantoni 2000). However, it has been reported that the watershed algorithm often leads to over-segmentation (Vincent 1993), meaning that the method may partition one magnetic element to a set of small magnetic elements.…”
Section: Introductionmentioning
confidence: 99%