Loading [MathJax]/jax/output/SVG/jax.js
Research article

Spotted hyena optimizer with deep learning enabled vehicle counting and classification model for intelligent transportation systems


  • Received: 02 January 2023 Revised: 09 March 2023 Accepted: 10 March 2023 Published: 26 April 2023
  • Traffic surveillance systems are utilized to collect and monitor the traffic condition data of the road networks. This data plays a crucial role in a variety of applications of the Intelligent Transportation Systems (ITSs). In traffic surveillance, it is challenging to achieve accurate vehicle detection and count the vehicles from traffic videos. The most notable difficulties include real-time system operations for precise classification, identification of the vehicles' location in traffic flows and functioning around total occlusions that hamper the vehicle tracking process. Conventional video-related vehicle detection techniques such as optical flow, background subtraction and frame difference have certain limitations in terms of efficiency or accuracy. Therefore, the current study proposes to design the spotted hyena optimizer with deep learning-enabled vehicle counting and classification (SHODL-VCC) model for the ITSs. The aim of the proposed SHODL-VCC technique lies in accurate counting and classification of the vehicles in traffic surveillance. To achieve this, the proposed SHODL-VCC technique follows a two-stage process that includes vehicle detection and vehicle classification. Primarily, the presented SHODL-VCC technique employs the RetinaNet object detector to identify the vehicles. Next, the detected vehicles are classified into different class labels using the deep wavelet auto-encoder model. To enhance the vehicle detection performance, the spotted hyena optimizer algorithm is exploited as a hyperparameter optimizer, which considerably enhances the vehicle detection rate. The proposed SHODL-VCC technique was experimentally validated using different databases. The comparative outcomes demonstrate the promising vehicle classification performance of the SHODL-VCC technique in comparison with recent deep learning approaches.

    Citation: Manal Abdullah Alohali, Mashael Maashi, Raji Faqih, Hany Mahgoub, Abdullah Mohamed, Mohammed Assiri, Suhanda Drar. Spotted hyena optimizer with deep learning enabled vehicle counting and classification model for intelligent transportation systems[J]. Electronic Research Archive, 2023, 31(7): 3704-3721. doi: 10.3934/era.2023188

    Related Papers:

    [1] Xiaoming Su, Jiahui Wang, Adiya Bao . Stability analysis and chaos control in a discrete predator-prey system with Allee effect, fear effect, and refuge. AIMS Mathematics, 2024, 9(5): 13462-13491. doi: 10.3934/math.2024656
    [2] Kottakkaran Sooppy Nisar, G Ranjith Kumar, K Ramesh . The study on the complex nature of a predator-prey model with fractional-order derivatives incorporating refuge and nonlinear prey harvesting. AIMS Mathematics, 2024, 9(5): 13492-13507. doi: 10.3934/math.2024657
    [3] Nehad Ali Shah, Iftikhar Ahmed, Kanayo K. Asogwa, Azhar Ali Zafar, Wajaree Weera, Ali Akgül . Numerical study of a nonlinear fractional chaotic Chua's circuit. AIMS Mathematics, 2023, 8(1): 1636-1655. doi: 10.3934/math.2023083
    [4] A. Q. Khan, Ibraheem M. Alsulami . Complicate dynamical analysis of a discrete predator-prey model with a prey refuge. AIMS Mathematics, 2023, 8(7): 15035-15057. doi: 10.3934/math.2023768
    [5] Xiao-Long Gao, Hao-Lu Zhang, Xiao-Yu Li . Research on pattern dynamics of a class of predator-prey model with interval biological coefficients for capture. AIMS Mathematics, 2024, 9(7): 18506-18527. doi: 10.3934/math.2024901
    [6] Weili Kong, Yuanfu Shao . The effects of fear and delay on a predator-prey model with Crowley-Martin functional response and stage structure for predator. AIMS Mathematics, 2023, 8(12): 29260-29289. doi: 10.3934/math.20231498
    [7] Asharani J. Rangappa, Chandrali Baishya, Reny George, Sina Etemad, Zaher Mundher Yaseen . On the existence, stability and chaos analysis of a novel 4D atmospheric dynamical system in the context of the Caputo fractional derivatives. AIMS Mathematics, 2024, 9(10): 28560-28588. doi: 10.3934/math.20241386
    [8] 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
    [9] Guilin Tang, Ning Li . Chaotic behavior and controlling chaos in a fast-slow plankton-fish model. AIMS Mathematics, 2024, 9(6): 14376-14404. doi: 10.3934/math.2024699
    [10] Xuyang Cao, Qinglong Wang, Jie Liu . Hopf bifurcation in a predator-prey model under fuzzy parameters involving prey refuge and fear effects. AIMS Mathematics, 2024, 9(9): 23945-23970. doi: 10.3934/math.20241164
  • Traffic surveillance systems are utilized to collect and monitor the traffic condition data of the road networks. This data plays a crucial role in a variety of applications of the Intelligent Transportation Systems (ITSs). In traffic surveillance, it is challenging to achieve accurate vehicle detection and count the vehicles from traffic videos. The most notable difficulties include real-time system operations for precise classification, identification of the vehicles' location in traffic flows and functioning around total occlusions that hamper the vehicle tracking process. Conventional video-related vehicle detection techniques such as optical flow, background subtraction and frame difference have certain limitations in terms of efficiency or accuracy. Therefore, the current study proposes to design the spotted hyena optimizer with deep learning-enabled vehicle counting and classification (SHODL-VCC) model for the ITSs. The aim of the proposed SHODL-VCC technique lies in accurate counting and classification of the vehicles in traffic surveillance. To achieve this, the proposed SHODL-VCC technique follows a two-stage process that includes vehicle detection and vehicle classification. Primarily, the presented SHODL-VCC technique employs the RetinaNet object detector to identify the vehicles. Next, the detected vehicles are classified into different class labels using the deep wavelet auto-encoder model. To enhance the vehicle detection performance, the spotted hyena optimizer algorithm is exploited as a hyperparameter optimizer, which considerably enhances the vehicle detection rate. The proposed SHODL-VCC technique was experimentally validated using different databases. The comparative outcomes demonstrate the promising vehicle classification performance of the SHODL-VCC technique in comparison with recent deep learning approaches.



    Throughout the paper, we work over an algebraically closed field k of characteristic zero. Let C be a nonsingular projective curve of genus g0, and L be a very ample line bundle on C. The complete linear system |L| embeds C into a projective space Pr:=P(H0(C,L)). For an integer k0, the k-th secant variety

    Σk=Σk(C,L)Pr

    of C in Pr is the Zariski closure of the union of (k+1)-secant k-planes to C.

    Assume that degL2g+2k+1. Then the k-th secant variety Σk can be defined by using the secant sheaf Ek+1,L and the secant bundle Bk(L) as follows. Denote by Cm the m-th symmetric product of C. Let

    σk+1:Ck×CCk+1

    be the morphism sending (ξ,x) to ξ+x, and p:Ck×CC the projection to C. The secant sheaf Ek+1,L on Ck+1 associated to L is defined by

    Ek+1,L:=σk+1,pL,

    which is a locally free sheaf of rank k+1. Notice that the fiber of Ek+1,L over ξCk+1 can be identified with H0(ξ,L|ξ). The secant bundle of k-planes over Ck+1 is

    Bk(L):=P(Ek+1,L)

    equipped with the natural projection πk:Bk(L)Ck+1. We say that a line bundle L on a variety X separates m+1 points if the natural restriction map H0(X,L)H0(ξ,L|ξ) is surjective for any effective zero-cycle ξX with length(ξ)=m+1. Notice that a line bundle L is globally generated if and only if L separates 1 point, and L is very ample if and only if L separates 2 points. Since degL2g+k, it follows from Riemann–Roch that L separates k+1 points. Then the tautological bundle OBk(L)(1) is globally generated. We have natural identifications

    H0(Bk(L),OBk(L)(1))=H0(Ck+1,Ek+1,)=H0(C,L),

    and therefore, the complete linear system |OBk(L)(1)| induces a morphism

    βk:Bk(L)Pr=P(H0(C,L)).

    The k-th secant variety Σk=Σk(C,L) of C in Pr can be defined to be the image βk(Bk(L)). Bertram proved that βk:Bk(L)Σk is a resolution of singularities (see [1,Section 1]).

    It is clear that there are natural inclusions

    C=Σ0Σ1Σk1ΣkPr.

    The preimage of Σk1 under the morphism βk is actually a divisor on Bk(L). Thus there exits a natural morphism from Bk(L) to the blowup of Σk along Σk1. Vermeire proved that B1(L) is indeed the blowup of Σ1 along Σ0=C ([3,Theorem 3.9]). In the recent work [2], we showed that Bk(L) is the normalization of the blowup of Σk along Σk1 ([2,Proposition 5.13]), and raised the problem asking whether Bk(L) is indeed the blowup itself ([2,Problem 6.1]). The purpose of this paper is to give an affirmative answer to this problem by proving the following:

    Theorem 1.1. Let C be a nonsingular projective curve of genus g, and L be a line bundle on C. If degL2g+2k+1 for an integer k1, then the morphism βk:Bk(L)Σk(C,L) is the blowup of Σk(C,L) along Σk1(C,L).

    To prove the theorem, we utilize several line bundles defined on symmetric products of the curve. Let us recall the definitions here and refer the reader to [2] for further details. Let

    Ck+1=C××Ck+1times

    be the (k+1)-fold ordinary product of the curve C, and pi:Ck+1C be the projection to the i-th component. The symmetric group Sk+1 acts on p1Lpk+1L in a natural way: a permutation μSk sends a local section s1sk+1 to sμ(1)sμ(k+1). Then p1Lpk+1L is invariant under the action of Sk+1, so it descends to a line bundle Tk+1(L) on the symmetric product Ck+1 via the quotient map q:Ck+1Ck+1. We have qTk+1(L)=p1Lpk+1L. Define a divisor δk+1 on Ck+1 such that the associated line bundle OCk+1(δk+1)=det(σk+1,(OCk×C)). Let

    Ak+1,L:=Tk+1(L)(2δk+1)

    be a line bundle on Ck+1. When k=0, we use the convention that T1(L)=E1,L=L and δ1=0.

    The main ingredient in the proof of Theorem 1.1 is to study the positivity of the line bundle Ak+1,L. Some partial results and their geometric consequences have been discussed in [2,Lemma 5.12 and Proposition 5.13]. Along this direction, we establish the following proposition to give a full picture in a general result describing the positivity of the line bundle Ak+1,L. This may be of independent interest.

    Proposition 1.2. Let C be a nonsingular projective curve of genus g, and L be a line bundle on C. If degL2g+2k+ for integers k,0, then the line bundle Ak+1,L on Ck+1 separates +1 points.

    In particular, if degL2g+2k, then Ak+1,L is globally generated, and if degL2g+2k+1, then Ak+1,L is very ample.

    In this section, we prove Theorem 1.1. We begin with showing Proposition 1.2.

    Proof of Proposition 1.2. We proceed by induction on k and . If k=0, then A1,L=L and degL2g+. It immediately follows from Riemann–Roch that L separates +1 points. If =0, then degL2g+2k. By [2,Lemma 5.12], Ak+1,L separates 1 point.

    Assume that k1 and 1. Let z be a length +1 zero-dimensional subscheme of Ck+1. We aim to show that the natural restriction map

    rz,k+1,L:H0(Ck+1,Ak+1,L)H0(z,Ak+1,L|z)

    is surjective. We can choose a point pC such that Xp contains a point in the support of z, where Xp is the divisor on Ck+1 defined by the image of the morphism CkCk+1 sending ξ to ξ+p. Let y:=zXp be the scheme-theoretic intersection, and Ix:=(Iz:IXp), which defines a subscheme x of z in Ck+1, where Iz and IXp are ideal sheaves of z and Xp in Ck+1, respectively. We have the following commutative diagram

    rz,k+1,L:H0(Ck+1,Ak+1,L)H0(z,Ak+1,L|z)

    where all rows and columns are short exact sequences. By tensoring with Ak+1,L and taking the global sections of last two rows, we obtain the commutative diagram with exact sequences

    rz,k+1,L:H0(Ck+1,Ak+1,L)H0(z,Ak+1,L|z)

    in which we use the fact that H1(Ak+1,L(Xp))=0 (see the proof of [2,Lemma 5.12]). Note that Ak+1,L(Xp)=Ak+1,L(p) and Ak+1,L|XpAk,L(2p), where we identify Xp=Ck.

    Since length(y)length(z)=+1 and degL(2p)2g+2(k1)+, the induction hypothesis on k implies that ry,k,L(2p) is surjective. On the other hand, if x=, which means that z is a subscheme of Xp, then trivially rx,k+1,L(p) is surjective. Otherwise, suppose that x. By the choice of Xp, we know that y is not empty, and therefore, we have length(x)length(z)1=. Now, degL(p)2g+2k+(1), so the induction hypothesis on implies that L(p) separates points. In particular, rx,k+1,L(p) is surjective. Hence rz,k+1,L is surjective as desired.

    Lemma 2.1. Let φ:XY be a finite surjective morphism between two varieties. If φ1(q) is scheme theoretically a reduced point for each closed point qY, then φ is an isomorphism.

    Proof. Note that φ is proper, injective, and unramifield. Then it is indeed a classical result that φ is an isomorphism. Here we give a short proof for reader's convenience. The problem is local. We may assume that X=SpecB and Y=SpecA for some rings A,B. We may regard A as a subring of B. For any qY, let p:=φ1(q)X. It is enough to show that the localizations A:=Amq and B:=Bmp are isomorphic. Let mq,mp be the maximal ideals of the local rings A,B, respectively. The assumption says that mqB=mp. We have

    B/AAA/mq=B/(mqB+A)=B/(mp+A)=0.

    By Nakayama lemma, we obtain B/A=0.

    We keep using the notations used in the introduction. Recall that C is a nonsingular projective curve of genus g0, and L is a very ample line bundle on C. Consider ξkCk and xC, and let ξ:=ξk+xCk+1. The divisor ξk spans a k-secant (k1)-plane P(H0(ξk,L|ξk)) to C in P(H0(C,L)), and it is naturally embedded in the (k+1)-secant k-plane P(H0(ξ,L|ξ)) spanned by ξ. This observation naturally induces a morphism

    αk,1:Bk1(L)×CBk(L).

    To see it in details, we refer to [1,p.432,line –5]. We define the relative secant variety Z=Zk1 of (k1)-planes in Bk(L) to be the image of the morphism αk,1. The relative secant variety Z is a divisor in the secant bundle Bk(L), and it is the preimage of (k1)-th secant variety Σk1 under the morphism βk. It plays the role of transferring the codimension two situation (Σk,Σk1) into the codimension one situation (Bk(L),Z). We collect several properties of Z.

    Proposition 2.2. ([2,Proposition 3.15,Theorem 5.2,and Proposition 5.13]) Recall the situation described in the diagram

    αk,1:Bk1(L)×CBk(L).

    Let H be the pull back of a hyperplane divisor of Pr by βk, and let IΣk1|Σk be the ideal sheaf on Σk defining the subvariety Σk1. Then one has

    1. OBk(L)((k+1)HZ)=πkAk+1,L.

    2. Riβk,OBk(L)(Z)={IΣk1|Σkifi=00ifi>0.

    3. IΣk1|ΣkOBk(L)=OBk(L)(Z).

    As a direct consequence of the above proposition, we have an identification

    H0(Ck+1,Ak+1,L)=H0(Σk,IΣk1|Σk(k+1)).

    We are now ready to give the proof of Theorem 1.1.

    Proof of Theorem 1.1. Let

    b:˜Σk:=BlΣk1ΣkΣk

    be the blowup of Σk along Σk1 with exceptional divisor E. As IΣk1|ΣkOBk(L)=OBk(L)(Z) (see Proposition 2.2), there exists a morphism α from Bk(L) to the blowup ˜Σk fitting into the following commutative diagram

    b:˜Σk:=BlΣk1ΣkΣk

    We shall show that α is an isomorphism.

    Write V:=H0(Σk,IΣk1|Σk(k+1)). As proved in [2,Theorem 5.2], IΣk1|Σk(k+1) is globally generated by V. This particularly implies that on the blowup ˜Σk one has a surjective morphism VO˜ΣkbOΣk(k+1)(E), which induces a morphism

    γ:˜ΣkP(V).

    On the other hand, one has an identification V=H0(Ck+1,Ak+1,L) by Proposition 2.2. Recall from Proposition 1.2 that Ak+1,L is very ample. So the complete linear system |V|=|Ak+1,L| on Ck+1 induces an embedding

    ψ:Ck+1P(V).

    Also note that α(bOΣk(k+1)(E))=βkOΣk(k+1)(Z)=πkAk+1,L by Proposition 2.2. Hence we obtain the following commutative diagram

    ψ:Ck+1P(V).

    Take an arbitrary closed point x˜Σk, and consider its image x:=b(x) on Σk. There is a nonnegative integer mk such that xΣmΣm1Σk. In addition, the point x uniquely determines a degree m+1 divisor ξm+1,x on C in such a way that ξm+1,x=ΛC, where Λ is a unique (m+1)-secant m-plane to C with xΛ (see [2,Definition 3.12]). By [2,Proposition 3.13], β1k(x)Ckm and πk(β1k(x))=ξm+1,x+CkmCk+1. Consider also x:=γ(x) which lies in the image of ψ. As ψ is an embedding, we may think x as a point of Ck+1. Now, through forming fiber products, we see scheme-theoretically

    α1(x)π1k(x)β1k(x).

    However, the restriction of the morphism πk on β1k(x) gives an embedding of Ckm into Ck+1. This suggests that π1k(x)β1k(x) is indeed a single reduced point, and so is α1(x). Finally by Lemma 2.1, α is an isomorphism as desired.



    [1] V. Kocur, M. Ftacnik, Multi-class multi-movement vehicle counting based on CenterTrack, in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2021, 4009–4015.
    [2] J. Mirthubashini, V. Santhi, Video based vehicle counting using deep learning algorithms, in 2020 6th International Conference on Advanced Computing and Communication Systems (ICACCS), IEEE, (2020), 142–147.
    [3] C. J. Lin, S. Y. Jeng, H. W. Lioa, A real-time vehicle counting, speed estimation, and classification system based on virtual detection zone and YOLO, Math. Probl. Eng., 2021 (2021), 1–10. https://doi.org/10.1155/2021/1577614 doi: 10.1155/2021/1577614
    [4] A. Glowacz, Thermographic fault diagnosis of shaft of BLDC motor, Sensors, 22 (2022), 8537. https://doi.org/10.3390/s22218537 doi: 10.3390/s22218537
    [5] H. Xu, Z. Cai, R. Li, W. Li, Efficient citycam-to-edge cooperative learning for vehicle counting in ITS, IEEE Trans. Intell. Transp. Syst., 23 (2022), 16600–16611. https://doi.org/10.1109/TITS.2022.3149657 doi: 10.1109/TITS.2022.3149657
    [6] Y. Y. Tseng, T. C. Hsu, Y. F. Wu, J. J. Chen, Y. C. Tseng, Efficient vehicle counting based on time-spatial images by neural networks, in 2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems (MASS), IEEE, (2021), 383–391. https://doi.org/10.1109/MASS52906.2021.00055
    [7] M. Haris, A. Glowacz, Lane line detection based on object feature distillation, Electronics, 10 (2021), 1102. https://doi.org/10.3390/electronics10091102 doi: 10.3390/electronics10091102
    [8] Z. Xie, R. Rajamani, Vehicle counting and maneuver classification with support vector machines using low-density flash lidar, IEEE Trans. Veh. Technol., 71 (2021), 86–97. https://doi.org/10.1109/TVT.2021.3125919 doi: 10.1109/TVT.2021.3125919
    [9] A. Glowacz, Ventilation diagnosis of angle grinder using thermal imaging, Sensors, 21 (2021), 2853. https://doi.org/10.3390/s21082853 doi: 10.3390/s21082853
    [10] C. Liu, D. Q. Huynh, Y. Sun, M. Reynolds, S. Atkinson, A vision-based pipeline for vehicle counting, speed estimation, and classification, IEEE Trans. Intell. Transp. Syst., 22 (2020), 7547–7560. https://doi.org/10.1109/TITS.2020.3004066
    [11] A. M. Santos, C. J. Bastos-Filho, A. Maciel, Counting vehicle by axes with high-precision in brazilian roads with deep learning methods, in International Conference on Intelligent Systems Design and Applications, Springer, Cham, 418 (2021), 188–198. https://doi.org/10.1007/978-3-030-96308-8_17
    [12] A. Glowacz, Thermographic fault diagnosis of ventilation in BLDC motors, Sensors, 21 (2021), 7245. https://doi.org/10.3390/s21217245 doi: 10.3390/s21217245
    [13] O. E. A. Agudelo, C. E. M. Marín, R. G. Crespo, Sound measurement and automatic vehicle classification and counting applied to road traffic noise characterization, Soft Comput., 25 (2021), 12075–12087. https://doi.org/10.1007/s00500-021-05766-6 doi: 10.1007/s00500-021-05766-6
    [14] A. Alsanabani, A. Ahmed, A. M. Al Smadi, Vehicle counting using detecting-tracking combinations: A comparative analysis, in 2020 The 4th International Conference on Video and Image Processing, (2020), 48–54. https://doi.org/10.1145/3447450.3447458
    [15] H. Lin, Z. Yuan, B. He, X. Kuai, X. Li, R. Guo, A deep learning framework for video-based vehicle counting, Front. Phys., 10 (2022), 32. https://doi.org/10.3389/fphy.2022.829734 doi: 10.3389/fphy.2022.829734
    [16] M. Fachrie, A simple vehicle counting system using deep learning with YOLOv3 model, Jurnal RESTI (Rekayasa Sistem Dan Teknologi Informasi), 4 (2020), 462–468. https://doi.org/10.29207/resti.v4i3.1871 doi: 10.29207/resti.v4i3.1871
    [17] K. Yin, L. Wang, J. Zhang, ST-CSNN: a novel method for vehicle counting, Mach. Vision Appl., 32 (2021), 1–13. https://doi.org/10.1007/s00138-021-01233-2 doi: 10.1007/s00138-021-01233-2
    [18] Y. Youssef, M. Elshenawy, Automatic vehicle counting and tracking in aerial video feeds using cascade region-based convolutional neural networks and feature pyramid networks, Trans. Res. Rec., 2675 (2021), 304–317. https://doi.org/10.1177/0361198121997833 doi: 10.1177/0361198121997833
    [19] J. Navarro, D. S. Benítez, N. Pérez, D. Riofrío, R. F. Moyano, Towards a low-cost embedded vehicle counting system based on deep-learning for traffic management applications, in 2021 IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON), 2021, 1–6. https://doi.org/10.1109/CHILECON54041.2021.9702914
    [20] S. Djukanović, Y. Patel, J. Matas, T. Virtanen, Neural network-based acoustic vehicle counting, in 2021 29th European Signal Processing Conference (EUSIPCO), 2021,561–565. https://doi.org/10.23919/EUSIPCO54536.2021.9615925
    [21] Z. Al-Ariny, M. A. Abdelwahab, M. Fakhry, E. S. Hasaneen, An efficient vehicle counting method using mask r-cnn, in 2020 International Conference on Innovative Trends in Communication and Computer Engineering (ITCE), 2020,232–237. https://doi.org/10.1109/ITCE48509.2020.9047800
    [22] J. Liu, R. Jia, W. Li, F. Ma, H. M. Abdullah, H. Ma, et al., High precision detection algorithm based on improved RetinaNet for defect recognition of transmission lines, Energy Rep., 6 (2020), 2430–2440. https://doi.org/10.1016/j.egyr.2020.09.002 doi: 10.1016/j.egyr.2020.09.002
    [23] M. Ahmad, M. Abdullah, D. Han, Small object detection in aerial imagery using RetinaNet with anchor optimization, in 2020 International Conference on Electronics, Information, and Communication (ICEIC), 2020, 1–3. https://doi.org/10.1109/ICEIC49074.2020.9051269
    [24] G. Dhiman, V. Kumar, Spotted hyena optimizer: A novel bio-inspired based metaheuristic technique for engineering applications, Adv. Eng. Softw., 114 (2017), 48–70. https://doi.org/10.1016/j.advengsoft.2017.05.014 doi: 10.1016/j.advengsoft.2017.05.014
    [25] A. Saha, P. Dash, N. R. Babu, T. Chiranjeevi, M. Dhananjaya, L. Knypiński, Dynamic stability evaluation of an integrated biodiesel-geothermal power plant-based power system with spotted hyena optimized cascade controller, Sustainability, 14 (2022), 14842. https://doi.org/10.3390/su142214842 doi: 10.3390/su142214842
    [26] M. Gafar, R. A. El-Sehiemy, H. M. Hasanien, A. Abaza, Optimal parameter estimation of three solar cell models using modified spotted hyena optimization, J. Ambient Intell. Human. Comput., 2022 (2022), 1–12. https://doi.org/10.1007/s12652-022-03896-9 doi: 10.1007/s12652-022-03896-9
    [27] H. D. Shao, H. K. Jiang, X. Q. Li, S. P. Wu, Intelligent fault diagnosis of rolling bearing using deep wavelet auto-encoder with extreme learning machine, Knowl. Based Syst., 140 (2018), 1–14. https://doi.org/10.1016/j.knosys.2017.10.024 doi: 10.1016/j.knosys.2017.10.024
    [28] I. Abd El Kader, G. Xu, Z. Shuai, S. Saminu, I. Javaid, I. S. Ahmad, et al., Brain tumor detection and classification on MR images by a deep wavelet auto-encoder model, Diagnostics, 11 (2021), 1589. https://doi.org/10.3390/diagnostics11091589 doi: 10.3390/diagnostics11091589
    [29] H. D. Shao, H. K. Jiang, K. Zhao, D. D. Wei, Dongdong, X. Q. Li, A novel tracking deep wavelet auto-encoder method for intelligent fault diagnosis of electric locomotive bearings, Mech. Syst. Signal Process., 110 (2018), 193–209. https://doi.org/10.1016/j.ymssp.2018.03.011 doi: 10.1016/j.ymssp.2018.03.011
    [30] H. Song, H. Liang, H. Li, Z. Dai, X. Yun, Vision-based vehicle detection and counting system using deep learning in highway scenes, Eur. Transp. Res. Rev., 11 (2019), 1–16. https://doi.org/10.1186/s12544-019-0390-4 doi: 10.1186/s12544-019-0390-4
  • Reader Comments
  • © 2023 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(1931) PDF downloads(107) Cited by(1)

Figures and Tables

Figures(13)  /  Tables(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog