2006
DOI: 10.1007/11892755_32
|View full text |Cite
|
Sign up to set email alerts
|

A Clustering Based Approach for Automatic Image Segmentation: An Application to Biplane Ventriculograms

Abstract: Abstract. This paper reports on an automatic method for ventricular cavity segmentation in angiographic images. The first step of the method consists in applying a linear regression model that exploits the functional relationship between the original input image and a smoothed version. This intermediate result is used as input to a clustering algorithm, which is based on a region growing technique. The clustering algorithm is a two stage process. In the first stage an initial segmentation is achieved using as … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…This parameter is set to the standard deviation value of the corrected image. The relationship between corrected and smoothed images is obtained using a simple linear regression model 28 .…”
Section: Methodsmentioning
confidence: 99%
“…This parameter is set to the standard deviation value of the corrected image. The relationship between corrected and smoothed images is obtained using a simple linear regression model 28 .…”
Section: Methodsmentioning
confidence: 99%
“…This is an extended version of the clustering-based approach for automatic image segmentation presented in Ref. [23]. The performance of the proposed method is quantified by estimating the difference between contours obtained by our approach with respect to contours traced by two cardiologists (expert 1 and expert 2).…”
Section: Purposementioning
confidence: 99%
“…According to the criterion used in Ref. [23], pixels p I LR (i, j) (in I LR ) and p I P (i, j) (in I P ) have feature vectors denoted as: pv I LR = [I 1 , a] and pv I P = [I 2 , b], where I 1 and I 2 denote the intensities associated with the corresponding pixel and, a and b are the intensity average in a l × l neighborhood around each pixel. The similarity matrix (I S ) was obtained in Ref.…”
Section: Clustering Approachmentioning
confidence: 99%
“…This filter quantifies the difference between the graylevel values of pixels in the original image I in and in the smoothed image (I average ) based on a similarity criterion [14]. The similarity filter is constructed using the procedure proposed in [17]:…”
Section: Edge Enhancementmentioning
confidence: 99%