Processing math: 100%
Research article

An intelligent recognition framework of access control system with anti-spoofing function

  • Under the background that Covid-19 is spreading across the world, the lifestyle of people has to confront a series of changes and challenges. This also presents new problems and requirements to automation facilities. For example, nowadays masks have almost become necessities for people in public places. However, most access control systems (ACS) cannot recognize people wearing masks and authenticate their identities to deal with increasingly serious epidemic pressure. Consequently, many public entries have turned to an attendant mode that brings low efficiency, infection potential, and high possibility of negligence. In this paper, a new security classification framework based on face recognition is proposed. This framework uses mask detection algorithm and face authentication algorithm with anti-spoofing function. In order to evaluate the performance of the framework, this paper employs the Chinese Academy of Science Institute of Automation-Face Anti-spoofing Datasets (CASIA-FASD) and Reply-Attack datasets as benchmarks. Performance evaluation indicates that the Half Total Error Rate (HTER) is 9.7%, the Equal Error Rate (EER) is 5.5%. The average process time of a single frame is 0.12 seconds. The results demonstrate that this framework has a high anti-spoofing capability and can be employed on the embedded system to complete the mask detection and face authentication task in real-time.

    Citation: Dongzhihan Wang, Guijin Ma, Xiaorui Liu. An intelligent recognition framework of access control system with anti-spoofing function[J]. AIMS Mathematics, 2022, 7(6): 10495-10512. doi: 10.3934/math.2022585

    Related Papers:

    [1] Abdul Qadeer Khan, Ayesha Yaqoob, Ateq Alsaadi . Neimark-Sacker bifurcation, chaos, and local stability of a discrete Hepatitis C virus model. AIMS Mathematics, 2024, 9(11): 31985-32013. doi: 10.3934/math.20241537
    [2] Yao Shi, Zhenyu Wang . Bifurcation analysis and chaos control of a discrete fractional-order Leslie-Gower model with fear factor. AIMS Mathematics, 2024, 9(11): 30298-30319. doi: 10.3934/math.20241462
    [3] Ibraheem M. Alsulami . On the stability, chaos and bifurcation analysis of a discrete-time chemostat model using the piecewise constant argument method. AIMS Mathematics, 2024, 9(12): 33861-33878. doi: 10.3934/math.20241615
    [4] Abdul Qadeer Khan, Ayesha Yaqoob, Ateq Alsaadi . Discrete Hepatitis C virus model with local dynamics, chaos and bifurcations. AIMS Mathematics, 2024, 9(10): 28643-28670. doi: 10.3934/math.20241390
    [5] A. Q. Khan, Ibraheem M. Alsulami, S. K. A. Hamdani . Controlling the chaos and bifurcations of a discrete prey-predator model. AIMS Mathematics, 2024, 9(1): 1783-1818. doi: 10.3934/math.2024087
    [6] Kamel Guedri, Rahat Zarin, Ashfaq Khan, Amir Khan, Basim M. Makhdoum, Hatoon A. Niyazi . Modeling hepatitis B transmission dynamics with spatial diffusion and disability potential in the chronic stage. AIMS Mathematics, 2025, 10(1): 1322-1349. doi: 10.3934/math.2025061
    [7] Yulong Li, Long Zhou, Fengjie Geng . Dynamics on semi-discrete Mackey-Glass model. AIMS Mathematics, 2025, 10(2): 2771-2807. doi: 10.3934/math.2025130
    [8] Xiongxiong Du, Xiaoling Han, Ceyu Lei . Dynamics of a nonlinear discrete predator-prey system with fear effect. AIMS Mathematics, 2023, 8(10): 23953-23973. doi: 10.3934/math.20231221
    [9] Muhammad Farman, Ali Akgül, J. Alberto Conejero, Aamir Shehzad, Kottakkaran Sooppy Nisar, Dumitru Baleanu . Analytical study of a Hepatitis B epidemic model using a discrete generalized nonsingular kernel. AIMS Mathematics, 2024, 9(7): 16966-16997. doi: 10.3934/math.2024824
    [10] Ali Al Khabyah, Rizwan Ahmed, Muhammad Saeed Akram, Shehraz Akhtar . Stability, bifurcation, and chaos control in a discrete predator-prey model with strong Allee effect. AIMS Mathematics, 2023, 8(4): 8060-8081. doi: 10.3934/math.2023408
  • Under the background that Covid-19 is spreading across the world, the lifestyle of people has to confront a series of changes and challenges. This also presents new problems and requirements to automation facilities. For example, nowadays masks have almost become necessities for people in public places. However, most access control systems (ACS) cannot recognize people wearing masks and authenticate their identities to deal with increasingly serious epidemic pressure. Consequently, many public entries have turned to an attendant mode that brings low efficiency, infection potential, and high possibility of negligence. In this paper, a new security classification framework based on face recognition is proposed. This framework uses mask detection algorithm and face authentication algorithm with anti-spoofing function. In order to evaluate the performance of the framework, this paper employs the Chinese Academy of Science Institute of Automation-Face Anti-spoofing Datasets (CASIA-FASD) and Reply-Attack datasets as benchmarks. Performance evaluation indicates that the Half Total Error Rate (HTER) is 9.7%, the Equal Error Rate (EER) is 5.5%. The average process time of a single frame is 0.12 seconds. The results demonstrate that this framework has a high anti-spoofing capability and can be employed on the embedded system to complete the mask detection and face authentication task in real-time.



    Schoenberg introduced the trigonometric spline functions defined by divided differences in [18]. And the trigonometric spline functions have been shown to possess many B-spline-like properties. In view of this, many scholars call the trigonometric splines the trigonometric B-splines, in [4,8]. It is well-known that the trigonometric B-splines are piecewise functions corresponding to the spaces

    T2n+1:=span{1,cost,sint,cos2t,sin2t,,cosnt,sinnt},

    for odd-order, and

    H2n:=span{cost2,sint2,cos3t2,sin3t2,,cos(2n1)t2,sin(2n1)t2},

    for even-order. Odd-order trigonometric B-splines in T2n+1 form a partition of unity, a desirable property for curve design. However, even-order B-splines in H2n lack this partition of unity, creating challenges in certain applications where this property is critical. As a result, extensive research has focused on the odd-order basis, particularly on its normalization. The author of [8] established the recurrence relation for the trigonometric B-splines of arbitrary order and derived trigonometric Marsden identity. The author of [20] utilized the trigonometric Marsden identity to derive the normalized odd-order trigonometric B-splines over uniform knots. Building on the trigonometric Marsden identity expansion introduced by [7], [11] explicitly derived the normalization coefficients required to ensure that the trigonometric B-spline basis functions are properly normalized. [15] provided the p-Bézier basis functions in the space T2n+1, which is defined over any interval of length <π. Those basis functions are a subcase of the normalized trigonometric B-splines. [2] presented the normalized Bernstein-like basis functions in the space T2n+1, which is defined over the interval [0,π/2]. [21] established the C-B spline basis. In this work, the C-B spline basis of order 3 is just the normalized trigonometric B-spline basis corresponding to the space T3. In a more general context, the normalized trigonometric B-splines are also considered in [16] as a special case.

    Curve and surface design is an important area in Computer Aided Geometric Design (CAGD), where trigonometric B-splines are a foundational tool. Normalized trigonometric B-splines enable enhanced construction and control of curves and surfaces, suggesting their potential applications in aircraft design [9]. Additionally, trigonometric B-splines show promising applications in other fields, such as physical simulations (see [5,12,19]).

    The purpose of this paper is to introduce the integral formula for odd-order trigonometric B-splines. Given the significant applications and theoretical importance of integral formulas in Chebyshev systems for fields such as numerical analysis, signal processing, and function approximation, it is notable that the integral properties of sin and cos in trigonometric B-spline bases render them incapable of being directly derived like other bases in Chebyshev systems. The aim of this study is to provide a similar integral formula for trigonometric B-spline bases. To achieve this, this paper first constructs a novel set of even-order trigonometric B-spline curve basis functions and, through integration of these functions, successfully derives the traditional odd-order trigonometric B-spline basis functions, thereby establishing the integral formula for odd-order trigonometric B-spline bases. During this derivation process, a determinant of even order with structural symmetry is obtained. Furthermore, this study refines the conditions for knot sequences to ensure that the corresponding normalized trigonometric B-spline bases possess nonnegativity.

    Our main contributions are

    ● A set of trigonometric spline bases corresponding to the DC component-free space is provided, along with the integral representation of normalized trigonometric B-spline bases corresponding to space T2n+1.

    ● Adjusting the conditions imposed on the knot sequence to guarantee the nonnegativity of the normalized trigonometric B-spline basis functions.

    ● A structurally symmetric even-order determinant is presented.

    The remainder of this article is organized as follows: Section 2 reviews the related concepts and properties. The improvements to knot sequences are discussed in Section 3. In Section 4, the trigonometric spline basis corresponding to the DC component-free space and the integral formula for the normalized trigonometric B-spline basis are presented. The final conclusions are drawn in the last section.

    In this section, we will recall some established concepts and conclusions.

    [1] has demonstrated that the knot sequences for B-spline basis functions can be finite, infinite, or bi-infinite. Analogous to the case of traditional B-spline basis functions, this paper focuses on the study of trigonometric B-spline basis functions corresponding to bi-infinite knot sequences.

    The normalized trigonometric B-spline basis functions are defined in a manner analogous to the de Boor-Cox formula [4,7,8,11].

    Definition 2.1. (Normalized trigonometric B-spline basis functions) Given a knot sequence T={ti}+i=, such that

    titi+1,0<ti+2n+1ti<2π,iZ,nZ+, (2.1)

    the normalized trigonometric B-spline basis functions of order 2n+1 are defined as follows:

    Ki,2n+1(t)=ζi,2n+1Ni,2n+1(t), (2.2)

    where

    Ni,1(t)={1, if tit<ti+1,0,otherwise. (2.3)
    Ni,2n(t)=sin(tti2)sin(ti+2n1ti2)Ni,2n1(t)+sin(ti+2nt2)sin(ti+2nti+12)Ni+1,2n1(t), (2.4)
    Ni,2n+1(t)=sin(tti2)sin(ti+2nti2)Ni,2n(t)+sin(ti+2n+1t2)sin(ti+2n+1ti+12)Ni+1,2n(t), (2.5)
    ζi,2n+1=1(2n)!μnj=1costi+μ(2j)ti+μ(2j1)2, (2.6)

    and the sum is taken over all permutations μ:{1,2,,2n}{1,2,,2n}.

    Remark 2.1 In [4,8,11], the knot sequence satisfies the condition 0<ti+2n+1ti<2π. However, the knot sequence described in [7] satisfies a slightly different condition, 0<ti+2nti<2π. In the subsequent section, the conditions of the knot sequence are reiterated.

    If ti1<ti=ti+1==ti+mi1<ti+mi, where 1mi2n, the knots tj, where j=i,i+1,,i+mi1, are referred to as knots of multiplicity mi. Especially, we set 00=0. The space of trigonometric spline basis is defined by

    Γ2n+1[T]:={Ni,2n+1(t)|Ni,2n+1(t)|t[ti,ti+1)T2n+1, and N(l)i,2n+1(ti)=N(l)i,2n+1(ti+),0l2nmi,iZ}.

    The trigonometric B-spline basis functions possess many B-spline-like properties [3,6,8,14].

    Property 2.1. (Properties of the trigonometric B-spline basis functions) The trigonometric B-spline basis functions Ni,2n+1(t) defined in Eq (2.5) possess the following properties:

    (1) (Local support) For any iZ and nZ+, there exists

    Ni,2n+1(t)={>0,t(ti,ti+2n+1),=0,t[ti,ti+2n+1]. (2.7)

    (2) (Continuity) The continuous order of Ni,2n+1(t) at tj (where iji+2n+1), denoted as kji,2n+1, can be described as

    kji,2n+1={2nξ,iji+ξ1,2nmj, i+ξji+2n+1η,2nη,   i+2n+2ηji+2n+1, (2.8)

    if ti=ti+1==ti+ξ1<ti+ξti+ξ+1ti+2n+1η<ti+2n+2η==ti+2n+1.

    In this section, we will adjust the conditions of the knot sequence to ensure the nonnegativity of the normalized trigonometric B-spline basis functions Ki,2n+1(t) for iZ and nZ+.

    First, the condition (2.1) can be relaxed.

    The nonnegativity of the basis function Ni,2n+1(t) is ensured by the condition 0<ti+2n+1ti<2π as stated in (2.1). Since the length of the support intervals for Ni,2n(t) and Ni+1,2n(t) in Eq (2.4) is 2n, replacing 0<ti+2n+1ti<2π with the condition 0<ti+2nti<2π still guarantees the nonnegativity of Ni,2n+1(t). Therefore, the condition (2.1) can be relaxed to

    titi+1,0<ti+2nti<2π,iZ,nZ+. (3.1)

    Second, the condition to ensure the positivity of the normalized coefficients ζi,2n+1 in Eq (2.6) is presented. According to the representation in Eq (2.6), we obtain the condition to ensure the positivity of the normalized coefficient ζi,2n+1, that is

    0ti+2n1ti<π, iZ,nZ+. (3.2)

    The Bézier-like basis defined in the space T2n+1 is a subcase of the trigonometric B-spline basis. In [13], it was noted that the space T2n+1 does not have an NTP basis when the domain of T2n+1 is [0,π]. This implies the non-existence of normalized coefficients. Consequently, we conclude that ti+2n1tiπ. In [15], it proved that there exist NTP bases provided that the domain of T2n+1 is any interval of length <π, specifically referred to as p-Bézier bases. This implies that the normalized coefficient satisfies the condition ti+2n1ti<π, in the special cases of Bézier.

    Figure 1a presents an example of the basis functions Ni,2n+1(t) for iZ, whose corresponding knot sequence T satisfies condition (3.1) but fails to satisfy condition (2.1). Here n=2 and the knot sequence T={ti}16i=1={1,1,1,1,1,3,4,5.3,6.5,7.5,8.8,10,10,10,10,10}. Figure 1b shows the trigonometric B-spline basis functions Ni,3(t) and Ki,3(t) corresponding to the knot sequence that satisfies condition (3.1) but does not satisfy condition (3.2), while Figure 1c presents the functions Ni,3(t) and Ki,3(t) corresponding to the knot sequence that satisfies both conditions (3.1) and (3.2).

    Figure 1.  Examples of trigonometric B-spline basis Ni,2n+1(t) and Ki,2n+1(t).

    Although the coefficients of the normalized trigonometric B-spline basis have already been defined in Eq (2.6), for the convenience of deriving and proving the integral formula of the normalized trigonometric B-spline basis, this paper introduces a simplified normalized coefficient expression that is equivalent to Eq (2.6).

    Lemma 3.1. Let

    Ci,2n+1=1(2n1)!!γ(1,2,,2n)nr=1costi+m2rti+m2r12,iZ,nZ+, (3.3)

    where the sum is taken over all permutations γ(1,2,,2n):{m1,m2,,m2n}{1,2,,2n}, with m1,m2,,m2n being a permutation of 1,2,,2n that satisfies m1<m3<<m2n1 and m2r1<m2r for each r=1,,n. Then there exists

    Ci,2n+1=ζi,2n+1,

    where ζi,2n+1 defined in Eq (2.6).

    Third, a new definition for the normalized trigonometric B-spline basis that guarantees nonnegativity is presented.

    Definition 3.1. (Nonnegative normalized trigonometric B-spline basis functions) Given a knot sequence T={ti}+i=, such that

    titi+1, 0<ti+2nti<2π and 0ti+2n1ti<π, iZ,nZ+, (3.4)

    the nonnegative normalized trigonometric B-spline basis functions of order 2n+1 are defined as follows:

    Ki,1(t)={1, if tit<ti+1,0,otherwise. (3.5)
    Ki,2n+1(t)=Ci,2n+1Ni,2n+1(t), (3.6)

    where Ni,2n+1(t), Ci,2n+1 is defined in Eqs (2.5) and (3.3), respectively.

    In this section, we generally set the knot sequence to be T={ti}+i= that satisfies condition (3.4), where the multiplicity of ti is mi with 1mi2n, and kji,2n+1 is defined in Eq (2.8) without further explanation. Let us define the DC component-free space as T2n:=span{cost,sint,,cosnt,sinnt}. Its corresponding piecewise trigonometric polynomial space is

    Γ2n[T]:={Fi,2n(t)|Fi,2n(t)|t[ti,ti+1)T2n, and F(l)i,2n(ti)=F(l)i,2n(ti+),0l2nmi1, 1mi2n1,iZ}.

    Clearly, Γ2n[T] is a linear space. We can derive the subspace of Γ2n[T] as follows:

    Γ2n[ti,ti+2n]={Fi,2n(t)Γ2n[T]|Fi,2n(t)=0,t[ti,ti+2n] and Fi,2n(t)0,t(ti,ti+2n),F(l)i,2n(tj)=F(l)i,2n(tj+),0lkji,2n, iji+2n}.

    It can be shown that a function in the space \(\Gamma_{2n}[t_i, t_{i + 2n}]\) exhibits local support and a specific order of continuity.

    The following determinant and its accompanying proof are presented to facilitate future derivations.

    Lemma 4.1. For any nZ+, then the following identity holds.

    D(t1,t2,,t2n):=|cost1cost2cost2nsint1sint2sint2ncos2t1cos2t2cos2t2nsin2t1sin2t2sin2t2ncosnt1cosnt2cosnt2nsinnt1sinnt2sinnt2n|=22n2nn!1l<jnsintjtl2γ(1,2,,2n)nr=1costm2rtm2r12, (4.1)

    where γ(1,2,,2n) defined in Lemma 3.1.

    Proof. According to Euler's formula and the identity eitjeits=2iei2(tj+ts)sintjts2, it follows that

    D(t1,t2,,t2n)=|eit1+eit12eit2+eit22eit2n+eit2n2eit1eit12ieit2eit22ieit2neit2n2ienit1+enit12enit2+enit22enit2n+enit2n2enit1enit12ienit2enit22ienit2nenit2n2i|=(1)n2+n(2i)nenit1enit2n|111eit1eit2eit2ne(n1)it1e(n1)it2e(n1)it2ne(n+1)it1e(n+1)it2e(n+1)it2ne2nit1e2nit2e2nit2n|=22n2n2nenit1enit2n1m1<m2<<mn2neitm1eitmn1s<j2nei2(tj+ts)sintjts2.

    For the sake of convenience, let

    C(t1,t2,,t2n)=γ(1,2,,2n)nr=1costm2rtm2r12. (4.2)

    Therefore, it suffices to prove that

    C(t1,t2,,t2n)=n!2nenit1enit2n1m1<m2<<mn2neitm1eitmn1s<j2nei2(tj+ts)=n!2n1m1<m2<<mn2nexp(i2mnq=m1tqi2(2nh=1thmnq=m1tq)). (4.3)

    We establish the inductive hypothesis for n. For n=1, the result is straightforward. Assume that the conclusion holds for np1, where \(p\) is any positive integer. Specifically, we have

    C(tn1,tn2,,tn2p2)=(p1)!2(p1)εexp(i2mp1q=m1tqi2(n2p2h=n1thmp1q=m1tq)),

    where the sum is taken over all permutations ε:{m1,m2,,mp1}{n1,n2,,n2p2}. Here, n1,n2,,n2p2 represent a permutation of 1,2,,2n such that n1<n2<<n2p2, while m1,m2,,mp1 is a subset of n1,n2,,n2p2 satisfying m1<m2<<mp1.

    Next, consider the case where n=p. Based on this assumption, we have

    C(t1,t2,,t2p)=cost2pt2p12γ(1,2,,2p2)p1r=1costm2rtm2r12+cost2pt2p22γ(1,2,,2p3,2p1)p1r=1costm2rtm2r12++cost2pt22γ(1,3,4,,2p1)p1r=1costm2rtm2r12+cost2pt12γ(2,3,,2p1)p1r=1costm2rtm2r12=12(exp(i2(t2pt2p1))+exp(i2(t2pt2p1)))C(t1,t2,,t2p2)+12(exp(i2(t2pt2p2))+exp(i2(t2pt2p2)))C(t1,t2,,t2p3,t2p1)++12(exp(i2(t2pt2))+exp(i2(t2pt2)))C(t1,t3,t4,,t2p1)+12(exp(i2(t2pt1))+exp(i2(t2pt1)))C(t2,t3,,t2p1)=p!2p1m1<m2<<mp2pexp(i2mpq=m1tqi2(2ph=1thmpq=m1tq)),

    where the sum is taken over all permutations γ(n1,n2,,n2p2):{m1,m2,,m2p2}{n1,n2,,n2p2}, with m1,m2,,m2p2 being a permutation of n1,n2,,n2p2 that satisfies m1<m3<<m2p3 and m2r1<m2r for each r=1,,p1. Here, the sequence {n1,n2,,n2p2} represents, in order, the sequences {1,2,,2p2}, {1,2,,2p3,2p1}, , {1,3,4,,2p1}, and \(\{2, 3, \cdots, 2p-1\}\). Eq (4.3) is valid for any positive integer n. Thus, the lemma is proved.

    This subsection defines a set of truncated functions and demonstrates that any function in the space Γ2n[ti,ti+2n] can be expressed as a linear combination of these functions.

    Let g2n(t):=sintsin2n2(t2)(nZ+), the truncated functions Gi,2n(t), where iZ and nZ+, are defined as follows: If ti=ti+1==ti+ξ1<ti+ξ, then

    Gi,2n(t):={0,t<ti,g(ξ1)2n(tti),tti. (4.4)

    Figure 2a2c illustrate examples of the function g4(t) and the truncated functions Gi,4(t), where iZ, over single and multiple knots, respectively.

    Figure 2.  Examples of functions g4(t) and Gi,4(t) for iZ.

    To prove that any function in the space Γ2n[ti,ti+2n] can be represented as a linear combination of {Gi,2n(t)}iZ, the following lemmas will be utilized.

    Lemma 4.2. There exist n+1 real numbers d0,d1,,dn such that

    sin2n(t2)=d0+d1cost+d2cos2t++dncosnt,

    where d0=(2n1)!!(2n)!!.

    Proof. It is well known that

    sin2n(t2)span{1,cost,cos2t,,cosnt},

    since

    sin2n(t2)=(sin2(t2))n=(1cost2)n.

    Thus, there are n+1 real numbers d0,d1,,dn such that

    sin2n(t2)=d0+d1cost+d2cos2t++dncosnt.

    We deduce that, based on Euler's formula,

    (eit2eit22i)2n=d0+d1eit+eit2+d2e2it+e2it2++dnenit+enit2. (4.5)

    Expanding the left side of Eq (4.5) using the binomial theorem results in d0=(2n1)!!(2n)!!.

    Lemma 4.3. The function Gi,2n(t) defined in Eq (4.4) lies in Γ2n[T] for any iZ,nZ+.

    Proof. First, according to Lemma 4.2, we obtain

    sin2n2(t2)span{1,cost,cos2t,,cos(n1)t},

    Thus, we have

    sintsin2n2(t2)span{sint,sin2t,,sinnt},

    and

    g2n(tti)T2n for iZ.

    Second, the order of continuity of g2n(tti) at ti is 2n2, because that

    g(l)2n(tti)|t=ti=0,l=0,1,,2n2, and g(2n1)2n(tti)|t=ti0.

    Third, it is easy to see that the order of continuity of Gi,2n(t) is 2nξ1 at ti and is at the other knots.

    In conclusion, Gi,2n(t)Γ2n[T], for iZ.

    Lemma 4.4. The functions Gi,2n(t) for iZ in Eq (4.4) are linearly independent.

    Proof. If ti1<ti=ti+1==ti+mi1<ti+mi, the mi functions Gj,2n(t) for iji+mi1 are linearly independent since they have different continuous orders at ti.

    For the sake of simplicity, let r=i+mi and tr1<tr=tr+1==tr+mr1<tr+mr. We can then similarly conclude that the functions Gj,2n(t) for rjr+mr1 are linearly independent. In addition, it is straightforward to derive that

    span{Gi,2n(t),Gi+1,2n(t),,Gi+mi1,2n(t)}span{Gr,2n(t),Gr+1,2n(t),,Gr+mr1,2n(t)}={0}.

    Thus, Gi,2n(t),Gi+1,2n(t),,Gi+mi1,2n(t),Gr,2n(t),Gr+1,2n(t),,Gr+mr1,2n(t) are linearly independent. Consequently, the functions Gi,2n(t) for iZ are linearly independent.

    From the above lemmas, we conclude that any function in the space Γ2n[ti,ti+2n] can be expressed as a linear combination of Gi,2n(t) for iZ.

    Theorem 4.1. For any function Fi,2n(t)Γ2n[ti,ti+2n], there exist 2nη+1 real numbers νi,νi+1,,νi+2nη such that

    Fi,2n(t)=i+2nηj=iνjGj,2n(t), t[ti,ti+2n),

    where η is the multiplicity of ti+2n in the interval [ti,ti+2n] and the functions Gj,2n(t), where iji+2nη, are defined in Eq (4.4).

    Proof. Since Fi,2n(t) in space Γ2n[ti,ti+2n] is a piecewise function, it can first be linearly represented by the functions Gj,2n(t) for iji+2nη in Eq (4.4) over a non-zero interval within its support interval.

    Suppose ti=ti+1==ti+ξ1<ti+ξti+2nη<ti+2nη+1==ti+2n. We consider that the function Fi,2n(t) can be linearly represented in the interval [ti,ti+ξ). Thus, we prove that there exist ξ real numbers κi,κi+1,,κi+ξ1 such that

    Fi,2n(t)|[ti,ti+ξ)=i+ξ1j=iκjGj,2n(t).

    For simplicity, assume that

    f1(t)=Fi,2n(t)|[ti,ti+ξ), t[ti,ti+ξ).

    Based on the definition of the space Γ2n[ti,ti+2n], we know that f1(t)T2n, which means that there exist 2n real numbers x1,x2,,x2n such that

    f1(t)=x1cost+x2sint++x2n1cosnt+x2nsinnt,

    and

    f(s)1(ti)=f(s)1(ti)=f(s)1(ti+), 0s2nξ1,

    which implies that

    f(s)1(ti)=0, 0s2nξ1.

    Let ρ=2nξ1, Ωρ:={f1(t)|f1(t)T2n,f(s)1(ti)=0,0sρ}, and Ψρ:=span{g2n(tti),g2n(tti+1),,g(2nρ2)2n(tti+ξ1)}=span{g2n(tti),g2n(tti),,g(2nρ2)2n(tti)}.

    Since g2n(tti),g2n(tti),,g(2nρ2)2n(tti) are linearly independent, we conclude that the dimension of Ψρ is 2nρ1. According to the definition of the function g2n(t), we obtain that g(l)2n(tti)Ωρ, l=0,1,,2nρ2. Hence, it follows naturally that Ψρ is the subspace of Ωρ.

    The dimension of the space Ωρ is equal to the dimension of the solution space corresponding to the following linear equations.

    {f1(ti)=0,f1(ti)=0,f(ρ)1(ti)=0. (4.6)

    Thus, the following linear equations holds:

    {x1costi+x2sinti+x3cos2ti+x4sin2ti++x2n1cosnti+x2nsinnti=0,x1sinti+x2costix32sin2ti+x42cos2ti+x2n1nsinnti+x2nncosnti=0,x1costix2sintix322cos2tix422sin2ti+x2n1n2cosntix2nn2sinnti=0,x1sintix2costi+x323sin2tix423cos2ti++x2n1n3sinntix2nn3cosnti=0,x1cos(π2ρ+ti)+x2sin(π2ρ+ti)++x2n1nρcos(π2ρ+nti)+x2nnρsin(π2ρ+nti)=0, (4.7)

    where the corresponding coefficient matrix is given as

    (costisinticos2tisin2ticosntisinntisinticosti2sin2ti2cos2tinsinntincosnticostisinti22cos2ti22sin2tin2cosntin2sinntisinticosti23sin2ti23cos2tin3sinntin3cosnticos(π2ρ+ti)sin(π2ρ+ti)2ρcos(π2ρ+2ti)2ρsin(π2ρ+2ti)nρcos(π2ρ+nti)nρsin(π2ρ+nti)). (4.8)

    By performing elementary row operations, it is demonstrated that the matrix (4.8) maintains full row rank, independent of the parity of ρ. This result establishes that the dimension of the solution space for the linear system (4.7) is

    2n(ρ+1)=2nρ1.

    The dimension of Ωρ is determined to be 2nρ1. Consequently, it follows that Ωρ=Ψρ. In other words, we know that there exist 2nρ1=2n(2nξ1)1=ξ real numbers κi,κi+1,,κi+ξ1 such that

    f1(t)=i+ξ1j=iκjg(ji)2n(ttj).

    According to the definition of Gi,2n(t), the function \(f_1(t)\) can be expressed as

    f1(t)=i+ξ1j=iκjGj,2n(t).

    Consider the non-zero interval [ti+ξ,ti+ξ+mi+ξ). We define

    f2(t)=Fi,2n(t)|[ti+ξ,ti+ξ+mi+ξ),t[ti+ξ,ti+ξ+mi+ξ).

    According to the continuous order of Fi,2n(t) at ti+ξ, we deduce that

    f(s)1(ti+ξ)=f(s)1(ti+ξ)=f(s)2(ti+ξ+)=f(s)2(ti+ξ),0s2nmi+ξ1.

    This implies that

    f(s)2(ti+ξ)f(s)1(ti+ξ)=0,0s2nmi+ξ1.

    Thus, from the above analysis, it follows that there are mi+ξ real numbers κi+ξ,κi+ξ+1,,κi+ξ+mi+ξ1 such that

    f2(t)f1(t)=i+ξ+mi+ξ1j=i+ξκjGj,2n(t).

    Consequently, we have

    f2(t)=i+ξ+mi+ξ1j=iκjGj,2n(t).

    For every non-zero subinterval of the support interval of Fi,2n(t), we consider it this way. It can be concluded that there exist 2nη+1 real numbers νi,νi+1,,νi+2nη such that

    Fi,2n(t)=i+2nηj=iνjGj,2n(t), t[ti,ti+2nη+1)=[ti,ti+2n),

    where νj for iji+2nη is expressed as a linear combination of κi,κi+1,,κi+2nη.

    The subsection demonstrates that the dimension of Γ2n[ti,ti+2n] is 1. To support this, we first require the following lemma.

    Lemma 4.5. Given an integer i and positive integers n,η such that η2n1, then the determinant

    |Gi,2n(ti+2n)Gi+1,2n(ti+2n)Gi+2nη1,2n(ti+2n)Gi,2n(ti+2n)Gi+1,2n(ti+2n)Gi+2nη1,2n(ti+2n)G(2nη1)i,2n(ti+2n)G(2nη1)i+1,2n(ti+2n)G(2nη1)i+2nη1,2n(ti+2n)|0,

    where the functions Gj,2n(t) for iji+2nη1 are defined in Eq (4.4).

    Proof. Use reduction to absurdity. Assume that the determinant is equal to zero. Then, there are 2nη real numbers zi,zi+1,,zi+2nη1, which are not all equal to zero, satisfying

    i+2nη1l=izl(Gl,2n(ti+2n)Gl,2n(ti+2n)G(2nη1)l,2n(ti+2n))=0.

    Let Y(t)=i+2nη1l=izlGl,2n(t). Then, we find that the first 2nη1 derivatives of Y(t) at ti+2n are all zero. According to Theorem 4.1, there exist mi+2n real numbers, such that

    Y(t)=i+2n+mi+2nη1u=i+2nηzuGu,2n(t).

    Therefore,

    Y(t)=i+2nη1l=izlGl,2n(t)=i+2n+mi+2nη1u=i+2nηzuGu,2n(t),

    and

    i+2nη1l=izlGl,2n(t)i+2n+mi+2nη1u=i+2nηzuGu,2n(t)=0.

    According to Lemma 4.4, we obtain that zi==zi+2nη1=0. This conflicts with the assumption. So, the lemma is proved.

    From Theorem 4.1 and Lemma 4.5, we obtain the dimension of Γ2n[ti,ti+2n].

    Theorem 4.2. The dimension of the linear space Γ2n[ti,ti+2n] is 1.

    Proof. Suppose that u(t) is an arbitrary function in Γ2n[ti,ti+2n]. Thus, according to Theorem 4.1, there are 2nη+1 real numbers νi,νi+1,,νi+2nη such that

    u(t)=i+2nηj=iνjGj,2n(t),t[ti,ti+2n)=[ti,ti+2nη+1),

    where η denotes the multiplicity of ti+2n in the interval [ti,ti+2n]. Consider the continuous order of function u(t) at ti+2n. We have

    u(l)(ti+2n)=u(l)(ti+2n)=u(l)(ti+2n+)=0,l=0,1,2,,2nη1,

    which implies that

    u(l)(ti+2n)=0,l=0,1,2,,2nη1.

    Thus, the equation representing the continuous order of u(t)s at ti+2n is given by

    {u(ti+2n)=0,u(ti+2n)=0,u(2nη1)(ti+2n)=0. (4.9)

    which can be expressed in matrix form as follows:

    (Gi,2n(ti+2n)Gi+1,2n(ti+2n)Gi+2nη,2n(ti+2n)Gi,2n(ti+2n)Gi+1,2n(ti+2n)Gi+2nη,2n(ti+2n)G(2nη1)i,2n(ti+2n)G(2nη1)i+1,2n(ti+2n)G(2nη1)i+2nη,2n(ti+2n))(νiνi+1νi+2nη)=0. (4.10)

    This system consists of linear equations with νi,νi+1,,νi+2nη as variables. Based on Lemma 4.5, the coefficient matrix of these linear equations is full row rank, with a rank of 2nη+1(2nη)=1. This indicates that the dimension of Γ2n[ti,ti+2n] is 1.

    In this subsection, we consider single knots and assume that ti<ti+1 for any iZ. Then the even-order trigonometric spline basis functions corresponding to the DC component-free space T2n, and the integral expression for the trigonometric B-spline basis Ki,2n+1(t) are presented.

    According to Theorem 4.2 and the definition of Γ2n[ti,ti+2n], it is established that Fi,2n(t)Γ2n[ti,ti+2n] and the dimension of Γ2n[ti,ti+2n] is 1. If we find a function H(t)Γ2n[ti,ti+2n], then it follows that Fi,2n(t)=αH(t),t[ti,ti+2n) for some real number α. Thus, the following theorem is provided.

    Theorem 4.3. (The function expression in the space Γ2n[ti,ti+2n] over single knots) For any function Fi,2n(t)Γ2n[ti,ti+2n], there exists a real number α such that

    Fi,2n(t)=αH(t),t[ti,ti+2n),

    where

    H(t)=|Gi,2n(t)Gi+1,2n(t)Gi+2n1,2n(t)Gi+2n,2n(t)costicosti+1costi+2n1costi+2nsintisinti+1sinti+2n1sinti+2ncos2ticos2ti+1cos2ti+2n1cos2ti+2nsin2tisin2ti+1sin2ti+2n1sin2ti+2ncosnticosnti+1cosnti+2n1cosnti+2nsinntisinnti+1sinnti+2n1sinnti+2n|,

    and α=1D(ti,ti+1,,ti+2n1). Here D(ti,ti+1,,ti+2n1) and the functions Gj,2n(t) for iji+2n are defined in Eqs (4.1) and (4.4), respectively.

    Proof. According to Theorem 4.1, there exist 2n real numbers αi,αi+1,,αi+2n1 such that

    Fi,2n(t)=i+2n1j=iαjGj,2n(t),t[ti,ti+2n), (4.11)

    By the continuous order of Fi,2n(t) at ti+2n, it follows that

    F(d)i,2n(ti+2n)=i+2n1j=iαjG(d)j,2n(ti+2n)=0,t[ti,ti+2n),d=0,1,2,,2n2. (4.12)

    This can be expressed equivalently as a system of equations

    {i+2n1j=iαjGj,2n(ti+2n)=0,i+2n1j=iαjGj,2n(ti+2n)=0,i+2n1j=iαjG(2n2)j,2n(ti+2n)=0. (4.13)

    In addition, we have

    sin(tti+2n)sin2n2(tti+2n2)=i+2n1j=iβjsin(ttj)sin2n2(ttj2), (4.14)

    where βi,βi+1,,βi+2n1 are real numbers. Since Eq (4.14) when t=ti+2n is equivalent to Eq (4.13). We obtain that αj=βj,j=i,,i+2n1. Thus, we only focus on βj,iji+2n1. By proving Lemma 4.3, it can be concluded that there exist n numbers η1,η2,,ηn such that

    sin(ttj)sin2n2(ttj2)=nl=1ηlsinl(ttj),j=i,i+1,,i+2n. (4.15)

    So we can rewrite (4.14) as follows:

    (costsintcosntsinnt)(η1sinti+2nη1costi+2nη2sin2ti+2nη2cos2ti+2nηnsinnti+2nηncosnti+2n)=(costsintcosntsinnt)(η1sintiη1sinti+2n1η1costiη1costi+2n1η2sin2tiη2sin2ti+2n1η2cos2tiη2cos2ti+2n1ηnsinntiηnsinnti+2n1ηncosntiηncosnti+2n1)(βiβi+1βi+2n2βi+2n1). (4.16)

    Based on the properties of matrix operations, we deduce that

    (η1sintiη1sinti+2n1η1costiη1costi+2n1η2sin2tiη2sin2ti+2n1η2cos2tiη2cos2ti+2n1ηnsinntiηnsinnti+2n1ηncosntiηncosnti+2n1)(βiβi+1βi+2n2βi+2n1)=(η1sinti+2nη1costi+2nη2sin2ti+2nη2cos2ti+2nηnsinnti+2nηncosnti+2n). (4.17)

    The coefficient matrix of (4.17) is non-zero due to the linear independence of the functions cost,sint,, cosnt,sinnt. According to Cramer's Rule, we have

    βi+j1=D(ti,,ti+j2,ti+2n,ti+j,,ti+2n1)D(ti,ti+1,,ti+2n1), for j=1,2,,2n.

    We apply this result to Eq (4.11) to yield

    Fi,2n(t)=2nj=1αi+j1Gi+j1,2n(t)=2nj=1D(ti,,ti+j2,ti+2n,ti+j,,ti+2n1)D(ti,ti+1,,ti+2n1)Gi+j1,2n(t)=D(ti+2n,ti+1,,ti+2n1)D(ti,ti+1,,ti+2n1)Gi,2n(t)+D(ti,ti+2n,ti+2,,ti+2n1)D(ti,ti+1,,ti+2n1)Gi+1,2n(t)++D(ti,,ti+2n2,ti+2n)D(ti,ti+1,,ti+2n1)Gi+2n1,2n(t)=(1)2n1D(ti+1,,ti+2n)D(ti,ti+1,,ti+2n1)Gi,2n(t)+(1)2n2D(ti,ti+2,,ti+2n)D(ti,ti+1,,ti+2n1)Gi+1,2n(t)++D(ti,,ti+2n2,ti+2n)D(ti,ti+1,,ti+2n1)Gi+2n1,2n(t)+D(ti,,ti+2n2,ti+2n1)D(ti,ti+1,,ti+2n1)Gi+2n,2n(t)=1D(ti,ti+1,,ti+2n1)H(t), t[ti,ti+2n),

    where Gi+2n,2n(t)=0,t[ti,ti+2n).

    The linear space Γ2n[ti,ti+2n] corresponds to space T2n. Similarly, the space Γ2n+1[ti,ti+2n+1], which corresponds to space T2n+1, can be defined as follows:

    Γ2n+1[ti,ti+2n+1]:={Mi,2n+1(t)Γ2n+1[T]|Mi,2n+1(t)=0,t[ti,ti+2n+1] and Mi,2n+1(t)0,t(ti,ti+2n+1), M(l)i,2n+1(tj)=M(l)i,2n+1(tj+),l=0,1,,kji,2n+1, iji+2n+1.}

    We can derive the following theorem analogously.

    Theorem 4.4. The dimension of the linear space Γ2n+1[ti,ti+2n+1] is 1.

    The proof is similar to the proof of Theorem 4.2.

    Inspired by the method for constructing normalized B-basis in extended Chebyshev space presented in [10], we use the functions Fi,2n(t), where iZ, to construct the normalized function Mi,2n+1(t). Therefore, the following theorem holds.

    Theorem 4.5. (The normalized function) Suppose that

    Mi,2n+1(t)=tFi,2n(s)ds+Fi,2n(t)dttFi+1,2n(s)ds+Fi+1,2n(t)dt, (4.18)

    where Fi,2n(t)Γ2n[ti,ti+2n] and Fi+1,2n(t)Γ2n[ti+1,ti+2n+1] are defined in Theorem 4.3, with iZ and nZ+. Then we have

    +i=Mi,2n+1(t)1, t[tj,tj+1).

    Proof. For t[tj,tj+1), there exists

    +i=Mi,2n+1(t)=+i=(tFi,2n(s)ds+Fi,2n(t)dttFi+1,2n(s)ds+Fi+1,2n(t)dt)=ji=j2n(tFi,2n(s)ds+Fi,2n(t)dttFi+1,2n(s)ds+Fi+1,2n(t)dt)=ji=j2n(ttiFi,2n(s)dsti+2ntiFi,2n(t)dttti+1Fi+1,2n(s)dsti+2n+1ti+1Fi+1,2n(t)dt)=ttj2nFj2n,2n(s)dstjtj2nFj2n,2n(t)dtttj+1Fj+1,2n(s)dstj+2n+1tj+1Fj+1,2n(t)dt=tjtj2nFj2n,2n(s)ds+ttjFj2n,2n(s)dstjtj2nFj2n,2n(t)dt0=1+ttjFj2n2n(s)dstjtj2nFj2n2n(t)dt0=1.

    Lemma 4.6. The function Mi,2n+1(t) in Eq (4.18) lies in the space Γ2n+1[ti,ti+2n+1].

    Proof. First, Eq (4.18) indicates that the support interval of the function Mi,2n+1(t) is the union of the interval of Fi,2n(t) and Fi+1,2n(t), denoted as [ti,ti+2n+1).

    Second, since the integral operator increases the continuous order by 1, the continuous order of Mi,2n+1(t) at tj is greater than or equal to

    kji,2n+1=kji,2n+1,iji+2n+1.

    So, it is natural that

    Mi,2n+1(t)Γ2n+1[ti,ti+2n+1].

    According to Theorem 4.4 and Lemma 4.6, the normalized function Mi,2n+1(t) in Eq (4.18) must be equal to the trigonometric B-spline function Ni,2n+1(t) in Eq (2.5) multiplied by a constant. Therefore, the following theorem is established.

    Theorem 4.6. (Integral representation of the normalized trigonometric B-spline basis) Given a knot sequence T={ti}+i= satisfying

    ti<ti+1, 0<ti+2nti<2π and 0ti+2n1ti<π, iZ,nZ+,

    then there holds

    Ki,2n+1(t)=Mi,2n+1(t), t[ti,ti+2n+1),

    where Ki,2n+1(t) and Mi,2n+1(t) are separately defined in Definition 3.1 and Eq (4.18).

    Proof. We will demonstrate that the expression of Mi,2n+1(t), as defined in Eq (4.18), is identical to that of Ki,2n+1(t) defined in Definition 3.1. The notations C(ti+1,ti+2,,ti+2n) in Lemma 4.1 and U(ti,ti+1,,ti+2n) (see [17]) are used in the following proof, where

    U(ti,ti+1,,ti+2n)=|1111costicosti+1costi+2n1costi+2nsintisinti+1sinti+2n1sinti+2ncos2ticos2ti+1cos2ti+2n1cos2ti+2nsin2tisin2ti+1sin2ti+2n1sin2ti+2ncosnticosnti+1cosnti+2n1cosnti+2nsinntisinnti+1sinnti+2n1sinnti+2n|=22n2il<ji+2nsintjtl2. (4.19)

    Based on Definition 2.1, it suffices to prove the explicit expression of the function Mi,2n+1(t) over a non-zero subinterval within its support interval. Therefore, according to Lemmas 3.1, 4.1, and 4.2, and Theorems 4.3 and 4.5, we deduce that

    Mi,2n+1(t)=ttiFi,2n(s)dsti+2ntiFi,2n(t)dt=D(ti+1,ti+2,,ti+2n)(2n1)!!(2n)!!U(ti,ti+1,,ti+2n)sin2n(tti2)=22n2nn!i+1l<ji+2nsintjtl2C(ti+1,ti+2,,ti+2n)(2n1)!!(2n)!!22n2il<ji+2nsintjtl2sin2n(tti2)=C(ti+1,ti+2,,ti+2n)(2n1)!!j=1,2,,2nsinti+jti2sin2n(tti2)=Ci,2n+1j=1,2,,2nsinti+jti2sin2n(tti2), t[ti,ti+1).

    Since

    Ni,2n+1(t)=sin2n(tti2)j=1,2,,2nsinti+jti2, t[ti,ti+1),

    we have

    Mi,2n+1(t)=Ci,2n+1Ni,2n+1(t), t[ti,ti+1),

    consequently

    Mi,2n+1(t)=Ci,2n+1Ni,2n+1(t)=Ki,2n+1(t), t[ti,ti+2n+1).

    In this subsection, we consider multiple knots and assume that the multiplicity of the knot ti in the interval [ti,ti+2n) is ξ, while the multiplicity of the knot ti+2n in the same interval is η. Similarly to the single knot case, there exist the following theorems.

    Theorem 4.7. (The function expression in the space Γ2n[ti,ti+2n] over multiple knots) Let

    Au,v=((cos(t+π2u))|t=tv, (sin(t+π2u))|t=tv, ,nu(cos(nt+π2u))|t=tv, nu(sin(nt+π2u))|t=tv )T,
    Bu,v=((1)u1Au1,v, (1)u2Au2,v, ,(1)1A1,v, (1)0A0,v ),
    Eu,v=(G(u1)v,2n(t), G(u2)v,2n(t), ,Gv,2n(t), Gv,2n(t) ).

    For any function Fi,2n(t)Γ2n[ti,ti+2n], there exists a real number α such that

    Fi,2n(t)=αH(t),t[ti,ti+2n),

    where

    α=(1)η|Bξ,iBmi+ξ,i+ξBmi+ξ+mi+ξ,i+ξ+mi+ξBmi+2nη,i+2nηBη1,i+2n|,

    and

    H(t)=|Eξ,iEmi+ξ,i+ξEmi+ξ+mi+ξ,i+ξ+mi+ξEmi+2nη,i+2nηEη,i+2nBξ,iBmi+ξ,i+ξBmi+ξ+mi+ξ,i+ξ+mi+ξBmi+2nη,i+2nηBη,i+2n|.

    Here the functions Gj,2n(t) for iji+2n are defined in Eq (4.4).

    Proof. To simplify the notation, we define

    φu,v=(sin(ttv)sin2n2(ttv2))(u).

    Thus, we conclude that

    φη1,i+2n=βiφξ1,i+βi+1φξ2,i++βi+ξ1φ0,i+βi+ξφmi+ξ1,i+ξ++βi+ξ+mi+ξ1φ0,i+ξ++βi+2n+1ηmi+2nηφmi+2nη1,i+2nη++βi+2nηφ0,i+2nη+βi+2nη+1φ0,i+2n++βi+2n1φη2,i+2n. (4.20)

    Similar to Theorem 4.3, there exist

    Fi,2n(t)=i+2nηj=iαjGj,2n(t),t[ti,ti+2n)=[ti,ti+2n+1η), (4.21)
    F(d)i,2n(ti+2n)=i+2nηj=iαjG(d)j,2n(ti+2n)=0,t[ti,ti+2n+1η),d=0,1,2,,2n1η. (4.22)

    Additionally, it follows that Eq (4.20) is equivalent to Eq (4.22) when t=ti+2n. Thus, by applying the proof strategy from Theorem 4.3, we derive that

    Fi,2n(t)=(1)η|Eξ,iEmi+ξ,i+ξEmi+ξ+mi+ξ,i+ξ+mi+ξEmi+2nη,i+2nηEη,i+2nBξ,iBmi+ξ,i+ξBmi+ξ+mi+ξ,i+ξ+mi+ξBmi+2nη,i+2nηBη,i+2n||Bξ,iBmi+ξ,i+ξBmi+ξ+mi+ξ,i+ξ+mi+ξBmi+2nη,i+2nηBη1,i+2n|.

    Theorem 4.8. (The normalized function over generalized knots) Suppose that Eq (4.18) still holds, where Fi,2n(t)Γ2n[ti,ti+2n] and Fi+1,2n(t)Γ2n[ti+1,ti+2n+1] are defined in Theorem 4.7, with iZ and nZ+, then

    +i=Mi,2n+1(t)1, t[tj,tj+1).

    In addition, when Fi,2n(t)=0, we set

    t(+Fi,2n(s)ds)1Fi,2n(s)ds={0t<ti,1tti.

    Theorem 4.9. (Integral representation of the normalized trigonometric B-spline basis over generalized knots) Given a knot sequence T={ti}+i= satisfying condition (3.4), then there holds

    Ki,2n+1(t)=Mi,2n+1(t), t[ti,ti+2n+1),

    where Ki,2n+1(t) and Mi,2n+1(t) are separately defined in Definition 3.1 and Theorem 4.8.

    This subsection presents examples of curve modeling to demonstrate that a curve possesses the convex hull property when the knot sequence satisfies condition (3.4).

    Figures 3 and 4 illustrate examples of open and closed curves over different knot sequences, respectively. The red curves correspond to the knot sequences that satisfy condition (3.4) as defined in Definition 3.1, while the orange curves correspond to the knot sequences that satisfy condition (2.1) as defined in Definition 2.1. Additionally, the knot sequences in Figure 3 are T={0,2,3,3,3.5,5.3,6.1,6.6,8.4,9.1,9.5,11.2,12.2,12.6,14.2,15}, and T={0,0.8,3,3,3.5,5.3,6.6,8.6,9.1,9.1,10,12.2,12.2,13,14.2,15}, while those in Figure 4 are T={8,8,8,8,8,7,6.3,5.6,4.9,4.5,1.2,1.2,1.2,0,1.2,1.2, 1.2,4.5,4.9,5.6,6.3,7,8,8,8,8,8}, and T={8,8,8,8,8,7,6.3,5.3,4,3.3,1.2,1.2, 1.2,0,1.2,1.2,1.2,3.3,4,5.3,6.3,7,8,8,8,8,8}. Clearly, if the knot sequence only satisfies condition (2.1), the convex hull property of the curve cannot be guaranteed.

    Figure 3.  Open curve.
    Figure 4.  Closed curve.

    In the Chebyshev system, due to the integral properties of sine and cosine in the trigonometric B-spline basis, the trigonometric B-spline basis cannot be directly derived from lower-order bases through integration, which leads to an unnormal Chebyshev system. This paper successfully derives the integral formula for the normalized odd-order trigonometric B-spline basis by constructing a new set of even-order trigonometric B-spline bases. This integral formula allows for the transition from even-order to odd-order bases but cannot be obtained through stepwise integration, indicating that it is only similar to a segment of the integral formula in the Chebyshev system. Although we are currently unable to provide a direct recursive formula for integrating from lower-order trigonometric spline bases to higher-order ones, we hope to use this as a foundation for further exploration of this issue in future work.

    Mei Li: Investigation, methodology, software, validation, writing—original draft preparation, writing—review and editing; Wanqiang Shen: Conceptualization, methodology, software, writing—original draft preparation, writing—review and editing. All authors have read and approved the final version of the manuscript for publication.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This research is supported in part by the National Natural Science Foundation of China (Grant No. 61772013).

    The authors declare that there are no conflicts of interest regarding the publication of this paper.



    [1] B. Qin, D. Li, Identifying facemask-wearing condition using image super-resolution with classification network to prevent COVID-19, Sensors, 10 (2020), 5236. https://doi.org/10.3390/s20185236 doi: 10.3390/s20185236
    [2] M. S. Ejaz, M. R. Islam, M. Sifatullah, A. Sarker, Implementation of principal component analysis on masked and non-masked face recognition, 2019 1st Int. Conf. Adv. Sci., Eng. Rob. Technol. (ICASERT), 2019, 1–5. https://doi.org/10.1109/ICASERT.2019.8934543 doi: 10.1109/ICASERT.2019.8934543
    [3] M. Jiang, X. Fan, H. Yan, Retinamask: A face mask detector, arXiv, unpublished work.
    [4] J. Hosang, R. Benenson, B. Schiele, Learning non-maximum suppression, 2017 IEEE Conf. Comput. Vision Pattern Recognit. (CVPR), 2017, 4507–4515. https://doi.org/10.1109/CVPR.2017.685 doi: 10.1109/CVPR.2017.685
    [5] S. Woo, J. Park, J. Lee, I. Kweon, Cbam: Convolutional block attention module, Proc. Eur. Conf. Comput. Vision (ECCV), 2018, 3–19.
    [6] Y. Taigman, M. Yang, M. A. Ranzato, L. Wolf, Deepface: Closing the gap to human-level performance in face verification, Proc. IEEE Conf. Comput. Vision Pattern Recognit. (CVPR), 2014, 1701–1708.
    [7] Y. Sun, X. Wang, X. Tang, Deep learning face representation from predicting 10,000 classes, Proc. IEEE Conf. Comput. Vision Pattern Recognit. (CVPR), 2014, 1891–1898.
    [8] D. Nguyen, K. Nguyen, S. Sridharan, D. Dean, C. Fookes, Deep spatio-temporal feature fusion with compact bilinear pooling for multimodal emotion recognition, Comput. Vis. Image Und., 174 (2018), 33–42. https://doi.org/10.1016/j.cviu.2018.06.005 doi: 10.1016/j.cviu.2018.06.005
    [9] J. Deng, J. Guo, N. Xue, S. Zafeiriou, Arcface: Additive angular margin loss for deep face recognition, Proc. IEEE/CVF Conf. Comput. Vision Pattern Recognit. (CVPR), 2019, 4690–4699.
    [10] H. Liu, X. Zhu, Z. Lei, S. Z. Li, Adaptiveface: Adaptive margin and sampling for face recognition, Proc. IEEE/CVF Conf. Comput. Vision Pattern Recognit. (CVPR), 2019, 11947–11956.
    [11] Y. Jiang, W. Li, M. S. Hossain, M. Chen, A. Alelaiwi, M. Al-Hammadi, A snapshot research and implementation of multimodal information fusion for data-driven emotion recognition, Inform. Fusion, 53 (2019), 145–156. https://doi.org/10.1016/j.inffus.2019.06.019 doi: 10.1016/j.inffus.2019.06.019
    [12] Y. Huang, Y. Wang, Y. Tai, X. Liu, P. Shen, S. Li, et al., Curricularface: Adaptive curriculum learning loss for deep face recognition, Proc. IEEE/CVF Conf. Comput. Vision Pattern Recognit. (CVPR), 2020, 5901–5910.
    [13] Z. Boulkenafet, J. Komulainen, A. Hadid, Face anti-spoofing based on color texture analysis, 2015 IEEE Int. Conf. Image Proc. (ICIP), 2015, 2636–2640. https://doi.org/10.1109/ICIP.2015.7351280 doi: 10.1109/ICIP.2015.7351280
    [14] Z. Boulkenafet, J. Komulainen, A. Hadid, Face spoofing detection using colour texture analysis, IEEE T. Inf. Forensics Secur., 11 (2016), 1818–1830. https://doi.org/10.1109/TIFS.2016.2555286 doi: 10.1109/TIFS.2016.2555286
    [15] X. Li, J. Komulainen, G. Zhao, P. C. Yuen, M. Pietikäinen, Generalized face anti-spoofing by detecting pulse from face videos, 2016 23rd Int. Conf. Pattern Recognit. (ICPR), 2016, 4244–4249. https://doi.org/10.1109/ICPR.2016.7900300 doi: 10.1109/ICPR.2016.7900300
    [16] I. Chingovska, N. Erdogmus, A. Anjos, S. Marcel, Face recognition systems under spoofing attacks, In: T. Bourlai, Face recognition across the imaging spectrum, Springer, 2016, 165–194. https://doi.org/10.1007/978-3-319-28501-6_8
    [17] S. Q. Liu, X. Lan, P. C. Yuen, Remote photoplethysmography correspondence feature for 3D mask face presentation attack detection, Proc. Eur. Conf. Comput. Vision (ECCV), 2018,558–573.
    [18] I. Manjani, S. Tariyal, M. Vatsa, R. Singh, A. Majumdar, Detecting silicone mask-based presentation attack via deep dictionary learning, IEEE T. Inf. Forensics Secur., 2017, 1713–1723. https://doi.org/10.1109/TIFS.2017.2676720 doi: 10.1109/TIFS.2017.2676720
    [19] R. Shao, X. Lan, P. C. Yuen, Joint discriminative learning of deep dynamic textures for 3d mask face anti-spoofing, IEEE T. Inf. Forensics Secur., 14 (2018), 923–938. https://doi.org/10.1109/TIFS.2018.2868230 doi: 10.1109/TIFS.2018.2868230
    [20] J. Määttä, A. Hadid, M. Pietikäinen, Face spoofing detection from single images using micro-texture analysis, 2011 Int. Joint Conf. Biometrics (IJCB), 2011, 1–7. https://doi.org/10.1109/IJCB.2011.6117510 doi: 10.1109/IJCB.2011.6117510
    [21] J. Määttä, A. Hadid, M. Pietikäinen, Face spoofing detection from single images using texture and local shape analysis, IET Biom., 1 (2012), 3–10. https://doi.org/10.1049/iet-bmt.2011.0009 doi: 10.1049/iet-bmt.2011.0009
    [22] Y. Atoum, Y. Liu, A. Jourabloo, X. Liu, Face anti-spoofing using patch and depth-based CNNs, 2017 IEEE International Joint Conference on Biom. (IJCB), 2017,319–328. https://doi.org/10.1109/BTAS.2017.8272713 doi: 10.1109/BTAS.2017.8272713
    [23] Y. Liu, A. Jourabloo, X. Liu, Learning deep models for face anti-spoofing: Binary or auxiliary supervision, Proc. IEEE Conf. Comput. Vision Pattern Recognit. (CVPR), 2018,389–398.
    [24] G. Pan, L. Sun, Z. Wu, S. Lao, Eyeblink-based anti-spoofing in face recognition from a generic web camera, 2007 IEEE 11th Int. Conf. Comput. Vision, 2007, 1–8. https://doi.org/10.1109/ICCV.2007.4409068 doi: 10.1109/ICCV.2007.4409068
    [25] A. Zadeh, P. P. Liang, N. Mazumder, S. Poria, E. Cambria, L. P. Morency, Memory fusion network for multi-view sequential learning, Thirty-Second AAAI Conf. Artif. Intell., 32 (2018), 5642–5649.
    [26] T. Baltruaitis, C. Ahuja, L. P. Morency, Multimodal machine learning: A survey and taxonomy, IEEE T. Pattern Anal. Mach. Intell., 41 (2019), 154–163. https://doi.org/10.1109/TPAMI.2018.2798607 doi: 10.1109/TPAMI.2018.2798607
    [27] T. Li, Q. Yang, S. Rong, L. Chen, B. He, Distorted underwater image reconstruction for an autonomous underwater vehicle based on a self-attention generative adversarial network, Appl. Opt., 59 (2020), 10049–10060.
    [28] T. Li, S. Rong, X. Cao, Y. Liu, L. Chen, B. He, Underwater image enhancement framework and its application on an autonomous underwater vehicle platform, Opt. Eng., 59 (2020), 083102. https://doi.org/10.1117/1.OE.59.8.083102 doi: 10.1117/1.OE.59.8.083102
    [29] K. Zhang, Z. Zhang, Z. Li, Y. Qiao, Joint face detection and alignment using multitask cascaded convolutional networks, IEEE Signal Proc. Let., 23 (2016), 1499–1503. https://doi.org/10.1109/LSP.2016.2603342 doi: 10.1109/LSP.2016.2603342
    [30] J. Fu, J. Liu, H. Tian, Y. Li, Y. Bao, Z. Fang, et al., Dual attention network for scene segmentation, Proc. IEEE/CVF Conf. Comput. Vision Pattern Recognit. (CVPR), 2019, 3146–3154.
    [31] W. Sanghyun, H. Soonmin, I. S. Kweon, Stairnet: Top-down semantic aggregation for accurate one-shot detection, 2018 IEEE Winter Conf. Appl. Comput. Vision (WACV), 2018, 1093–1102. https://doi.org/10.1109/WACV.2018.00125 doi: 10.1109/WACV.2018.00125
    [32] T. Ojala, M. Pietikäinen, T. Mäenpää, Gray scale and rotation invariant texture classification with local binary patterns, In: Computer Vision-ECCV 2000, Lecture Notes in Computer Science, Springer, 1842 (2000), 404–420. https://doi.org/10.1007/3-540-45054-8_27
    [33] T. Ojala, M. Pietikainen, T. Maenpaa, Multiresolution gray-scale and rotation invariant texture classification with local binary patterns, IEEE T. Pattern Anal. Mach. Intell., 24 (2002), 971–987. https://doi.org/10.1109/TPAMI.2002.1017623 doi: 10.1109/TPAMI.2002.1017623
    [34] W. S. Noble, What is a support vector machine? Nat. Biotechnol., 24 (2006), 1565–1567. https://doi.org/10.1038/nbt1206-1565 doi: 10.1038/nbt1206-1565
    [35] F. N. Iandola, S. Han, M. W. Moskewicz, K. Ashraf, W. J. Dally, K. Keutzer, SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and < 0.5 MB model size, arXiv, unpublished work.
    [36] F. Chollet, Xception: Deep learning with depthwise separable convolutions, Proc. IEEE Conf. Comput. Vision Pattern Recognit. (CVPR), 2017, 1251–1258.
    [37] M. Sandler, A. Howard, M. Zhu, A. Zhmoginov, L. C. Chen, Mobilenetv2: Inverted residuals and linear bottlenecks, Proc. IEEE Conf. Comput. Vision Pattern Recognit. (CVPR), 2018, 4510–4520.
    [38] A. Howard, M. Sandler, G. Chu, L. C. Chen, B. Chen, M. Tan, et al., Searching for mobilenetv3, Proc. IEEE/CVF Int. Conf. Comput. Vision (ICCV), 2019, 1314–1324.
    [39] N. Ma, X. Zhang, H. Zheng, J. Sun, Shufflenet v2: Practical guidelines for efficient CNN architecture design, Proc. Eur. Conf. Comput. Vision (ECCV), 2018,116–131.
    [40] Z. Zhang, J. Yan, S. Liu, Z. Lei, D. Yi, S. Z. Li, A face antispoofing database with diverse attacks, 2012 5th IAPR Int. Conf. Biom. (ICB), 2012, 26–31. https://doi.org/10.1109/ICB.2012.6199754 doi: 10.1109/ICB.2012.6199754
    [41] A. Costa-Pazo, S. Bhattacharjee, E. Vazquez-Fernandez, Sebastien Marcel, The replay-mobile face presentation-attack database, 2016 Int. Conf. Biom. Spec. Interest Group (BIOSIG), 2016, 1–7. https://doi.org/10.1109/BIOSIG.2016.7736936 doi: 10.1109/BIOSIG.2016.7736936
  • Reader Comments
  • © 2022 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(2515) PDF downloads(89) Cited by(15)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog