vessels crossing through the surface of retina have important characteristics in detection and diagnosis of retinopathies such as glaucoma , hypertension , diabetic retinopathy , retinal artery occlusion and arteriosclerosis .
eye specialist often use fundus camera to scan retina 's surface of patients and then by probing the situations of retinal vessels in digital images , they diagnose retinal disease . in some images taken by fundus cameras ,
vessels have poor contrast toward background retina , thus using image processing techniques permit eye specialists and/or computer aided diagnostic tools to detect vessels accurately .
fundamentally , retinal vessel detection is categorized as line detection methods . at a first glance , conducting edge detectors such as canny , sobel or prewitt seems to be useful , but as the intensity of vessels change smoothly , ordinary edge detectors are not able to identify them satisfactorily . besides , non - edge detecting methods such as morphological image processing methods , line tracking method and ridge based vessel segmentation , do not detect vessels accurate enough to be used in medical diagnosis . filter based operators are another class of methods used to detect retinal vessels .
wavelet high - pass filter and matched filter are two examples of filter - based methods .
matched filter seems to be the best vessel detection method among all filter base approaches .
in fact , comparing the alternation of intensity level of the vessel 's cross section with a predefined vessel template , the matched filter detects vessels and identifies them brighter than they are in the non - processed image .
first attempt to use the matched filter as a vessel detector in retinal images was done by chaudhuri et al .
they assumed vessels as piece - wise lines , which have approximated bell - shape change in intensity of their cross section .
thus they defined the template of the matched filter like the bell - shape curve of a gaussian density function . in order to make the bell - shape curve
, they used the gaussian function as the kernel of the matched filter . using a thresholding method they obtained binary image from the gray scale retinal image .
later researchers mainly worked to improve the thresholding techniques rather than changing the kernel function which produces the template .
successfully proposed a new thresholding method and also enhanced the values for the parameters of the matched filter to advance the accuracy of gaussian matched filter .
the first attempt to alter the kernel function of the matched filter was done by the authors of this article as reported . in this article , student probability density function ( pdf )
was proposed to be used as the kernel of the matched filter instead of customary gaussian function .
they showed that using student pdf can perk up the accuracy of the matched filter substantially .
in this paper , we propose cauchy pdf as the new kernel of the matched filter and show the new pdf improves the accuracy of the vessel detection .
in fact , cauchy pdf appears to model the alternation in intensity of the vessel 's cross section better than gaussian function .
that resulted in a better vessel detection as will be shown in the experimental section of this article .
distinct by its name , the matched filter detects features in an image which are most likely to a predefined template ( known as kernel ) . in the matched filter vessels
are assumed to be piece - wise lines with the cross sectional intensity change similar to predefined kernel . to detect lines in every direction , a set of the kernel
all the twelve kernels are produced by rotating each kernel by 15 apart from the previous one .
modeled the bell - shape curve of the vessels ' cross section as gaussian curve , using gaussian pdf .
the intensity for a cross section of a typical vessel in depicted in figure 1a , comparing to figure 1b which contains approximated gaussian pdf .
( a ) cross section of a typical vessel and ( b ) its bell - shaped approximation the gaussian pdf is expressed as follows : here ,  is the variance which draws up the scale of gaussian bell - shape curve . using chuadhuri 's notation , l defines the length of the vessel which is assumed as piece - wise line in the kernel .
the pair ( x , y ) are the coordinates of each element in the kernel , and are used to rotate the kernel due to calculate all kernels in the kernel set . kernels with different orientations are calculated using the rotation translation matrix defined as : the pair ( u , v ) are new rotated coordinates of ( x , y ) , and  is the angle which the kernel is rotated . the number of elements in the matrix denoted by n and computed as : here , t is trunk value in which the gaussian curve should be cut .
it is important to note that more than 99% of the area beneath the gaussian curve is bounded between [ 3 , 3 ] .
chose 3 for the trunk value of their gaussian matched filter . in order to filter out an image ,
examined , the output image consists of bright pixels , which belong to vessels and darker ones which are non - vessels .
. showed that the pixel response is maxima when both kernel and vessel have the same direction . to construct a set containing filters in different directions
, they argued that the rotated kernel can be written as : after each kernel is calculated , it should be normalized to have zero mean as follows : where mi is calculated using : where the parameter a defines the number of elements belongs to n. experimentally calculated , chaudhuri et al .
selected parameters are follows , ( l ,  , t ) = ( 9 , 2 , 6 ) it should be noted that the trunk value , which is chosen six is calculate from t = 3 where  = 2 .
one of the best attempts have been done by al - rawi et al . who improved the accuracy of the matched filter by altering the parameters governing both the gaussian function and the matched filter .
using same gaussian pdf as the kernel , they proposed two improvements : 
 introducing optimized gaussian matched filter ( ogmf ) with enhanced parameters : ( l ,  , t ) = ( 10.8 , 1.9 , 8)formulizing two stage gaussian matched filter ( tsgmf ) , which commencing two sets of filters . incorporating improvement ( 1 ) above , parameters for the first stage are set as ( l ,  , t ) = ( 7.6 , 1.9 , 8) and the second stage uses the parameters : ( l ,  , t ) = ( 10.8 , 1.9 , 8) . 
 
