Loading [MathJax]/jax/output/SVG/jax.js
Review Special Issues

Detection of glaucoma using retinal fundus images: A comprehensive review

  • Received: 12 December 2020 Accepted: 01 February 2021 Published: 02 March 2021
  • Content-based image analysis and computer vision techniques are used in various health-care systems to detect the diseases. The abnormalities in a human eye are detected through fundus images captured through a fundus camera. Among eye diseases, glaucoma is considered as the second leading case that can result in neurodegeneration illness. The inappropriate intraocular pressure within the human eye is reported as the main cause of this disease. There are no symptoms of glaucoma at earlier stages and if the disease remains unrectified then it can lead to complete blindness. The early diagnosis of glaucoma can prevent permanent loss of vision. Manual examination of human eye is a possible solution however it is dependant on human efforts. The automatic detection of glaucoma by using a combination of image processing, artificial intelligence and computer vision can help to prevent and detect this disease. In this review article, we aim to present a comprehensive review about the various types of glaucoma, causes of glaucoma, the details about the possible treatment, details about the publicly available image benchmarks, performance metrics, and various approaches based on digital image processing, computer vision, and deep learning. The review article presents a detailed study of various published research models that aim to detect glaucoma from low-level feature extraction to recent trends based on deep learning. The pros and cons of each approach are discussed in detail and tabular representations are used to summarize the results of each category. We report our findings and provide possible future research directions to detect glaucoma in conclusion.

    Citation: Amsa Shabbir, Aqsa Rasheed, Huma Shehraz, Aliya Saleem, Bushra Zafar, Muhammad Sajid, Nouman Ali, Saadat Hanif Dar, Tehmina Shehryar. Detection of glaucoma using retinal fundus images: A comprehensive review[J]. Mathematical Biosciences and Engineering, 2021, 18(3): 2033-2076. doi: 10.3934/mbe.2021106

    Related Papers:

    [1] Shaoliang Yuan, Lin Cheng, Liangyong Lin . Existence and uniqueness of solutions for the two-dimensional Euler and Navier-Stokes equations with initial data in H1. AIMS Mathematics, 2025, 10(4): 9310-9321. doi: 10.3934/math.2025428
    [2] Kaile Chen, Yunyun Liang, Nengqiu Zhang . Global existence of strong solutions to compressible Navier-Stokes-Korteweg equations with external potential force. AIMS Mathematics, 2023, 8(11): 27712-27724. doi: 10.3934/math.20231418
    [3] Cuiman Jia, Feng Tian . Regularity of weak solution of the compressible Navier-Stokes equations with self-consistent Poisson equation by Moser iteration. AIMS Mathematics, 2023, 8(10): 22944-22962. doi: 10.3934/math.20231167
    [4] Krunal B. Kachhia, Jyotindra C. Prajapati . Generalized iterative method for the solution of linear and nonlinear fractional differential equations with composite fractional derivative operator. AIMS Mathematics, 2020, 5(4): 2888-2898. doi: 10.3934/math.2020186
    [5] Benedetta Ferrario, Christian Olivera . Lp-solutions of the Navier-Stokes equation with fractional Brownian noise. AIMS Mathematics, 2018, 3(4): 539-553. doi: 10.3934/Math.2018.4.539
    [6] Yina Lin, Qian Zhang, Meng Zhou . Global existence of classical solutions for the 2D chemotaxis-fluid system with logistic source. AIMS Mathematics, 2022, 7(4): 7212-7233. doi: 10.3934/math.2022403
    [7] Qingkun Xiao, Jianzhu Sun, Tong Tang . Uniform regularity of the isentropic Navier-Stokes-Maxwell system. AIMS Mathematics, 2022, 7(4): 6694-6701. doi: 10.3934/math.2022373
    [8] Jishan Fan, Tohru Ozawa . A note on 2D Navier-Stokes system in a bounded domain. AIMS Mathematics, 2024, 9(9): 24908-24911. doi: 10.3934/math.20241213
    [9] Jae-Myoung Kim . Time decay rates for the coupled modified Navier-Stokes and Maxwell equations on a half space. AIMS Mathematics, 2021, 6(12): 13423-13431. doi: 10.3934/math.2021777
    [10] Junling Sun, Xuefeng Han . Existence of Sobolev regular solutions for the incompressible flow of liquid crystals in three dimensions. AIMS Mathematics, 2022, 7(9): 15759-15794. doi: 10.3934/math.2022863
  • Content-based image analysis and computer vision techniques are used in various health-care systems to detect the diseases. The abnormalities in a human eye are detected through fundus images captured through a fundus camera. Among eye diseases, glaucoma is considered as the second leading case that can result in neurodegeneration illness. The inappropriate intraocular pressure within the human eye is reported as the main cause of this disease. There are no symptoms of glaucoma at earlier stages and if the disease remains unrectified then it can lead to complete blindness. The early diagnosis of glaucoma can prevent permanent loss of vision. Manual examination of human eye is a possible solution however it is dependant on human efforts. The automatic detection of glaucoma by using a combination of image processing, artificial intelligence and computer vision can help to prevent and detect this disease. In this review article, we aim to present a comprehensive review about the various types of glaucoma, causes of glaucoma, the details about the possible treatment, details about the publicly available image benchmarks, performance metrics, and various approaches based on digital image processing, computer vision, and deep learning. The review article presents a detailed study of various published research models that aim to detect glaucoma from low-level feature extraction to recent trends based on deep learning. The pros and cons of each approach are discussed in detail and tabular representations are used to summarize the results of each category. We report our findings and provide possible future research directions to detect glaucoma in conclusion.



    The globalization of financial markets has been developing rapidly, which requires more on credit risk management. Credit risk, which is attracting more and more attention from people in academics and practices, refers to not only default risk but also credit rating migration risk. The credit rating migration risk is playing a more and more significant role in financial markets and risk management, especially after the outbreak and spread of 2008 financial crisis. In particular, the credit rating migration risk makes difference to the corporate bond pricing.

    There are two traditional models for default risk, involving the structural models and reduced form models. In the reduced form models, the default event is depicted and captured by introducing an exogenous variant. The default time is modeled by a stochastic default intensity in this approach, see [7,14,17] and so forth. The assumption on the structural models is that if the below bound of some insolvency threshold is met by corporate value, default occurs. In the model proposed by Merton [28], a default event may only occur at the maturity. Subsequently, Black and Cox [2] extended Merton's model to a first-passage-time model, where default may occur at any time before the debt maturity, see also [1,3,18,25] and so forth.

    With regard to literatures working on credit rating migration, a commonly adopted approach is the Markov chain, which is captured by transition intensity matrix coming from general statistic data, see [5,8,9] and so forth. The framework of reduced form then can be directly developed for dynamic credit rating migration process, see [6,15,30] and so forth. However, the Markov chain ignores the role played by the corporate value when modelling credit rating migration. In fact, the corporate value is an important factor in the credit rating migration and should be taken into consideration. Accordingly, from the corporate perspective, Liang et al. [20] started to model and analyze credit rating migration risk by structural model based on Merton's model. They set a predetermined migration threshold to divide the corporate value into high and low rating regions, where the corporate value follows different stochastic processes. However in practice, the threshold dividing credit ratings is usually not predetermined. To solve this problem, Hu et al. [11] improved the model proposed by Liang et al. [20]. They determined the migration boundary by the dynamic proportion between corporate debt and corporate value, which results in a free boundary problem. Subsequently, Liang et al. [21] incorporated a risk discount factor, which measures the sensibility of credit rating migration to the proportion, into the model and showed that an asymptotic traveling wave solution exists in the free boundary problem. Problem on credit rating migration in switching macro regions can also be referred to Wu and Liang [36], while credit contingent interest rate swap with credit rating migration can be seen in Liang and Zou [23].

    In particular, the aforementioned works [11,20,21,23,36] only take two credit ratings into consideration in credit rating migration problem. The credit region is divided into the high rating region and the low rating region, which results in only one free boundary in the corresponding free boundary problem. However, in practice, we should notice that there are usually more than two credit ratings used when accessing the corporate credit levels. The Standard & Poor's, an international rating agency, downgraded the long-term sovereign credit rating of Greece from A- to BBB+ on the evening of December 16, 2009. This verifies the fact and inspires us to consider multiple credit ratings in migration problems. Wu and Liang [34] provided some numeric results for multiple credit rating migration problem. Wang et al. [32] presented some theoretical results by showing that the asymptotic traveling wave solution obtained in Liang et al. [21] persists in the free boundary problem with multiple free boundaries. By considering stochastic interest rate in reality [19,24,29], Yin et al. [37] improved the model by replacing the constant interest rate with a stochastic version. This improved model covers the previous works where only two credit ratings are involved with an interest-dependent volatility [22] or multiple credit ratings migration with constant interest rate [32,34]. Then Huang et al. [12] continued to study the bond pricing model with multiple credit rating migration and stochastic interest rate. They contributed to establishing the asymptotic traveling wave solution in the time-heterogeneous free boundary problem with multiple free boundaries.

    The aforementioned models for credit rating migration in the structure framework are based on the Merton's model, i.e., default may only occur at the maturity. However, in practice, default may occur at any time up to maturity [4,26,31]. Wu et al. [35] relaxed the default restriction in the credit rating migration model by setting a predetermined threshold capturing the first-passage time when the default occurs. Once the corporate value falls below the threshold at any time, the default occurs. This results in a free boundary problem subject to a new boundary condition. Again we have to notice that the credit region in their credit rating migration model pricing a defaultable corporate bond is still divided into the high and low rating regions and meanwhile, a constant interest rate is also considered. Hence, motivated by these existing works on the effect of credit rating migration risk when valuating a corporate bond, in this paper, we devote to studying a pricing model for a defaultable corporate bond with both multiple credit rating migration risk and stochastic interest rate. Our work extends the existing works [12,37], where the multiplicity of credit rating and stochasticity of interest rate are involved in their models, by inserting the default risk. Meanwhile, we improve the results of Wu et al. [35], who considered default risk in pricing the corporate bond with only one credit rating migration boundary and constant interest rate, to fit the effects of multiple credit ratings and stochastic interest rate.

    The difficulties in analysis are generated from the joint effects and mutual restrictions among the multiplicity of credit ratings, stochastic volatility of interest rate and presence of default boundary. Besides that the free boundary problem turns into a initial-boundary problem, in particular, it is perplexed by not only a time-dependent and discontinuous coefficient but also a time-dependent process arisen in the problem. In addition to an irreducible barrier boundary, these indeed cause some troubles in deriving necessary estimates and then proving the existence and uniqueness of solution to the free boundary problem. Another contribution is the asymptotic behavior of solution to the free boundary problem. We prove that the solution converges to some steady status, which is the spatially homogeneous solution of an auxiliary free boundary problem, whose coefficients are the long time limits of the time-dependent coefficients in the original free boundary problem. This convergence, which shows us the developing tendency of solution, is established by two steps. In the first step, it is shown that the solution of the original free boundary problem converges to the solution of the auxiliary free boundary problem with time tending to infinity, while in the second step, it is shown that the solution of the auxiliary free boundary problem converges to the steady status. Moreover, the steady status can be solved explicitly. Thus, we present an explicit formula to valuate the defaultable corporate bond with multiple credit rating migration risk and stochastic volatility of interest rate.

    The paper is organized as follows. In Section 2, the pricing model is constructed. In Section 3, the model is reduced into a free boundary problem with initial condition and boundary conditions involving default boundary and migrating boundaries. In Section 4, an approximated free boundary problem is analyzed and some preliminary lemmas for uniform estimates are collected. In Section 5, through the approximated free boundary problem, the existence and uniqueness of solution to the free boundary problem are obtained. In Section 6, it is proved that the solution is convergent to a steady status by a Lyapunov argument. Then we conclude the paper by presenting an explicit pricing formula for the defaultable corporate bond in Section 7.

    In this section, we set up the baseline pricing model for a defaultable corporate bond subject to multiple credit rating migration risk and stochastic interest rate. Some necessary assumptions are put forward as follows.

    Let (Ω,F,P) be a complete probability space. Suppose that the corporation issues a defaultable bond, which is a contingent claim of its value on the space (Ω,F,P).

    Let S denote the corporate value in the risk neutral world. It satisfies the Black-Scholes model

    dS=r(t)Sdt+σ(t)SdWt,

    where r is the time-varying interest rate and σ is the heterogeneous volatility with respect to credit ratings. Wt is the Brownian motion generating the filtration {Ft}. The credit is divided into n ratings. In different credit ratings, the corporation shows different volatilities of its value. We denote the volatility in the i'th rating by σ(t)=σi, i=1,2,,n, and in addition, they satisfy

    0<σ1<σ2<<σn1<σn<,

    which means that in the highest credit rating, the corporation shows the smallest volatility σ1 and in the lowest credit rating, it shows the largest volatility σn. The stochastic interest rate r is supposed to satisfy the Vasicek model [27,33]

    dr=a(t)(θ(t)r)dt+σr(t)dWrt,

    which is widely popular in financial application, where the parameters a, θ, σr are supposed to be positive constants in this paper. σr is the volatility of the interest rate. θ is considered as the central location or the long-term value. a determines the speed of adjustment.

    We suppose that the corporation issues only one defaultable bond with face value F. The effect of corporate value on the bond value is focused on and the discount value of bond is considered. Denote by ϕt the discount value of bond at time t. The corporation exhibits two risks, the default risk and credit rating migration risk. The corporation can default before maturity time T. The default time τd is the first moment when the corporate value falls below the threshold K, namely that

    τd=inf{t>0|S0>K,StK},

    where K<FD(t,T), where 0<D(t,T)<1 is the discount function. Once the corporation defaults, the investors will get what is left. Hence, ϕt(K)=K and at the maturity time T, the investors can get ϕT=min{ST,F}. On the other hand, the credit regions are determined by the leverage γ(t)=ϕt/St. Denote the thresholds of leverage γ(t) by γi, i=1,2,,n1, and they satisfy

    0<γ1<γ2<<γn2<γn1<1.

    The credit rating migration times are the first moments when the corporate credit rating is upgraded or downgraded. They are defined as follows:

    τ1=inf{t>0|ϕ0/S0<γ1,ϕt/Stγ1},
    τn=inf{t>0|ϕ0/S0>γn1,ϕt/Stγn1},
    τi,i+1=inf{t>0|γi1<ϕ0/S0<γi,ϕt/Stγi},i=2,3,,n1,
    τi,i1=inf{t>0|γi1<ϕ0/S0<γi,ϕt/Stγi1},i=2,3,,n1.

    τ1 is the first moment that the corporation degrades from the highest credit rating. τn is the first moment that the corporation upgrades from the lowest credit rating. τi,i+1 is the first moment that the corporation jumps up into the i+1'th credit rating from the i'th credit rating, while τi,i1 is the first moment that the corporation jumps down into the i1'th credit rating from the i'th credit rating.

    Once the credit rating migrates before the maturity T, a virtual substitute termination happens, namely that the bond is virtually terminated and substituted by a new one with a new credit rating [35]. Thus, there is a virtual cash flow of the bond. Denote the bond values in different credit ratings by ϕi(t,S), i=1,2,,n. Then they are the conditional expectations as follows

    ϕ1(t,S)=Et,S[h1(t,T)|ϕ1(t,S)<γ1S],

    where

    h1(t,T)=eTtr(s)dsmin{ST,F}χ(min{τ1,τd}T)+eτ1tr(s)dsϕ2(τ1,Sτ1)χ(t<τ1<min{τd,T})+eτdtr(s)dsKχ(t<τd<min{τ1,T}),

    and for i=2,3,,n1,

    ϕi(t,S)=Et,S[hi(t,T)|γi1S<ϕi(t,S)<γiS],

    where

    hi(t,T)=eTtr(s)dsmin{ST,F}χ(min{τi,i+1,τi,i1,τd}T)+eτi,i+1tr(s)dsϕi+1(τi,i+1,Sτi,i+1)χ(t<τi,i+1<min{τi,i1,τd,T})+eτi,i1tr(s)dsϕi1(τi,i1,Sτi,i1)χ(t<τi,i1<min{τi,i+1,τd,T})+eτdtr(s)dsKχ(t<τd<min{τi,i+1,τi,i1,T})

    and

    ϕn(t,S)=Et,S[hn(t,T)|ϕn(t,S)>γn1S],

    where

    hn(t,T)=eTtr(s)dsmin{ST,F}χ(min{τn,τd}T)+eτntr(s)dsϕn1(τn,Sτn)χ(t<τn<min{τd,T})+eτdtr(s)dsKχ(t<τd<min{τn,T}),

    where χ is the indicative function, satisfying χ=1 if the event happens and otherwise, χ=0.

    Suppose that the correlation between the interest rate and the corporate value is given by dWrtdWt=ρt, 1ρ1. By the Feynman-Kac formula, we can derive that ϕi, i=1,2,,n, are functions of time t, interest rate r and value S. They satisfy the following PDE in their regions

    ϕ1t+σ21S222ϕ1S2+σrσ1ρS2ϕ1Sr+rSϕ1S+2ϕ1r2+a(θr)ϕ1rrϕ1=0,ϕ1<γ1S, (2.1)

    and for i=2,3,,n1,

    ϕit+σ2iS222ϕiS2+σrσiρS2ϕiSr+rSϕiS+2ϕir2+a(θr)ϕirrϕi=0,γi1S<ϕi<γiS, (2.2)

    and

    ϕnt+σ2nS222ϕnS2+σrσnρS2ϕnSr+rSϕnS+2ϕnr2+a(θr)ϕnrrϕn=0,ϕn>γn1S, (2.3)

    with terminal conditions

    ϕi(T,r,S)=min{S,F},i=1,2,,n, (2.4)

    and boundary condition

    ϕn(t,r,K)=K. (2.5)

    The bond value is continuous when it passes a rating threshold, i.e., ϕi=ϕi+1 on the rating migration boundaries, where i=1,2,,n1. Also, if we construct a risk free portfolio π by longing a bond and shorting Δ amount asset value S, i.e., π=ϕΔS and such that dπ=rπ, this portfolio is also continuous when it passes the rating migration boundaries, namely that πi=πi+1 or Δi=Δi+1 on the rating migration boundaries, where i=1,2,,n1. By Black-Scholes theory [16], it is equivalent to

    ϕiS=ϕi+1Sontheratingmigrationboundary,i=1,2,,n1. (2.6)

    Denote by P(t,r) the value of a guaranteed zero-coupon bond with face value 1 at the maturity t=T, where the interest rate follows the Vasicek model. By the Feynman-Kac formula, P(t,r) satisfies the following PDE

    Pt+σ2r22Pr2+a(θr)PrrP=0,r>0,0<t<T,

    with terminal condition P(T,r)=1, whose explicit solution is solved as P(t,r)=eA(Tt) [13], where

    A(Tt)=1a2(B2(Tt)(Tt))(a2θσ2r2)σ2r4aB2(Tt)rB(Tt)

    and

    B(Tt)=1a(1ea(Tt)).

    Take transformations

    y=SP(t,r),ψi(t,y)=ϕi(t,r,S)P(t,r),i=1,2,,n.

    Then ψi, i=1,2,,n satisfy

    ψ1t+ˆσ21y222ψ1y2=0,ψ1<γ1y, (2.7)

    and for i=2,3,,n1,

    ψit+ˆσ2iy222ψiy2=0,γi1y<ψi<γiy, (2.8)

    and

    ψnt+ˆσ2ny222ψny2=0,ψn>γn1y, (2.9)

    where

    ˆσ2i=σ2i+2ρσiσrB(Tt)+σ2rB2(Tt).

    The terminal conditions are given as

    ψi(T,y)=min{y,F},i=1,2,,n, (2.10)

    and the boundary conditions are

    ψn(t,KeA(Tt))=KeA(Tt) (2.11)

    and

    ψi=ψi+1,ψiy=ψi+1y,ontheratingmigrationboundary (2.12)

    for i=1,2,,n1.

    We introduce the standard transformation of variable x=logy, remaining Tt as t, and define

    φ(t,x)=exψi(Tt,ex)inthei'thratingregion.

    Using (2.12), we drive the following equation from (2.7)-(2.9) as

    φtˆσ222φx2ˆσ22φx=0,logKA(t)<x<,t>0, (3.1)

    where ˆσ=ˆσ1 as φ<γ1, ˆσ=ˆσi as γi1<φ<γi for i=1,2,,n1, ˆσ=ˆσn as φ>γn1,

    ˆσ2i(t)=σ2i+2ρσiσrB(t)+σ2rB2(t),i=1,2,,n. (3.2)

    Meanwhile denote by

    ˉˆσ2i=σ2i+2ρσiσra+σ2ra2,i=1,2,,n, (3.3)

    the limits of ˆσ2i(t) as time tends to infinity, i=1,2,,n. Without loss of generality, suppose that F=1 and there holds K<1. Then (3.1) is supplemented with the initial condition

    φ(0,x)=min{1,ex}. (3.4)

    and boundary condition

    φ(t,s(t))=1, (3.5)

    where s(t)=logKA(t). Take u(t,x)=φ(t,x+s(t)). Then u satisfies

    utˆσ222ux2(ˆσ22+˙s(t))ux=0,0<x<,t>0, (3.6)

    where

    ˙s(t)=(σ2r2a2θ)(2B(t)eat1)+σ2r2aB(t)eat+reat

    and ˆσ=ˆσ1 as u<γ1, ˆσ=ˆσi as γi1<u<γi for i=1,2,,n1, ˆσ=ˆσn as u>γn1, with the initial condition

    u(0,x)=min{1,e(x+s(0))}=min{1,e(x+logK)} (3.7)

    and boundary condition

    u(t,0)=1. (3.8)

    The domain will be divided into n rating regions Qi, i=1,2,,n. We will prove that the domain can be separated by n1 free boundaries x=λi(t), i=1,2,,n1. These boundaries are a prior unknown since they should be solved by equations

    u(t,λi(t))=γi,i=1,2,,n1, (3.9)

    where u is also a priori unknown. Since we have assumed that (3.1) is valid cross the free boundaries, (2.12) implies that for i=1,2,,n1,

    u(t,λi(t))=u(t,λi(t)+)=γi,ux(t,λi(t))=ux(t,λi(t)+). (3.10)

    In the work [35] and [12], where the former model is subject to constant interest rate and the later one is subject to stochastic interest rate but without default boundary, the process ˙s(t) in (3.6) is replaced by a constant. The presence of ˙s(t) indeed leads to some technical differences in deriving the estimates in the following argument. We can rewrite the formula of ˙s(t) as

    ˙s(t)=(β+r)eatβe2ata2(βσ2r2a2),

    where

    β=σ2ra32θa+σ2r2a2.

    It is not difficult to analyze and derive that one of the following conditions holds, then there holds ˙s(t)0:

    02a2βσ2r; (3.11)

    or

    βr,a(β+r)2+σ2rβ2a2β2; (3.12)

    or

    r<β<0. (3.13)

    Let H(ξ) be the Heaviside function, namely that H(ξ)=0 for ξ<0 and H(ξ)=1 for ξ0. Then we can rewrite the volatility ˆσ in (3.6) as

    ˆσ=ˆσ1+n1i=1(ˆσi+1ˆσi)H(uγi).

    We approximate H(ξ) by a C function Hϵ(ξ) satisfying

    Hϵ(ξ)=0forξ<ϵ,Hϵ(ξ)=1forξ>0,Hϵ(ξ)0for<ξ<.

    Consider the approximated free boundary problem

    Lϵ[uϵ]uϵtˆσ2ϵ22uϵx2(ˆσ2ϵ2+˙s(t))uϵx=0,0<x<,t>0, (4.1)

    with initial condition

    uϵ(0,x)=min{1,e(x+logK)} (4.2)

    and

    uϵ(t,0)=1, (4.3)

    where

    ˆσϵ=ˆσ1+n1i=1(ˆσi+1ˆσi)Hϵ(uϵγi).

    Problem (4.1)-(4.3) admits a unique classical solution uϵ. Now we proceed to derive some estimates for uϵ.

    Some uniform estimates are presented in this section, which are sufficient to obtain the existence and uniqueness of solution to problem (3.6)-(3.10).

    Lemma 4.1. Let uϵ be the solution of problem (4.1)-(4.3). Suppose that one of the conditions (3.11)-(3.13) holds. Then there holds

    0uϵmin{1,e(x+logK)},0<x<,t>0.

    Proof. It is easy to verify that 0 is the lower solution of uϵ and meanwhile, e(x+logK) and 1 are upper solutions. The result is a direct application of comparison principle.

    Lemma 4.2. Let uϵ be the solution of problem (4.1)-(4.3). Then there exists a constant C>0, independent of ϵ, such that

    Cuϵx0,0<x<,t>0.

    Proof. It is easy to see that ˆσ2ϵ can be written as

    ˆσ2ϵ=ˆσ21+n1i=1(ˆσ2i+1ˆσ2i)Hϵ(uϵγi).

    Differentiating (4.1) with respect to x gives

    Lϵ1[uϵx]Lϵ[uϵx]12n1i=1(ˆσ2i+1ˆσ2i)Hϵ(uϵγi)(2uϵx2+uϵx)uϵx=0.

    It is known that uϵx(0,x)=0 for 0<x<logK and uϵx(0,x)=e(x+logK)0 for x>logK. Since

    uϵ(t,x)uϵ(t,0)x0,

    then letting x0, it holds that uϵx(t,0)0. Thus it follows by maximum principle that there holds uϵx0.

    On the other hand, since ˙s(t) is uniformly bounded, take an appropriate value C>0, such that

    Lϵ[eCx]=(ˆσ2ϵ2C2+(ˆσ2ϵ2+˙s(t))C)eCx<0.

    Clearly, eCx|x=0=1 and eCxmin{1,e(x+logK)} for C sufficiently large. Then there hold uϵ(t,x)eCx and

    uϵ(t,x)uϵ(t,0)xeCx1x.

    Letting x0, we have uϵx(t,0)C. Clearly, there holds

    Lϵ1[C]=C22n1i=1(ˆσ2i+1ˆσ2i)Hϵ(uϵγi)0,

    as ˆσ2i+1>ˆσ2i for i=1,2,,n1. It follows by the comparison principle that there holds uϵxC.

    Lemma 4.3. Let uϵ be the solution of problem (4.1)-(4.3). Suppose that one of the conditions (3.11)-(3.13) holds. Then there exist constants C1, C2, C3 and C4, independent of ϵ, such that

    C3C2texp(C1t|x+logK|2)uϵtC4,0<x<,t>0.

    Proof. Differentiating (4.1) with respect to t gives

    Lϵ[uϵt]12ˆσ2ϵtuϵt+˙s(t)2ˆσ2ϵtuϵx¨s(t)uϵx=0,

    where

    ¨s(t)=2aβe2ata(β+r)eat.

    Since

    ˆσ2ϵt=h1(t)+h2(t)uϵt,

    where

    h1(t)=ˆσ21t+n1i=1(ˆσ2i+1tˆσ2it)Hϵ(uϵγi),

    and

    h2(t)=n1i=1(ˆσ2i+1ˆσ2i)Hϵ(uϵγi),

    we can write

    Lϵ[uϵt]=h2(t)2(uϵt)2+12(h1(t)˙s(t)h2(t)uϵx)uϵt+(¨s(t)˙s(t)h1(t)2)uϵx. (4.4)

    According to the formulas of ˆσ2i, i=1,2,,n, we have h1(t)ˆσ2nt. On the other hand, there exists ˜λϵi(t) such that Hϵ(uϵ(t,˜λϵi(t))γi) attains its maximum and

    h2(t)˜h2(t)max1in1(ˆσ2i+1(t)ˆσ2i(t))Hϵ(uϵ(t,˜λϵi(t))γi).

    Denote by y(t) the solution of the following ODE

    y(t)=˜h2(t)y2(t)+12(ˆσ2nt+C˙s(t)˜h2(t))y(t)+C(|¨s(t)|+˙s(t)2ˆσ2nt),y(0)=y0, (4.5)

    where the constant C is given as the one in Lemma 4.2. At x=logK, 2uϵx2(0,x) produces a Dirac measure of density 1. Thus uϵt(0,x)0 in the distribution sense. In addition, since the second order compatibility condition is satisfied at (0,0), we have uϵt is continuous at (0,0). Meanwhile, uϵt(0,t)=0. By further approximating the initial data with smooth function if necessary, there holds by the comparison principle that

    uϵt(t,x)y(t),0<x<,t>0,

    if we set y0=0. The ODE (4.5) can be solved formally as

    y(t)=q(t)exp(t0p(s)ds),

    where

    p(t)=˜h2(t)y(t)+12(ˆσ2nt+C˙s(t)˜h2(t)),

    and

    q(t)=Ct0(|¨s(r)|+˙s(r)2ˆσ2nr)exp(r0p(τ)dτ)dr.

    Since ˆσ2nt0 as t and Hϵ converges to the Dirac measure as ϵ0, this implies that exp(t0p(s)ds) is uniformly bounded with respect to t. With regard to q(t), in addition to ¨s(t)0 as t, it is known that q(t) is also uniformly bounded. Hence, we conclude that y(t) is uniformly bounded with respect to t.

    On the other hand, since uϵ(0,0)=1>γn1, and by Hölder continuity of solution, there exists a ρ>0, independent of ϵ, such that

    uϵ(t,x)>1+γn12

    for |x|ρ, 0tρ2. Thus for sufficiently small ϵ<12(1γn1), ˆσϵ=ˆσn for |x+logK|ρ, 0tρ2. It follows from the standard parabolic estimates [10] that

    uϵtC2C2texp(C1t|x+logK|2)

    for |x+logK|<ρ2, 0<tρ24. Note that (4.4) can be rewritten as

    Lϵ[uϵt]=h2(t)2(uϵt˙s(t)uϵx)uϵt+h1(t)2uϵt+(¨s(t)˙s(t)h1(t)2)uϵx.

    As ˙s(t) is uniformly bounded, we take a sufficiently large constant C3 such that C3supt0|˙s(t)|C, where constant C is the one given in Lemma 4.2. Then if uϵt<C3, there holds

    Lϵ[uϵt]12ˆσ2ntuϵt(|¨s(t)|+˙s(t)2ˆσ2nt)C.

    Denote by z(t) the solution of the following ODE

    z(t)=12ˆσ2ntz(t)(|¨s(t)|+˙s(t)2ˆσ2nt)C,z(0)=z0,

    which can be solved as

    z(t)=b(t)exp(12t0ˆσ2nsds),

    where

    b(t)=z0Ct0(|¨s(r)|+˙s(r)2ˆσ2nr)exp(12r0ˆσ2nτdτ)dr.

    As ˆσ2nt and ¨s(t) tends to 0 as t, z(t) is uniformly bounded. Moreover, z(t) is also decreasing if z00. Take the initial data |z0| and constant C3 sufficiently large such that

    C3supt0|z(t)|C2+C2texp(C1t|x+logK|2)

    on the boundary

    {|x+logK|=ρ2,0<t<ρ24}{|x+logK|<ρ2,t=ρ24}.

    We claim that the region

    {uϵt<C3}\{|x+logK|<ρ2,0<tρ24}

    is an empty set. If not, on the parabolic boundary of this region, we clearly have uϵtC3, which implies by the comparison principle that

    uϵtz(t)C3

    in this region. This is a contradiction.

    Remark 4.4. In the work [35], it was proved that uϵt0, which is different from the result shown in Lemma 4.3. However, although we get a similar result to Lemma 5.4 in [12], the proof is very different and more technical. This is due to the joint effect of stochastic interest rate and default boundary.

    Corollary 4.5. Let uϵ be the solution of problem (4.1)-(4.3). Suppose that one of the conditions (3.11)-(3.13) holds. Then there exist constants C1, C2, C3 and C4, independents of ϵ, such that

    C3C2texp(C1t|x+logK|2)2uϵx2C4,0<x<,t>t0.

    Denote by λϵi, i=1,2,,n1 the approximated free boundaries, which are the solutions of equations

    uϵ(t,λϵi(t))=γi,i=1,2,,n1. (4.6)

    Then we have the following estimates for the approximated free boundaries.

    Lemma 4.6. Let λϵi, i=1,2,,n1, be the approximated free boundaries defined in (4.6). Suppose that one of the conditions (3.11)-(3.13) holds. Then there exist constants C1, C2, independent of ϵ, such that

    C1λϵn1(t)λϵn2(t)λϵ2(t)λϵ1(t)C2.

    Proof. Since

    uϵ(t,λϵi(t))=γi<γi+1=uϵ(t,λϵi+1(t)),

    which implies that λϵi(t)λϵi+1(t) by Lemma 4.2. From Lemma 4.1, we have

    uϵ(t,x)e(x+logK),

    which implies that

    uϵ(t,x)<γ1forx>logγ1K.

    This means that region {x>logγ1K} is in the highest rating region and hence

    λϵ1(t)C2logγ1K.

    Denote by m=supt0˙s(t) and

    v(x)=1+γn12exp((1+2mσ21)x).

    Then v(0)=12(1+γn1)<1=uϵ(t,0). We can see that v(x)v(0)<1 and

    v(x)ex+logK=1+γn12exp(2mσ21x+logK)<1,

    which implies that

    v(x)<min{1,e(x+logK)}=uϵ(0,x).

    In addition, we have

    Lϵ[v]=1+γn12exp((1+2mσ21)x)(1+2mσ21)(˙s(t)mˆσ2ϵσ21)0.

    By the comparison principle, we have v(x)uϵ(t,x), which implies that

    uϵ(t,x)1+γn12exp((1+2mσ21)x)>γn1

    for

    x<C1σ21σ21+2mlog1+γn12γn1.

    This means that region {x<C1} is in the lowest rating region and hence λϵn1(t)C1.

    Lemma 4.7. Let λϵi, i=1,2,,n1, be the approximated free boundaries defined in (4.6). Suppose that one of the conditions (3.11)-(3.13) holds. Then there exists constant C independent of ϵ, such that

    CdλϵidtC,0<t<T,i=1,2,,n1.

    Proof. Clearly, there holds

    dλϵidt=uϵt(t,λϵi(t))/uϵx(t,λϵi(t)),i=1,2,,n1.

    Since λϵi(0)=logγilogK, i=1,2,,n1, by Lemma 4.3, there is a constant ρ>0 independent of ϵ such that

    λϵi(t)+logKρfor0tρ2,i=1,2,,n1.

    It follows from Lemma 4.3 that

    C0uϵt(t,λϵi(t))C0,i=1,2,,n1,

    where C0 is a constant independent of ϵ. To finish the proof, it is sufficient to prove that

    uϵx(t,λϵi(t))C

    for some positive constant C independent of ϵ. As shown in Lemma 4.2, we have

    Lϵ1[uϵx]=Lϵ[uϵx]+12n1i=1(ˆσ2i+1ˆσ2i)Hϵ(uϵγi)(2uϵx2+uϵx)uϵx=0.

    In addition, there also holds uϵx(0,x)=0 for 0<x<logK and uϵx(0,x)=e(x+logK) for x>logK, and uϵx(t,0)0 for t>0. By Lemmas 4.3 and 4.6, there exists constant R>0 independent of ϵ, such that

    2Rλϵi(t)R1for0<tT,i=1,2,,n1,

    and

    λϵi(t)+logKρfor0tρ2,i=1,2,,n1.

    Consider the region

    Ω={ρ2logK<x<R,0<t<ρ2}{1RxR,ρ2tT}. (4.7)

    The parabolic boundary of this region Ω consists of five line segments. On the initial line segment {t=0,ρ2logKxR}, there holds that uϵx(0,x)=e(x+logK). The remaining four parabolic boundaries {0tT,x=R}{0tρ2,x=ρ2logK}{t=ρ2,1Rxρ2logK}{ρ2tT,x=1R} are completely and uniformly within the highest or lowest rating region (independent of ϵ). Thus by compactness and the strong maximum principle, on these four boundaries, it holds that uϵxˉC>0 for some ˉC independent of ϵ. It follows that

    uϵxmin{1,ˉC}ConΩ, (4.8)

    which completes the proof of the lemma.

    Lemmas 4.1-4.3 and Corollary 4.5 provide uniform estimates for approximated solution uϵ. By taking a limit ϵ0 (along a subsequence if necessary), we derive the existence of solution to problem (3.6)-(3.10). Lemmas 4.6-4.7 show that there are uniform estimates in C1([0,T]) for the approximated free boundaries λϵi, i=1,2,,n1. Therefore, the limits of λϵi as ϵ0 exist, which are denoted by λi, i=1,2,,n1. These λi, i=1,2,,n1, are the free boundaries of the original problem.

    Theorem 5.1. The free boundary problem (3.6)-(3.10) admits a solution (u,λi,i=1,2,,n1) with

    uW1,2([0,T]×(0,)¯Qt0)W0,1([0,T]×(0,))

    for any t0>0, where

    Qt0=(0,t20)×(t0logK,t0logK)

    and λiW1([0,T]), i=1,2,,n1.

    By the classical parabolic theory, it is also clear that the solution is in ni=1C(Ωi), where

    Ω1={(t,x):x>λ1(t),0<tT},

    and for i=2,3,,n1

    Ωi={(t,x):λi(t)<x<λi1(t),0<tT},

    and

    Ωn={(t,x):x<λn1(t),0<tT}.

    Now we prove the uniqueness of solution to the problem (3.6)-(3.10).

    Theorem 5.2. The solution (u,λi,i=1,2,,n1) of the problem (3.6)-(3.10) with

    uW1,2([0,T]×(0,)¯Qt0)W0,1([0,T]×(0,))

    and λiC([0,T]) is unique.

    Proof. Suppose that (u,λi,i=1,2,,n1) and (˜u,˜λi,i=1,2,,n1) are two solutions of the problem (3.6)-(3.10). Then u(t,λi(t))=˜u(t,˜λi(t))=γi, i=1,2,,n1 and

    u(t,λi(t))˜u(t,λi(t))=˜u(t,˜λi(t))˜u(t,λi(t)),i=1,2,,n1.

    Besides, at t=0, λi(0)=˜λi(0)=logKlogγi, i=1,2,,n1. As shown in Lemma 4.7, there exists a constant C>0, such that ux<C and ˜ux<C on the region Ω defined by (4.7). Then by the implicit function theorem, there exists ρ>0, such that when 0<t<ρ,

    |λi(t)˜λi(t)|Cmax0<x<|u(t,x)˜u(t,x)|,i=1,2,,n1, (5.1)

    where C is a positive constant, whose value may change line on line but makes no difference. Let w=u˜u and denote by ˆσ and ˜ˆσ the corresponding coefficients, then w satisfies

    1ˆσ2wt122wx2(˙s(t)ˆσ2+12)wx=(1˜ˆσ21ˆσ2)(˜ut˙s(t)˜ux). (5.2)

    u, ˜u and their derivatives decay exponentially fast to 0 as x. Multiplying (5.2) by w on both sides and integrating x from 0 to gives

    0(wˆσ2wtw22wx2(˙s(t)ˆσ2+12)wwx)dx=0(1˜ˆσ21ˆσ2)(˜ut˙s(t)˜ux)wdx. (5.3)

    Since

    1˜ˆσ21ˆσ20forxn1i=1[λi(t)˜λi(t),λi(t)˜λi(t)],

    and ˜ut and ˜ux are uniformly bounded outside the region ¯Qt0, we conclude that they are bounded for xn1i=1[λi(t)˜λi(t),λi(t)˜λi(t)]. Since w decays exponentially to 0 as x, for any t>0, there exists x0< such that

    max0<x<w2(t,x)=w2(t,x0).

    Take

    ¯w=1ϵx0+ϵx0w(t,x)dx=w(t,x),

    for some x(x0,x0+ϵ). Then there holds

    max0<x<|w(t,x)|22|w(t,x0)¯w|2+2|¯w|2=2(xx0wxdx)2+2ϵ2(x0+ϵx0wdx)22ϵx0+ϵx0(wx)2dx+2ϵx0+ϵx0w2dx2ϵ0(wx)2dx+2ϵ0w2dx. (5.4)

    It follows that

    0(1˜ˆσ21ˆσ2)(˜ut˙s(t)˜ux)wdxCmax0<x<|w(t,x)|n1i=1λi(t)˜λi(t)λi(t)˜λi(t)|1˜ˆσ21ˆσ2|dxCmax0<x<|w(t,x)|n1i=1|λi(t)˜λi(t)|Cmax0<x<|w(t,x)|2(by(5.1))Cϵ0w2dx+ϵ0(wx)2dx. (5.5)

    We now proceed to estimate the left side of (5.3). First, we have

    +0wˆσ2wtdx=λn10wˆσ2nwtdx+n2i=1λiλi+1wˆσ2i+1wtdx+λ1wˆσ21wtdx=g1(t)+g2(t)+n1i=1(1ˆσ2i1ˆσ2i+1)λi(t)w2(t,λi(t))2g1(t)+n1i=1(1ˆσ2i1ˆσ2i+1)λi(t)w2(t,λi(t))2, (5.6)

    where

    g1(t)=λn10w22ˆσ2ndx+n2i=1λiλi+1w22ˆσ2i+1dx+λ1w22ˆσ21dx,

    and

    g2(t)=λn10w22ˆσ4nˆσ2ntdx+n2i=1λiλi+1w22ˆσ4i+1ˆσ2i+1tdx+λ1w22ˆσ41ˆσ21tdx.

    Second, we have

    0w22wx2dx=120(wx)2dx (5.7)

    and

    0(˙s(t)ˆσ2+12)wwxdxϵ0(wx)2dx+Cϵ0w2dx, (5.8)

    as ˙s(t) is uniformly bounded. Combining the above inequalities (5.5)-(5.8), taking into account (5.3), we drive

    g1(t)ϵ0(wx)2dx+Cϵ0w2dx+n1i=1(1ˆσ2i+11ˆσ2i)λi(t)w2(t,λi(t))2ϵ0(wx)2dx+Cϵ0w2dx+Cmax0x|w(t,x)|2Cϵ0(wx)2dx+Cϵ0w2dx.

    It is easy to see that there exists a constant C0>0 such that

    C00w2dxg1(t)Cϵt00(wx)2dxds+Cϵt00w2dxds.

    Then for sufficiently small ϵ, by applying the Gronwall's inequality, we conclude that w0. This proves the uniqueness for 0tρ. A close examination of the proof indicates that the uniqueness result can be extended to any time interval, where ux is strictly negative, which is already verified in (4.8).

    Denote by ψ the solution of the following static problem

    ˉˆσ222ψx2+(ˉˆσ22+θσ2r2a2)ψx=0, (6.1)

    with boundary conditions

    ψ(0)=1,limxψ(x)=0, (6.2)
    ψ(λi)=γi,ψx(λi+)=ψx(λi),i=1,2,,n1, (6.3)

    where ˉˆσ=ˉˆσ1 as ψ<γ1, ˉˆσ=ˉˆσi as γi1<ψ<γi for i=1,2,,n1, ˉˆσ=ˉˆσn as ψ>γn1, and ˉˆσi, i=1,2,,n, are given in (3.3). We suppose that in the i'th rating region, ψ admits the following form

    ψ(x)=pi+qiexp(kix),i=1,2,,n, (6.4)

    where pi, qi and ki are undetermined constants. Substituting (6.4) into (6.1) in the corresponding rating region gives

    ki=σ2ra2ˉˆσ2i2θˉˆσ2i1,i=1,2,,n.

    As it is supposed that one of the conditions (3.11)-(3.13) holds, then ˙s(t)0, which implies that ki<0, i=1,2,,n. Substituting (6.4) into the boundary condition (6.3) gives

    pi+qiexp(kiλi)=γi, (6.5)
    pi+1+qi+1exp(ki+1λi)=γi, (6.6)

    and

    qikiexp(kiλi)=qi+1ki+1exp(ki+1λi) (6.7)

    for i=1,2,,n1. Also, substituting (6.4) into the boundary condition (6.2) gives

    p1=0,pn+qn=1. (6.8)

    It is easy to see that coefficient system (6.5)-(6.8) can be equivalently rewritten as

    logqi+kiλi=log(γipi), (6.9)
    logqi+1+ki+1λi=log(γipi+1), (6.10)
    logqi+logki+kiλi=logqi+1+logki+1+ki+1λi (6.11)

    for i=1,2,,n1, and

    log(γ1p1)=logγ1,logqn=log(1pn). (6.12)

    For i=1,2,,n2, from the equations

    pi+1+qi+1exp(ki+1λi)=γi,pi+1+qi+1exp(ki+1λi+1)=γi+1,

    we can derive their relationship as

    log(γipi+1)=log(γi+1pi+1)+ki+1λiki+1λi+1.

    Thus, denote by xi=logqi for i=1,2,,n, yi=log(γipi) for i=1,2,,n1 and yn=log(1pn), zi=log(γipi+1), i=1,2,,n1. Then (6.9)-(6.12) can be rewritten as

    xiyi+kiλi=0,i=1,2,,n1, (6.13)
    xi+1zi+ki+1λi=0,i=1,2,,n1, (6.14)
    xixi+1+(kiki+1)λi+logkilogki+1=0,i=1,2,,n1, (6.15)
    ziyi+1ki+1λi+ki+1λi+1=0,i=1,2,,n1, (6.16)
    λn=0,y1=logγ1,xn=yn, (6.17)

    where a virtual parameter λn is added. (6.13)-(6.17) is a linearized system from (6.5)-(6.8) and can be solved according to fundamental linear algebra theory. Thus, we obtain the explicit solution of the static problem (6.1)-(6.3).

    The coefficients in the model of [35] are time-homogeneous and moreover, the solution is decreasing in time. However, both of these are not the cases in our model. We cannot take advantage of the decreasing property of solution to obtain the convergence. In this paper, we are motivated by the idea of [12] and obtain the convergence by two steps. The first step is to show that the solution of problem (3.6)-(3.10) converges to the solution of some auxiliary problem defined below, while in the second step, we show that the solution of auxiliary problem converges to the solution of static problem (6.1)-(6.3). Now define an auxiliary free boundary problem as follows

    ˉutˉˆσ222ˉux2(ˉˆσ22+θσ2r2a2)ˉux=0,0<x<,t>0, (6.18)

    with initial condition ˉu0 and boundary condition ˉu(t,0)=1,

    ˉu(t,ˉλi(t))=ˉu(t,ˉλi(t)+)=γi,ˉux(t,ˉλi(t))=ˉux(t,ˉλi(t)+),i=1,2,,n1. (6.19)

    All the results derived above involving the existence, uniqueness and some properties of solution presented in Lemmas 4.1-4.6 hold for solution of problem (6.18)-(6.19). We have to notice that as the presence of default boundary, although we follow the idea of [12], the technical proofs are different, especially in the step, i.e., the convergence from the original solution to the auxiliary solution.

    Since ˆσi(t)ˉˆσi, i=1,2,,n, and ˙s(t)θσ2r2a2 as t, then for any ϵ>0, there exists a T>0 such that for tT,

    1ˉˆσ2iϵ1ˆσ2i(t)1ˉˆσ2i+ϵ,θσ2r2a2ϵ˙s(t)θσ2r2a2+ϵ. (6.20)

    Let ˉu0(x)=u(T,x) and denote by uT(t,x)=u(t+T,x) for t0. We have uT(t,λi(t))=ˉu(t,ˉλi(t))=γi, i=1,2,,n1, and

    uT(t,λTi(t))ˉu(t,λTi(t))=ˉu(t,ˉλi(t))ˉu(t,λTi(t)),i=1,2,,n1,

    where λTi(t)=λi(t+T), i=1,2,,n1. Similarly to the proof of Theorem 5.2, by the implicit function theorem, there exists a ρ>0, such that when 0<t<ρ,

    |ˉλi(t)λTi(t)|Cmax0x|uT(t,x)ˉu(t,x)|,i=1,2,,n1, (6.21)

    where C is a positive constant, whose value may change line on line but makes no difference. Let w=uTˉu. Then w satisfies

    1ˆσ2Twt=122wx2+(12+˙sT(t)ˆσ2T)wx+h1+h2, (6.22)

    where ˙sT(t)=˙s(t+T),

    h1=(1ˉˆσ21ˆσ2T)(ˉut(θσ2r2a2)ˉux),

    and

    h2=(˙sT(t)θ+σ2r2a2)ˉux.

    As u, ˉu and their derivatives decay exponentially fast to 0 as x, multiplying (6.22) by w on both sides and integrating x from 0 to gives

    0wˆσ2Twtdx=0w22wx2dx+0(12+˙sT(t)ˆσ2T)wxwdx+0h1wdx+0h2wdx. (6.23)

    By Lemmas 4.2 and 4.3, we know that ˉut and ˉux are uniformly bounded as the initial data is set to be ˉu0(x)=u(T,x) for a sufficiently large T. It follows that

    0h1wdxmax0x|w(t,x)|n1i=1λTiˉλiλTiˉλi|1ˉˆσ21ˆσ2T|dx+h3max0x|w(t,x)|n1i=1|λTi(t)ˉλi(t)|+h3(by(6.21))max0x|w(t,x)|2+h3,

    where

    h3=(λTn1ˉλn10+n2i=1λTiˉλiλTi+1ˉλi+1+λT1ˉλ1)|1ˉˆσ21ˆσ2T|wdxϵ0wdxCϵ,

    hold by (6.20) and the exponential decay of w. Using (5.4), there holds

    0h1wdxCϵ0w2dx+ϵ0(wx)2dx+ϵC. (6.24)

    On the other hand, there holds

    0h2wdxϵ0|ˉux|wdxCϵ0wdxCϵ. (6.25)

    We now proceed to estimate the left side of (6.23) by

    +0wˆσ2Twtdx=λTn10w(ˆσT)2nwtdx+n2i=1λTiλTi+1w(ˆσT)2i+1wtdx+λT1w(ˆσT)21wtdx=g1(t)+g2(t)+n1i=1(1(ˆσT)2i1(ˆσT)2i+1)12dλTidtw2(t,λTi(t))g1(t)+n1i=1(1(ˆσT)2i1(ˆσT)2i+1)12dλTidtw2(t,λTi(t)), (6.26)

    where

    g1(t)=λTn10w22(ˆσT)2ndx+n2i=1λTiλTi+1w22(ˆσT)2i+1dx+λT1w22(ˆσT)21dx,

    and

    g2(t)=λTn10w22(ˆσT)4n(ˆσT)2ntdx+n2i=1λTiλTi+1w22(ˆσT)4i+1(ˆσT)2i+1tdx+λT1w22(ˆσT)41(ˆσT)21tdx.

    The remaining terms in (6.23) can be estimated by

    0w22wx2dx=120(wx)2dx (6.27)

    and

    0(˙sTˆσ2T+12)wwxdxϵ0(wx)2dx+Cϵ0w2dx. (6.28)

    Combining the inequalities (6.24)-(6.28), we have

    g1(t)ϵ0(wx)2dx+Cϵ0w2dx+n1i=1(1(ˆσT)2i+11(ˆσT)2i)λTitw2(t,λTi(t))2+Cϵϵ0(wx)2dx+Cϵ0w2dx+Cmax0x|w(t,x)|2+CϵCϵ0(wx)2dx+Cϵ0w2dx+Cϵ.

    It follows that

    C00w2dxg1(t)Cϵt00(wx)2dxds+Cϵt00w2dxds+Cϵt.

    Then taking a sufficiently small ϵ, which means a sufficiently large T, by applying the Gronwall's inequality, we conclude that w=0, namely that uT(t,x)=ˉu(t,x) for 0tρ. The result can be extended to any interval of t.

    The convergence from the solution of auxiliary problem (6.18)-(6.19) to the solution of problem (6.1)-(6.3) is proved by a Lyapunov argument, which is similar to the procedure in [12,21,32], but with some necessary modifications to fit the model in this paper. For instance, we have extend the solution with domain [0,) to the whole real line. The first step is to present the formal construction of a Lyapunov function, ignoring the integrability of any arisen integral. The second step is to verify the integrability of those integrals arisen in the formal construction. The third step is to complete the proof of convergence.

    Denote by ˉU the extension of ˉu, who is the solution of auxiliary problem (6.18)-(6.19), from x[0,) to the real line R, namely that

    ˉU(t,x)=1forx<0,ˉU(t,x)=ˉu(t,x)forx0.

    Following [12], let V(x,u,q) be a undetermined function and set

    E[ˉU](t)=V(x,ˉU(t,x),ˉUx(t,x))dx.

    Formally, assuming the integrability, we also have

    ddtE[ˉU]=(VuˉUt+VqˉUxt)dx=ˉUt(VuVqxVquˉUxVqqˉUxx)dx=ˉUt(VuVqxVquˉUxVqq(2ˉˆσ2ˉUt2ˉˆσ2(ˉˆσ22+δ)ˉUx))dx=2ˉˆσ2VqqˉU2tdx+ˉUt(VuVqxVquˉUx+Vqq(1+2δˉˆσ2)ˉUx)dx=2ˉˆσ2VqqˉU2tdx,

    where δ=θσ2r2a2, provided taking V satisfying

    VuVqxqVqu+qVqq(1+2δˉˆσ2(u))=0. (6.29)

    Denote by ρ=Vqq. Suppose that V(x,u,0)=Vq(x,u,0)=0 as in [12]. Then we have

    q0(qm)ρ(x,u,m)dm=q0(qm)dVq(x,u,m)=q0Vq(x,u,m)dm=V(x,u,q).

    It follows that

    Vu(x,u,q)=q0(qm)ρu(x,u,m)dm,
    Vq(x,u,q)=q0ρ(x,u,m)dm,
    Vqx(x,u,q)=q0ρx(x,u,m)dm,
    Vqu(x,u,q)=q0ρu(x,u,m)dm,

    and

    qVqq=qρ=q0ddm(ρ(x,u,m)m)dm=q0(ρ(x,u,m)+ρq(x,u,m))dm.

    Then (6.29) can be written as

    q0(qρu(x,u,m)mρu(x,u,m)ρx(x,u,m)qρu(x,u,m))dm+q0(1+2δˉˆσ2(u))(ρ(x,u,m)+ρq(x,u,m)m)dm=0.

    To ensure (6.29) holds, it should be

    mρu(x,u,m)+ρx(x,u,m)(1+2δˉˆσ2(u))(ρ(x,u,m)+ρq(x,u,m)m)=0. (6.30)

    Formally, denote by v the solution of the following equation

    vxx(1+2δˉˆσ2(v))vx=0, (6.31)

    with boundary conditions

    v(x0)=u0,vx(x0)=q0.

    Then by (6.30) and (6.31), there holds

    ddxρ=ρx+ρuvx+ρqvxx=ρx+ρuvxρq(1+2δˉˆσ2(v))vx=(1+2δˉˆσ2(v))ρ,

    which can be solved as

    ρ(x0,u0,q0)=exp(x00(1+2δˉˆσ2(v(z)))dz).

    Replacing x0 by x, u0 by u and q0 by q, we have

    ρ(x,u,q)=exp(x0(1+2δˉˆσ2(v(z)))dz). (6.32)

    Integrating the Lyapunov function and assuming E(t)0, we have

    tt02ˉˆσ2ρ(x,ˉU(s,x),ˉUx(s,x))ˉU2s(s,x)dxds=E(t0)E(t)E(t0).

    Following the formal construction, we proceed to the second step, namely that verify the integrability of those integrals arisen in the formal construction of the Lyapunov function. As indicated by Liang et al. [21], there are two problems, where the first one is that ρ grows exponentially as x±, while the second one is that the coefficient in (6.31) is discontinuous and the theory of ODE cannot be applied directly. These two problems will be overcame through the approximated solution of problem (4.1)-(4.3) with all the uniform estimates. We begin this step by defining

    ER[ˉUϵ](t)=RRVϵ(x,ˉUϵ(t,x),ˉUϵx(t,x))dx,

    for R>0, where ˉUϵ is the approximation of ˉU with the coefficient of the approximated problem given as

    ˉˆσϵ=ˉˆσ1+n1i=1(ˉˆσi+1ˉˆσi)Hϵ(ˉUϵγi),

    and Vϵ satisfies

    Vϵ(x,u,q)=q0(qm)ρϵ(x,u,m)dm,Vϵ(x,u,0)=Vϵq(x,u,0)=0,

    and ρϵ is defined by (6.32) with ˉˆσ2 replaced by ˉˆσ2ϵ. Thus, (6.31) can be solved on the real line xR and Vϵ is well defined. Meanwhile, it also satisfies

    Vϵu2Vϵqxq2Vϵqu+q2Vϵq2(1+2δˉˆσ2ϵ(u))=0.

    Then we have

    ddtER[ˉUϵ]=RR(VϵuˉUϵt+Vϵq2ˉUϵxt)dx=VϵqˉUϵt|RRRR2ρϵˉˆσ2ϵ(ˉUϵt)2dx.

    Lemma 6.1. Let ˉuϵ be the approximated solution of problem (6.18)-(6.19). Then for any K1>0, there exist constants C0, K2>0 such that for x>C2, there holds

    |ˉuϵx|+|ˉuϵt|C0eK2tK1x,

    where C2 is the constant given in Lemma 4.5.

    Proof. We know that for x>C2

    Lϵσ1[ˉuϵ]=Lϵσ1[ˉuϵt]=Lϵσ1[ˉuϵx],

    where the operator

    Lϵσ1[]=tˉˆσ2122x2(ˉˆσ212+δ)x.

    By Lemmas 4.2 and 4.3, it has been shown that

    sup0<t<(|ˉuϵt(t,C2)|+|ˉuϵx(t,C2)|)C,

    for some C>0. On the other hand, there holds

    ˉuϵt(0,x)=δe(x+logK),ˉuϵx(0,x)=e(x+logK)

    for x>C2. Then for any K1>0, there exist constants C0, K2>0 such that

    Lϵσ1[C0eK2tK1x]0,x>C2,t>0,

    and C0C, C0eK1x(δ1)e(x+logK), which implies that

    C0eK2tK1xˉuϵxC0eK2tK1x,C0eK2tK1xˉuϵtC0eK2tK1x

    for x>C2.

    From the formula of ρϵ

    ρϵ(x,u,q)=exp(x0(1+2δˉˆσ2ϵ(v(z)))dz),

    we have

    exp((1+2δˉˆσ2n)x)ρϵ(x,u,q)exp((1+2δˉˆσ21)x), (6.33)

    which also clearly implies that

    exp((1+2δˉˆσ2n)x)qVϵq(x,u,q)exp((1+2δˉˆσ21)x)q

    and

    exp((1+2δˉˆσ2n)x)q2Vϵ(x,u,q)exp((1+2δˉˆσ21)x)q2

    for x>0. Thus by Lemma 6.1, we can choose K1>1+2δˉˆσ21 such that

    limRVϵq(t,R)ˉUϵt(t,R)=0,

    and

    limRRR2ρϵˉˆσ2ϵ(ˉUϵt)2dx=2ρϵˉˆσ2ϵ(ˉUϵt)2dx.

    Then there holds

    tt02ρϵˉˆσ2ϵ(ˉUϵs)2dxdsE[ˉUϵ](t0)C,

    where the constant C is independent of ϵ, which implies that

    t00ˉu2t(s,x)dxdsC, (6.34)

    according to (6.28) and the setting of ˉU.

    Now we arrive at the third step, completing the proof of convergence from ˉu to ψ. Denote by ˉum(t,x)=ˉu(t+m,x) and consider ˉum as a sequence of functions on [0,1]×(0,). Since ˉum is a bounded sequence in W1,2([0,1]×(0,)), we derive by the embedding theorem that there exists a subsequence mj of m and a function ˜ψ such that as mj, there holds

    ˉumj˜ψinC(1+α)2,1+α([0,1]×(0,R)),0<α<1, (6.35)

    for any R>1. Furthermore, by taking a further subsequence if necessary, there holds that

    ˉumjtw˜ψt,2ˉumjx2w˜ψxxinL([0,1]×(0,)),

    and thus

    ˜ψtLlim infmˉumjtLC,˜ψxxLlim infm2ˉumjx2LC,

    for some constant C>0. As (6.34) suggests that

    100(ˉumt)2dxds=m+1m0ˉu2tdxds0asm=mj.

    we have

    100˜ψ2tdxdt=0,

    which implies that ˜ψt0 and ˜ψ is independent of t and only depends on x. Now we proceed to prove that ˜ψ satisfies (6.1). Take a test function fCc(0,), then there holds

    0ˉumtfdx=012ˉˆσ2(ˉum)(2ˉumx2+ˉumx)fdx+0δˉumxfdx. (6.36)

    Clearly, the second term on the right side converges to the corresponding integral of ˜ψ as m=mj. With regard to the first term on the right side of (6.36), there holds

    012ˉˆσ2(ˉum)(2ˉumx2+ˉumx)fdx=012ˉˆσ2(˜ψ)(2ˉumx2+ˉumx)fdx+012(ˉˆσ2(ˉum)ˉˆσ2(˜ψ))(2ˉumx2+ˉumx)fdx. (6.37)

    By the weak-star convergence, the first term on the right side of (6.32) converges to the corresponding integral of ˜ψ. The second term on the right side of (6.37) is bounded by C0|ˉˆσ2(ˉum)ˉˆσ2(˜ψ)|fdx, which converges to 0 by the dominated convergence theorem. By the convergence (6.35), we have

    100ˉumtfdxdt0asm.

    Thus integrating (6.36) with respect to t over [0,1] and letting m, there holds

    012ˉˆσ2(˜ψ)(˜ψxx+˜ψx)fdx+0δ˜ψxfdx=0.

    It follows that ˜ψ satisfies (6.1). The convergence (6.35) also suggests that ˜ψ satisfies (6.2). Now suppose that

    lim infmjinf0t1ˉλi(t+mj)=ˉλminiˉλmaxi=lim supmjsup0t1ˉλi(t+mj),i=1,2,,n1. (6.38)

    We choose tmini,j, tmaxi,j[0,1] such that

    inf0t1ˉλi(t+mj)=ˉλi(tmini,j+mj),sup0t1ˉλi(t+mj)=ˉλi(tmaxi,j+mj).

    Taking the subsequences along which the liminf and limsup in (6.38) are attained, together with the boundary conditions

    ˉum(t,ˉλi(t+n))=γi,i=1,2,,n1,

    and (6.35), it is deduced that

    ˜ψ(ˉλmini)=˜ψ(ˉλmaxi)=γi,i=1,2,,n1.

    However, by the uniqueness of solution to static problem (6.1)-(6.3), there should hold

    ˉλmini=ˉλmaxi=λi,i=1,2,,n1,

    and ψ˜ψ. In addition, the uniqueness implies that all subsequences limit should be uniform and thus the full sequence must converge as m.

    In this paper, we study a free boundary problem for pricing a defaultable corporate bond with multiple credit rating migration risk and stochastic interest rate. By using PDE techniques, the existence, uniqueness some regularities of solution are obtained to support the rationality of the model to pricing a defaultable corporate bond. In [35], it is shown that the solution and rating boundaries of the free boundary problem pricing a defaultable corporate bond with constant interest rate are all decreasing with respect to time, which do not hold any more in our model with stochastic interest rate, as the coefficients of model are all time heterogeneous. Furthermore, we present the asymptotic behavior of solution to this pricing model. Asymptotic behaviors of solution to free boundary problems pricing corporate bonds with credit rating migration risk have been analyzed in [12,21,32]. The asymptotic solution of the model with only one migration boundary can be solved explicitly [21], while in the works [12,32], where the models are subject to multiple migration boundaries, it is not the case. However, interestingly, in this paper, although our model is also subject to multiple migration boundaries, it is proved that the asymptotic solution can be solved explicitly. We conclude that if the maturity T is sufficiently large, we can valuate the defaultable corporate bond with multiple credit rating migration risk and stochastic interest rate by an explicit pricing formula as follows:

    ϕ(t)=S(t)ψ(logS(t)logK),

    where S(t) is the corporate value, K is default threshold and ψ is the steady status given in Section 6, whose explicit form can be obtained by solving the linear algebraic equation set.

    This work was supported by the National Natural Science Foundation of China (No. 11701115).

    All authors declare no conflict of interest.



    [1] A. Latif, A. Rasheed, U. Sajid, J. Ahmed, N. Ali, N. I. Ratyal, et al., Content-based image retrieval and feature extraction: a comprehensive review, Math. Probl. Eng., 2019.
    [2] B. Gupta, M. Tiwari, S. S. Lamba, Visibility improvement and mass segmentation of mammogram images using quantile separated histogram equalisation with local contrast enhancement, CAAI Trans. Intell. Technol., 4 (2019), 73–79. doi: 10.1049/trit.2018.1006
    [3] S. Maheshwari, V. Kanhangad, R. B. Pachori, S. V. Bhandary, U. R. Acharya, Automated glaucoma diagnosis using bit-plane slicing and local binary pattern techniques, Comput. Biol. Med., 105 (2019), 72–80. doi: 10.1016/j.compbiomed.2018.11.028
    [4] S. Masood, M. Sharif, M. Raza, M. Yasmin, M. Iqbal, M. Younus Javed, Glaucoma disease: A survey, Curr. Med. Imaging, 11 (2015), 272–283. doi: 10.2174/157340561104150727171246
    [5] U. R. Acharya, S. Bhat, J. E. Koh, S. V. Bhandary, H. Adeli, A novel algorithm to detect glaucoma risk using texton and local configuration pattern features extracted from fundus images, Comput. Biol. Med., 88 (2017), 72–83. doi: 10.1016/j.compbiomed.2017.06.022
    [6] B. J. Shingleton, L. S. Gamell, M. W. O'Donoghue, S. L. Baylus, R. King, Long-term changes in intraocular pressure after clear corneal phacoemulsification: Normal patients versus glaucoma suspect and glaucoma patients, J. Cataract. Refract. Surg., 25 (1999), 885–890. doi: 10.1016/S0886-3350(99)00107-8
    [7] K. F. Jamous, M. Kalloniatis, M. P. Hennessy, A. Agar, A. Hayen, B. Zangerl, Clinical model assisting with the collaborative care of glaucoma patients and suspects, Clin. Exp. Ophthalmol., 43 (2015), 308–319. doi: 10.1111/ceo.12466
    [8] T. Khalil, M. U. Akram, S. Khalid, S. H. Dar, N. Ali, A study to identify limitations of existing automated systems to detect glaucoma at initial and curable stage, Int. J. Imaging Syst. Technol., 8 (2021).
    [9] H. A. Quigley, A. T. Broman, The number of people with glaucoma worldwide in 2010 and 2020, Br. J. Ophthalmol., 90 (2006), 262–267. doi: 10.1136/bjo.2005.081224
    [10] C. Costagliola, R. Dell'Omo, M. R. Romano, M. Rinaldi, L. Zeppa, F. Parmeggiani, Pharmacotherapy of intraocular pressure: part i. parasympathomimetic, sympathomimetic and sympatholytics, Expert Opin. Pharmacother., 10 (2009), 2663–2677. doi: 10.1517/14656560903300103
    [11] A. A. Salam, M. U. Akram, K. Wazir, S. M. Anwar, M. Majid, Autonomous glaucoma detection from fundus image using cup to disc ratio and hybrid features, in ISSPIT.), IEEE, 2015,370–374.
    [12] R. JMJ, Leading causes of blindness worldwide, Bull. Soc. Belge. Ophtalmol., 283 (2002), 19–25.
    [13] M. K. Dutta, A. K. Mourya, A. Singh, M. Parthasarathi, R. Burget, K. Riha, Glaucoma detection by segmenting the super pixels from fundus colour retinal images, in 2014 International Conference on Medical Imaging, m-Health and Emerging Communication Systems (MedCom.), IEEE, 2014, 86–90.
    [14] C. E. Willoughby, D. Ponzin, S. Ferrari, A. Lobo, K. Landau, Y. Omidi, Anatomy and physiology of the human eye: effects of mucopolysaccharidoses disease on structure and function–a review, Clin. Exp. Ophthalmol., 38 (2010), 2–11.
    [15] M. S. Haleem, L. Han, J. Van Hemert, B. Li, Automatic extraction of retinal features from colour retinal images for glaucoma diagnosis: a review, Comput. Med. Imaging Graph., 37 (2013), 581–596. doi: 10.1016/j.compmedimag.2013.09.005
    [16] A. Sarhan, J. Rokne, R. Alhajj, Glaucoma detection using image processing techniques: A literature review, Comput. Med. Imaging Graph., 78 (2019), 101657. doi: 10.1016/j.compmedimag.2019.101657
    [17] H. A. Quigley, Neuronal death in glaucoma, Prog. Retin. Eye Res., 18 (1999), 39–57. doi: 10.1016/S1350-9462(98)00014-7
    [18] N. Salamat, M. M. S. Missen, A. Rashid, Diabetic retinopathy techniques in retinal images: A review, Artif. Intell. Med., 97 (2019), 168–188. doi: 10.1016/j.artmed.2018.10.009
    [19] F. Bokhari, T. Syedia, M. Sharif, M. Yasmin, S. L. Fernandes, Fundus image segmentation and feature extraction for the detection of glaucoma: A new approach, Curr. Med. Imaging Rev., 14 (2018), 77–87.
    [20] A. Agarwal, S. Gulia, S. Chaudhary, M. K. Dutta, R. Burget, K. Riha, Automatic glaucoma detection using adaptive threshold based technique in fundus image, in (TSP.), IEEE, 2015,416–420.
    [21] L. Xiong, H. Li, Y. Zheng, Automatic detection of glaucoma in retinal images, in 2014 9th IEEE Conference on Industrial Electronics and Applications, IEEE, 2014, 1016–1019.
    [22] A. Diaz-Pinto, S. Morales, V. Naranjo, T. Köhler, J. M. Mossi, A. Navea, Cnns for automatic glaucoma assessment using fundus images: An extensive validation, Biomed. Eng. Online, 18 (2019), 29. doi: 10.1186/s12938-019-0649-y
    [23] T. Kersey, C. I. Clement, P. Bloom, M. F. Cordeiro, New trends in glaucoma risk, diagnosis & management, Indian J. Med. Res., 137 (2013), 659.
    [24] A. L. Coleman, S. Miglior, Risk factors for glaucoma onset and progression, Surv. Ophthalmol., 53 (2008), S3–S10. doi: 10.1016/j.survophthal.2008.08.006
    [25] T. Saba, S. T. F. Bokhari, M. Sharif, M. Yasmin, M. Raza, Fundus image classification methods for the detection of glaucoma: A review, Microsc. Res. Tech., 81 (2018), 1105–1121. doi: 10.1002/jemt.23094
    [26] T. Aung, L. Ocaka, N. D. Ebenezer, A. G. Morris, M. Krawczak, D. L. Thiselton, et al., A major marker for normal tension glaucoma: association with polymorphisms in the opa1 gene, Hum. Genet., 110 (2002), 52–56. doi: 10.1007/s00439-001-0645-7
    [27] M. A. Khaimi, Canaloplasty: A minimally invasive and maximally effective glaucoma treatment, J. Ophthalmol., 2015.
    [28] M. Bechmann, M. J. Thiel, B. Roesen, S. Ullrich, M. W. Ulbig, K. Ludwig, Central corneal thickness determined with optical coherence tomography in various types of glaucoma, Br. J. Ophthalmol., 84 (2000), 1233–1237. doi: 10.1136/bjo.84.11.1233
    [29] D. Ahram, W. Alward, M. Kuehn, The genetic mechanisms of primary angle closure glaucoma, Eye., 29 (2015), 1251–1259. doi: 10.1038/eye.2015.124
    [30] R. Törnquist, Chamber depth in primary acute glaucoma, Br. J. Ophthalmol., 40 (1956), 421. doi: 10.1136/bjo.40.7.421
    [31] H. S. Sugar, F. A. Barbour, Pigmentary glaucoma*: A rare clinical entity, Am. J. Ophthalmol., 32 (1949), 90–92. doi: 10.1016/0002-9394(49)91112-5
    [32] H. S. Sugar, Pigmentary glaucoma: A 25-year review, Am. J. Ophthalmol., 62 (1966), 499–507. doi: 10.1016/0002-9394(66)91330-4
    [33] R. Ritch, U. Schlötzer-Schrehardt, A. G. Konstas, Why is glaucoma associated with exfoliation syndrome?, Prog. Retin. Eye Res., 22 (2003), 253–275. doi: 10.1016/S1350-9462(02)00014-9
    [34] J. L.-O. De, C. A. Girkin, Ocular trauma-related glaucoma., Ophthalmol. Clin. North. Am., 15 (2002), 215–223. doi: 10.1016/S0896-1549(02)00011-1
    [35] E. Milder, K. Davis, Ocular trauma and glaucoma, Int. Ophthalmol. Clin., 48 (2008), 47–64. doi: 10.1097/IIO.0b013e318187fcb8
    [36] T. G. Papadaki, I. P. Zacharopoulos, L. R. Pasquale, W. B. Christen, P. A. Netland, C. S. Foster, Long-term results of ahmed glaucoma valve implantation for uveitic glaucoma, Am. J. Ophthalmol., 144 (2007), 62–69. doi: 10.1016/j.ajo.2007.03.013
    [37] H. C. Laganowski, M. G. K. Muir, R. A. Hitchings, Glaucoma and the iridocorneal endothelial syndrome, Arch. Ophthalmol., 110 (1992), 346–350. doi: 10.1001/archopht.1992.01080150044025
    [38] C. L. Ho, D. S. Walton, Primary congenital glaucoma: 2004 update, J. Pediatr. Ophthalmol. Strabismus., 41 (2004), 271–288. doi: 10.3928/01913913-20040901-11
    [39] M. Erdurmuş, R. Yağcı, Ö. Atış, R. Karadağ, A. Akbaş, İ. F. Hepşen, Antioxidant status and oxidative stress in primary open angle glaucoma and pseudoexfoliative glaucoma, Curr. Eye Res., 36 (2011), 713–718. doi: 10.3109/02713683.2011.584370
    [40] S. S. Hayreh, Neovascular glaucoma, Prog. Retin. Eye Res., 26 (2007), 470–485. doi: 10.1016/j.preteyeres.2007.06.001
    [41] D. A. Lee, E. J. Higginbotham, Glaucoma and its treatment: a review, Am. J. Health. Syst. Pharm., 62 (2005), 691–699. doi: 10.1093/ajhp/62.7.691
    [42] X. Wang, R. Khan, A. Coleman, Device-modified trabeculectomy for glaucoma, Cochrane. Database Syst. Rev..
    [43] K. R. Sung, J. S. Kim, G. Wollstein, L. Folio, M. S. Kook, J. S. Schuman, Imaging of the retinal nerve fibre layer with spectral domain optical coherence tomography for glaucoma diagnosis, Br. J. Ophthalmol., 95 (2011), 909–914. doi: 10.1136/bjo.2010.186924
    [44] M. E. Karlen, E. Sanchez, C. C. Schnyder, M. Sickenberg, A. Mermoud, Deep sclerectomy with collagen implant: medium term results, Br. J. Ophthalmol., 83 (1999), 6–11. doi: 10.1136/bjo.83.1.6
    [45] J. Carrillo, L. Bautista, J. Villamizar, J. Rueda, M. Sanchez, D. Rueda, Glaucoma detection using fundus images of the eye, 2019 XXII Symposium on Image, Signal Processing and Artificial Vision (STSIVA), IEEE, 2019, 1–4.
    [46] N. Sengar, M. K. Dutta, R. Burget, M. Ranjoha, Automated detection of suspected glaucoma in digital fundus images, 2017 40th International Conference on Telecommunications and Signal Processing (TSP), IEEE, 2017,749–752.
    [47] A. Poshtyar, J. Shanbehzadeh, H. Ahmadieh, Automatic measurement of cup to disc ratio for diagnosis of glaucoma on retinal fundus images, in 2013 6th International Conference on Biomedical Engineering and Informatics, IEEE, 2013, 24–27.
    [48] F. Khan, S. A. Khan, U. U. Yasin, I. ul Haq, U. Qamar, Detection of glaucoma using retinal fundus images, in The 6th 2013 Biomedical Engineering International Conference, IEEE, 2013, 1–5.
    [49] H. Yamada, T. Akagi, H. Nakanishi, H. O. Ikeda, Y. Kimura, K. Suda, et al., Microstructure of peripapillary atrophy and subsequent visual field progression in treated primary open-angle glaucoma, Ophthalmology, 123 (2016), 542–551. doi: 10.1016/j.ophtha.2015.10.061
    [50] J. B. Jonas, Clinical implications of peripapillary atrophy in glaucoma, Curr. Opin. Ophthalmol., 16 (2005), 84–88. doi: 10.1097/01.icu.0000156135.20570.30
    [51] K. H. Park, G. Tomita, S. Y. Liou, Y. Kitazawa, Correlation between peripapillary atrophy and optic nerve damage in normal-tension glaucoma, Ophthalmol., 103 (1996), 1899–1906. doi: 10.1016/S0161-6420(96)30409-0
    [52] F. A. Medeiros, L. M. Zangwill, C. Bowd, R. M. Vessani, R. Susanna Jr, R. N. Weinreb, Evaluation of retinal nerve fiber layer, optic nerve head, and macular thickness measurements for glaucoma detection using optical coherence tomography, Am. J. Ophthalmol., 139 (2005), 44–55. doi: 10.1016/j.ajo.2004.08.069
    [53] G. Wollstein, J. S. Schuman, L. L. Price, A. Aydin, P. C. Stark, E. Hertzmark, et al., Optical coherence tomography longitudinal evaluation of retinal nerve fiber layer thickness in glaucoma, Arch. Ophthalmol., 123 (2005), 464–470. doi: 10.1001/archopht.123.4.464
    [54] M. Armaly, The optic cup in the normal eye: I. cup width, depth, vessel displacement, ocular tension and outflow facility, Am. J. Ophthalmol., 68 (1969), 401–407. doi: 10.1016/0002-9394(69)90702-8
    [55] M. Galdos, A. Bayon, F. D. Rodriguez, C. Mico, S. C. Sharma, E. Vecino, Morphology of retinal vessels in the optic disk in a göttingen minipig experimental glaucoma model, Vet. Ophthalmol., 15 (2012), 36–46.
    [56] W. Zhou, Y. Yi, Y. Gao, J. Dai, Optic disc and cup segmentation in retinal images for glaucoma diagnosis by locally statistical active contour model with structure prior, Comput. Math. Methods. Med., 2019.
    [57] P. Sharma, P. A. Sample, L. M. Zangwill, J. S. Schuman, Diagnostic tools for glaucoma detection and management, Surv. Ophthalmol., 53 (2008), S17–S32. doi: 10.1016/j.survophthal.2008.08.003
    [58] M. J. Greaney, D. C. Hoffman, D. F. Garway-Heath, M. Nakla, A. L. Coleman, J. Caprioli, Comparison of optic nerve imaging methods to distinguish normal eyes from those with glaucoma, Invest. Ophthalmol. Vis. Sci., 43 (2002), 140–145.
    [59] R. Bock, J. Meier, L. G. Nyúl, J. Hornegger, G. Michelson, Glaucoma risk index: automated glaucoma detection from color fundus images, Med. Image. Anal., 14 (2010), 471–481. doi: 10.1016/j.media.2009.12.006
    [60] K. Chan, T.-W. Lee, P. A. Sample, M. H. Goldbaum, R. N. Weinreb, T. J. Sejnowski, Comparison of machine learning and traditional classifiers in glaucoma diagnosis, IEEE Trans. Biomed. Eng., 49 (2002), 963–974. doi: 10.1109/TBME.2002.802012
    [61] N. Varachiu, C. Karanicolas, M. Ulieru, Computational intelligence for medical knowledge acquisition with application to glaucoma, in Proceedings First IEEE International Conference on Cognitive Informatics, IEEE, 2002,233–238.
    [62] J. Yu, S. S. R. Abidi, P. H. Artes, A. McIntyre, M. Heywood, Automated optic nerve analysis for diagnostic support inglaucoma, in CBMS'05., IEEE, 2005, 97–102.
    [63] R. Bock, J. Meier, G. Michelson, L. G. Nyúl and J. Hornegger, Classifying glaucoma with image-based features from fundus photographs, in Joint Pattern Recognition Symposium., Springer, 2007,355–364.
    [64] Y. Hatanaka, A. Noudo, C. Muramatsu, A. Sawada, T. Hara, T. Yamamoto, et al., Vertical cup-to-disc ratio measurement for diagnosis of glaucoma on fundus images, in Medical Imaging 2010: Computer-Aided Diagnosis, vol. 7624, International Society for Optics and Photonics, 2010, 76243C.
    [65] S. S. Abirami, S. G. Shoba, Glaucoma images classification using fuzzy min-max neural network based on data-core, IJISME., 1 (2013), 9–15.
    [66] J. Liu, Z. Zhang, D. W. K. Wong, Y. Xu, F. Yin, J. Cheng, et al., Automatic glaucoma diagnosis through medical imaging informatics, Journal of the American Medical Informatics Association, 20 (2013), 1021–1027. doi: 10.1136/amiajnl-2012-001336
    [67] A. Almazroa, R. Burman, K. Raahemifar, V. Lakshminarayanan, Optic disc and optic cup segmentation methodologies for glaucoma image detection: A survey, J. Ophthalmol., 2015.
    [68] A. Dey, S. K. Bandyopadhyay, Automated glaucoma detection using support vector machine classification method, J. Adv. Med. Med. Res., 1–12.
    [69] F. R. Silva, V. G. Vidotti, F. Cremasco, M. Dias, E. S. Gomi, V. P. Costa, Sensitivity and specificity of machine learning classifiers for glaucoma diagnosis using spectral domain oct and standard automated perimetry, Arq. Bras. Oftalmol., 76 (2013), 170–174. doi: 10.1590/S0004-27492013000300008
    [70] M. U. Akram, A. Tariq, S. Khalid, M. Y. Javed, S. Abbas, U. U. Yasin, Glaucoma detection using novel optic disc localization, hybrid feature set and classification techniques, Australas. Phys. Eng. Sci. Med., 38 (2015), 643–655. doi: 10.1007/s13246-015-0377-y
    [71] A. T. A. Al-Sammarraie, R. R. Jassem, T. K. Ibrahim, Mixed convection heat transfer in inclined tubes with constant heat flux, Eur. J. Sci. Res., 97 (2013), 144–158.
    [72] M. R. K. Mookiah, U. R. Acharya, C. M. Lim, A. Petznick, J. S. Suri, Data mining technique for automated diagnosis of glaucoma using higher order spectra and wavelet energy features, Knowl. Based. Syst., 33 (2012), 73–82. doi: 10.1016/j.knosys.2012.02.010
    [73] C. Raja, N. Gangatharan, Glaucoma detection in fundal retinal images using trispectrum and complex wavelet-based features, Eur. J. Sci. Res., 97 (2013), 159–171.
    [74] G. Lim, Y. Cheng, W. Hsu, M. L. Lee, Integrated optic disc and cup segmentation with deep learning, in ICTAI., IEEE, 2015,162–169.
    [75] K.-K. Maninis, J. Pont-Tuset, P. Arbeláez, L. Van Gool, Deep retinal image understanding, in International conference on medical image computing and computer-assisted intervention, Springer, 2016,140–148.
    [76] B. Al-Bander, W. Al-Nuaimy, B. M. Williams, Y. Zheng, Multiscale sequential convolutional neural networks for simultaneous detection of fovea and optic disc, Biomed. Signal Process Control., 40 (2018), 91–101. doi: 10.1016/j.bspc.2017.09.008
    [77] A. Mitra, P. S. Banerjee, S. Roy, S. Roy, S. K. Setua, The region of interest localization for glaucoma analysis from retinal fundus image using deep learning, Comput. Methods Programs Biomed., 165 (2018), 25–35. doi: 10.1016/j.cmpb.2018.08.003
    [78] S. S. Kruthiventi, K. Ayush, R. V. Babu, Deepfix: A fully convolutional neural network for predicting human eye fixations, IEEE Trans. Image. Process., 26 (2017), 4446–4456. doi: 10.1109/TIP.2017.2710620
    [79] M. Norouzifard, A. Nemati, A. Abdul-Rahman, H. GholamHosseini, R. Klette, A comparison of transfer learning techniques, deep convolutional neural network and multilayer neural network methods for the diagnosis of glaucomatous optic neuropathy, in International Computer Symposium, Springer, 2018,627–635.
    [80] X. Sun, Y. Xu, W. Zhao, T. You, J. Liu, Optic disc segmentation from retinal fundus images via deep object detection networks, in EMBC., IEEE, 2018, 5954–5957.
    [81] Z. Ghassabi, J. Shanbehzadeh, K. Nouri-Mahdavi, A unified optic nerve head and optic cup segmentation using unsupervised neural networks for glaucoma screening, in EMBC., IEEE, 2018, 5942–5945.
    [82] J. H. Tan, S. V. Bhandary, S. Sivaprasad, Y. Hagiwara, A. Bagchi, U. Raghavendra, et al., Age-related macular degeneration detection using deep convolutional neural network, Future Gener. Comput. Syst., 87 (2018), 127–135. doi: 10.1016/j.future.2018.05.001
    [83] J. Zilly, J. M. Buhmann, D. Mahapatra, Glaucoma detection using entropy sampling and ensemble learning for automatic optic cup and disc segmentation, Comput. Med. Imaging Graph., 55 (2017), 28–41. doi: 10.1016/j.compmedimag.2016.07.012
    [84] J. Cheng, J. Liu, Y. Xu, F. Yin, D. W. K. Wong, N.-M. Tan, et al., Superpixel classification based optic disc and optic cup segmentation for glaucoma screening, IEEE Trans. Med. Imaging, 32 (2013), 1019–1032. doi: 10.1109/TMI.2013.2247770
    [85] H. Ahmad, A. Yamin, A. Shakeel, S. O. Gillani, U. Ansari, Detection of glaucoma using retinal fundus images, in iCREATE., IEEE, 2014,321–324.
    [86] S. Kavitha, S. Karthikeyan, K. Duraiswamy, Neuroretinal rim quantification in fundus images to detect glaucoma, IJCSNS., 10 (2010), 134–140.
    [87] Z. Zhang, B. H. Lee, J. Liu, D. W. K. Wong, N. M. Tan, J. H. Lim, et al., Optic disc region of interest localization in fundus image for glaucoma detection in argali, in 2010 5th IEEE Conference on Industrial Electronics and Applications, IEEE, 2010, 1686–1689.
    [88] D. Welfer, J. Scharcanski, C. M. Kitamura, M. M. Dal Pizzol, L. W. Ludwig, D. R. Marinho, Segmentation of the optic disk in color eye fundus images using an adaptive morphological approach, Computers Biol. Med., 40 (2010), 124–137. doi: 10.1016/j.compbiomed.2009.11.009
    [89] H. Tjandrasa, A. Wijayanti, N. Suciati, Optic nerve head segmentation using hough transform and active contours, Telkomnika, 10 (2012), 531. doi: 10.12928/telkomnika.v10i3.833
    [90] M. Tavakoli, M. Nazar, A. Golestaneh, F. Kalantari, Automated optic nerve head detection based on different retinal vasculature segmentation methods and mathematical morphology, in NSS/MIC., IEEE, 2017, 1–7.
    [91] P. Bibiloni, M. González-Hidalgo, S. Massanet, A real-time fuzzy morphological algorithm for retinal vessel segmentation, J. Real Time Image Process., 16 (2019), 2337–2350. doi: 10.1007/s11554-018-0748-1
    [92] A. Agarwal, A. Issac, A. Singh, M. K. Dutta, Automatic imaging method for optic disc segmentation using morphological techniques and active contour fitting, in 2016 Ninth International Conference on Contemporary Computing (IC3), IEEE, 2016, 1–5.
    [93] S. Pal, S. Chatterjee, Mathematical morphology aided optic disk segmentation from retinal images, in 2017 3rd International Conference on Condition Assessment Techniques in Electrical Systems (CATCON), IEEE, 2017,380–385.
    [94] L. Wang, A. Bhalerao, Model based segmentation for retinal fundus images, in Scandinavian Conference on Image Analysis, Springer, 2003,422–429.
    [95] G. Deng, L. Cahill, An adaptive gaussian filter for noise reduction and edge detection, in 1993 IEEE conference record nuclear science symposium and medical imaging conference, IEEE, 1993, 1615–1619.
    [96] K. A. Vermeer, F. M. Vos, H. G. Lemij, A. M. Vossepoel, A model based method for retinal blood vessel detection, Comput. Biol. Med., 34 (2004), 209–219. doi: 10.1016/S0010-4825(03)00055-6
    [97] J. I. Orlando, E. Prokofyeva, M. B. Blaschko, A discriminatively trained fully connected conditional random field model for blood vessel segmentation in fundus images, IEEE Trans. Biomed. Eng., 64 (2016), 16–27.
    [98] R. Ingle, P. Mishra, Cup segmentation by gradient method for the assessment of glaucoma from retinal image, Int. J. Latest Trends. Eng. Technol., 4 (2013), 2540–2543.
    [99] G. D. Joshi, J. Sivaswamy, S. Krishnadas, Optic disk and cup segmentation from monocular color retinal images for glaucoma assessment, IEEE Trans. Biomed. Eng., 30 (2011), 1192–1205.
    [100] W. W. K. Damon, J. Liu, T. N. Meng, Y. Fengshou, W. T. Yin, Automatic detection of the optic cup using vessel kinking in digital retinal fundus images, in 2012 9th IEEE International Symposium on Biomedical Imaging (ISBI), IEEE, 2012, 1647–1650.
    [101] D. Finkelstein, Kinks, J. Math. Phys., 7 (1966), 1218–1225.
    [102] Y. Xu, L. Duan, S. Lin, X. Chen, D. W. K. Wong, T. Y. Wong, et al., Optic cup segmentation for glaucoma detection using low-rank superpixel representation, in International Conference on Medical Image Computing and Computer-Assisted Intervention, Springer, 2014,788–795.
    [103] Y. Xu, J. Liu, S. Lin, D. Xu, C. Y. Cheung, T. Aung, et al., Efficient optic cup detection from intra-image learning with retinal structure priors, in International Conference on Medical Image Computing and Computer-Assisted Intervention, Springer, 2012, 58–65.
    [104] M. A. Aslam, M. N. Salik, F. Chughtai, N. Ali, S. H. Dar, T. Khalil, Image classification based on mid-level feature fusion, in 2019 15th International Conference on Emerging Technologies (ICET), IEEE, 2019, 1–6.
    [105] N. Ali, K. B. Bajwa, R. Sablatnig, S. A. Chatzichristofis, Z. Iqbal, M. Rashid, et al., A novel image retrieval based on visual words integration of sift and surf, PloS. one., 11 (2016), e0157428. doi: 10.1371/journal.pone.0157428
    [106] C.-Y. Ho, T.-W. Pai, H.-T. Chang, H.-Y. Chen, An atomatic fundus image analysis system for clinical diagnosis of glaucoma, in 2011 International Conference on Complex, Intelligent, and Software Intensive Systems, IEEE, 2011,559–564.
    [107] H.-T. Chang, C.-H. Liu, T.-W. Pai, Estimation and extraction of b-cell linear epitopes predicted by mathematical morphology approaches, J. Mol. Recognit., 21 (2008), 431–441. doi: 10.1002/jmr.910
    [108] D. Wong, J. Liu, J. Lim, N. Tan, Z. Zhang, S. Lu, et al., Intelligent fusion of cup-to-disc ratio determination methods for glaucoma detection in argali, in 2009 Annual International Conference of the IEEE Engineering in Medicine and Biology Society, IEEE, 2009, 5777–5780.
    [109] F. Yin, J. Liu, D. W. K. Wong, N. M. Tan, C. Cheung, M. Baskaran, et al., Automated segmentation of optic disc and optic cup in fundus images for glaucoma diagnosis, in 2012 25th IEEE international symposium on computer-based medical systems (CBMS), IEEE, 2012, 1–6.
    [110] S. Chandrika, K. Nirmala, Analysis of cdr detection for glaucoma diagnosis, IJERA., 2 (2013), 23–27.
    [111] N. Annu, J. Justin, Automated classification of glaucoma images by wavelet energy features, IJERA., 5 (2013), 1716–1721.
    [112] H. Fu, J. Cheng, Y. Xu, D. W. K. Wong, J. Liu, X. Cao, Joint optic disc and cup segmentation based on multi-label deep network and polar transformation, IEEE Trans. Med. Imaging., 37 (2018), 1597–1605. doi: 10.1109/TMI.2018.2791488
    [113] P. K. Dhar, T. Shimamura, Blind svd-based audio watermarking using entropy and log-polar transformation, JISA., 20 (2015), 74–83.
    [114] D. Wong, J. Liu, J. Lim, H. Li, T. Wong, Automated detection of kinks from blood vessels for optic cup segmentation in retinal images, in Medical Imaging 2009: Computer-Aided Diagnosis, vol. 7260, International Society for Optics and Photonics, 2009, 72601J.
    [115] A. Murthi, M. Madheswaran, Enhancement of optic cup to disc ratio detection in glaucoma diagnosis, in 2012 International Conference on Computer Communication and Informatics, IEEE, 2012, 1–5.
    [116] N. E. A. Khalid, N. M. Noor, N. M. Ariff, Fuzzy c-means (fcm) for optic cup and disc segmentation with morphological operation, Procedia. Comput. Sci., 42 (2014), 255–262. doi: 10.1016/j.procs.2014.11.060
    [117] H. A. Nugroho, W. K. Oktoeberza, A. Erasari, A. Utami, C. Cahyono, Segmentation of optic disc and optic cup in colour fundus images based on morphological reconstruction, in 2017 9th International Conference on Information Technology and Electrical Engineering (ICITEE), IEEE, 2017, 1–5.
    [118] L. Zhang, M. Fisher, W. Wang, Retinal vessel segmentation using multi-scale textons derived from keypoints, Comput. Med. Imaging Graph., 45 (2015), 47–56. doi: 10.1016/j.compmedimag.2015.07.006
    [119] X. Li, B. Aldridge, R. Fisher, J. Rees, Estimating the ground truth from multiple individual segmentations incorporating prior pattern analysis with application to skin lesion segmentation, in 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, IEEE, 2011, 1438–1441.
    [120] M. M. Fraz, P. Remagnino, A. Hoppe, S. Velastin, B. Uyyanonvara, S. Barman, A supervised method for retinal blood vessel segmentation using line strength, multiscale gabor and morphological features, in 2011 IEEE International Conference on Signal and Image Processing Applications (ICSIPA), IEEE, 2011,410–415.
    [121] M. Niemeijer, J. Staal, B. van Ginneken, M. Loog, M. D. Abramoff, Comparative study of retinal vessel segmentation methods on a new publicly available database, in Medical imaging 2004: Image processing, vol. 5370, International Society for Optics and Photonics, 2004,648–656.
    [122] J. Y. Choi, T. K. Yoo, J. G. Seo, J. Kwak, T. T. Um, T. H. Rim, Multi-categorical deep learning neural network to classify retinal images: a pilot study employing small database, PloS one, 12.
    [123] L. Zhang, M. Fisher, W. Wang, Comparative performance of texton based vascular tree segmentation in retinal images, in 2014 IEEE International Conference on Image Processing (ICIP), IEEE, 2014,952–956.
    [124] A. Septiarini, A. Harjoko, R. Pulungan, R. Ekantini, Automated detection of retinal nerve fiber layer by texture-based analysis for glaucoma evaluation, Healthc. Inform. Res., 24 (2018), 335–345. doi: 10.4258/hir.2018.24.4.335
    [125] B. S. Kirar, D. K. Agrawal, Computer aided diagnosis of glaucoma using discrete and empirical wavelet transform from fundus images, IET Image Process., 13 (2018), 73–82.
    [126] K. Nirmala, N. Venkateswaran, C. V. Kumar, J. S. Christobel, Glaucoma detection using wavelet based contourlet transform, in 2017 International Conference on Intelligent Computing and Control (I2C2), IEEE, 2017, 1–5.
    [127] A. A. G. Elseid, A. O. Hamza, Glaucoma detection using retinal nerve fiber layer texture features, J. Clin. Eng., 44 (2019), 180–185. doi: 10.1097/JCE.0000000000000361
    [128] M. Claro, L. Santos, W. Silva, F. Araújo, N. Moura, A. Macedo, Automatic glaucoma detection based on optic disc segmentation and texture feature extraction, CLEI Electron. J., 19 (2016), 5.
    [129] L. Abdel-Hamid, Glaucoma detection from retinal images using statistical and textural wavelet features, J. Digit Imaging., 1–8.
    [130] S. Maetschke, B. Antony, H. Ishikawa, G. Wollstein, J. Schuman, R. Garnavi, A feature agnostic approach for glaucoma detection in oct volumes, PloS. one., 14 (2019), e0219126. doi: 10.1371/journal.pone.0219915
    [131] D. C. Hood, A. S. Raza, On improving the use of oct imaging for detecting glaucomatous damage, Br. J. Ophthalmol., 98 (2014), ii1–ii9. doi: 10.1136/bjophthalmol-2014-305156
    [132] D. C. Hood, Improving our understanding, and detection, of glaucomatous damage: an approach based upon optical coherence tomography (oct), Prog.Retin. Eye Res., 57 (2017), 46–75. doi: 10.1016/j.preteyeres.2016.12.002
    [133] H. S. Basavegowda, G. Dagnew, Deep learning approach for microarray cancer data classification, CAAI Trans. Intell. Technol., 5 (2020), 22–33. doi: 10.1049/trit.2019.0028
    [134] X. Chen, Y. Xu, D. W. K. Wong, T. Y. Wong, J. Liu, Glaucoma detection based on deep convolutional neural network, in 2015 37th annual international conference of the IEEE engineering in medicine and biology society (EMBC), IEEE, 2015,715–718.
    [135] U. T. Nguyen, A. Bhuiyan, L. A. Park, K. Ramamohanarao, An effective retinal blood vessel segmentation method using multi-scale line detection, Pattern Recognit., 46 (2013), 703–715. doi: 10.1016/j.patcog.2012.08.009
    [136] J. H. Tan, U. R. Acharya, S. V. Bhandary, K. C. Chua, S. Sivaprasad, Segmentation of optic disc, fovea and retinal vasculature using a single convolutional neural network, J. Comput. Sci., 20 (2017), 70–79. doi: 10.1016/j.jocs.2017.02.006
    [137] Y. Chai, H. Liu, J. Xu, Glaucoma diagnosis based on both hidden features and domain knowledge through deep learning models, Knowl. Based Syst., 161 (2018), 147–156. doi: 10.1016/j.knosys.2018.07.043
    [138] A. Pal, M. R. Moorthy, A. Shahina, G-eyenet: A convolutional autoencoding classifier framework for the detection of glaucoma from retinal fundus images, in 2018 25th IEEE International Conference on Image Processing (ICIP), IEEE, 2018, 2775–2779.
    [139] R. Asaoka, M. Tanito, N. Shibata, K. Mitsuhashi, K. Nakahara, Y. Fujino, et al., Validation of a deep learning model to screen for glaucoma using images from different fundus cameras and data augmentation, Ophthalmol. Glaucoma., 2 (2019), 224–231. doi: 10.1016/j.ogla.2019.03.008
    [140] X. Chen, Y. Xu, S. Yan, D. W. K. Wong, T. Y. Wong, J. Liu, Automatic feature learning for glaucoma detection based on deep learning, in International Conference on Medical Image Computing and Computer-Assisted Intervention, Springer, 2015,669–677.
    [141] A. Singh, S. Sengupta, V. Lakshminarayanan, Glaucoma diagnosis using transfer learning methods, in Applications of Machine Learning, vol. 11139, International Society for Optics and Photonics, 2019, 111390U.
    [142] S. Maheshwari, V. Kanhangad, R. B. Pachori, Cnn-based approach for glaucoma diagnosis using transfer learning and lbp-based data augmentation, arXiv. preprint.
    [143] S. Sengupta, A. Singh, H. A. Leopold, T. Gulati, V. Lakshminarayanan, Ophthalmic diagnosis using deep learning with fundus images–a critical review, Artif. Intell. Med., 102 (2020), 101758. doi: 10.1016/j.artmed.2019.101758
    [144] U. Raghavendra, H. Fujita, S. V. Bhandary, A. Gudigar, J. H. Tan, U. R. Acharya, Deep convolution neural network for accurate diagnosis of glaucoma using digital fundus images, Inf. Sci., 441 (2018), 41–49. doi: 10.1016/j.ins.2018.01.051
    [145] R. Asaoka, H. Murata, A. Iwase, M. Araie, Detecting preperimetric glaucoma with standard automated perimetry using a deep learning classifier, Ophthalmol., 123 (2016), 1974–1980. doi: 10.1016/j.ophtha.2016.05.029
    [146] Z. Li, Y. He, S. Keel, W. Meng, R. T. Chang, M. He, Efficacy of a deep learning system for detecting glaucomatous optic neuropathy based on color fundus photographs, Ophthalmol., 125 (2018), 1199–1206. doi: 10.1016/j.ophtha.2018.01.023
    [147] V. V. Raghavan, V. N. Gudivada, V. Govindaraju, C. R. Rao, Cognitive computing: Theory and applications, Elsevier., 2016.
    [148] J. Sivaswamy, S. Krishnadas, G. D. Joshi, M. Jain, A. U. S. Tabish, Drishti-gs: Retinal image dataset for optic nerve head (onh) segmentation, in 2014 IEEE 11th international symposium on biomedical imaging (ISBI), IEEE, 2014, 53–56.
    [149] A. Chakravarty, J. Sivaswamy, Glaucoma classification with a fusion of segmentation and image-based features, in 2016 IEEE 13th international symposium on biomedical imaging (ISBI), IEEE, 2016,689–692.
    [150] E. Decencière, X. Zhang, G. Cazuguel, B. Lay, B. Cochener, C. Trone, et al., Feedback on a publicly distributed image database: The messidor database, Image Analys. Stereol., 33 (2014), 231–234. doi: 10.5566/ias.1155
    [151] A. Allam, A. Youssif, A. Ghalwash, Automatic segmentation of optic disc in eye fundus images: a survey, ELCVIA, 14 (2015), 1–20. doi: 10.5565/rev/elcvia.762
    [152] P. Porwal, S. Pachade, R. Kamble, M. Kokare, G. Deshmukh, V. Sahasrabuddhe, et al., Indian diabetic retinopathy image dataset (idrid): A database for diabetic retinopathy screening research, Data, 3 (2018), 25. doi: 10.3390/data3030025
    [153] F. Calimeri, A. Marzullo, C. Stamile, G. Terracina, Optic disc detection using fine tuned convolutional neural networks, in 2016 12th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS), IEEE, 2016, 69–75.
    [154] M. N. Reza, Automatic detection of optic disc in color fundus retinal images using circle operator, Biomed. Signal. Process. Control., 45 (2018), 274–283. doi: 10.1016/j.bspc.2018.05.027
    [155] Z. Zhang, F. S. Yin, J. Liu, W. K. Wong, N. M. Tan, B. H. Lee, et al., Origa-light: An online retinal fundus image database for glaucoma analysis and research, in 2010 Annual International Conference of the IEEE Engineering in Medicine and Biology, IEEE, 2010, 3065–3068.
    [156] Z. Zhang, J. Liu, F. Yin, B.-H. Lee, D. W. K. Wong, K. R. Sung, Achiko-k: Database of fundus images from glaucoma patients, in 2013 IEEE 8th Conference on Industrial Electronics and Applications (ICIEA), IEEE, 2013,228–231.
    [157] F. Yin, J. Liu, D. W. K. Wong, N. M. Tan, B. H. Lee, J. Cheng, et al., Achiko-i retinal fundus image database and its evaluation on cup-to-disc ratio measurement, in 2013 IEEE 8th Conference on Industrial Electronics and Applications (ICIEA), IEEE, 2013,224–227.
    [158] F. Fumero, S. Alayón, J. L. Sanchez, J. Sigut, M. Gonzalez-Hernandez, Rim-one: An open retinal image database for optic nerve evaluation, in 2011 24th international symposium on computer-based medical systems (CBMS), IEEE, 2011, 1–6.
    [159] J. Lowell, A. Hunter, D. Steel, A. Basu, R. Ryder, E. Fletcher, et al., Optic nerve head segmentation, IEEE Trans. Med. Imaging., 23 (2004), 256–264. doi: 10.1109/TMI.2003.823261
    [160] C. C. Sng, L.-L. Foo, C.-Y. Cheng, J. C. Allen Jr, M. He, G. Krishnaswamy, et al., Determinants of anterior chamber depth: the singapore chinese eye study, Ophthalmol., 119 (2012), 1143–1150. doi: 10.1016/j.ophtha.2012.01.011
    [161] Z. Zhang, J. Liu, C. K. Kwoh, X. Sim, W. T. Tay, Y. Tan, et al., Learning in glaucoma genetic risk assessment, in 2010 Annual International Conference of the IEEE Engineering in Medicine and Biology, IEEE, 2010, 6182–6185.
    [162] D. Wong, J. Liu, J. Lim, X. Jia, F. Yin, H. Li, et al., Level-set based automatic cup-to-disc ratio determination using retinal fundus images in argali, in 2008 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, IEEE, 2008, 2266–2269.
    [163] T. Ge, L. Cui, B. Chang, Z. Sui, F. Wei, M. Zhou, Seri: A dataset for sub-event relation inference from an encyclopedia, in CCF International Conference on Natural Language Processing and Chinese Computing, Springer, 2018,268–277.
    [164] M. Haloi, Improved microaneurysm detection using deep neural networks, arXiv. preprint..
    [165] B. Antal, A. Hajdu, An ensemble-based system for automatic screening of diabetic retinopathy, Knowl. Based Syst., 60 (2014), 20–27. doi: 10.1016/j.knosys.2013.12.023
    [166] J. Nayak, R. Acharya, P. S. Bhat, N. Shetty, T.-C. Lim, Automated diagnosis of glaucoma using digital fundus images, J. Med. Syst., 33 (2009), 337. doi: 10.1007/s10916-008-9195-z
    [167] J. V. Soares, J. J. Leandro, R. M. Cesar, H. F. Jelinek, M. J. Cree, Retinal vessel segmentation using the 2-d gabor wavelet and supervised classification, IEEE Trans. Med. Imaging., 25 (2006), 1214–1222. doi: 10.1109/TMI.2006.879967
    [168] S. Kankanahalli, P. M. Burlina, Y. Wolfson, D. E. Freund, N. M. Bressler, Automated classification of severity of age-related macular degeneration from fundus photographs, Invest. Ophthalmol. Vis. Sci., 54 (2013), 1789–1796. doi: 10.1167/iovs.12-10928
    [169] K. Prasad, P. Sajith, M. Neema, L. Madhu, P. Priya, Multiple eye disease detection using deep neural network, in TENCON 2019-2019 IEEE Region 10 Conference (TENCON), IEEE, 2019, 2148–2153.
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(15054) PDF downloads(1732) Cited by(50)

Figures and Tables

Figures(12)  /  Tables(15)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog