2011 Eighth International Conference Computer Graphics, Imaging and Visualization 2011
DOI: 10.1109/cgiv.2011.27
|View full text |Cite
|
Sign up to set email alerts
|

A Region-Based Image Segmentation by Watershed Partition and DCT Energy Compaction

Abstract: An image segmentation approach by improved watershed partition and DCT energy compaction has been proposed in this paper. The proposed energy compaction, which expresses the local texture of an image area, is derived by exploiting the discrete cosine transform. The algorithm is a hybrid segmentation technique which is composed of three stages. First, the watershed transform is utilized by preprocessing techniques: edge detection and marker in order to partition the image into several small disjoint patches, wh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 27 publications
0
5
0
Order By: Relevance
“…See case (A) in Figure 7b. Then add e to edge set E, and add the 2 nodes to vertex set V. In the example in Figure 7a, the satisfied edges are w (9,10), w (9,11), w (9,12), and w (11,12); Case B: The states of two nodes connected by e are all VN, and they are descendants of the same ancestor. See case (B) in Figure 7b.…”
Section: Rag Criterionmentioning
confidence: 99%
See 2 more Smart Citations
“…See case (A) in Figure 7b. Then add e to edge set E, and add the 2 nodes to vertex set V. In the example in Figure 7a, the satisfied edges are w (9,10), w (9,11), w (9,12), and w (11,12); Case B: The states of two nodes connected by e are all VN, and they are descendants of the same ancestor. See case (B) in Figure 7b.…”
Section: Rag Criterionmentioning
confidence: 99%
“…Reform it to , which is a connection between the ancestor of VN node and the original RL node. Then add to edge set E, and the two nodes after reformation to vertex set V. In the example shown in Figure 7a, the satisfied edges include: w(1,9) reformed from w (6,9), w (1,11) reformed from w (8,11), w (11,4) reformed from w (11,17), and w (12,4) reformed from w (12,18).…”
Section: Case Dmentioning
confidence: 99%
See 1 more Smart Citation
“…In this algorithm, an analogy is made between image and its constituent objects with watershed (ridge) and various catchment basins in it flooded with water. The output of this algorithm is the input image into its different catchment basins signifying objects in image and each basin is characterized by a unique label [16].…”
Section: Watershed Segmentationmentioning
confidence: 99%
“…All these algorithms work on the use of any of the three main criteria: the homogeneity within a segment, separation from adjacent segments and shape homogeneity. Typically, the segmentation algorithms can be grouped into three major categories on the basis of their segment formation properties, namely Threshold Based Segmentation [11,22], Boundary based Segmentation [9,16] and Region Based Segmentation [10].…”
Section: Introductionmentioning
confidence: 99%