introducing optimized gaussian matched filter ( ogmf ) with enhanced parameters : ( l ,  , t ) = ( 10.8 , 1.9 , 8) formulizing two stage gaussian matched filter ( tsgmf ) , which commencing two sets of filters . incorporating improvement ( 1 ) above , parameters for the first stage are set as ( l ,  , t ) = ( 7.6 , 1.9 , 8) and the second stage uses the parameters : ( l ,  , t ) = ( 10.8 , 1.9 , 8) . with no changes in the orientation and the kernel size ( which we refer it as window size later ) ,
the tsgmf detects vessels through two matched filters . in their method , each pixel in a raw retinal image convolves with 24 produced kernels using two different parameters defined in tsgmf .
they showed that the tsgmf filtering brings more accurate the vessel detections better than solely use ogmf .
later , the authors of this article focused on changing the type of the kernel function from gaussian to student pdf , which resulted in more accurate retinal vessel detection filter . in that paper
, it is shown that the accuracy of the matched filter improves further when the student pdf is used to generate the template of the matched filter . in this paper , we propose a new kernel function , namely cauchy function , as the matched filter template generator .
the results reported in the following sections shows a boost in the vessel detection accuracy .
the cauchy function as the new kernel for the matched filter is formulated in the next section .
earlier , we explained that the matched filter uses a kernel function to approximate the vessel 's cross section .
we discovered that the cauchy pdf imitates the vessels patterns better and behaves more flexible than gaussian matched filter , thus more vessels can be detected via a matched filter uses cauchy function as the template generator .
the cauchy pdf is defined as : figure 2 shows a significant difference comparing the cauchy and gaussian functions on how these functions diminish toward their trunk values .
the cauchy pdf reaches to its trunk value slower than the gaussian function . on the other hand
, retinal blood vessels do not vanish as fast as the gaussian function diminishes toward trunk values .
therefore , the cauchy characteristic fits the vessel lines better than its gaussian counterpart and thus it is makes it much more flexible to detect blood vessels in retinal images .
the plot compares the cauchy curve with  = 1 ( solid line ) to the shorter tailed , standard gaussian function ( dashed line ) analyzing the cauchy pdf , similar to the variance in gaussian function , which governs the curve scales , the cauchy pdf uses parameter  for this purpose .
that is , analogous to  in the gaussian function , small values for  lead to a tight cauchy curve .
in contrast , larger  and  values expand the gaussian and cauchy curves on x axis , respectively . beside the scaling parameter , 
these two parameters shape the cauchy curve and therefore have an effect on the vessels detection template .
figure 3 shows how  and x0 affect the cauchy 's curve . choosing non - zero values for x0 shifts the peak of the curve on the horizontal axis .
since we want to detect vessels which pass across the center of aperture placed of the image , we select zero value for x0 to construct an acceptable template for our detection procedure .
comparison between  = 1 ( solid line ) and  = 2 ( dashed line ) both with x0 = 0 and  = 1.5 with x0 = 3 ( bold line ) in cauchy function constructing the filter set using cauchy kernel , the retinal image is convolved and maximum response based on the direction of filter is calculated . to obtain final retinal map
, we proposed to use local entropy thresholding algorithm that was introduced in- and also used in- to produce the binary image of the cauchy matched filtered image .
this entropy based thresholding algorithm is more accurate than other competitive methods because the dependencies between pixels ' intensity of the filtered image allows us to preserve the spatial structure in the thresholding images as argued in .
furthermore , combining it with global thresholding , it is assured that vessels are correctly distinguished from non - vessels . for our experiments
, we use the retinal images of drive database of retinal images . in order to find the best suitable value for cauchy pdf parameter ,  , template curves trunk value , t , and length , l , and also to measure the method 's accuracy , we compared the resulted images from our cauchy matched filter algorithm as well as other competitive methods with their corresponding hand labeled images provided in drive database .
there are three metrics to which are considered in both parameter selection and comparisons : 
 true positive ratio ( tpr ) which is defined as the number of correct detected pixels of the output image which belong to vessels divided by the number of pixels belong to vessels in the corresponding hand labeled imagefalse positive ratio ( fpr ) that is the number of pixels in the output image which are detected incorrectly divided by the number of pixels belong to vessels in the corresponding hand labeled imagetrue negative ratio ( tnr ) which is calculated by dividing the number of non - vessel pixels detected correctly in the output image by the number of pixels belong to non - vessels in the corresponding hand labeled image
