- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Computational and Mathematical Methods in Medicine
Volume 2013 (2013), Article ID 401413, 9 pages
Bayesian Method with Spatial Constraint for Retinal Vessel Segmentation
Institut Fresnel/UMR-CNRS, D. U. de Saint-Jérôme, 13013 Marseille, France
Received 20 March 2013; Revised 22 May 2013; Accepted 10 June 2013
Academic Editor: William Crum
Copyright © 2013 Zhiyong Xiao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
A Bayesian method with spatial constraint is proposed for vessel segmentation in retinal images. The proposed model makes the assumption that the posterior probability of each pixel is dependent on posterior probabilities of their neighboring pixels. An energy function is defined for the proposed model. By applying the modified level set approach to minimize the proposed energy function, we can identify blood vessels in the retinal image. Evaluation of the developed method is done on real retinal images which are from the DRIVE database and the STARE database. The performance is analyzed and compared to other published methods using a number of measures which include accuracy, sensitivity, and specificity. The proposed approach is proved to be effective on these two databases. The average accuracy, sensitivity, and specificity on the DRIVE database are 0.9529, 0.7513, and 0.9792, respectively, and for the STARE database 0.9476, 0.7147, and 0.9735, respectively. The performance is better than that of other vessel segmentation methods.
Retinal vessel segmentation plays an important role in medical image processing. It can provide much help for the detection of eye diseases and other medical diagnosis. A large number of methods for retinal vessel segmentation have been proposed. A survey on retinal vessel segmentation methods is presented in the literature . According to the image processing methodologies and algorithms, these retinal vessel segmentation approaches can be categorized into pattern recognition techniques, matched filtering, vessel tracking, mathematical morphology, multiscale approaches, and model-based approaches.
The algorithm based on pattern recognition can detect or classify the retinal blood vessel features and the background. This group of algorithms can be divided into two categories: supervised and unsupervised approaches. In supervised methods, the prior labeling information is used to decide whether a pixel belongs to a vessel or not. In , a ridge-based vessel segmentation methodology has been proposed. In , a method which combines the radial projection and the support vector machines classifier has been introduced for vessel segmentation. A supervised method which is based on neural network has been presented in . The Gaussian matched filter and the k-nearest neighbor algorithm are used for vessel segmentation . In , a 2D Gabor wavelet has been applied for vessel segmentation. The unsupervised methods perform the vessel segmentation without any prior labeling knowledge. In , a spatially weighted fuzzy C-means clustering method has been used for vessel segmentation. In , a vessel detection system based on a maximum likelihood estimation has been developed.
The matched filtering approaches [9–11] are also popular methods to detect and measure blood vessels. In , a method which combines local and region-based properties of retinal blood vessels has been described. In , a modified second-order Gaussian filter has been used for retinal vessel detection. In , the zero-mean Gaussian filter and the first-order derivative of the Gaussian have been applied to detect vessels.
In the vessel tracking-based method framework [12–14], several seed pixels are chosen on the boundaries and the centerlines of vessels, and then we detect vessels from these seeded pixels. In , the Bayesian method with the maximum a posteriori (MAP) probability criterion has been used to identify the vessel’s boundary points. In [12, 14], a probabilistic tracking method has been used to detect the vessel edge points by using local grey level statistics and vessel’s continuity properties.
The mathematical morphology-based methods extract image components which are useful in the representation and description of region shapes such as features, boundaries, skeletons, and convex hulls. In , a unique combination of vessel centerlines detection and morphological bit plane slicing has been introduced to extract the blood vessel tree form the retinal images. The fast discrete curvelet transforms and multistructure mathematical morphology have been employed for vessel detection . In , the combination of morphological filters and cross-curvature evaluation have been used to segment vessel-like patterns. A difference of offset gaussian filter  has been utilized for retinal vasculature extraction. A general framework of locally adaptive thresholding method for retinal vessel segmentation has been introduced in .
Multiscale approaches are to separate out information related to the blood vessel having varying width at different scales. A scale space segmentation algorithm has been proposed in , which has been used to measure and quantify geometrical and topological properties of the retinal vascular tree. Two extensions of this scale space algorithm have been demonstrated in [21, 22]. A multi-scale line tracking for vasculature segmentation has been presented in .
The model-based approaches are very popular techniques for image segmentation and have been used for retinal vessel segmentation. Active contour models which are based on curve evolution are very commonly used for image segmentation. The main advantage is their great performance. Recently, they have been used to detect boundaries of vessels in retinal images [24–28]. The classical snake in combination with blood vessel topological properties has been used to extract the vasculature from retinal image . A methodology based on nonlinear projections has been proposed for vessel segmentation . Level set method is a very good approach to deal with topological changes  and has been successfully used for vessel segmentation of retinal images [32, 33]. Graph-based approach is very popular and interesting method for image segmentation and also has been applied to vessel boundary detection .
The above methods [12–14] are based on the Bayesian model. However, the main disadvantage of these approaches is that the pixels are assumed to be independent. Spatial dependence is very important to guarantee connectedness of the vessel structure. To take into account the dependence in the spatial space, Markov random field (MRF) models have been widely used for solving the image segmentation problem [35–37]. However, one of the drawbacks of the MRF-based methods is that the computational cost is quite high.
In this paper, we present a novel Bayesian segmentation method for vessel segmentation. The proposed method takes the spatial information into account. We found that maximizing log-likelihood function is equivalent to energy function minimization. The parameters of the model can be estimated via energy minimization. In order to detect the boundaries of the blood vessels, the modified level set approach is used for solving the energy function minimization problem. The method was evaluated on two publicly available databases, the DRIVE database  and the STARE database . Results of the proposed method are compared to those from other methods, leading to the conclusion that our approach outperforms other techniques.
The remainder of this paper is organized as follows. In Sections 2 and 3, we describe the details of the proposed model and the modified level set algorithm. In Section 4, we show the experimental results and conclude with a discussion in Section 5.
2. Proposed Model
2.1. Image Segmentation
Let denote an observed image, where is the observation of pixel and is image domain. Let denote a label set, and is the total number of classes. Let be an image of labels. The aim of labeling is to assign a label to each pixel , based on . The goal of segmentation is to separate the image domain into disjoint regions and ensure smooth inside each region . Notice that, given a labeling , the collection for is one of these regions. Also, given the segmentation for , the image is a labeling. It is a one-to-one relationship between the labeling and the segmentation. Thus, the image segmentation problem can be considered as a labeling problem.
2.2. Bayesian Model with Spatial Constraint
In Bayesian framework, inference is often carried out by maximizing the posterior distribution where is the likelihood function and is the prior distribution.
When the pixels are considered independent of each other, the likelihood function can be written as
However, the spatial relationships between neighboring pixels are not taken into account. To improve the accuracy of the segmented results, the spatial dependencies should be taken into account.
In this paper, we use a modeling strategy for the spatial dependencies between the conditional probabilities. The conditional probability is defined as a mixture distribution over the conditional probabilities of neighboring pixels , , that is, where are fixed positive weights and for each holds . The mixing weight depends on the geometric closeness between the pixels and . Thus, the above likelihood function can be expressed as
Let be the parameter form of the . Usually, it is assumed to be Gaussian distribution
The log-likelihood function of Bayesian model (4) is given by where are fixed positive weights and for each it holds . The mixing weight depends on the geometric closeness between the pixels and .
The geometric closeness is a Gaussian function of the magnitude of the relative position vector of pixel from pixel , . The geometric closeness function is given as a decreasing function when the distance increases as where is parameter, which defines the desired structural locality between neighboring pixels, and and are the location of the pixel and , respectively. We use a neighborhood window and we suggest .
We define the mixing weight as follows:
Note that are fixed constants, and we can drop the term that depends only on . Image segmentation can be performed by maximizing log-likelihood function (6) with respect to the parameter as
2.3. Energy Minimization
Since the logarithm is a monotonically increasing function, it it more convenient to consider the negative likelihood function as an energy function as Thus, image segmentation problem can be solved by minimizing energy (10) with respect to the parameter .
We assume that the variance of the proposed energy (10) has the common form . Thus, the functional for the proposed energy (10) can be written as We introduce kernel function as a nonnegative window function With the window function, the energy function (11) can be rewritten as By exchanging the order of sum, we have For convenience, we can rewrite the above energy functional in the following form: where is the function defined by
We minimize the above proposed energy functional using the modified level set approach.
In this section, the energy (10) is converted to a level set formulation by representing the disjoint regions with a number of level set functions, with a regularization term on these level set functions.
We consider the two-phase level set formulation. The image domain is segmented into two disjoint regions and . In level set methods, a level set function is a function that takes positive and negative signs. We use level set function to represent a partition of the domain into two disjoint regions and as
The regions and can be represented with their membership functions defined by the Heaviside function as
Let and denote the regularization terms of level set function . The energy term is defined by  which computes the arc length of the zero level contour of and serves to smooth the contour . The energy term is defined by  where function is an energy density function, which is called a distance regularization term .
Therefore, combining these two energy terms with the energy (19), the total energy functional becomes
By minimizing the above energy, we obtain the result of image segmentation given by the level set function and the estimation of the parameters . The details of the algorithm for minimizing the energy (22) are given in the next section.
3.1. Modified Level Set Algorithm
The energy minimization is achieved by an iterative process: in each iteration, we minimize the energy (22) with respect to each of its variables , , given the other two updated in previous iteration. We give the solution to the energy minimization with respect to each variable as follows.
We compute the Gâteaux derivative and the corresponding gradient flow equation is
Keeping fixed and minimizing (22) with respect to , the variable can be expressed as
Finally, the principal steps of the algorithm are as follows.(i)Initialize , .(ii)Compute , by (25).(iii)Solve the PDE where is defined in (24) to obtain .(iv)Check whether the solution is stationary. If not, let and repeat.
3.2. Numerical Approximation
In numerical implementation, in order to compute the unknown function , we consider the slightly regularized version of the Heaviside function , denoted here by , which is computed by  Accordingly, the dirac delta function , which is the derivative of the Heaviside function, is replaced by the derivative of approximation Heaviside function . The dirac delta function is given by
Since the energy is nonconvex, the solution may be the local minima. With the Heaviside function and the dirac delta function , the algorithm has the tendency to compute the global minimizer. Thus, the algorithm is not sensitive to the position of the initial curve.
In this section, we have evaluated and compared the proposed method for the segmentation of retinal images. The retinal images are obtained from two publicly available databases the DRIVE database  and the STARE database . In the experiments, we generally choose the parameters as follows: and the time step . After many experiments on a small number of example images, we have found that, when , the performance is very good. In all the following experiments, the values of the parameters are same.
The images of the DRIVE database are with pixels and bits per color channel. The database includes binary images with the results of manual segmentation, which have been used as ground truth to evaluate the performance of the vessel segmentation methods. The retinal images of the STARE database are digitized to pixels, bits per RGB channel. The STARE database contains images for blood vessel segmentation: normal images and abnormal images. Binary images with manual segmentations are also available for each image of this database.
Evaluation of the developed method is done on the DRIVE and STARE databases. Experimental results are compared to those obtained using other vessel segmentation methods. To facilitate the comparison with other retinal vessel segmentation methods, the segmentation accuracy has been selected as performance measure. The segmentation accuracy has been defined by the ratio of the total number of correctly classified pixels by the number of pixels in the field of view (FOV). It contains values in the range , with values closer to indicating a good result. Other important measures are sensitivity and specificity. In this paper, the sensitivity is estimated by the percentage of pixels correctly classified as vessel pixels. The specificity stands for the fraction of pixels erroneously classified as vessel pixels. The ground truth for evaluating the performance measures was a manual segmentation result which is provided together with each database image.
A majority of the pixels are often easy to be classified by the previous methods; however, some of the pixels, such as those on the boundary of a vessel, those for small vessels, and those for vessels near pathology, are difficult to be classified. The proposed method provides a novel way to account for spatial dependence between image pixels. Thus, it can reduce the sensitivity of the segmented results and guarantee connectedness of the vessel structure.
In the first experiment, the proposed method is done on retinal vessel images of DRIVE database. Image in Figure 1(a) shows the original retinal vessel images. The ground truth of the original retinal image is presented in Figure 1(b). The segmentation result obtained by using the proposed method is illustrated in Figure 1(c). It can observed that the proposed method obtains good results.
In order to test the accuracy and determine the efficiency of the proposed method, we do experiment on another retinal vessel image of the DRIVE database and compare the result with those obtained by other methods. Figure 2(a) shows a retinal image of the DRIVE database. The image in Figure 2(b) is the ground truth. Figures 2(c)–2(f) present the segmentation results obtained by Niemeijer et al.’s method , Staal et al.’s method , Mendonça and Campilho (green intensity) method , and the proposed method, respectively. For visual inspection of the results, the proposed method produces a very good segmentation result.
To facilitate the comparison of our results to those presented by other authors in their original papers, the results have been calculated for the images of the DRIVE database. The value results of the proposed method are shown in Table 1. The other vessel segmentation methods which are reported in their published papers are also presented in Table 1. The performance measures of the proposed method in Table 1 are the average values for all the images of DRIVE database. We can view that the proposed method can capture more correctly classified vessel pixels and less erroneously classified vessel pixels than the other methods. The average accuracy of the proposed method is better than the other techniques.
In order to further test the accuracy and determine the efficiency of the proposed method, the proposed method has been tested on the images of the STARE database. Figures 3(a) and 3(d) show two retinal images of STARE database. Figures 3(b) and 3(e) present the ground truth, respectively. The results obtained by using the proposed method are shown in Figures 3(c) and 3(f), respectively. For visual inspection, it can be seen that the proposed method can obtain very good results.
To compare our results to those reported in other published papers, we give the performance measures in Table 2. The average accuracy, sensitivity, and specificity are used to measure the performance. We can note that the proposed method performs better than the other techniques.
The execution time of the proposed method depends on many parameters. For the images of the STARE database, one iteration time of the proposed method is less than 10 seconds. Convergence of the proposed algorithm may be achieved in less than iterations.
The accurate extraction of the retinal blood vessel can provide much help for diagnosis of cardiovascular and ophthalmologic diseases. Even though many techniques and algorithms have been developed, there is still room for improvement in blood vessel segmentation methodologies. In this paper, we have presented a novel Bayesian model for vessel segmentation. To overcome the drawback that the spatial information is not taken into account, the proposed model exploits the spatial information. To obtain the boundaries of the blood vessels, the modified level set approach is employed for minimizing the proposed energy function. The proposed method has been tested on real retinal image databases and the experimental results have been compared with those of other methods. Since the developed method takes the spatial information into account, it can result in very good performance in the detection of narrow and low contrast vessels and guarantee connectedness of the vessel structure. The comparison demonstrates that the proposed method outperforms other methods. In future work, we will compare the proposed method to other algorithms. Most of the techniques in the literature and the proposed method are evaluated on a limited range of databases (DRIVE and STARE). We will do more experiments on larger database and compare to more techniques in future.
- M. M. Fraz, P. Remagnino, A. Hoppe et al., “Blood vessel segmentation methodologies in retinal images—a survey,” Computer Methods and Programs in Biomedicine, vol. 108, no. 1, pp. 407–433, 2012.
- J. Staal, M. D. Abràmoff, M. Niemeijer, M. A. Viergever, and B. van Ginneken, “Ridge-based vessel segmentation in color images of the retina,” IEEE Transactions on Medical Imaging, vol. 23, no. 4, pp. 501–509, 2004.
- X. You, Q. Peng, Y. Yuan, Y. M. Cheung, and J. Lei, “Segmentation of retinal blood vessels using the radial projection and semi-supervised approach,” Pattern Recognition, vol. 44, no. 10-11, pp. 2314–2324, 2011.
- D. Marín, A. Aquino, M. E. Gegúndez-Arias, and J. M. Bravo, “A new supervised method for blood vessel segmentation in retinal images by using gray-level and moment invariants-based features,” IEEE Transactions on Medical Imaging, vol. 30, no. 1, pp. 146–158, 2011.
- M. Niemeijer, J. Staal, B. van Ginneken, M. Loog, and M. D. Abràmoff, “Comparative study of retinal vessel segmentation methods on a new publicly available database,” in Medical Imaging 2004: Image Processing, J. M. Fitzpatrick and M. Sonka, Eds., vol. 5370 of Proceedings of SPIE, pp. 648–656, San Diego, Calif, USA, February 2004.
- J. V. B. Soares, J. J. G. Leandro, R. M. Cesar Jr., H. F. Jelinek, and M. J. Cree, “Retinal vessel segmentation using the 2-D Gabor wavelet and supervised classification,” IEEE Transactions on Medical Imaging, vol. 25, no. 9, pp. 1214–1222, 2006.
- G. B. Kande, P. V. Subbaiah, and T. S. Savithri, “Unsupervised fuzzy based vessel segmentation in pathological digital fundus images,” Journal of Medical Systems, vol. 34, no. 5, pp. 849–858, 2010.
- J. Ng, S. T. Clay, S. A. Barman et al., “Maximum likelihood estimation of vessel parameters from scale space analysis,” Image and Vision Computing, vol. 28, no. 1, pp. 55–63, 2010.
- A. Hoover, V. Kouznetsova, and M. Goldbaum, “Locating blood vessels in retinal images by piecewise threshold probing of a matched filter reponse,” IEEE Transactions on Medical Imaging, vol. 19, no. 3, pp. 203–210, 2000.
- L. Gang, O. Chutatape, and S. M. Krishnan, “Detection and measurement of retinal vessels in fundus images using amplitude modified second-order Gaussian filter,” IEEE Transactions on Biomedical Engineering, vol. 49, no. 2, pp. 168–172, 2002.
- B. Zhang, L. Zhang, L. Zhang, and F. Karray, “Retinal vessel extraction by matched filter with first-order derivative of Gaussian,” Computers in Biology and Medicine, vol. 40, no. 4, pp. 438–445, 2010.
- Y. Yin, M. Adel, and S. Bourennane, “Retinal vessel segmentation using a probabilistic tracking method,” Pattern Recognition, vol. 45, no. 4, pp. 1235–1244, 2012.
- M. Adel, A. Moussaoui, M. Rasigni, S. Bourennane, and L. Hamami, “Statistical-based tracking technique for linear structures detection: application to vessel segmentation in medical images,” IEEE Signal Processing Letters, vol. 17, no. 6, pp. 555–558, 2010.
- Y. Yin, M. Adel, and S. Bourennane, “An automatic tracking method for retinal vascular tree extraction,” in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '12), pp. 709–712, Kyoto, Japan, March 2012.
- M. M. Fraz, S. A. Barman, P. Remagnino et al., “An approach to localize the retinal blood vessels using bit planes and centerline detection,” Computer Methods and Programs in Biomedicine, vol. 108, no. 2, pp. 600–616, 2012.
- M. S. Miri and A. Mahloojifar, “Retinal image analysis using curvelet transform and multistructure elements morphology by reconstruction,” IEEE Transactions on Biomedical Engineering, vol. 58, no. 5, pp. 1183–1192, 2011.
- F. Zana and J. C. Klein, “Segmentation of vessel-like patterns using mathematical morphology and curvature evaluation,” IEEE Transactions on Image Processing, vol. 10, no. 7, pp. 1010–1019, 2001.
- A. M. Mendonça and A. Campilho, “Segmentation of retinal blood vessels by combining the detection of centerlines and morphological reconstruction,” IEEE Transactions on Medical Imaging, vol. 25, no. 9, pp. 1200–1213, 2006.
- X. Jiang and D. Mojon, “Adaptive local thresholding by verification-based multithreshold probing with application to vessel detection in retinal images,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 1, pp. 131–137, 2003.
- M. E. Martinez-Perez, A. D. Hughes, A. V. Stanton, S. A. Thom, A. A. Bharath, and K. H. Parker, “Retinal blood vessel segmentation by means of scale-space analysis and region growing,” in Proceedings of the 2nd International Conference on Medical Image Computing and Computer-Assisted Intervention, pp. 90–97, Springer, London, UK, 1999.
- M. E. Martinez-Perez, A. D. Hughes, S. A. Thom, A. A. Bharath, and K. H. Parker, “Segmentation of blood vessels from red-free and fluorescein retinal images,” Medical Image Analysis, vol. 11, no. 1, pp. 47–61, 2007.
- M. E. Martinez-Perez, A. D. Hughes, S. A. Thom, and K. H. Parker, “Improvement of a retinal blood vessel segmentation method using the insight segmentation and registration toolkit (ITK),” in Proceedings of the 29th Annual International Conference of IEEE-EMBS, Engineering in Medicine and Biology Society (EMBC '07), pp. 892–895, Lyon, France, August 2007.
- M. Vlachos and E. Dermatas, “Multi-scale retinal vessel segmentation using line tracking,” Computerized Medical Imaging and Graphics, vol. 34, no. 3, pp. 213–227, 2010.
- B. Al-Diri, A. Hunter, and D. Steel, “An active contour model for segmenting and measuring retinal vessels,” IEEE transactions on medical imaging, vol. 28, no. 9, pp. 1488–1497, 2009.
- K. Sun, Z. Chen, and S. Jiang, “Local morphology fitting active contour for automatic vascular segmentation,” IEEE Transactions on Biomedical Engineering, vol. 59, no. 2, pp. 464–473, 2012.
- Y. Shang, R. Deklerck, E. Nyssen et al., “Vascular active contour for vessel tree segmentation,” IEEE Transactions on Biomedical Engineering, vol. 58, no. 4, pp. 1023–1032, 2011.
- A. Yazdanpanah, G. Hamarneh, B. R. Smith, and M. V. Sarunic, “Segmentation of intra-retinal layers from optical coherence tomography images using an active contour approach,” IEEE Transactions on Medical Imaging, vol. 30, no. 2, pp. 484–496, 2011.
- M. O. L. Espona, M. J. Carreira, and M. G. Penedo, “A snake for retinal vessel segmentation,” in Pattern Recognition and Image Analysis, vol. 4478 of Lecture Notes in Computer Science, pp. 178–185, 2007.
- L. Espona, M. J. Carreira, M. G. Penedo, and M. Ortega, “Retinal vessel tree segmentation using a deformable contour model,” in Proceedings of the 19th International Conference on Pattern Recognition (ICPR '08), pp. 1–4, December 2008.
- Y. Zhang, W. Hsu, and M. L. Lee, “Detection of retinal blood vessels based on nonlinear projections,” Journal of Signal Processing Systems, vol. 55, no. 1–3, pp. 103–112, 2009.
- R. Malladi, J. A. Sethian, and B. C. Vemuri, “Shape modeling with front propagation: a level set approach,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 2, pp. 158–175, 1995.
- K. W. Sum and P. Y. S. Cheung, “Vessel extraction under non-uniform illumination: a level set approach,” IEEE Transactions on Biomedical Engineering, vol. 55, no. 1, pp. 358–360, 2008.
- H. Yu, E. S. Barriga, C. Agurto et al., “Fast localization and segmentation of optic disk in retinal images using directional matched filtering and level sets,” IEEE Transactions on Information Technology in Biomedicine, vol. 16, no. 4, pp. 644–657, 2012.
- X. Xu, M. Niemeijer, Q. Song et al., “Vessel boundary delineation on fundus images using graph-based approach,” IEEE Transactions on Medical Imaging, vol. 30, no. 6, pp. 1184–1191, 2011.
- Y. Zhang, M. Brady, and S. Smith, “Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm,” IEEE Transactions on Medical Imaging, vol. 20, no. 1, pp. 45–57, 2001.
- F. Forbes and N. Peyrard, “Hidden Markov random field model selection criteria based on mean field-like approximations,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 9, pp. 1089–1101, 2003.
- S. P. Chatzis and T. A. Varvarigou, “A fuzzy clustering approach toward hidden Markov random field models for enhanced spatially constrained image segmentation,” IEEE Transactions on Fuzzy Systems, vol. 16, no. 5, pp. 1351–1361, 2008.
- M. Niemeijer and B. van Ginneken, “Digital retinal image for vessel extraction (DRIVE) database,” 2002, http://www.isi.uu.nl/Research/Databases/DRIVE/.
- A. Hoover, “Structured analysis of the retina (STARE) database,” http://www.parl.clemson.edu/~ahoover/stare/.
- W. C. K. Wong and A. C. S. Chung, “Bayesian image segmentation using local iso-intensity structural orientation,” IEEE Transactions on Image Processing, vol. 14, no. 10, pp. 1512–1523, 2005.
- T. F. Chan and L. A. Vese, “Active contours without edges,” IEEE Transactions on Image Processing, vol. 10, no. 2, pp. 266–277, 2001.
- C. Li, C. Xu, C. Gui, and M. D. Fox, “Distance regularized level set evolution and its application to image segmentation,” IEEE Transactions on Image Processing, vol. 19, no. 12, pp. 3243–3254, 2010.