IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v34y2024i1ne2228.html
   My bibliography  Save this article

Detection of car parking space by using Hybrid Deep DenseNet Optimization algorithm

Author

Listed:
  • Vankadhara Rajyalakshmi
  • Kuruva Lakshmanna

Abstract

Internet of Things (IoT) and related applications have revolutionized most of our societal activities, enhancing the quality of human life. This study presents an IoT‐based model that enables optimized parking space utilization. The paper implements a Hybrid Deep DenseNet Optimization (HDDNO) algorithm for predicting parking spot availability involving Machine Learning (ML) and deep learning techniques. The HDDNO‐based ML model uses secondary data from the National Research Council Park (CNRPark) in Pisa, Italy. Different regression algorithms are employed to forecast parking lot availability for a given time as part of the prediction process. The DenseNet technique has generated promising results, whereas the HDDNO model yielded better accuracy. The use of five optimizers, namely, Adaptive Moment Estimation (Adam), Root Mean Squared Propagation (RMSprop), Adaptive Gradient (AdaGrad), AdaDelta, and Stochastic Gradient Descent (SGD), have played significant roles in minimizing the loss of the model. The part of Adam has enabled the HDDNO model to generate predictions with high accuracy 99.19% and low loss 0.0306%. This proposed methodology would significantly improve environmental safety and act as an initiative toward developing smart cities.

Suggested Citation

  • Vankadhara Rajyalakshmi & Kuruva Lakshmanna, 2024. "Detection of car parking space by using Hybrid Deep DenseNet Optimization algorithm," International Journal of Network Management, John Wiley & Sons, vol. 34(1), January.
  • Handle: RePEc:wly:intnem:v:34:y:2024:i:1:n:e2228
    DOI: 10.1002/nem.2228
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2228
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2228?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:34:y:2024:i:1:n:e2228. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.