. 
  true positive ratio ( tpr ) which is defined as the number of correct detected pixels of the output image which belong to vessels divided by the number of pixels belong to vessels in the corresponding hand labeled image false positive ratio ( fpr ) that is the number of pixels in the output image which are detected incorrectly divided by the number of pixels belong to vessels in the corresponding hand labeled image true negative ratio ( tnr ) which is calculated by dividing the number of non - vessel pixels detected correctly in the output image by the number of pixels belong to non - vessels in the corresponding hand labeled image .
all images should be examined with the proposed matched filter , the mean value of expressed metrics are calculated which are abbreviated by mtpr , mfpr and mtnr , for the mean of true positive ratio , mean of false positive ratio and the mean of true negative ratio , respectively .
note that the competitive researches reported  accuracy  as their customary metric for comparison purpose , this 
accuracy  is defined by the sum of both vessel and non - vessel pixels of a resulted image detected by the matched filter divided by the sum of both vessel and non - vessel pixels in the corresponding hand labeled image . in this paper ,
the  accuracy  of the method for different values for cauchy pdf parameter ,  , template curves trunk value , t , and length , l and also for comparison purposes , with the given definition is provided and denoted by . the comparison among four matched filters , the gaussian matched filter introduces in as a classical matched filter , the improved gaussian matched filter introduced in as the most precise gaussian based matched filter , the student matched filter proposed in and our cauchy matched filter introduced in this paper . for all mentioned matched filter algorithms , images in drive database are used and examined and comparison parameters ( mtpr , mfpr , mtnr and  ) are reported .
initially , we used trial and error technique to obtain the best  value for our cauchy matched filter , the template curves trunk value , t , and the length value , l , which are led to the best accuracy , . for each parameter , a reasonable range of values are examined on all images in drive database and then the value , which corresponds to the highest accuracy is selected . finally , obtaining the matched filter parameters , proposed method
, the cauchy pdf includes the parameter  to control the scale of its curve .
figure 3 shows that decreasing or increasing in  values causes the cauchy curve to be tightened or loosen up , respectively . arguably ,
considering the drive database images as the proper general representative of blood vessels curves , to select a suitable value for  , a reasonable range of integers between are examined on all the blood vessels images on drive database and the corresponding  to the highest accuracy ,  , is chosen . as a reference ,
other parameters , namely mtpr , mfpr and mtnr , are also computed and reported in table 1 .
both the results of table 1 and the figure 4 , which shows the comparison of different  values , indicate that the best integer value for  of the cauchy matched filter is  = 1 .
values examined to obtain suitable value for  results of table 1 indicates that  = 1 has best accuracy among other  values next , we examine the drive database to identify the best trunk value , t. note that the trunk value specifies where the curve should be cut . in other words ,
trunk value shows the edge of the vessels in the template in the kernel of the matched filter .
small values for trunk cause to detect only the center of the vessels , while the edges are ignored , so the accuracy decreases because some of the pixels placed in the edges of a vessel may not be detected . on the other hand , too large values for trunk
cause the matched filter to interpret the texture near the vessels as vessels , incorrectly which increases fpr , and decreases subsequently the accuracy . to identify the best value for the trunk , t , a valid range of integers between are examined and the results are reported in table 2 . as both table 2 and figure 5 indicates , t = 9 has the highest accuracy ,  , so it is chosen as the trunk value for the template of the cauchy matched filter .
result of examining different values for trunk parameter , t comparison among trunk parameter , t similarly , a valid range of integers between are examined on the images of the drive database to identify the best suited value for the length of the template denoted with l. the length corresponds to the length of assumed piece wise line embedded in the kernel .
reported in table 3 , experimental results indicates that l = 8 leads to highest  among others and therefore , l is selected as such .
l choosing l = 8 as an adequate value for length next parameter to be considered is the kernel size , which affects both the accuracy and the algorithm run time .
while a small kernel size decreases the accuracy , a large kernel size increases the computational complexity .
small kernel size decreases the accuracy because vessels with large diameters fulfill the whole kernel , so for the matched filter , they are detected like the retinal texture where the bell - shape feature is not found in it .
this causes the matched filter to detect just the edges of thick vessels like a two side - rail which are imprecisely interpreted as two parallel vessels .
in contrast , a large kernel size has no positive effect on the accuracy because the template is bounded by the parameter l. the large kernel size , however , requires more computations during the filtering procedure since many more pixels need to be convolved for the elements in the kernel .
al - rawi et al . in used this same kernel size in their improved matched filter algorithm and avoid discussing on why the 17-pixel kernel size is picked up .
zolfagharnasab and naghsh - nilchi in used a 13-pixel kernel size concluded from their practical experiments set .
this table consists of reasonable kernel size , w , and the resulted accuracy and calculation times are reported .
table 4 and figure 7 shows that w = 17 pixels have the highest accuracy among others .
results of examining different values for window size , w , running on a 2.53 ghz intel core i5 , 3 gb ddriii pc the effect of increasing window size , w , on accuracy we implemented our proposed cauchy matched filter in mathworks matlab 7.6.0 and we examined all the retinal blood vessel images in the drive database of retinal images . as mentioned earlier , we compared our proposed cauchy matched filter with three other prominent matched filter algorithms , namely the classic gaussian matched filter first introduced by chaudhuri et al . in , best available gaussian matched filter introduced by al - rawi et al . in and the student matched filter as the most accurate kernel based matched filter methods in detecting retinal vessels introduced by zolfagharnasab and naghsh - nilchi in .
matlab codes for all four methods are prepared and then , several experiments conducted using the same thresholding method for all four . thresholding method could affect the accuracy .
since each of them used their own thresholding method , in order to have a fair comparison , we used a combination of otsu and local entropy thresholding methods as the universal thresholding method to obtain binary images for all four methods .
later , by applying local entropy thresholding method , the segmented image is converted to the binary vessel map .
such two - step threshold guarantee the effectiveness of the method , because pixels in the first and fourth quarter of the histogram can change the threshold value applied in entropy thresholding method .
the mtpr , mfpr , mtnr and accuracy ,  for our new method and all other three methods are calculated and reported in table 5 .
in addition , figure 8 provides the accuracy of the overall methods in compare to each other . comparing matched filters with different kernel functions to determine which kernel function is more accurate accuracy comparison amidst four matched filter kernels . as it is shown , the proposed matched filter is more accurate the reported mtpr in table 5 indicates that the student matched filter method provide the best mtpr , meaning that the correct detection of the vessels is best done by this algorithm .
other than that , our cauchy matched filter , provides the best mfpr and mtnr among all .
that is , our method is able to not falsely detect pixels as vessels ' pixels and also it is able to correctly detect non - vessel pixels better than all other methods .
in addition , our cauchy matched filter algorithm provides the most accurate results with the accuracy of  = 92.69% , a 1.34% and a 1.73% better than student matched filter and al - rawi et al .
methods , respectively and a significant 5.60% better than chuadhuri 's et al . method .
figure 9 shows an example of the retinal image being processed by classical gaussian matched filter algorithm introduced by chaudhuri et al .
, al - rawi et al . improved gaussian matched and cauchy matched filter algorithm of this paper .
it can clearly be seen that some vessels could be detected by our method while they are not visible in other methods ' results .
that is , cauchy filter based algorithm of this article results a clearer and more precise image of the blood vessels .
visual comparison among different matched filter outputs : ( a ) retinal image , ( b ) classical matched filter proposed by chaudhuri et al .
( d ) cauchy matched filter proposed in this paper moreover figure 10 contains segmented vessels from an abnormal retina .
although the retina contains some abnormalities , the overall accuracy remains 91.70% with 3.5% of fpr , since the algorithm tried to detect structure similar to the constructed cauchy template .
( a ) digital fundus image from an abnormal retina , ( b ) filtered image with cauchy matched filter , ( c ) manual vessel extraction , ( d ) binary resulted image obtained by combination of otsu and local entropy thresholding methods
as discussed earlier , the cauchy pdf includes the parameter  to control the scale of its curve . figure 3 shows that decreasing or increasing in  values causes the cauchy curve to be tightened or loosen up , respectively .
arguably , considering the drive database images as the proper general representative of blood vessels curves , to select a suitable value for  , a reasonable range of integers between are examined on all the blood vessels images on drive database and the corresponding  to the highest accuracy ,  , is chosen . as a reference ,
other parameters , namely mtpr , mfpr and mtnr , are also computed and reported in table 1 .
both the results of table 1 and the figure 4 , which shows the comparison of different  values , indicate that the best integer value for  of the cauchy matched filter is  = 1 .
values examined to obtain suitable value for  results of table 1 indicates that  = 1 has best accuracy among other  values next , we examine the drive database to identify the best trunk value , t. note that the trunk value specifies where the curve should be cut . in other words ,
trunk value shows the edge of the vessels in the template in the kernel of the matched filter .
small values for trunk cause to detect only the center of the vessels , while the edges are ignored , so the accuracy decreases because some of the pixels placed in the edges of a vessel may not be detected . on the other hand , too large values for trunk
cause the matched filter to interpret the texture near the vessels as vessels , incorrectly which increases fpr , and decreases subsequently the accuracy . to identify the best value for the trunk , t , a valid range of integers between are examined and the results are reported in table 2 . as both table 2 and figure 5 indicates , t = 9 has the highest accuracy ,  , so it is chosen as the trunk value for the template of the cauchy matched filter .
result of examining different values for trunk parameter , t comparison among trunk parameter , t similarly , a valid range of integers between are examined on the images of the drive database to identify the best suited value for the length of the template denoted with l. the length corresponds to the length of assumed piece wise line embedded in the kernel .
reported in table 3 , experimental results indicates that l = 8 leads to highest  among others and therefore , l is selected as such .
results of examining range of values for vessel length , l choosing l = 8 as an adequate value for length next parameter to be considered is the kernel size , which affects both the accuracy and the algorithm run time .
while a small kernel size decreases the accuracy , a large kernel size increases the computational complexity .
small kernel size decreases the accuracy because vessels with large diameters fulfill the whole kernel , so for the matched filter , they are detected like the retinal texture where the bell - shape feature is not found in it .
this causes the matched filter to detect just the edges of thick vessels like a two side - rail which are imprecisely interpreted as two parallel vessels .
in contrast , a large kernel size has no positive effect on the accuracy because the template is bounded by the parameter l. the large kernel size , however , requires more computations during the filtering procedure since many more pixels need to be convolved for the elements in the kernel .
used this same kernel size in their improved matched filter algorithm and avoid discussing on why the 17-pixel kernel size is picked up .
zolfagharnasab and naghsh - nilchi in used a 13-pixel kernel size concluded from their practical experiments set .
this table consists of reasonable kernel size , w , and the resulted accuracy and calculation times are reported .
table 4 and figure 7 shows that w = 17 pixels have the highest accuracy among others .
results of examining different values for window size , w , running on a 2.53 ghz intel core i5 , 3 gb ddriii pc the effect of increasing window size , w , on accuracy
we implemented our proposed cauchy matched filter in mathworks matlab 7.6.0 and we examined all the retinal blood vessel images in the drive database of retinal images . as mentioned earlier , we compared our proposed cauchy matched filter with three other prominent matched filter algorithms , namely the classic gaussian matched filter first introduced by chaudhuri et al . in , best available gaussian matched filter introduced by al - rawi et al . in and the student matched filter as the most accurate kernel based matched filter methods in detecting retinal vessels introduced by zolfagharnasab and naghsh - nilchi in .
matlab codes for all four methods are prepared and then , several experiments conducted using the same thresholding method for all four . thresholding method could affect the accuracy .
since each of them used their own thresholding method , in order to have a fair comparison , we used a combination of otsu and local entropy thresholding methods as the universal thresholding method to obtain binary images for all four methods . filtered image
later , by applying local entropy thresholding method , the segmented image is converted to the binary vessel map .
such two - step threshold guarantee the effectiveness of the method , because pixels in the first and fourth quarter of the histogram can change the threshold value applied in entropy thresholding method .
the mtpr , mfpr , mtnr and accuracy ,  for our new method and all other three methods are calculated and reported in table 5 .
in addition , figure 8 provides the accuracy of the overall methods in compare to each other . comparing matched filters with different kernel functions to determine
which kernel function is more accurate accuracy comparison amidst four matched filter kernels . as it is shown , the proposed matched filter is more accurate the reported mtpr in table 5 indicates that the student matched filter method provide the best mtpr , meaning that the correct detection of the vessels is best done by this algorithm .
other than that , our cauchy matched filter , provides the best mfpr and mtnr among all .
that is , our method is able to not falsely detect pixels as vessels ' pixels and also it is able to correctly detect non - vessel pixels better than all other methods .
in addition , our cauchy matched filter algorithm provides the most accurate results with the accuracy of  = 92.69% , a 1.34% and a 1.73% better than student matched filter and al - rawi et al .
methods , respectively and a significant 5.60% better than chuadhuri 's et al . method .
figure 9 shows an example of the retinal image being processed by classical gaussian matched filter algorithm introduced by chaudhuri et al .
, al - rawi et al . improved gaussian matched and cauchy matched filter algorithm of this paper .
it can clearly be seen that some vessels could be detected by our method while they are not visible in other methods ' results .
that is , cauchy filter based algorithm of this article results a clearer and more precise image of the blood vessels .
visual comparison among different matched filter outputs : ( a ) retinal image , ( b ) classical matched filter proposed by chaudhuri et al .
( d ) cauchy matched filter proposed in this paper moreover figure 10 contains segmented vessels from an abnormal retina .
although the retina contains some abnormalities , the overall accuracy remains 91.70% with 3.5% of fpr , since the algorithm tried to detect structure similar to the constructed cauchy template .
( a ) digital fundus image from an abnormal retina , ( b ) filtered image with cauchy matched filter , ( c ) manual vessel extraction , ( d ) binary resulted image obtained by combination of otsu and local entropy thresholding methods
in this paper , we proposed a new kernel function for the retinal blood vessels matched filters based detectors .
it is shown that the cauchy probability distribution function could be substituted with customary gaussian function used by prominent researchers reported in and even replacing the student pdf offered in our previous works .
the reason of higher accuracy is due to better matching between cauchy - based template and vessel profile .
in addition , with a trial and error technique , suitable values for the matched filters variables such as length , l , trunk , t and kernel size , w , in general ; and for the scale variable ,  , of the offered cauchy method based , in specific , could be determined . in general , the identified values improved the matched filters offered by others as well as set a well - designed cauchy matched filter .
the proposed cauchy matched filter is compared under similar circumstances with three other matched filters to have a fair comparison on all kernel functions .
that is , the same local entropy and otsu thresholding methods demonstrated in and are used for all three matched filters as well as our cauchy matched filter .
all retinal blood vessels images at drive database in are used for our experiments and four comparing parameters including mtpr , mfpr , mtnr and accuracy  are measured to compare the results .
experimental results reported in table 5 and figure 8 . all in all , from the results , it is deduced that the offered matched filter with the cauchy pdf as its kernel is a better choice to detect blood vessels in the digital retinal images .
hooshiar zolfagharnasab was born in 1987 . regarding b.sc . , he received computer hardware engineering degree from shahed university of tehran in 2009 . graduated in 2011 , he got m.sc .
currently he is studying phd in electrical and computer engineering at the university of porto , portugal .
e - mail : 
 hozo19@gmail.com , dee12012@fe.up.pt ahmad reza naghsh - nilchi is an associate professor at the university of isfahan , iran .
phd , all in electrical engineering from the university of utah , salt lake city , utah , usa . his research interests include medical image and signal processing as well as intensive computing .
he has been an author or co - author of several journal articles and conference papers and a couple of book sections .
he is the editor - in - chief of the journal of computing and security .
he has served as the chairman of the computer engineering department for three terms and now is the chairman of newly established department of artificial intelligent and multimedia engineering all at the university of isfahan .
he has collaboration with internationally known institutions and peers and served as research scholar at the national university of ireland ( summer 2011 ) , and the university of california , irvine ( 2012 ) , he was listed as who 's who in the world 2011 .
 in this paper , a novel matched filter based on a new kernel function with cauchy distribution is introduced to improve the accuracy of the automatic retinal vessel detection compared with other available matched filter - based methods , most notably , the methods built on gaussian distribution function . 
 several experiments are conducted to pick the best values of the parameters for the new designed filter , including both cauchy function parameters as well as the matched filter parameters such as the threshold value . moreover , 
 the thresholding phase is enhanced with a two - step procedure . 
 experimental results employed on drive retinal images database confirms that the proposed method has higher accuracy compared with other available matched filter - based methods . 
INTRODUCTION
THE MATCHED FILTER
CAUCHY FUNCTION AS MATCHED FILTER'S KERNEL
EXPERIMENTAL RESULTS
Parameters Selection
Implementing and Comparison
CONCLUSION
BIOGRAPHIES