<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">69681</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2025.069681</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Displacement Feature Mapping for Vehicle License Plate Recognition Influenced by Haze Weather</article-title>
<alt-title alt-title-type="left-running-head">Displacement Feature Mapping for Vehicle License Plate Recognition Influenced by Haze Weather</alt-title>
<alt-title alt-title-type="right-running-head">Displacement Feature Mapping for Vehicle License Plate Recognition Influenced by Haze Weather</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Albekairi</surname><given-names>Mohammed</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Khdhir</surname><given-names>Radhia</given-names></name><xref ref-type="aff" rid="aff-2">2</xref><email>rkboujelben@ju.edu.sa</email></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Magdich</surname><given-names>Amina</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Asklany</surname><given-names>Somia</given-names></name><xref ref-type="aff" rid="aff-4">4</xref><email>Somia.Asklany@nbu.edu.sa</email></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Abbas</surname><given-names>Ghulam</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Yousef </surname><given-names>Amr</given-names></name><xref ref-type="aff" rid="aff-6">6</xref><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Electrical Engineering, College of Engineering, Jouf University</institution>, <addr-line>Sakakah, 72388</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>College of Computer and Information Sciences, Jouf University</institution>, <addr-line>Sakakah, 72388</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Computer sciences, Applied College, Princess Nourah bint Abdulrahman University, P.O. Box 84428</institution>, <addr-line>Riyadh, 11671</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Computers and Information Technologies, College of Sciences and Arts Turaif, Northern Border University</institution>, <addr-line>Arar, 91431</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-5"><label>5</label><institution>School of Electrical Engineering, Southeast University</institution>, <addr-line>Nanjing, 210096</addr-line>, <country>China</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Electrical Engineering, University of Business and Technology</institution>, <addr-line>Jeddah, 21448</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-7"><label>7</label><institution>Engineering Mathematics Department, Alexandria University, Lotfy El-Sied st. off Gamal Abd El-Naser</institution>, <addr-line>Alexandria, 11432</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Radhia Khdhir. Email: rkboujelben@ju.edu.sa; Somia Asklany. Email: <email>somia.asklany@nbu.edu.sa</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>30</day><month>09</month><year>2025</year>
</pub-date>
<volume>144</volume>
<issue>3</issue>
<fpage>3607</fpage>
<lpage>3644</lpage>
<history>
<date date-type="received">
<day>28</day>
<month>6</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>20</day>
<month>8</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_69681.pdf"></self-uri>
<abstract>
<p>License plate recognition in haze-affected images is challenging due to feature distortions such as blurring and elongation, which lead to pixel displacements. This article introduces a Displacement Region Recognition Method (DR2M) to address such a problem. This method operates on displaced features compared to the training input observed throughout definite time frames. The technique focuses on detecting features that remain relatively stable under haze, using a frame-based analysis to isolate edges minimally affected by visual noise. The edge detection failures are identified using a bilateral neural network through displaced feature training. The training converges bilaterally towards the minimum edges from the maximum region. Thus, the training input and detected edges are used to identify the displacement between observed image frames to extract and differentiate the license plate region from the other vehicle regions. The proposed method maps the similarity feature between the detected and identified vehicle regions. This aids in leveraging the plate recognition precision with a high F1 score. Thus, this technique achieves a 10.27% improvement in identification precision, a 10.57% increase in F1 score, and a 9.73% reduction in false positive rate compared to baseline methods under maximum displacement conditions caused by haze. The technique attains an identification precision of 95.68%, an F1 score of 94.68%, and a false positive rate of 4.32%, indicating robust performance under haze-affected settings.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Neural network</kwd>
<kwd>machine learning</kwd>
<kwd>edge detection</kwd>
<kwd>feature displacement</kwd>
<kwd>haze weather</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Nourah bint Abdulrahman University</funding-source>
<award-id>PNURSP2025R848</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Scientific Research at Northern Border University</funding-source>
<award-id>NBU-FFR-2025-2932-09</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<sec id="s1_1">
<label>1.1</label>
<title>Background</title>
<p>License plate detection in haze weather is a challenging task to perform in transportation systems. To overcome the complexity range, the automatic license plate detection (ALPD) model is used [<xref ref-type="bibr" rid="ref-1">1</xref>]. The ALPD model collects hazardous images captured by smart devices on the road. The model produces real driving vehicle plates in foggy or hazy weather conditions [<xref ref-type="bibr" rid="ref-2">2</xref>]. The ALPD model analyzes the image&#x2019;s background, eliminating foggy content and features to detect the number of plates accurately. It also tilted the plates to reduce the foggy weather effects from the images. The ALPD model maximizes the precision in the detection process [<xref ref-type="bibr" rid="ref-3">3</xref>,<xref ref-type="bibr" rid="ref-4">4</xref>]. A License Plate Recognition (LPR) method is used in fog and haze environments. The LPR method estimates the atmospheric lights and surrounding effects of the hazed and blurred images [<xref ref-type="bibr" rid="ref-5">5</xref>]. The estimating process de-hazes the features and patterns of the images for detection. The LPR method detects the exact character and features of the number plates. It enhances the performance level in the license plate recognition process [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>Feature extraction and analysis methods are used for license plate detection in haze weather. It is used to ease the detection process by reducing the energy computation in further processes [<xref ref-type="bibr" rid="ref-7">7</xref>]. A feature extraction technique extracts the optimal features from the given video footage and improves vehicle detection. It addresses issues like background detection-subtraction and cast shadow removal. The extraction technique analyzes the vehicle images and produces data for the specific detection process like plates [<xref ref-type="bibr" rid="ref-8">8</xref>]. The extraction technique optimizes the issues that cause latency in detecting license plates. It is also used to process the data and remove the fogged edges of the images [<xref ref-type="bibr" rid="ref-9">9</xref>]. A feature analysis approach is also used for license plate detection in haze weather. The analysis approach recognises the license plate in complex haze conditions [<xref ref-type="bibr" rid="ref-10">10</xref>]. The approach analyzes the colour, edge, corner, and information presented in the fogged images. The image produces relevant data, which minimizes the computational cost of detection. Both horizontal and vertical histograms are used in the approach to remove the unnecessary edges in the images. The analysis approach enlarges the effectiveness level of the detection systems [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>].</p>
<p>Machine learning (ML) algorithms are used for license plate detection in haze weather. The ML methods are used here to improve the precision of the plate detection process [<xref ref-type="bibr" rid="ref-13">13</xref>]. A generative adversarial network model developed for improving picture quality under difficult settings is known as the Multi-Phase Generative Adversarial Network (MPGAN). Its primary goal is to improve object identification and recognition, such as license plate recognition. This includes repairing damaged photos caused by haze and other visual degradations. The method also uses a visual processing algorithm to improve the quality of the haze pictures and images [<xref ref-type="bibr" rid="ref-14">14</xref>]. The MPGAN is used here to dehaze the images as needed. The algorithm locates the license plate&#x2019;s exact location and produces the vehicles&#x2019; features in haze weather conditions [<xref ref-type="bibr" rid="ref-15">15</xref>,<xref ref-type="bibr" rid="ref-16">16</xref>]. The MPGAN algorithm increases the accuracy and feasibility ratio of the license plate detection. A deep learning (DL) algorithm-based detection method is also used in detection systems [<xref ref-type="bibr" rid="ref-17">17</xref>]. Deep Learning uses complex neural network topologies to learn characteristics from raw input, such as photos, automatically. These algorithms can decipher intricate visual patterns, allowing for accurate identification and classification tasks, such as separating license plate areas from backgrounds with little human intervention. The DL algorithm uses a descriptor classifier to classify the exact features extracted from the images. The DL algorithm detects the license plates with minimized requirements, enhancing the system&#x2019;s quality range [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>The above abstract, which encompasses the components and functions, is graphically exhibited in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> illustrates the Displacement Region Recognition Method (DR2M) feature extraction. These versions detect missing license plate characteristics, especially in low light. An accurate detection process relies on size and color. Before anything else, snap images in dim light to see license plates better. Photography will be crisper after dehazing to reduce noise and boost contrast. In addition to size, colour intensity and license plate isolation are crucial visual aspects. Fill a bidirectional neural network with these variables and use displacement mapping to smooth road bumps. Maximum region extraction layers capture the full license plate area, while minimum region extraction layers concentrate on finer details like character edges and boundary lines essential for precise detection. Two tiers make up this network design. The network calculates displacement using hazy equations by analysing area and edge properties over several frames. Hazy equations in the DR2M model, both region-level and edge-level feature displacement under haze, using maximization for structural stability and minimization for detail preservation. To increase feature identification, convergence estimation refines bidirectional neural network feature mappings to convergence. Convergence estimation tracks residual displacement over iterations, halting updates once stability is reached. This ensures consistent, noise-resistant mappings, improving accuracy in degraded visibility conditions. Use maximisation and minimisation algorithms to compare relocated features to their picture positions. Use Adam or Stochastic Gradient Descent (SGD) as a gradient descent optimiser and train the dataset at the right learning rate and batch size. Cross-entropy or MSE might be the loss function depending on the classification goal. License plate placements are common in fuzzy training photos.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Graphical abstract of the article</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-1.tif"/>
</fig>
<p>The recommended method for recognising license plates in foggy conditions employs a bidirectional neural network and DR2M for accurate recognition. First, capture photos in low light, when ambient noise and poor vision make license plates difficult to see. Clearer images start with dehazing to remove noise and boost contrast. Apart from size, colour intensity (RGB values or greyscale) and license plate isolation are the most crucial photo attributes. Input these variables into a bidirectional neural network and map them using displacement to account for hazy variations. Minimum region extraction layers focus on boundaries and finer features, whereas maximum region extraction layers prioritise the full plate. Two layers form this network architecture. The network examines edge and area properties over successive frames to calculate displacement and employs equations characterising haze-induced feature changes.</p>
<p>In DR2M, the similarity feature quantifies the correspondence between current and historical plate region&#x2013;edge mappings. By comparing geometric alignment and feature consistency, it filters out mismatched or unstable detections. This selective acceptance of only high-similarity mappings reduces false positives, thereby enhancing precision and improving the overall recognition reliability.</p>
<p>Up to convergence, the convergence estimation technique refines feature mappings in a bidirectional neural network to enhance feature detection. As mentioned, the maximisation and minimisation equations compare the relocated features to their original places in the picture. Employ Adam or SGD gradient descent optimisers with dataset-optimal learning rate and batch size for training. Fuzzy training photos comprise license plate positions, and the loss function is cross-entropy or mean squared error (MSE), depending on the classification task. After numerous training cycles, the model is evaluated using recall, accuracy, F1 score, and false positive rate to reduce errors. To minimize background attention on crucial regions like the plate&#x2019;s edges, the network uses Edge-Guided Sparse Attention (EGSA). The technology accurately detects license plates in haze, shifting lighting, and ambient noise.</p>
<p>Beyond haze degradation, existing methods often ignore spatial displacement of features, lose fine character details, and lack temporal stability in detection. Many prioritize speed over robustness, struggle under occlusion or illumination changes, and fail to integrate multi-scale features. DR2M directly addresses these issues through displacement mapping, bilateral processing, and convergence estimation.</p>
</sec>
<sec id="s1_2">
<label>1.2</label>
<title>Contributions</title>
<p>The main contributions to the article are:
<list list-type="bullet">
<list-item>
<p>This paper presents the Displacement Region Identification Method (DR2M) to deal with license plate identification in cars affected by haze. The frame-based analysis uses the bare minimum of observed edges to derive the haze&#x2019;s effect. A bidirectional neural network can identify edge detection errors using misplaced feature training.</p></list-item>
<list-item>
<p>To isolate the license plate area from the rest of the vehicle&#x2019;s image, employ the training input and the identified edges to determine the displacement between the observed picture frames.</p></list-item>
<list-item>
<p>At the highest displacement factor, this method achieves an impressive 10.27% identification precision, an F1 score of 10.57%, and a false positive rate of 9.73% lower than the standard method.</p></list-item>
</list></p>
<p>The contributions of the article are also presented in <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Article&#x2019;s contribution</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Contribution</th>
<th>Discussion</th>
<th>Derivations</th>
<th>Analysis</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>Related works</bold></td>
<td>&#x2611;</td>
<td>&#x2612;</td>
<td>&#x2612;</td>
</tr>
<tr>
<td><bold>Novel methodology</bold></td>
<td>&#x2611;</td>
<td>&#x2611;</td>
<td>&#x2611;</td>
</tr>
<tr>
<td><bold>Machine learning</bold></td>
<td>&#x2611;</td>
<td>&#x2611;</td>
<td>&#x2611;</td>
</tr>
<tr>
<td><bold>Experimental assessment</bold></td>
<td>&#x2611;</td>
<td>&#x2612;</td>
<td>&#x2611;</td>
</tr>
<tr>
<td><bold>Comparative assessment</bold></td>
<td>&#x2611;</td>
<td>&#x2612;</td>
<td>&#x2611;</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s1_3">
<label>1.3</label>
<title>Novelty</title>
<p>The proposed method presents numerous innovative enhancements compared to current dehazing and License Plate Recognition (LPR) techniques:
<list list-type="bullet">
<list-item>
<p>Displacement Feature Mapping implements a dynamic system that monitors and rectifies haze-induced pixel displacements over successive frames. In contrast to conventional dehazing techniques that primarily emphasize picture improvement, DR2M precisely simulates the spatial displacement of license plate features&#x2014;such as edges and characters&#x2014;caused by haze, facilitating reliable localization even under significant visual distortion.</p></list-item>
<list-item>
<p>The Bilateral Neural Network is distinguished by its dual-layer architecture: one layer analyzes region-based features (e.g., plate dimensions, morphology), while the other addresses edge-based features (e.g., text margins, outlines). This concurrent feature processing enhances the model&#x2019;s capacity to distinguish plate regions from background noise, especially in hazy conditions.</p></list-item>
<list-item>
<p>DR2M&#x2019;s architecture incorporates convergence estimation that realigns displaced features with their original placements over time, a process lacking in the majority of current LPR or dehazing pipelines.</p></list-item>
<list-item>
<p>These advances enable DR2M to enhance image clarity and structurally adjust to haze-induced distortions, resulting in an improved F1 score, heightened detection precision, and diminished false positives relative to state-of-the-art approaches.</p></list-item>
</list></p>
<p>DR2M is novel as it integrates displacement feature mapping, bilateral region&#x2013;edge pathways, and convergence estimation to handle haze-induced spatial drift, edge degradation, and instability. Unlike existing methods focused solely on enhancement or detection, DR2M jointly ensures spatial consistency, detail preservation, and temporal stability, directly addressing these persistent shortcomings.</p>
</sec>
<sec id="s1_4">
<label>1.4</label>
<title>Structure of the Paper</title>
<p>The rest of the paper is followed by <xref ref-type="sec" rid="s2">Section 2</xref>, describing the recent literature review on the proposed topic. <xref ref-type="sec" rid="s3">Section 3</xref> introduces the Proposed Displacement Region Recognition Method. <xref ref-type="sec" rid="s4">Section 4</xref> gives details about the results obtained and the discussions. <xref ref-type="sec" rid="s5">Section 5</xref> gives the conclusion of the paper.</p>
</sec>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<sec id="s2_1">
<label>2.1</label>
<title>Advancements in License Plate Recognition</title>
<p>Silva and Jung [<xref ref-type="bibr" rid="ref-19">19</xref>] introduce IWPOD-NET, a strong network for recognizing license plates in difficult conditions. IWPOD-NET accurately detects license plate corners in diverse conditions, allowing effective perspective rectification. IWPOD-NET performs well against the top methods in Advancements in License Plate Recognition (ALPR), scoring highly across different datasets. IWPOD-NET was evaluated across various conditions and vehicle types, including motorcycles, showcasing its robustness.</p>
<p>Jiang et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] propose an ALPR method optimized for real-time performance and accuracy in various conditions. License Plate Detection Network (LPDNet) uses an anchor-free approach with a Rotating Gaussian Kernel and centrality loss for precise license plate detection. CRNet, a full-convolution network, improves character recognition speed and accuracy across different license plate types. The method outperforms existing approaches on diverse public datasets.</p>
<p>Lin et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] implement a method using the SOLOv2 model for better license plate detection and segmentation in wide-angle images. The approach improves recognition rates by 12% in challenging environments like indoor parking lots. The method effectively addresses issues such as low lighting and complex backgrounds. Employing instance segmentation accurately handles varying license plate positions and orientations, advancing multiple license plate recognition in diverse conditions.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Dataset Contributions for ALPR</title>
<p>Wang et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] introduce LSV-LP, a large-scale video dataset with over 1402 videos and 364,607 annotated license plates. LSV-LP improves upon single-image datasets by reflecting greater diversity and complexity in natural scenes. The MFLPR-Net framework leverages information from adjacent frames to enhance license plate detection and recognition (LPDR) performance. Experimental results demonstrate that MFLPR-Net outperforms mainstream methods in accuracy and robustness.</p>
<p>Ramajo-Ballester et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] developed dual license plate recognition and visual features encoding. The proposed method uses license plate recognition and visual encoding for vehicle identification, enhancing robustness and accuracy. Two new open-source datasets, UC3M-LP for license plate detection and UC3M-VRI for vehicle re-identification, have been created and published. The dual identification system shows excellent performance on public and proposed datasets.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Optimization for Real-Time Performance</title>
<p>Ke et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] present an ultra-fast ALPR approach using an improved Yolov3-tiny model for detecting multiple license plates in diverse environments. Multi-scale Residual Network (MRNet) efficiently recognizes license plates using multi-scale features without needing complex image adjustments or costly Recurrent Neural Networks (RNNs). The method includes a novel data augmentation technique to improve the network&#x2019;s generalisation ability. The approach enhances efficiency and accuracy in automatic license plate recognition systems.</p>
<p>Cao [<xref ref-type="bibr" rid="ref-25">25</xref>] investigated a Convolutional Neural Network (CNN)-based approach for license plate detection using a Yolo-based algorithm. The Yolo algorithm detects and extracts license plates in a single pass, optimizing efficiency. The model&#x2019;s accuracy is evaluated on a validation set to identify areas for further optimization. The method improves efficiency and accuracy in license plate detection using convolutional neural networks.</p>
<p>Qin and Liu [<xref ref-type="bibr" rid="ref-26">26</xref>] propose an end-to-end deep neural network for license plate detection and recognition in various conditions. The unified framework avoids the drawbacks of separate detection and recognition methods, making it more practical in real-world applications. The technique accurately localizes license plates, contributing to the accuracy of subsequent tasks. The process enhances performance across diverse scenarios, improving overall system effectiveness.</p>
<p>Wang et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] proposed a GPU-free method for license plate detection using color-edge fusion and a Retina model. The technique combines colour filtering, Sobel detector, Slime Mould Algorithm (SMA) search, Support Vector Machine (SVM), and a trained Retina model for efficient detection without GPUs. It achieves a speedup of 312.37% compared to the original Retina model on CPU devices, with a precision of 97.95%. Evaluated on the CCPD, the method excels in detecting Chinese blue license plates on CPU devices.</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Specialized ALPR Systems</title>
<p>Kim et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] introduced AFA-Net to better recognize license plates in low-resolution dash cam footage. AFA-Net uses modules for restoring images, combining features, and reconstructing images to improve recognition accuracy. The method targets challenging conditions typical of dynamic driving environments, focusing on optimizing recognition performance. AFA-Net&#x2019;s experiments show that accuracy in these conditions is improved compared to other methods.</p>
<p>Zhang et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] presented TOCNet, a network for detecting waterway license plates. Similarity Fusion Module (SFM) enhances the detection of Small License Plate (SLP) targets by using similarity weights to increase model sensitivity. Task-oriented Decoupling Head (TDH) improves localization accuracy through selective fusion, enhancing SLP detection precision in waterway supervision. The method aims to improve the performance of license plate detection in intelligent waterway scenarios.</p>
<p>Seo and Kang [<xref ref-type="bibr" rid="ref-30">30</xref>] proposed a robust model using lightweight anchor-free networks. The method enhances recognition accuracy outdoors by employing attention-based networks with a residual deformable block. The method surpasses traditional approaches on benchmark datasets like CCPD, AOLP, and VBLPD and performs well on Korean handicapped parking card data. The method detects and recognizes license plates in diverse, challenging scenarios.</p>
<p>Shahidi Zandi and Rajabi [<xref ref-type="bibr" rid="ref-31">31</xref>] developed a deep-learning framework for Iranian license plate detection. The method uses YOLOv3 to detect Iranian license plates and Faster R-CNN to recognize and classify the characters. YOLOv3 achieved 99.6% mAP and 98.08% accuracy with an average detection speed of 23 ms, while Faster R-CNN achieved 98.8%. The system works effectively in challenging conditions and outperforms other Iranian license plate recognition systems.</p>
</sec>
<sec id="s2_5">
<label>2.5</label>
<title>Environmental Challenges in ALPR</title>
<p>Rao et al. [<xref ref-type="bibr" rid="ref-32">32</xref>] used Yolov5l to detect license plates, adapting it to transfer learning for diverse environments. Adaptive Fusion Feature Segmentation Network (AFF-Net) is introduced to correct large-angle deflections in license plate images by combining segmentation results with original areas. The method enhances recognition accuracy using a Convolutional Recurrent Neural Network (CRNN) with a channel attention mechanism to utilize spatial information effectively. The approach aims to improve license plate recognition in complex and varied scenes.</p>
<p>Using deep learning, Vizcarra et al. [<xref ref-type="bibr" rid="ref-33">33</xref>] study adversarial attacks and defenses in License Plate Recognition (LPR) systems. Deep neural networks have advanced Optical Character Recognition (OCR) in LPR systems, which is crucial for accurate plate recognition. The method suggests enhancing the LPR system security with image Denoising and inpainting techniques. The approach enhances the reliability of LPR systems against adversarial threats.</p>
</sec>
<sec id="s2_6">
<label>2.6</label>
<title>Innovations in Feature Extraction and Classification</title>
<p>Liang et al. [<xref ref-type="bibr" rid="ref-34">34</xref>] introduce EGSANet, which uses an Edge-Guided Sparse Attention (EGSA) mechanism to improve license plate detection. EGSA is evaluated on CCPD and AOLP datasets, consistently showing high precision and strong generalization. The method outperforms existing attention methods and models in detecting license plates. EGSANet significantly enhances accuracy across various challenging real-world scenarios. EGSA improves license plate identification by focusing on edge information in the input picture. This strategy is helpful in haze-affected places where license plate detection is difficult due to low visibility, noise, or intricate backgrounds. EGSA focuses on object edges, notably license plate borders. Edges help identify spots like license plates by defining their structure and shape. Edge-guided attention helps the model focus on the picture&#x2019;s edges containing the most essential information. The EGSA method enhances license plate identification while optimizing computational resources by sparsely focusing on picture edges. Haze, fog, and intricate backgrounds are challenging, but our strategy improves feature localisation, false positives, and noise robustness. This method revolutionises practical license plate recognition.</p>
<p>Ramasamy et al. [<xref ref-type="bibr" rid="ref-35">35</xref>] present a new automated number plate recognition approach to reliably and efficiently identify number plates. The first step involves utilizing a pretrained Location-Dependent Ultra-Convolutional Neural Network (LUCNN), a novel ultra-convolutional neural network, to identify key characteristics in the input images. The gathered characteristics are inputted into hybrid single-shot fully convolutional detectors that incorporate a Support Vector Machine (SVM) classifier to distinguish between the city, model, and number of the car and its registration location. The suggested LUCNN&#x002B;SSVM model successfully extracts the number plate areas from images captured behind vehicles at varying distances. The performance results show that compared to the existing recognition models, the suggested LUCNN&#x002B;SSVM model achieves a higher accuracy of 98.75% and a lower error range of 1.25%.</p>
<p>Yan et al. [<xref ref-type="bibr" rid="ref-36">36</xref>] created a multilayer memristive neural network circuit for license plate detection. The neural network automatically adjusts outputs to match set targets based on inputs, which is suitable for tasks like pattern recognition. Simulations demonstrate the circuit achieves 93% accuracy in license plate detection and handles memristor variations, enhancing training speed and performance. Using novel memristive technology, the method shows promise for efficient and robust license plate detection.</p>
<p>Subramanian and Aruchamy [<xref ref-type="bibr" rid="ref-37">37</xref>] present a novel speech-emotion recognition (SER) framework to classify spoken emotions. The recommended method pre-processes voice signals to eliminate artefacts and background noise. We merged state-of-the-art speech emotion traits with the novel energy and phase attributes. The threshold-based feature selection (TFS) technique uses statistics to discover the best features. The Tamil Emotional dataset, a regional language of India, tests the proposed architecture using classical ML and deep learning classifiers. The recommended TFS approach has 97.96% accuracy, making it better for Indian regional languages than Indian English and Malayalam datasets.</p>
<p>Multi-scale fusion defogging (MsF) is a part of the multi-task learning framework to prepare pictures for processing by the re-identification branch, which successfully reduces image blur [<xref ref-type="bibr" rid="ref-38">38</xref>]. The adaptive preservation of critical features is further enhanced by using a phase attention mechanism. Compared to the semi-supervised joint defogging learning (SJDL) model, the method&#x2019;s improved performance is especially noticeable in challenging foggy conditions.</p>
<p>Secure the privacy of the Internet of Things via a blockchain-based method that involves LPR [<xref ref-type="bibr" rid="ref-39">39</xref>]. Bypassing the gateway, a system registers a user&#x2019;s license plate straight on the blockchain. As the system&#x2019;s car count increases, the database controller can potentially crash. Using blockchain technology, this article suggests a privacy protection mechanism for the Internet of Vehicles (IoV) that uses license plate recognition. The license plate reader system sends a picture of a license plate to the central gateway, which handles all incoming and outgoing data. Whenever a user needs a license plate, a system linked to the blockchain registers it directly, bypassing the gateway.</p>
<p>Based on the survey conducted in [<xref ref-type="bibr" rid="ref-40">40</xref>], current license plate recognition systems encounter significant problems, including suboptimal performance in low visibility, fluctuating illumination, occlusion, and severe weather conditions such as haze or fog. Numerous conventional methods depend significantly on image quality and encounter difficulties with warped or low-resolution plates, leading to erroneous detection and recognition. Moreover, several approaches exhibit insufficient adaptation to various plate formats and environmental fluctuations, constraining their generalizability. These constraints necessitate the development of advanced models such as DR2M, which mitigate haze-induced feature displacements through the utilization of bilateral neural networks for enhanced and precise recognition.</p>
<p>Alongside conventional methods, new research has explored real-time and lightweight license plate recognition systems designed for resource-limited settings. Shashirangana et al. [<xref ref-type="bibr" rid="ref-41">41</xref>] introduced a framework based on neural architecture search (NAS) tailored for edge devices. The model effectively accommodates hardware constraints and ensures fast deployment; nevertheless, it lacks mechanisms to address environmental distortions like haze, which considerably affects its accuracy in outdoor settings characterized by feature displacement and blurred edges. Sayedelahl [<xref ref-type="bibr" rid="ref-42">42</xref>] concentrated on deep learning-driven Arabic license plate identification for intelligent traffic systems, exhibiting great precision for region-specific plate varieties. Nonetheless, the system&#x2019;s resilience to haze or low visibility conditions is not expressly considered. The method presupposes largely untainted inputs and excludes any haze-aware modules or feature alignment techniques. Tang et al. [<xref ref-type="bibr" rid="ref-43">43</xref>] created an ultra-lightweight ALPR system suitable for microcontrollers, prioritizing cost-effectiveness and energy efficiency. This technique performs well in low-resource scenarios but demonstrates inadequate performance in degraded visual conditions, such as haze, due to its absence of feature rectification or adaptive augmentation processes essential for successful recognition in these environments.</p>
<p>Agarwal and Bansal [<xref ref-type="bibr" rid="ref-44">44</xref>] introduced a YOLO World-based system that accomplishes real-time license plate detection and recognition with excellent accuracy in controlled settings. Nonetheless, as indicated in their findings, the model&#x2019;s efficacy declines under adverse visibility conditions, such as poor illumination or environmental impediments. under contrast to YOLO World, our suggested DR2M explicitly targets haze-induced distortions and feature displacement, providing enhanced robustness under harsh situations. This method&#x2019;s contrast further emphasizes the innovation and practical importance of DR2M in uncontrolled, real-world contexts.</p>
<p>These results highlight a significant deficiency in the LPR literature: the majority of lightweight or real-time models emphasize speed and economy while frequently neglecting the issues associated with haze-induced feature displacement and edge degradation. This immediately inspires the proposed DR2M, which amalgamates displacement feature mapping with a bilateral neural network to rectify haze-induced distortions. DR2M enhances recognition accuracy in low visibility conditions while maintaining adaptability for real-time implementation, effectively reconciling resilience and efficiency in LPR systems.</p>
<p>Various technological deficiencies in earlier variety Plate Recognition (LPR) systems led to the creation of DR2M. Perspective correction, real-time performance, and other technologies can remedy haze and environmental distortions. These strategies function best with clean settings or organised data; therefore, they are ineffective at resolving ecological distortions. Although Adaptive Feature Attention Network (AFA-Net) and Multilayer Perceptron Network (MFLPR-Net) improve dynamic accuracy, haze-induced pixel displacements and feature extensions remain under-researched. SOLOv2 and Yolov5l can recognise and segment complicated circumstances, but they don&#x2019;t know how to handle haze-displaced properties. Most systems ignore environmental factors like haze, which change pixel positions and affect detection and recognition accuracy. This is noteworthy compared to TOCNet and EGSANet, which focus on specific settings or extremely tiny targets. Haze distorts characteristics; therefore, this area needs further attention. The handling of pixel displacements between frames is poor. Edge detection for haze is rare. Displaced feature training fails to enhance recognition accuracy. It was required to build DR2M to solve these issues. Bidirectional neural networks and misdirected feature training allow it to distinguish license plates in a haze.</p>
<p>According to published research, conventional license plate recognition methods have difficulty dealing with various environmental factors that can drastically affect detection accuracy, such as haze, occlusion, or poor illumination. Classical approaches, including simple Support Vector Machines (SVMs) and Convolutional Neural Networks (CNNs), have problems generalising to new datasets, which causes them to perform inconsistently when used in the real world. When faced with complicated backdrops or low-quality photographs, these methods aren&#x2019;t very resilient and usually require extensive pre-processing. These shortcomings have prompted several efforts to improve the precision and speed of number plate detection. Innovative approaches such as DR2M and EGSANet combine deep learning architectures with attention mechanisms to enhance the accuracy of feature extraction and detection under challenging environments. Hybrid models like LUCNN&#x002B;SSVM merge CNN-based feature extraction with SVM classification to improve accuracy and decrease false positives. In addition to fixing the problems with older methods, these additions make real-time processing easier and increase the models&#x2019; generalizability to other datasets.</p>
<p>New ALPR systems handle challenges including intricate scenarios, environmental distortions, and real-time performance. AFA-Net and EGSANet are great; they can only handle specific issues like low resolution or haze, not occlusion, shifting lighting, or missing pixels. YOLO-based frameworks and other existing recognition methods favour speed above accuracy, but they can&#x2019;t handle feature loss in harsh conditions.</p>
<p>A bidirectional neural network with displacement mapping manages haze-induced feature changes in the proposed Displacement Region Recognition Method (DR2M). With dual-layer processing for the region and edge-based extraction, DR2M ensures reliable identification under challenging scenarios. Improved detection accuracy with fewer false positives is achieved via convergence estimates and robust feature mapping. DR2M provides a scalable, reliable solution to ALPR system restrictions that will enhance identification accuracy, F1 score, and processing latency.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Proposed Displacement Region Recognition Method</title>
<p>This paper involves identifying the license plate number from the input image, and this pre-processing is carried out efficiently. This step uses image representation to extract the image as input and provide the necessary processing for this work. This work aims to improve the precision and F1 score for this observation and proposes a bilateral neural network. The state of the art involves determining whether the license plate capture is affected by errors due to haze conditions. If the capture occurs during the haze condition, detecting the number on the plate is difficult. Based on this analysis step, the background image is acquired as the input, i.e., the license plate and from this approach, the examination is followed up accurately. This strategy illustrates the features of the input image. In this process, colour and size are taken into consideration. Examining these license plate features, the mapping is followed up, and the vehicle is provided with a transparent license plate. This approach determines the displacement of the feature occurrences due to the feature extraction method. In this phase, the bilateral neural network is introduced under the displacement of features. In this context, &#x201C;bilateral&#x201D; denotes the dual-path architecture of the proposed neural network, which concurrently analyzes both region-based characteristics (e.g., plate size, shape) and edge-based features (e.g., contours, borders). This dual-layer architecture allows the model to identify both coarse and fine-grained details proficiently, hence augmenting its capacity to manage haze-induced distortions and promoting convergence in feature mapping and recognition.</p>
<p>The DR2M model feature extraction procedure is designed to detect misplaced characteristics in license plate images, especially when the lighting is poor. Colour and size are the process&#x2019;s primary properties for accurate detection. Because of its colour, the license plate can be easily distinguished from its surroundings, especially under difficult lighting conditions like haze. Using a suitable colour space is important to help the model differentiate between the vehicle&#x2019;s backdrop and the plate, as haze frequently reduces contrast. Colour extraction employs the distribution and intensity of RGB data to help the model identify the area of the license plate. The computational effort can be reduced by converting to greyscale in some circumstances while critical colour-based boundaries are retained.</p>
<p>The model&#x2019;s ability to recognise plates with various backdrop colours remains resilient, even in a haze, since it leverages colour. Even when haze makes it harder to see details, white or yellow plates may be identified by their darker backgrounds. The model compares the sizes of the identified areas to distinguish the license plate from other vehicle parts. This comes in handy, especially when there are several frames of the vehicle&#x2019;s movement or when part of the image is obscured.
<list list-type="bullet">
<list-item>
<p>Haze displacement handling manages pixel shifts induced by blurring. The model starts by identifying haze-induced pixel displacement. This displacement shifts license plate features, including characters, making identification harder.</p></list-item>
<list-item>
<p>Maximum and minimum region extraction let the DR2M bilateral neural network locate and measure displacement. The model analyzes feature similarity across image frames or time intervals to correct for license plate relocation.</p></list-item>
<list-item>
<p>Following displacement, the model realigns pixels using convergence estimation, as previously discussed. After displacement, the bilateral network validates the proper detection of large objects (like the plate) and minute details (like edges and letters).</p></list-item>
<list-item>
<p>A comparison of displaced features with training data maps presents features to projected license plate locations to fix the problem. Example: The model can predict when the plate&#x2019;s location will change due to haze and alter its detection border.</p></list-item>
</list></p>
<p>Robustness in handling Hazy conditions</p>
<p>1. Blurred or mismatched license plate borders can be created by haze-induced pixel displacement. By considering region-based (based on size) and edge-based (based on colour) characteristics, the bilateral network can manage misalignments and adjust for these changes.</p>
<p>2. Over time, the network fine-tunes its displacement feature recognition algorithm, making it more accurate for shifted plates and less prone to false positives.</p>
<p>The method&#x2019;s effectiveness in real-world circumstances will be supported by visual and numerical proof, thanks to the thorough treatment of displaced features.</p>
<p>This technique is classified into two forms: maximum region and minimum region. The convergence rate is observed due to the feature extraction and computation methodology. In this case, it considers the background image and provides a better analysis by performing the mapping. The bilateral works in these works are in two layers, including the maximum and minimum region extraction, to establish the convergence rate. This methodology illustrates license plate recognition and provides reliable computation with the necessary feature extraction mechanism. This step determines the feature mapping for the vehicle license plate recognition with two varying layers. The varying layers are associated with the region and edges. The preliminary step is to perform with the region and then with the edges. In this section, mapping is carried out for the training inputs observed under the bilateral neural network, and the displaced features from the extraction process are compared. The first derivation is the image representation formulated in the equation below.
<disp-formula id="eqn-1a"><label>(1a)</label><mml:math id="mml-eqn-1a" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mo movablelimits="false">&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The image representation is equated to the above equation for license plate detection from haze conditions. The region and edges are represented as <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mtext>&#xA0;and</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, the image representation is <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the feature extraction is described as <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, here two types of features are taken into consideration color and size and they are labeled as <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mrow><mml:mtext>and</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The license plate is represented as <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, which is detected under the haze condition. This factor extracts the necessary features from the image representation over the mentioned time interval. A timely manner is followed up in this approach, which estimates the better recognition of object features under haze conditions. This approach detects the recognition of license plates from the varying input images. This evaluation step observes the processing for the region where the pixel-based differences and blurriness are identified. The second process is based on edges that extract the feature position from the extracted image.</p>
<p>Due to the haze, the noisy pixels captured from these necessary features are extracted and show improved image resolution. If the particular image is somewhat noisy, then detection is difficult to ensure the resolution in the higher range, so the extraction of necessary features is very important to identify in haze conditions. The license plate detection in haze conditions is evaluated based on size and colour. Based on these factors, the extraction is followed up accurately in this proposed work for the input image. This stage defines the displacement of features and derives the mapping associated with the vehicle license plate recognition. This strategy provides the identification of license plates at the required time interval. Thus, it derives a reliable image representation from the background image and achieves the detection of the number. The formulation below extracts features from the image representation and improves the image quality.
<disp-formula id="eqn-1b"><label>(1b)</label><mml:math id="mml-eqn-1b" display="block"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:munder><mml:mo>&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>,</mml:mo><mml:mo>&#x2208;</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mi>i</mml:mi><mml:mi>z</mml:mi><mml:mi>e</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The feature extraction is observed in the above equation, further categorized by colour and size. Based on these two factors, the font and design of the plate are analyzed, and it is represented as <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mrow><mml:mtext>and</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The identification of the license plate is labelled as <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the periodic monitoring is expressed as <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the characteristic of the image. The characteristics of the image include the recognition and segmentation methods. Based on this analysis step, the feature extraction is followed up for the varying detection under haze conditions. The haze condition illustrates the region; edge-based computation relies on the identification phase. The identification phase determines the image&#x2019;s region and edges; in this case, it makes the tasks easy to extract. For every acquired input image, the feature extraction varies and defines the image representation. In this observation class, the extraction of color and size is important for license plate recognition. From this evaluation step, representation is used to illustrate the better characteristics.</p>
<p>A background image is taken from this processing step, and the extraction with the mentioned features is performed. On top of this analysis, the background image is acquired to extract the desired features. This mechanism determines the input image&#x2019;s color and size; from this approach, monitoring is observed periodically. In this examination stage, image identification plays an important role in this extraction process and produces the output. The time requirement is discussed in this topic to extract the necessary features in the required time interval. By progression of this method, feature extraction provides the background image for the efficient region and edge-based computation. The colour indicates the RGB value with some greyscale images; the size describes the font size of the number displayed on the plate. Based on this strategy, the extraction is followed up for the displacement identification of features, including the license plate&#x2019;s font and design. From this extraction method, the segmentation characteristic is performed, classifying the region and edges.
<disp-formula id="eqn-2a"><label>(2a)</label><mml:math id="mml-eqn-2a" display="block"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:munder><mml:mo>&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The characteristic segmentation is equated for the region and edges of the input image. The first derivation is for the region, and the second is for the edges. Based on this approach, the font and design of the input image are considered and work accordingly to extract the features. The feature extraction is carried out by identifying the colour and size of the acquired license plate. In this observation method, the font and design are considered and examined by monitoring the extraction over the mentioned time interval. The feature extraction process is defined by providing this process, and the region and edge-based computation is determined. Region-based execution is used to run the process efficiently. In this mechanism, the characteristic of the license plate is used to illustrate the extraction of color and size from the plate, making the task easy to define the region. From the region, the pixel is blurred due to the haze condition; to address this, both the region and edge detection are followed up in this bilateral layer.</p>
<p>This segmentation plays a vital role in the image&#x2019;s region and edge; the feature extraction is carried out efficiently from this observation. The process defines the maximum and minimum regions and is identified in this extraction method from these edges. The edges are associated with the feature mapping for the vehicle, which provides license plate detection for the feature position. Based on this strategy, it derives the edge that differs from boundary detection, where it analyzes the edges of the image. From the box format, the edges are distinguished and provide the necessary computation for the segmentation. The segmentation is carried out for the varying computation layers and relies on recognising the vehicle license plate. This approach derives the feature extraction process with the convergence rate for reliable analysis. Based on this evaluation step, recognition is carried out for the different processing sets and giving the characteristics of the region and edges from the image for segmentation. From this method, the analysis for displaced features is progressed to find the feature position changes, which are equated below.
<disp-formula id="eqn-2b"><label>(2b)</label><mml:math id="mml-eqn-2b" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mi>&#x03C0;</mml:mi></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mspace width="1em" /><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The analysis for the displaced feature is identified in the above equation and represented as <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula>. In this section, displaced features are <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, is identified at what position the feature is displaced and how much variation it is fixed. The time taken to analyze these displaced features is labelled as <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Based on these two constraints, the displacement is detected in this equation, for which maximization is attained for the feature extraction model, which provides the periodic monitoring of image representation. This observation methodology derives reliable characteristics for the variation in the image pixel. The identification phase employs colour and size as features and examines the appropriate pixel analysis. In this stage, the segmentation is considered for the characteristics that involve region and edges in the computation step. The recognition of the license plate is performed by detecting this displaced feature. In this concept, the comparison is done with the training input given, and the mapping is performed with the current and existing pixel region variation. The displacement feature detection functions are presented in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title><inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> detection functions</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-2.tif"/>
</fig>
<p>In <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, the <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> the detection process is diagrammatically presented. The <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>o</mml:mi></mml:math></inline-formula> with the training inputs define the <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. This <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> in difference with the <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of the actual input categorizes the <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula> to ensure all <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is covered. Leaving out the <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> from the <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> of the input, the rest of the region is illustrated for <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. In the case of <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> process, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> plays a vital role in estimating the <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> from <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula>. The region-based variation is observed for the identification of displacement of features by executing this technique, the feature extraction is followed up accurately. In this evaluation, characteristics are considered the better detection of features. The maximisation process is done for the periodic monitoring of image representation, which explores the region and edge detection. This detection is identified for the font and design on the license plate and it is expressed as <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:munder><mml:mo form="prefix">max</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula>. This technique illustrates the feature displacement and how much the variation appears, calculated with the comparison procedure. At this stage, the region and edges are considered for the variation analysis. In this mechanism, the displaced features are detected, and how much variation is analyzed with this comparison of training inputs. After this displaced feature analysis, the comparison is monitored with the training inputs computed in the following equation.
<disp-formula id="eqn-2c"><label>(2c)</label><mml:math id="mml-eqn-2c" display="block"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>

<p>The periodic monitoring is performed for the displaced features, and from this observation strategy, the time duration is calculated. The comparison is represented ass <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, in this technique, it illustrates the license plate and finds the font and design, and provides a better evaluation. In this evaluation step, the displaced features are considered, and the mapping with the training inputs and the output. The output is based on the displaced features and observed for efficient computation. The analysis is followed up with the image representation and segmentation process. The characteristic is used for the region and edge definition for the license plate. From this processing step, the displaced features are associated with the mapping of vehicle plate recognition. The analysis is done for the segmented region and then the edges of the image, and forwards the process to the displaced features. The Feature Extraction Process is presented in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Feature extraction process</title>
</caption>
<table>
<colgroup>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td>License plate features were detected using Image <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>I</mml:mi></mml:math></inline-formula> and Training Data <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>T</mml:mi></mml:math></inline-formula>.</td>
</tr>
<tr>
<td>1. Set the neural network parameters <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula>.</td>
</tr>
<tr>
<td>2. For each collection image, <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>I</mml:mi></mml:math></inline-formula>:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;3. Collect attributes:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Colour specs (RGB or monochrome)</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;- License Plate Sizes</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;Location of Boundaries and Areas</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;The Widest Areas (Plate Outside) and Narrowest Boundaries (Plate Surface)</td>
</tr>
<tr>
<td> &#x2002;&#x2002;5. Connect features to <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mi>D</mml:mi></mml:math></inline-formula> training dataset:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Compare observable traits to established criteria.</td>
</tr>
<tr>
<td>6. Improve collected attributes:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;Tune edge detection to reduce noise.</td>
</tr>
<tr>
<td> &#x2002;&#x2002;The <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula> parameters may be adjusted using Gradient Descent.</td>
</tr>
<tr>
<td>7. Restore improved features</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>In this study, the &#x201C;widest areas&#x201D; denote the bounding boxes exhibiting the most excellent height-width product that comply with the initial color and aspect ratio criteria. The calculation involves segmenting the image into contiguous sections and determining the area of each region as follows: <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>A</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mi>e</mml:mi><mml:mi>i</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mo>.</mml:mo></mml:math></inline-formula> The area with the greatest extent is deemed the contender for the complete license plate zone.</p>
<p>The &#x201C;narrowest boundaries&#x201D; are established using Sobel edge detection, followed by morphological thinning to improve edge definition. Among all identified edges, those possessing the minimal enclosing bounding box around character-level gradients are selected. These denote intricate elements such as letter outlines and plate margins. The metrics of the most significant area and narrowest boundary serve as inputs for the bilateral neural network to facilitate efficient region and edge-based license plate detection.</p>
<p>The primary goal of the first method is to recognize the license plate by extracting pertinent information from the input photos, such as the size and color. It uses a neural network to find the largest areas (plates) and the smallest boundaries (plates). Iterative optimization methods, such as gradient descent, enhance the findings by decreasing noise and increasing accuracy once these features have been mapped to training data for validation. The functional description of <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is presented in <xref ref-type="table" rid="table-3">Table 3</xref>.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Functional description of <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula></title>
</caption>
<table>
<colgroup>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td>1: Represent <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> using <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> detected</td>
</tr>
<tr>
<td>2: <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is performed as in <xref ref-type="disp-formula" rid="eqn-2c">Eq. (2c)</xref> <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>3: In the <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> process, differentiate <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>4: De-refer the training input by <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula></td>
</tr>
<tr>
<td>5: Perform the operation <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msup><mml:mi>o</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> as follows:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;(i) compute <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;(ii) compute <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula> as <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;(iii) <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mi>o</mml:mi><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is computed as <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;(iv) <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>o</mml:mi><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula> is computed as <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munderover><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>6: If <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mi>o</mml:mi><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> then <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mi>&#x03C0;</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> else <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>7: If <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>o</mml:mi><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>&#x03C0;</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> then <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> else <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>&#x03C0;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>8: Initiate the Learning process for <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>This evaluation step maximises the region for vehicle license plate detection. The comparison is made with the existing techniques and derived from reliable processing. Here, it illustrates the feature position and variation and resolves for further evaluation. In this technique, the bilateral neural network is proposed to acquire the input from the displaced features and progress, resulting in the maximum and minimum regions. Based on this structural feature, the comparison is followed up in this technique, the pixel&#x2019;s position is found, and the fix is used for the analysis. The fixed pixel frame is further computed to recognize the number plate. These steps are processed individually by introducing a bilateral neural network in the following section.</p>
<p>The suggested technique adjusts for light and background noise changes in hazy license plate identification by integrating a bidirectional neural network for displaced feature mapping with colour and size-based feature extraction. The model can see it in weak or changing lighting because it employs colour intensity to focus on the license plate&#x2019;s continuous colour contrasts. While focusing on license plate size, the algorithm filters out extraneous background noise. The bidirectional neural network enhances detection by integrating edge- and region-based feature extraction. This lowers background noise and lets the model react to illumination changes. The model eliminates background clutter and glares by focusing on the highest and lowest areas, and edge-guided recognition helps identify the plate&#x2019;s borders even with low-contrast illumination. These capabilities make license plate identification reliable even in noisy and dynamic environments.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Bi-Lateral Neural Network for Convergence Estimation</title>
<p>The suggested Displacement Region Identification Method (DR2M) uses a bidirectional neural network architecture to address displaced features in haze-related license plate recognition. A thorough description of layer connections, activation functions, training techniques, architectural rationale, and computing complexity.</p>
<p>1. Layer connectivity:</p>
<p>The algorithm analyses haze-impacted photos in the Input Layer to extract license plate properties, including size, colour, and text. The network uses maximum and minimum region extraction layers to reduce haze-related feature displacement.</p>
<p>The bidirectional neural network extracts areas and edges concurrently using two hidden layers. The network analyzes haze-induced visual properties using hidden layers to handle misplaced features.</p>
<p>The network&#x2019;s final hidden layers generate intermediate outputs representing maximum (region-level) and minimum (edge-level) features, which are then fused and passed to the output layer to produce the final license plate prediction. This enables the network to accurately recognise license plates by mapping misplaced characteristics to their correct positions.</p>
<p>2. Activation function:</p>
<p>The DR2M may use the popular Rectified Linear Unit (ReLU) in its hidden layers as an activation function. ReLU excels at non-linearity and sparse gradients, making it ideal for image-processing neural networks. The output layer can employ softmax or sigmoid activation functions to distinguish between license plate detection and non-detection.</p>
<p>3. Training process:
<list list-type="bullet">
<list-item>
<p>The model extracts several parameters to find missing characteristics. These include colour, size, and typeface. The bilateral network uses extracted features to determine maximum and minimum regions and estimate convergence rates.</p></list-item>
<list-item>
<p>The repeated comparison of displaced characteristics with seen image parts shows the repetitiveness of this operation. The network adjusts its weights to decrease the mismatch between observed and displaced features. It also compares training inputs with displaced characteristics to decrease early training mistakes.</p></list-item>
<list-item>
<p>Use a cross-entropy loss function or mean squared error (MSE) to calculate the difference between the features&#x2019; supposed and actual displacement. Training will employ gradient descent optimisers like Adam or SGD to update weights.</p></list-item>
<list-item>
<p>This architecture concurrently extracts characteristics from regions (size, location) and edges (licence plate borders and edges).</p></list-item>
<list-item>
<p>The Maximisation Layer handles areas with more characteristics to simplify extracting the most critical regions. The minimisation layer emphasises edges to improve identification in haze-covered areas.</p></list-item>
</list></p>
<p>The bilateral design&#x2019;s characteristic displacement detection improves license plate identification, especially in haze. This method reduces false positives by identifying and distinguishing important from irrelevant traits. Here, the Convergence estimation refers to the changes that describe the license plate acquisition of font and design that do not affect the different layers in a neural network. If the first layer works on segmentation, then the second layer also works under the same segmentation mechanism. It indicates two layers under the same computation process. This method is used in our work to find the region and edges of the number plate. To illustrate these two regions, maximum and minimum are detected, and based on this approach, the bilateral neural network works. The neural network is the interconnection of layers, including the hidden and training layers. From this observation, the proposal model analyzes the displaced feature that is equated in <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> and provides an examination of the region from the input image.</p>
<p><bold>Step 1-Region Assessment:</bold> In this proposal, the region examination is carried out to find the required features displaced in the image. This working principle involves the license plate detection under which position it has a deviation. The position deviation is used to determine the displacement of the feature, and the mapping is performed below. The bilateral works to examine the region with the displaced region involve the background image for the analysis, which is given as the input for the initial layer. <xref ref-type="disp-formula" rid="eqn-3a">Eq. (3a)</xref> is useful for determining the variance and location of haze-displaced features. In the context of the feature extraction phase, the expression <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mrow><mml:mtext>and</mml:mtext></mml:mrow></mml:math></inline-formula> &#x22C5;<inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the region that has been extracted from the picture, with <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> being an image characteristic and <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> being the time to converge.
<disp-formula id="eqn-3a"><label>(3a)</label><mml:math id="mml-eqn-3a" display="block"><mml:mi>&#x03C6;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The examination is <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula>, which acquires the input from the displaced features, and this equation is used to find the position and how much it varies using a bilateral neural network. The principle of this work is computed in this derivation that examines the image representation and variation for this purpose, it uses feature extraction techniques that involve two features, such as color and design. The bilateral network representation is given in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. This representation starts region assessment towards convergence detection.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Bilateral network representation</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-3.tif"/>
</fig>
<p>The general representation for <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula> process using the bilateral network is portrayed in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. The network constraints <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>&#x03C6;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>&#x03C6;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> through <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> differences. The target is to observe <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula> for both <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula> under multiple extractions <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Considerably the training network relies on <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> that represents the <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> from the input image. Thus, <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x222A;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are the training parameters for two different <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula>. The other constraint of <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x222A;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is also used in the training process to ensure <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula> is optimal from <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2295;</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> process.</p>

<p><bold>Step 2-Classification:</bold> Here, from the input layer, it forwards to the next interlinked layer <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> On top of this first step, the carry-forwarding is done, and, in this case, to analyze the classification under a neural network. This approach leads to the minimum and maximum region extraction based on the features. The DR2M bilateral neural network relies on <xref ref-type="disp-formula" rid="eqn-3b">Eq. (3b)</xref> for convergence estimation. <xref ref-type="disp-formula" rid="eqn-3b">Eq. (3b)</xref> represents the bilateral neural network&#x2019;s maximisation and minimisation processes. The neural network zeroes in on the most prominent or bigger features in the input picture (the license plate) by maximum region extraction during optimization. The neural network zeroes down on smaller or finer characteristics, like the license plate edges or details, during the minimisation phase by focusing on minimal area extraction. To properly identify the displaced features, whether they be huge regions or small edges, convergence aims to stabilise the network. If the network is to pay attention to both big, obvious characteristics and smaller, less obvious aspects like edges, the equation must employ both minimisation and maximisation procedures. To find the most important displacements of features, the network prioritises bigger areas throughout the maximisation phase, such as the whole license plate. The interlink layer acquires the examination as the input and from this, the classification of regions is performed and derived below.
<disp-formula id="eqn-3b"><label>(3b)</label><mml:math id="mml-eqn-3b" display="block"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>M</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:munder><mml:mo>&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>&#x03C4;</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>M</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The classification performed in the above equation is equated as <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula>, and the segmentation is symbolized as <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, the maximization and minimization are optimized. In this approach, region extraction is based on the interlinked maximization and minimization. This methodology monitors the number plate by finding the font and design. The first case determines the maximization where the interlinked is performed for the displaced feature detection and provides the variation for regions. The second case is observed for the minimization, where it employs the variation of features position, and it is described as <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The bi-lateral neural network used in this classification model examines the maximization and minimization of the region from the displaced features. <xref ref-type="table" rid="table-4">Table 4</xref> represents the classification process.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Classification process</title>
</caption>
<table>
<colgroup>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td>Input: Extracted Features <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>F</mml:mi></mml:math></inline-formula>, Training Data <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:mi>T</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>Output: Classified Regions and Edges</td>
</tr>
<tr>
<td>1. Initialize:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;- Maximum Region Extraction Layer <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;- Minimum Region Extraction Layer <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>2. For each feature f in F:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;3. Compute <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for large-scale regions</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;4. Compute <inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for small-scale edges</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;5. Evaluate Convergence:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;- If (<inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:msub><mml:mi>R</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> aligns with known pattern in<inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:mi>T</mml:mi></mml:math></inline-formula>):</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Classify region as license plate</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;- Else:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Update weights for misclassified regions</td>
</tr>
<tr>
<td>6. Output classified regions and edges</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The second algorithm determines whether detected areas and edges are license plates. The method employs maximum region extraction for features with a wide scale, like the plate area, and minimum region extraction for details with a small scale, such as edges. A convergence check verifies the classification by checking if the model&#x2019;s parameters have been updated to fix misaligned features. The functional description of the classification process is given in <xref ref-type="table" rid="table-5">Table 5</xref>.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Functional description of the classification process</title>
</caption>
<table>
<colgroup>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td>1: Initializing the learning process using <inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> Inputs</td>
</tr>
<tr>
<td>2: compute <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula> independently for <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula> using <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>3: Perform the operation <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula> as follows:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>&#x03C6;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mi>&#x03C6;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>Define <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td>4: Perform <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> operation for <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> in <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x222A;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> as follows:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>5: Perform <inline-formula id="ieqn-118"><mml:math id="mml-ieqn-118"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> operation for <inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> in <inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> as follows:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>6: Perform convergence estimation from <inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mspace width="thinmathspace" /><mml:mi mathvariant="normal">&#x0026;</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p><bold>Step 3-Convergence Estimation:</bold> The convergence rate for the proposed work is estimated in this step. This extracts the output from the classification model that ensures maximum region detection for convergence estimation. By fine-tuning the learning process indefinitely until it reaches an optimum state, convergence estimation ensures that the neural network reliably recognises license plate displacements. Convergence occurs when the neural network successfully detects the proper license plate region and edges and minimizes the discrepancy between future predictions of displaced features. The bidirectional network stabilises outputs now. The approach uses minimum and maximum region extraction due to the network&#x2019;s bidirectional topology. This layer may separate region-based and edge-based feature sets and determine how they converge.</p>
<p><xref ref-type="disp-formula" rid="eqn-3c">Eq. (3c)</xref> shows the DR2M model&#x2019;s convergence rate calculation, incorporating many critical factors to provide precise convergence for haze-related license plate identification. <inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> takes into consideration attributes like size <italic>z</italic><sub><italic>i</italic></sub> and brightness <italic>l</italic><sub><italic>r</italic></sub> in addition to the time variable <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Priority in identifying the license plate determines the relative weights of these characteristics. <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> maintains a steady equilibrium between the license plate features <italic>ap</italic> and the detected displaced features <italic>Zy</italic>, with the former normalised by adding the maximum and minimum <italic>ba</italic> features from the interconnected layers <italic>k</italic><sub><italic>i</italic></sub>. The last two components, &#x003D5; and &#x003D2;, stand for region assessment and classification score, respectively, which help improve the convergence by combining region-based and feature-based analysis. This equation specifies the convergence rate by weighting the important picture characteristics, areas, and temporal dynamics to ensure precise and steady license plate identification.
<disp-formula id="eqn-3c"><label>(3c)</label><mml:math id="mml-eqn-3c" display="block"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The convergence is represented as <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. In this stage, the features, colour, and size are considered. The maximum and minimum are symbolized as <inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mrow><mml:mtext>and</mml:mtext></mml:mrow><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, this is used to define the convergence rate for the proposed work. Bilateral is used for the two-layer computation, with one as maximum region extraction and one as minimum region extraction. This neural network&#x2019;s convergence rate is executed from the interlinked layer&#x2019;s output based on this strategy. The convergence estimation decision is portrayed in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Convergence estimation decision</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-4.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-4">Fig. 4</xref> depicts the decision-making process for the bilateral network&#x2019;s convergence. It shows the process flow from extracting input features to identifying maximum and minimum regions, and finally to the output of convergence. The important nodes like &#x03D5;, &#x03B3;, and <italic>v</italic><sub><italic>r</italic></sub> stand for the steps when the network looks at displaced characteristics like the region and edge and converges via bilateral processing. It is the process by which the neural network determines the largest area of interest by identifying and mapping out the displaced characteristics in broader portions of the image, such as the license plate. The minimal region extraction route shows that the neural network considers larger and smaller features, including edges. When the network stabilizes&#x2014;shown by the figure&#x2019;s feedback loop&#x2014;and the model ends training and makes a correct number plate prediction, the convergence decision-making process is complete. The convergence analysis is performed for maximum <inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and minimum <inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> from <inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:mi>&#x03C8;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula> variants. In the assessment process, the <inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the prime condition. The <inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the convergence checking condition for maximum region detection. The alternate of <inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the reinitialization of <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> using <inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> under <inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula>. If <inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the possible output for <inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> then <inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> is the process for extracting new displaced features within <inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Its alternating condition defines the convergence of <inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> as a minimum for the edges identified within <inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. This decision identifies the training purpose and the iterations of the learning network to improve <inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> detection precision (<xref ref-type="fig" rid="fig-4">Fig. 4</xref>). From step 2, step 3 identifies the convergence rate, and the training phase is evaluated to provide for the minimum region extraction, computed in step 4.</p>

<p><bold>Step 4-Training:</bold> The DR2M model was trained utilizing the Adam optimizer with an initial learning rate of 0.001, implementing a step decay schedule that diminished the learning rate by 50% every 10 epochs. A batch size of 32 was employed, and the training occurred across 50 epochs, with early stopping predicated on validation loss to mitigate overfitting. The loss function is integrated cross-entropy for classification precision and mean squared error (MSE) for displacement assessment. This setup facilitated consistent convergence and efficient learning of both regional and edge characteristics in images influenced by haze.</p>
<p>The training phase gives the previous processing feature detection as the input to enhance the extraction model.
<disp-formula id="eqn-3d"><label>(3d)</label><mml:math id="mml-eqn-3d" display="block"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mo movablelimits="false">&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The training phase performs the minimum range of region extraction, including the training input comparison techniques. The training is described as <inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The interlinked layer output is used to find the vehicle license plate recognition convergence rate. The training is provided for the minimum region extraction in this neural network from this convergence rate. In this processing step, the bilateral neural network works on two layers: an input layer and an interlinked conditional layer, which are equated in steps 2 and 3. The distinguished is processed for license plate detection using the calculated convergence rate from these steps.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>&#x03D1;</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The distinguishment of license plate variation is processed in the above equation, and it is equated as <inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><mml:mi>&#x03D1;</mml:mi></mml:math></inline-formula>. In this model, it derives the identification of the license plate along with the extracted features. In this manner, the variations are observed based on the displacement of feature mapping. The variations are observed to distinguish the maximum and minimum region detection from the variation analyzed with the displacement mechanism. This strategy defines the variation occurrence ranges, causing minimal region convergences. These occurrences are performed under the bilateral layers.</p>
<p>Learning rate, batch size, convergence time, and displacement thresholds are hyperparameters that influence the model&#x2019;s convergence accuracy and speed. Convergence can be accelerated or slowed down depending on the value of the learning rate; a greater value will result in faster convergence, but could lead to instability. While a bigger batch size does make convergence smoother, it may also lead to higher memory use. Convergence time specifies the amount of time allotted for the process to finish. Convergence may be delayed with a larger batch size and accelerated with a smaller time. Detecting more edges is possible with high sensitivity, but if it&#x2019;s too sensitive, it could produce false positives. Minimisation allows for detecting thin lines and edges, which are smaller and more subtle feature changes necessary for license plate recognition.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Mapping and Detection</title>
<p>The first and second layers run on the same computation steps from these layers to avoid errors and false rates. From this distinguishment model, the displacement of feature mapping is allowed by comparing training inputs.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>The mapping is used to observe the displacement position changes from the input region. In this case, training input is associated with the feature that identifies segmentation phases. The processing stage determines the mapping of current and previous detection of number plates and provides the maximum region extraction. This approach uses a background image to illustrate the mapping process and provides reliable results. It uses the bilateral format as a two-layer computation and provides the mapping with the previous detection phase. Further, the regions and edges are examined below.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>&#x03C6;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mo movablelimits="false">&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p>
<p>The examination is followed up for the mapping with the feature displacement, and from this region, edges are defined by the neural network computation. In this methodology, recognition of the number plate is detected and formulated below. In this phase, the first step is finding how much region is extracted, and the second is determining how many edges are extracted. Based on these techniques, the mapping is followed up for the region- and edge-based examination. From this approach, the identification of vehicle region is recognized below.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:mi>&#x03D1;</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The vehicle region identification is performed in the above equation, and the training section for the interlinked layer is employed, where the classification is followed up. This strategy defines the displacement of feature extraction by mapping with the training input and identifies the vehicle number plate. This methodology illustrates the region and edge detection based on the training inputs and the two layers. Thus, the vehicle detection is satisfied using a bi-lateral neural network and its convergence rate. <xref ref-type="table" rid="table-6">Table 6</xref> examines the Mapping and Detection Process.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>Mapping and Detection process</title>
</caption>
<table>
<colgroup>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td>Criteria: Regions Have Been Classified The regions <inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:mi>R</mml:mi></mml:math></inline-formula> and the edges <inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:mi>E</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>Created: License Plate Location Map</td>
</tr>
<tr>
<td>For every discovered region <inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><mml:mi>r</mml:mi></mml:math></inline-formula> in <inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><mml:mi>R</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>connect the present area with known locations:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;- To determine the distance that <inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:mi>r</mml:mi></mml:math></inline-formula> has moved from its historical location,</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;Verify the Mapping:</td>
</tr>
<tr>
<td>If the displacement is less than the threshold</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Approve the mapping plan</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;else: mark as possible misalignment</td>
</tr>
<tr>
<td>Subtract epsilon from <inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:mi>E</mml:mi></mml:math></inline-formula>:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;Compare edges to previously mapped areas for validation.</td>
</tr>
<tr>
<td>Provide the final mapped areas and edges that were discovered.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The last technique checks feature alignment by mapping found areas and edges to known locations and computing displacements. It checks for proper detection by comparing present and past traits and highlighting inconsistencies. The license plate&#x2019;s localization is fine-tuned, and the mapped areas and verified edges are outputted for identification at this stage. The functional description of the mapping and detection is presented in <xref ref-type="table" rid="table-7">Table 7</xref>.</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Functional description of mapping and detection</title>
</caption>
<table>
<colgroup>
<col align="left"/>
</colgroup>
<tbody>
<tr>
<td>1: Computed outputs of <inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>,</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are the inputs for mapping</td>
</tr>
<tr>
<td>2: Estimate the <inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for <inline-formula id="ieqn-157"><mml:math id="mml-ieqn-157"><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-158"><mml:math id="mml-ieqn-158"><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:math></inline-formula> classifications</td>
</tr>
<tr>
<td>3: Perform <inline-formula id="ieqn-159"><mml:math id="mml-ieqn-159"><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for <inline-formula id="ieqn-160"><mml:math id="mml-ieqn-160"><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-161"><mml:math id="mml-ieqn-161"><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:math></inline-formula> as follows:</td>
</tr>
<tr>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<inline-formula id="ieqn-162"><mml:math id="mml-ieqn-162"><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:msup><mml:mi>o</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td> &#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002; <inline-formula id="ieqn-163"><mml:math id="mml-ieqn-163"><mml:mi>&#x03C8;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x003E;</mml:mo><mml:mn>0</mml:mn><mml:mi>f</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>4: Detect the mapping Sequences as defined below:</td>
</tr>
<tr>
<td><inline-formula id="ieqn-164"><mml:math id="mml-ieqn-164"><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003A;</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> such that <inline-formula id="ieqn-165"><mml:math id="mml-ieqn-165"><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-166"><mml:math id="mml-ieqn-166"><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003A;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> such that<inline-formula id="ieqn-167"><mml:math id="mml-ieqn-167"><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2209;</mml:mo><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td>5: Detection of <inline-formula id="ieqn-168"><mml:math id="mml-ieqn-168"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> under the step 3&#x2019;s mapped output as follows:</td>
</tr>
<tr>
<td><inline-formula id="ieqn-169"><mml:math id="mml-ieqn-169"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>&#x003A;</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for maximum <inline-formula id="ieqn-170"><mml:math id="mml-ieqn-170"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-171"><mml:math id="mml-ieqn-171"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mi>v</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> for maximum <inline-formula id="ieqn-172"><mml:math id="mml-ieqn-172"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td>6: Return <inline-formula id="ieqn-173"><mml:math id="mml-ieqn-173"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-174"><mml:math id="mml-ieqn-174"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for the input <inline-formula id="ieqn-175"><mml:math id="mml-ieqn-175"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The proposed method maps the similarity feature between the detected and identified vehicle regions. This aids in leveraging the plate recognition precision with a high F1 score.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mi>&#x03B8;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2217;</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>This method enhances precision by improving the F1 score in this work, which uses the interlinked layer and input layer. This format relies on maximum region extraction and a better convergence rate. The precision is represented as <inline-formula id="ieqn-176"><mml:math id="mml-ieqn-176"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula>, the F1 score is described as <inline-formula id="ieqn-177"><mml:math id="mml-ieqn-177"><mml:mi mathvariant="normal">&#x2207;</mml:mi></mml:math></inline-formula> the recognition that is <inline-formula id="ieqn-178"><mml:math id="mml-ieqn-178"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. In this execution phase, the precision is improved by increasing the F1 score relatively. Thus, the scope of this article is achieved with higher precision and reliable recognition of vehicle license plates.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Computational Complexity</title>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>Preprocessing (Dehazing/Enhancement)</title>
<p>Preprocessing in DR2M includes steps such as resizing, haze removal, and normalization. These operations work across all image pixels, so the processing time grows in direct proportion to image size. The memory requirement is also proportional to the size of the image, as the entire frame must be stored temporarily. This stage prepares input images for reliable feature extraction by enhancing visibility and contrast. The workload is relatively modest and can be reduced further using GPU-accelerated filters. Since each frame is processed independently, the time needed increases in a linear manner with the dataset size, making it suitable for real-time use when optimized.</p>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>Feature Extraction (Region and Edge Features)</title>
<p>Feature extraction identifies both large-scale plate regions and fine-scale character edges. Techniques such as edge detection and region segmentation examine all pixels, so processing time increases in direct proportion to image size. Memory usage is also proportional to image size, as intermediate results like color channels, gradients, and edge maps must be stored. These extracted features are vital for later displacement mapping and classification. Because the operations can be performed in parallel, using a GPU can greatly speed them up. Parameter tuning, such as adaptive threshold settings, helps reduce unnecessary processing while preserving important details even under hazy conditions.</p>
</sec>
<sec id="s3_3_3">
<label>3.3.3</label>
<title>Displacement Feature Mapping</title>
<p>Displacement mapping connects features between the current frame and previous frames to capture haze-induced spatial shifts. In the most demanding case, every detected region may be compared with every other region, which can make this step the most time-consuming in DR2M. Memory usage depends on storing both current and historical feature data, which can be large for high-resolution inputs. This step is the main contributor to overall computational cost, but efficiency is improved by limiting comparisons to likely matches based on geometric constraints and similarity checks. This targeted approach strengthens temporal consistency without overwhelming processing resources.</p>
</sec>
<sec id="s3_3_4">
<label>3.3.4</label>
<title>Similarity Feature Computation</title>
<p>The similarity feature calculation measures how closely matched features from different frames resemble each other in both shape and appearance. This step is relatively lightweight compared to displacement mapping, requiring only simple comparisons between the stored descriptors of regions and edges. Memory requirements are also low, since only key descriptors need to be stored. By acting as a filtering stage before classification it helps remove mismatches and reduces false detections. This directly boosts precision and ensures only stable, consistent matches are kept. Because it uses straightforward comparison operations, it has very little impact on overall processing time.</p>
</sec>
<sec id="s3_3_5">
<label>3.3.5</label>
<title>Bilateral Pathway Inference (Max/Min Processing)</title>
<p>The bilateral pathway is made up of two parallel neural network streams: one that focuses on the largest, most prominent features (such as the plate&#x2019;s outer shape) and another that focuses on the smallest details (such as character edges). Both pathways run simultaneously, which can increase processing time and memory usage compared to single-path networks. However, this design ensures that both coarse shapes and fine details are preserved under hazy conditions, leading to more robust detection. Using GPU parallelization allows these two streams to run in tandem without significant delays, although architectural optimization is important for speed in real-time applications.</p>
</sec>
<sec id="s3_3_6">
<label>3.3.6</label>
<title>Convergence Estimation</title>
<p>Convergence estimation checks whether the displacement mapping results have stabilized over time. It monitors the changes in detected features across successive frames and stops updating when the results become steady. This helps prevent wasted processing and ensures consistent output. The memory and processing demands are relatively low, but repeated checks over large datasets can add some overhead. Optimizations such as early stopping rules, checking in batches, and reducing the number of frames considered can further improve speed. This stage plays an important role in producing stable, noise-resistant recognition results in video sequences or changing environmental conditions.</p>
<p><xref ref-type="sec" rid="s3_3">Section 3.3</xref> provides a detailed computational complexity analysis of DR2M, weighing the trade-off between processing overhead and the precision improvements it delivers. The twin-layer architecture of the bilateral neural network inherently increases both time and space requirements, as it must simultaneously evaluate maximum (region-level) and minimum (edge-level) feature pathways and perform displacement mapping between current and previous frames. Displacement mapping, in particular, can become the most resource-intensive stage, especially when processing high-resolution images or large-scale video datasets in real time. While this design is more demanding than single-path approaches, it enables superior detection accuracy under haze by preserving both coarse geometry and fine details while ensuring temporal stability. To keep the approach practical for real-world deployment, computational optimizations are essential. These include parallel processing on GPUs, pruning of candidate matches to reduce mapping overhead, architectural simplification to eliminate redundant computations, and faster convergence criteria to minimize unnecessary iterations. Together, these measures maintain DR2M&#x2019;s recognition accuracy while allowing it to operate efficiently in challenging, real-time environments. Computational Complexity of DR2M Components are futher given in <xref ref-type="table" rid="table-8">Table 8</xref>.</p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Computational complexity of DR2M components</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th align="center">Component</th>
<th align="center">Description</th>
<th align="center">Time complexity</th>
<th align="center">Space complexity</th>
<th align="center">Notes/Optimizations</th>
</tr>
</thead>
<tbody>
<tr>
<td>Preprocessing</td>
<td>Resizing, haze removal, normalization.</td>
<td>Grows proportionally with image size.</td>
<td>Proportional to image size.</td>
<td>GPU-based filters reduce latency.</td>
</tr>
<tr>
<td>Feature extraction</td>
<td>Region geometry and edge detection.</td>
<td>Proportional to image size.</td>
<td>Proportional to image size.</td>
<td>Parallelizable; adaptive thresholds reduce workload.</td>
</tr>
<tr>
<td>Displacement mapping</td>
<td>Matches features across frames to detect haze-induced shifts.</td>
<td>Potentially quadratic with number of features; reduced via pruning.</td>
<td>Proportional to number of stored features.</td>
<td>Candidate filtering and geometric constraints improve efficiency.</td>
</tr>
<tr>
<td>Similarity computation</td>
<td>Measures match consistency (shape and appearance).</td>
<td>Proportional to number of regions and edges.</td>
<td>Proportional to descriptor count.</td>
<td>Lightweight; minimal effect on runtime.</td>
</tr>
<tr>
<td>Bilateral pathway inference</td>
<td>Dual-stream processing of max (region) and min (edge) features.</td>
<td>Proportional to image size &#x00D7; network depth.</td>
<td>Proportional to feature map size.</td>
<td>GPU parallelization and architecture pruning recommended.</td>
</tr>
<tr>
<td>Convergence estimation</td>
<td>Checks mapping stability across iterations.</td>
<td>Proportional to number of features per check.</td>
<td>Proportional to stored residuals.</td>
<td>Early stopping and batch checks reduce overhead.</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Results and Discussions</title>
<sec id="s4_1">
<label>4.1</label>
<title>Experimental Assessment</title>
<p>The experimental assessment is performed using the CCPD dataset (<ext-link ext-link-type="uri" xlink:href="https://github.com/detectRecog/CCPD">https://github.com/detectRecog/CCPD</ext-link>, accessed on 10 May 2025). This dataset provides 30 thousand vehicle images observed at 720 &#x00D7; 1160-pixel concentrations recorded at 64FPS. From this dataset, 10,000 images are used to train the bilateral network, and 5700 images are used to test the proposed method&#x2019;s efficacy in detecting number plates. The experimental results are tabulated in <xref ref-type="table" rid="table-9">Tables 9</xref> and <xref ref-type="table" rid="table-10">10</xref>, corresponding to the intermediate functions of the methods. Due to its wide library ecosystem, Python 3.9 is suggested for the proposed system&#x2019;s software setup. TensorFlow 2.8 was used to train and build the bidirectional neural network, with PyTorch allowing custom layers and benchmarks. We utilized OpenCV 4.5 for image preprocessing and feature extraction. We used Scikit-Image for complicated transforms. CUDA Toolkit 11.6 and NumPy simplify numerical operations and data processing. Due to its speed and stability, Ubuntu 20.04 LTS fits the development environment. Matplotlib and Seaborn provide visual inspection. Hardware included an Intel Core i9-10900K, a strong multithreaded CPU with ten cores and twenty threads. An NVIDIA GeForce RTX 3080 GPU with 10 GB VRAM enabled fast neural network training and high-resolution picture processing. Due to its 64 GB DDR4 RAM and 1 TB NVMe SSD, this PC can easily manage large files. Using two 27-inch 4K displays for debugging and a 2 TB external hard drive for dataset backup improved visibility. It ensured real-time license plate recognition was efficient, scalable, and reliable under demand.</p>
<table-wrap id="table-9">
<label>Table 9</label>
<caption>
<title>Experimental results for <inline-formula id="ieqn-179"><mml:math id="mml-ieqn-179"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-180"><mml:math id="mml-ieqn-180"><mml:mi>&#x03C6;</mml:mi></mml:math></inline-formula> detection</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Sample</th>
<th><inline-formula id="ieqn-181"><mml:math id="mml-ieqn-181"><mml:msub><mml:mi mathvariant="bold-italic">u</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-182"><mml:math id="mml-ieqn-182"><mml:msub><mml:mi mathvariant="bold-italic">S</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-183"><mml:math id="mml-ieqn-183"><mml:mi mathvariant="bold-italic">&#x03C6;</mml:mi></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-1.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-2.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-3.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-4.tif"/></td>
</tr>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-5.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-6.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-7.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-8.tif"/></td>
</tr>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-9.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-10.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-11.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-12.tif"/></td>
</tr>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-13.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-14.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-15.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-16.tif"/></td>
</tr>
</tbody>
</table>
</table-wrap><table-wrap id="table-10">
<label>Table 10</label>
<caption>
<title>Experimental results for <inline-formula id="ieqn-184"><mml:math id="mml-ieqn-184"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th><inline-formula id="ieqn-185"><mml:math id="mml-ieqn-185"><mml:msub><mml:mi mathvariant="bold-italic">m</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-186"><mml:math id="mml-ieqn-186"><mml:mi mathvariant="bold-italic">v</mml:mi></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-187"><mml:math id="mml-ieqn-187"><mml:msub><mml:mi mathvariant="bold-italic">f</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-17.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-18.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-19.tif"/></td>
</tr>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-20.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-21.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-22.tif"/></td>
</tr>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-23.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-24.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-25.tif"/></td>
</tr>
<tr>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-26.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-27.tif"/></td>
<td><inline-graphic mimetype="image" mime-subtype="png" xlink:href="CMES_69681-inline-28.tif"/></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The suggested DR2M model was assessed utilizing two datasets: the Chinese City Parking Dataset (CCPD) and OpenALPR. Given that CCPD predominantly comprises clear images, synthetic haze was applied to 40% of the data utilizing an atmospheric scattering model, wherein the scattering coefficient &#x003B2; was adjusted between 0.5 and 2.5 to replicate varying haze strengths. Likewise, 30% of the OpenALPR dataset was enhanced with haze to assess the model&#x2019;s generalizability in challenging visual situations. The samples from both datasets were allocated into 70% training, 15% validation, and 15% testing sets to guarantee a rigorous examination.</p>
<p>The DR2M model utilized the Adam optimizer with a starting learning rate of 0.001. A step decay schedule was utilized, halving the learning rate every 10 epochs. The training procedure employed a batch size of 32 and was conducted for a maximum of 50 epochs, incorporating early stopping predicated on validation loss to avert overfitting. The loss function integrated cross-entropy for classification and mean squared error (MSE) for displacement mapping. L2 regularization with a weight decay of 0.0001 and a dropout rate of 0.3 was implemented in the fully connected layers to improve generalization.</p>
<p>A synthetic haze augmentation technique was employed on a portion of the CCPD dataset to replicate hazy conditions, as the original dataset predominantly features clear images. The atmospheric scattering model, grounded on the Koschmieder law, was employed to replicate real-world haze by modifying the image&#x2019;s contrast and color saturation by the following equation: <inline-formula id="ieqn-188"><mml:math id="mml-ieqn-188"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>J</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi>A</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>; where <italic>I</italic>(<italic>x</italic>) represents the observed blurry picture, <inline-formula id="ieqn-189"><mml:math id="mml-ieqn-189"><mml:mi>J</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the scene radiance (original image), A represents the global atmospheric light, and <inline-formula id="ieqn-190"><mml:math id="mml-ieqn-190"><mml:mi>t</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the transmission map modeled as <inline-formula id="ieqn-191"><mml:math id="mml-ieqn-191"><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:math></inline-formula> where <inline-formula id="ieqn-192"><mml:math id="mml-ieqn-192"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> signifies the scattering coefficient and <inline-formula id="ieqn-193"><mml:math id="mml-ieqn-193"><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> indicates the depth. Various levels of haze intensity were generated by adjusting <inline-formula id="ieqn-194"><mml:math id="mml-ieqn-194"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> between 0.5 and 2.5. This augmentation approach enabled the creation of a regulated set of haze-affected samples that maintain spatial organization while replicating authentic environmental degradation. The simulated images were utilized to train and assess the robustness of the DR2M model.</p>
<p>True and false positives will likely maximize detection precision in the self-experimental factors considered. Therefore the varying false rate the true positive rate for <inline-formula id="ieqn-195"><mml:math id="mml-ieqn-195"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-196"><mml:math id="mml-ieqn-196"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is analyzed in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>True positive rate assessment for <inline-formula id="ieqn-197"><mml:math id="mml-ieqn-197"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-198"><mml:math id="mml-ieqn-198"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-5.tif"/>
</fig>
<p>The constraints for <inline-formula id="ieqn-199"><mml:math id="mml-ieqn-199"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-200"><mml:math id="mml-ieqn-200"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> are different as presented in <xref ref-type="table" rid="table-5">Tables 5</xref> and <xref ref-type="table" rid="table-6">6</xref>. The classification rate decides the <inline-formula id="ieqn-201"><mml:math id="mml-ieqn-201"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x222A;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> or<inline-formula id="ieqn-202"><mml:math id="mml-ieqn-202"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> depending on the detected <inline-formula id="ieqn-203"><mml:math id="mml-ieqn-203"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. In the bilateral neural network <inline-formula id="ieqn-204"><mml:math id="mml-ieqn-204"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-205"><mml:math id="mml-ieqn-205"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03C0;</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> are the training insisting cases for <inline-formula id="ieqn-206"><mml:math id="mml-ieqn-206"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> (minimum) and <inline-formula id="ieqn-207"><mml:math id="mml-ieqn-207"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> (maximum). Depending on the <inline-formula id="ieqn-208"><mml:math id="mml-ieqn-208"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> the training for <inline-formula id="ieqn-209"><mml:math id="mml-ieqn-209"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> achievement is pursued. Therefore, the repeated iterations of <inline-formula id="ieqn-210"><mml:math id="mml-ieqn-210"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> maximizes the true positives by reducing the false positives in <inline-formula id="ieqn-211"><mml:math id="mml-ieqn-211"><mml:mi>m</mml:mi><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for all <inline-formula id="ieqn-212"><mml:math id="mml-ieqn-212"><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> defined. Hence the <inline-formula id="ieqn-213"><mml:math id="mml-ieqn-213"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x222A;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> achieves better output compared to <inline-formula id="ieqn-214"><mml:math id="mml-ieqn-214"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2229;</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> (<xref ref-type="fig" rid="fig-5">Fig. 5</xref>). The convergence for <inline-formula id="ieqn-215"><mml:math id="mml-ieqn-215"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-216"><mml:math id="mml-ieqn-216"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> under the increasing iterates is illustrated and assessed as in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title><inline-formula id="ieqn-236"><mml:math id="mml-ieqn-236"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> Assessment for <inline-formula id="ieqn-237"><mml:math id="mml-ieqn-237"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-238"><mml:math id="mml-ieqn-238"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-6.tif"/>
</fig>
<p>The <inline-formula id="ieqn-217"><mml:math id="mml-ieqn-217"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> requirement is mandatory for the <inline-formula id="ieqn-218"><mml:math id="mml-ieqn-218"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-219"><mml:math id="mml-ieqn-219"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> processes defined by the bilateral neural network. The neural network&#x2019;s <inline-formula id="ieqn-220"><mml:math id="mml-ieqn-220"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-221"><mml:math id="mml-ieqn-221"><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> process jointly identify the <inline-formula id="ieqn-222"><mml:math id="mml-ieqn-222"><mml:mi>&#x03C8;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-223"><mml:math id="mml-ieqn-223"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> need to enhance the convergence. The convergence is estimated differently for <inline-formula id="ieqn-224"><mml:math id="mml-ieqn-224"><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-225"><mml:math id="mml-ieqn-225"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> targeting <inline-formula id="ieqn-226"><mml:math id="mml-ieqn-226"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x222A;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-227"><mml:math id="mml-ieqn-227"><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>u</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="false">&#x2C6;</mml:mo></mml:mrow><mml:mrow><mml:mi>g</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>e</mml:mi></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> for convergence. Therefore as <inline-formula id="ieqn-228"><mml:math id="mml-ieqn-228"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> increases the impact of <inline-formula id="ieqn-229"><mml:math id="mml-ieqn-229"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is high compared to <inline-formula id="ieqn-230"><mml:math id="mml-ieqn-230"><mml:mi>&#x03C0;</mml:mi></mml:math></inline-formula> over <inline-formula id="ieqn-231"><mml:math id="mml-ieqn-231"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> through <inline-formula id="ieqn-232"><mml:math id="mml-ieqn-232"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> as either maximum or minimum. Based on the demands of the <inline-formula id="ieqn-233"><mml:math id="mml-ieqn-233"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, this <inline-formula id="ieqn-234"><mml:math id="mml-ieqn-234"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is iterated to maximize <inline-formula id="ieqn-235"><mml:math id="mml-ieqn-235"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> to fasten the license plate region detection (<xref ref-type="fig" rid="fig-6">Fig. 6</xref>).</p>

</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Comparative Assessment</title>
<p>The experimental assessment is validated using recognition precision, F1 score, edge detection rate, detection latency, and false positive rate. The <italic>X</italic>-axis considers the variations in displacement rate [0.05, 0.6] and feature mapping [0.1, 1] to assess their impact on the above metrics. The assessment encompasses EGSANet [<xref ref-type="bibr" rid="ref-28">28</xref>], LEAFDN [<xref ref-type="bibr" rid="ref-32">32</xref>], DLPR [<xref ref-type="bibr" rid="ref-34">34</xref>], and LUCNN&#x002B;SSVM [<xref ref-type="bibr" rid="ref-35">35</xref>] methods from the related works for a comparative presentation.</p>
<p>The recognition precision for the proposed work is high for varying displacement rates and feature mapping. This approach relates to the detection of license plates and extracts the necessary features from the background image. The evaluation step is used to indicate the feature position and identify the changes in the displaced features. The processing step indicates the region and edge-based detection, and finds a better license plate recognition. In this categorization method, two different layers are involved: the first is for the region, and the second is for the edges. This evaluation step observes mapping the current and previous stages of image features. The computation is carried out to analyze the vehicle number plate region and provides the necessary process. In this section, precision is improved along with the F1 score, which provides better recognition. The computation is carried out for both the region and edges and involves interlinking the first and second layers. In this computation process, recognition precision is formulated as <inline-formula id="ieqn-239"><mml:math id="mml-ieqn-239"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>&#x03D1;</mml:mi><mml:mo>+</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> (<xref ref-type="fig" rid="fig-7">Fig. 7</xref>). This method improves recognition precision by 10.27% and 10.54% for the considered variants.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Recognition precision assessment for displacement rate and feature mapping</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-7.tif"/>
</fig>
<p>The F1 score (<xref ref-type="fig" rid="fig-8">Fig. 8</xref>) shows better achievement under displacement rate and feature mapping in this work. This approach identifies a maximum and minimum range of values and employs feature mapping. The feature mapping is carried forward to improve the F1 score in this proposal. This computation step evaluates the license plate recognition from the background image and produces a reliable output. This case involves a bilateral neural network for the two layers associated with the region and edges. Considering this, it provides better license plate recognition from the captured image. In this section, the F1 score is improved by employing the image representation and giving appropriate results. The evaluation is done for the displacement rate and feature mapping, and the desired vehicle recognition is provided. From this processing step, the F1 score is enhanced in this work by equating <inline-formula id="ieqn-240"><mml:math id="mml-ieqn-240"><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:msub><mml:mi>k</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x03B3;</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:mi>&#x03C6;</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. The F1 score is leveraged by 10.57% and 11.4% for the different displacement rates and feature mapping.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>F1 score assessment for displacement rate and feature mapping</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-8.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-9">Fig. 9</xref> presents the edge detection rate comparisons for varying displacement rates and feature mapping. This shows better computation for feature mapping than the previous detection stage. The existing stage involves the displaced position changes acquired from the feature extraction process. This classification model involves the feature position where the displacement occurs due to pixel variations. The processing step involves feature mapping of the vehicle, where the recognition is carried out at the mentioned time interval. This is associated with the mapping of features that indicate the color and size of the input image. It extracts the necessary features from the input image and provides the appropriate result, such as license plate recognition. In this section, the edge detection is carried forward to achieve the maximum region extraction from the displaced features. The edge detection is done post to the region examination that is equated in <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> and it is represented as <inline-formula id="ieqn-241"><mml:math id="mml-ieqn-241"><mml:munder><mml:mo>&#x220F;</mml:mo><mml:mrow><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:msup><mml:mi>O</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>. This proposed method enhances the edge detection by 11.94% and 9.17% for the displacement rate and feature mapping.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Edge detection rate assessment for displacement rate and feature mapping</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-9.tif"/>
</fig>
<p>The proposed work&#x2019;s detection latency is less than the other methods and is processed under two metrics, displacement rate and feature mapping (<xref ref-type="fig" rid="fig-10">Fig. 10</xref>). Based on these factors, it is associated with the reliable detection of license plates and involves the feature extraction process. The extracted features are associated with the latency, which shows the improvement in precision. The precision rate is enhanced in this proposal, which involves a bilateral neural network. It is associated with the license plate recognition and performs the image representation. From the image representation model, the feature extraction is performed, and, in this format, it involves the color and size as the features in this work. These factors indicate the region- and edge-based detection from the image representation. By considering this process, latency is addressed better for reliable processing. In this examination phase, the detection latency decreases to enhance the precision rate and it is represented as <inline-formula id="ieqn-242"><mml:math id="mml-ieqn-242"><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>l</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. This DR2M reduces latency by 11.75% and 9.9% for the displacement rate and feature mapping.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Detection latency assessment for displacement rate and feature mapping</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-10.tif"/>
</fig>
<p><xref ref-type="fig" rid="fig-11">Fig. 11</xref> presents the false positive rate comparisons for varying displacement rates and feature mapping. Reducing this achieves better vehicle license plate recognition and estimates the convergence rate associated with the maximum and minimum region. This approach defines the recognition of the number plate and is associated with the training phase of the bilateral neural network. This format determines the segmentation characteristics involving the regions and edges. The evaluation step is used to indicate the two different layers, and it involves the detection of the displacement of the feature position and its changes. It is associated with the varying position changes that occur during the acquisition of the input image. The image representation is used to indicate reliable processing and provide better recognition. In this approach, it shows that the false rate positive is reduced and it is formulated as <inline-formula id="ieqn-243"><mml:math id="mml-ieqn-243"><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mspace width="thinmathspace" /><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>u</mml:mi><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. Here, the convergence rate and variation in the features are considered, and the result for the mentioned time interval is provided. The false positives are confined to 9.73% and 9.58% for the proposed method&#x2019;s different displacement rates and feature mappings.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>False positive rate assessment for displacement rate and feature mapping</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_69681-fig-11.tif"/>
</fig>
<p>The DR2M model&#x2019;s exceptional performance is due to its bilateral neural network architecture, which concurrently processes region-level and edge-level data. This dual-path architecture enables the model to maintain coarse structures such as plate form and size while simultaneously preserving intricate character edges, even within haze-induced visual distortion. In ambiguous images, when pixel values fluctuate due to scattering, the edge path aids in preserving discernible features, while the region path guarantees contextual coherence. The displacement feature mapping process aligns features across frames or image variants, compensating for pixel-level drift caused by haze. These solutions diminish false positives and improve localization accuracy. Nonetheless, the trade-off involves heightened computing complexity resulting from dual-path inference and convergence estimates. Nevertheless, DR2M preserves real-time functionality and provides reliable accuracy, particularly in areas with limited visibility, rendering it very appropriate for intelligent transportation applications.</p>
<p>The suggested approach considers several important factors to improve accuracy and decrease false positives in number plate identification, especially in difficult weather situations like haze. To solve the problem of false positives in license plate identification, which is particularly prevalent in difficult weather situations like haze, the suggested approach employs a bidirectional neural network that prioritizes maximum region and minimum edge extraction to guarantee correct feature detection. The technique differentiates between background objects that may be mistaken for license plates and the real location of the plate using displacement feature mapping. The system employs a mix of size- and colour-based feature extraction to reduce the likelihood of mistaking the license plate for other, similarly sized items or ambient noise in foggy environments. This improves accuracy in low-light or otherwise challenging environments by directing the model&#x2019;s processing capacity to the area most likely to contain the license plate, decreasing the possibility of false positives.</p>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Mean Average Precision (mAP)</title>
<p>The proposed model (DR2M) Mean Average Precision (mAP), as shown in <xref ref-type="table" rid="table-11">Table 11</xref> was compared to other state-of-the-art approaches, such as EGSANet, LEAFDN, DLPR, and LUCNN&#x002B;SSVM. Including mAP in haze-related investigations is essential for proving the method&#x2019;s dependability and generalizability. When the model&#x2019;s mAP stays high in clear and foggy situations, the approach can handle real-world differences in weather and atmospheric conditions, which is a big deal. It shows how successful the method is in practice. To guarantee that mAP represents performance across many difficulties, datasets used to evaluate it, such as CCPD or OpenALPR, must incorporate various situations. For a more accurate and representative mAP computation, it is helpful to have a dataset that includes photographs taken in various lighting situations, including bright, dim, and foggy. This will give us a better idea of how the model would do in real-world scenarios. Using Mean Average Precision (mAP) as the statistic, the comparison table showcases the efficacy of several license plate identification systems across two datasets&#x2014;CCPD and OpenALPR. With an impressive mAP of 95.68% on CCPD and 94.68% on OpenALPR, DR2M has the best performance, showing that it is the most accurate and resilient in detecting license plates in various situations. Although it lags slightly behind DR2M, EGSANet demonstrates good generalisation with mAP values of 91.22% on OpenALPR and 89.75% on CCPD. LEAFDN and DLPR demonstrate reasonable accuracy, particularly in more difficult real-world scenarios (CCPD), with comparatively lower mAP values. LEAFDN scored 83.42% and 84.91%, while DLPR achieved 84.54% and 85.54%. Despite DR2M&#x2019;s superior performance, LUCNN&#x002B;SSVM adapts to different contexts and achieves outstanding results, especially on the OpenALPR dataset (mAP &#x003D; 89.48%). Other approaches demonstrate inconsistent performance when faced with real-world problems, but DR2M remains dominant throughout both datasets.</p>
<table-wrap id="table-11">
<label>Table 11</label>
<caption>
<title>Measure of average precision (mAP) for the various LPR systems</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>mAP (CCPD)%</th>
<th>mAP (Open ALPR)%</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>EGSANet</bold></td>
<td>89.75</td>
<td>91.22</td>
</tr>
<tr>
<td><bold>LEAFDN</bold></td>
<td>83.42</td>
<td>84.91</td>
</tr>
<tr>
<td><bold>DLPR</bold></td>
<td>84.54</td>
<td>85.54</td>
</tr>
<tr>
<td><bold>LUCNN&#x002B;SSVM</bold></td>
<td>88.48</td>
<td>89.48</td>
</tr>
<tr>
<td><bold>DR2M</bold></td>
<td>95.68</td>
<td>94.68</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>Throughput</title>
<p>A critical performance indicator in number plate recognition is throughput, which quantifies the number of pictures processed by a system per second (or some other time unit). It demonstrates the efficiency of a technique in handling computations and its effectiveness with larger datasets or real-time scenarios. The performance in real-time settings is better when the throughput is larger. The performance of several approaches for the CCPD and OpenALPR datasets is compared in <xref ref-type="table" rid="table-12">Table 12</xref>. Crucial for real-time license plate identification applications, DR2M processes 67.5 photos per second on CCPD and 66.4 images per second on OpenALPR, demonstrating its computational efficiency. While DR2M attains somewhat higher throughput numbers, EGSANet maintains efficiency and obtains strong throughput values on CCPD and OpenALPR, with 60.6 and 61.8 images/sec, respectively. This is especially true for bigger datasets. DLPR and LEAFDN exhibit reasonable efficiency but lower throughput (46.9 to 49.5 images/sec) when handling larger or more complex datasets, such as OpenALPR. Although LUCNN&#x002B;SSVM demonstrates respectable efficiency, it falls just short of top-performing algorithms like DR2M, with throughputs of 60.8 and 61.1 images/sec on CCPD and OpenALPR, respectively. Although EGSANet and LUCNN&#x002B;SSVM offer competitive performance, they cannot match DR2M&#x2019;s ability to manage real-time processing demands.</p>
<table-wrap id="table-12">
<label>Table 12</label>
<caption>
<title>Throughput comparison</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>mAP (CCPD)%</th>
<th>mAP (Open ALPR)%</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>EGSANet</bold></td>
<td>55.6</td>
<td>54.6</td>
</tr>
<tr>
<td><bold>LEAFDN</bold></td>
<td>48.3</td>
<td>47.3</td>
</tr>
<tr>
<td><bold>DLPR</bold></td>
<td>50.5</td>
<td>49.5</td>
</tr>
<tr>
<td><bold>LUCNN&#x002B;SSVM</bold></td>
<td>60.8</td>
<td>61.8</td>
</tr>
<tr>
<td><bold>DR2M</bold></td>
<td>67.5</td>
<td>66.4</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The recommended technique improves processing efficiency and recognition accuracy with many significant advances. A bidirectional network architecture increases feature extraction by combining coarse and fine data. This speeds up and lightens computer photo processing without affecting quality. This dual-pathway strategy helps the model handle large datasets and infer faster, increasing throughput. The training area decreases until it hits the minimum maximum region borders on both sides. This emphasis enhances the model&#x2019;s Mean Average Precision (mAP) and ensures system efficiency, making it suitable for real-time license plate identification. These advancements outperform earlier systems&#x2019; computational efficiency and recognition abilities, providing a reliable solution that balances speed and accuracy.</p>
<p>This work presents a new approach to license plate identification in haze-affected settings, emphasising fixing pixel displacement and feature distortions brought about by weather and other environmental factors. The technique employs sophisticated displacement mapping with a bidirectional neural network to ensure features are correctly aligned across frames. With this new development, we can be certain that region and edge extraction will be accurate, increasing the flexibility of identification in dynamic and complicated situations like limited visibility and background noise. The approach provides a substantial improvement in efficiently dealing with complex real-world scenarios.</p>
<p><xref ref-type="table" rid="table-13">Table 13</xref> illustrates that DR2M surpasses current methodologies by integrating architectural advancements with haze-specific improvements. Although EGSANet employs edge attention algorithms, it fails to include pixel displacement, a limitation that DR2M addresses proficiently via displacement feature mapping. In contrast to DLPR and LEAFDN, which experience performance declines in hazy conditions due to their dependence on distinct contour borders, DR2M preserves edge sharpness and structural alignment through bilateral processing. Hybrid models such as LUCNN&#x002B;SSVM prioritize classifier-level accuracy but exhibit insufficient dynamic adaptability in distorted environments, a limitation that DR2M mitigates with its convergence estimation module.</p>
<table-wrap id="table-13">
<label>Table 13</label>
<caption>
<title>Comparative analysis of DR2M with related studies</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th align="center">Study/Method</th>
<th align="center">Key features</th>
<th align="center">Weaknesses in Haze conditions</th>
<th align="center">mAP (%) (CCPD)</th>
<th align="center">F1 Score (%)</th>
<th align="center">Notable advantage of DR2M</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>EGSANet [<xref ref-type="bibr" rid="ref-28">28</xref>]</bold></td>
<td>Edge-Guided Sparse Attention</td>
<td>No correction for displaced features</td>
<td>89.75</td>
<td>91.20</td>
<td>Adds displacement mapping &#x002B; convergence</td>
</tr>
<tr>
<td><bold>DLPR [<xref ref-type="bibr" rid="ref-34">34</xref>]</bold></td>
<td>Deep learning-based plate recognition</td>
<td>Sensitive to haze; lacks region alignment</td>
<td>84.54</td>
<td>85.57</td>
<td>Robust to haze via temporal feature tracking</td>
</tr>
<tr>
<td><bold>LEAFDN [<xref ref-type="bibr" rid="ref-32">32</xref>]</bold></td>
<td>Character enhancement using attention</td>
<td>Weak boundary detection under fog</td>
<td>83.42</td>
<td>84.91</td>
<td>Better edge extraction under poor visibility</td>
</tr>
<tr>
<td><bold>LUCNN&#x002B;SSVM [<xref ref-type="bibr" rid="ref-35">35</xref>]</bold></td>
<td>CNN &#x002B; SVM hybrid classifier</td>
<td>Limited adaptation to haze-induced noise</td>
<td>88.48</td>
<td>89.30</td>
<td>Bilateral layers improve generalization</td>
</tr>
<tr>
<td><bold>Shashirangana et al. [<xref ref-type="bibr" rid="ref-41">41</xref>]</bold></td>
<td>NAS for edge deployment</td>
<td>Lightweight but lacks haze resilience</td>
<td>N/A</td>
<td>&#x007E;85.00</td>
<td>Prioritizes robustness over model size</td>
</tr>
<tr>
<td><bold>Tang et al. [<xref ref-type="bibr" rid="ref-43">43</xref>]</bold></td>
<td>Ultra-lightweight for microcontrollers</td>
<td>High speed, low haze robustness</td>
<td>N/A</td>
<td>&#x007E;82.00</td>
<td>Maintains accuracy in degraded visibility</td>
</tr>
<tr>
<td><bold>Proposed DR2M</bold></td>
<td>Bilateral NN &#x002B; Displacement Mapping &#x002B; Convergence</td>
<td>Slightly higher compute load</td>
<td>95.68</td>
<td>94.68</td>
<td>Superior haze handling and edge precision</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>While the lightweight solutions proposed by Shashirangana et al. and Tang et al. demonstrate resource efficiency, they compromise robustness, especially in hazy or low-contrast environments. DR2M, although marginally more computationally demanding, achieves a balance of robustness, precision, and practical reliability, as demonstrated by its superior mAP and F1 scores on benchmark datasets such as CCPD. DR2M is positioned as a technically and practically superior solution for license plate recognition in challenging environmental circumstances.</p>
<p>DR2M is especially appropriate for implementation in intelligent traffic surveillance systems, automated toll booths, and smart parking infrastructure, where environmental factors like haze, fog, or smog frequently diminish image clarity. Its capacity to manage haze-induced feature displacement renders it dependable for outdoor applications in diverse weather and illumination circumstances.</p>
<p>The bidirectional neural network architecture allows the model to achieve high detection accuracy without dependence on high-resolution or improved inputs, hence minimizing the necessity for costly preprocessing hardware. The model can be implemented into GPU-based edge devices or embedded systems that accommodate moderate computational demands, facilitating near real-time processing.</p>
<p>In smart cities, DR2M can be integrated into roadside cameras or traffic drones to oversee vehicle compliance and detect infractions. It can additionally assist law enforcement, urban planning, and transportation analytics in regions impacted by environmental deterioration. Subsequent optimization techniques, such as quantization or model trimming, might enhance deployment efficiency in low-resource settings.</p>
<p>Traditional dehazing methods predominantly aim to restore image clarity via contrast augmentation or atmospheric light modeling; however, they frequently neglect to address spatial misalignment resulting from haze-induced pixel displacement. Our approach mitigates this deficiency by explicitly modeling feature displacement using a neural mapping mechanism that monitors the movement of essential visual characteristics (e.g., plate borders, character boundaries) across consecutive or spatially distorted frames. This is essential in situations where repaired photos continue to result in erroneous detection due to minor misalignments.</p>
<p>To assess its contribution, we conducted ablation research, comparing the complete DR2M model with a baseline version that omits the displacement mapping component. The findings indicate a 7.84% decline in F1 score and a notable rise in false positives, corroborating that displacement mapping substantially improves both feature convergence and plate localization precision under hazy conditions. This illustrates that our methodology is both innovative and crucial for addressing the structural constraints of conventional dehazing and detection frameworks.</p>
<p>DR2M outperforms others by combining displacement feature mapping for haze-induced drift correction, bilateral pathways for preserving both region structure and fine edges, and convergence estimation for temporal stability. These components jointly enhance robustness, precision, and recall, addressing limitations of existing methods in challenging, haze-affected license plate recognition scenarios.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion and Future Work</title>
<p>The displacement region recognition method is designed in this article to improve the license plate detection precision in haze weather. The proposed method eyed displacement that generates false positives. These displacement features, scattered region-wise, are identified using a bilateral neural network. The first step is edge detection, in which the maximum regions are identified for computing displaced features. This network is trained using the convergence factor, which is designed to achieve maximum region and minimum edge detection. The convergence validation is monotonous for any number of extracted frames from the input based on edge dimensions. The bilateral neural network is trained using training inputs from the experimental dataset. The later training is pursued using the convergence factor based on precise feature mapping between the identified regions. If the areas overlap the edges, the training is halted to detect the license plate region. In particular, the F1 score metric is optimal in detecting the similarity features between the training and testing inputs to improve precision. Thus, this method achieves a 10.27% high recognition precision for the maximum displacement factor, a 10.57% high F1 score, and a 9.73% lower false positive rate.</p>
<p>Although the proposed DR2M is reliable in identifying precise regions, the problem of intensity variations in the rendezvous edge and region boundaries was observed. The extracted feature required a more complex false rate assessment to achieve convergence at these points. Therefore, to address this problem, a saturation-dependent normalization for edge splitting will be incorporated in this work. This concept targets minimal feature differentiation in such rendezvous points. The computational expense of bidirectional neural networks inhibits their use in real-time applications, particularly in high-resolution video streams.</p>
<p>Additionally, real-time performance validation is lacking. Nighttime and license plate blending may also lead to the model&#x2019;s color-and-size-based approach to underperform. Complex environmental conditions like dense fog, high glare, or object occlusion make feature extraction harder for the model. Future work will focus on real-time compute efficiency and resilience features like texture and depth. Improve model accuracy in complex situations using adaptive feature selection and advanced dehazing methods, such as dynamic area scaling depending on environmental context. Testing the model in more scenarios and datasets will improve its practicality.</p>
</sec>
</body>
<back>
<ack>
<p>Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2025R848), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. The authors extend their appreciation to the Deanship of Scientific Research at Northern Border University, Arar, Saudi Arabia for funding this research work through the project number &#x201C;NBU-FFR-2025-2932-09&#x201D;.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This study was supported by the Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2025R848), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia. The authors extend their appreciation to the Deanship of Scientific Research at Northern Border University, Arar, Saudi Arabia for funding this research work through the project number &#x201C;NBU-FFR-2025-2932-09&#x201D;.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Mohammed Albekairi, Radhia Khdhir; data collection: Amina Magdich; analysis and interpretation of results: Mohammed Albekairi, Radhia Khdhir, Somia Asklany; draft manuscript preparation: Ghulam Abbas, Amr Yousef. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The authors will make the data available upon request to the corresponding Author.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<glossary content-type="abbreviations" id="glossary-1">
<title>Notations Used in Mathematical Formulations</title>
<def-list>
<def-item>
<term><bold>Symbol/Notation</bold></term>
<def>
<p><bold>Description</bold></p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-244"><mml:math id="mml-ieqn-244"><mml:mi>I</mml:mi></mml:math></inline-formula></term>
<def>
<p>Input image or frame</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-245"><mml:math id="mml-ieqn-245"><mml:mrow><mml:mover><mml:mi>I</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula></term>
<def>
<p>Background or haze-affected input image</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-246"><mml:math id="mml-ieqn-246"><mml:mi>F</mml:mi></mml:math></inline-formula></term>
<def>
<p>Extracted features from the input</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-247"><mml:math id="mml-ieqn-247"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Color-based features (e.g., RGB, grayscale)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-248"><mml:math id="mml-ieqn-248"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Size-related features (e.g., font size, plate width)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-249"><mml:math id="mml-ieqn-249"><mml:mi>R</mml:mi></mml:math></inline-formula></term>
<def>
<p>Region-based features (plate area, shape, etc.)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-250"><mml:math id="mml-ieqn-250"><mml:mi>E</mml:mi></mml:math></inline-formula></term>
<def>
<p>Edge-based features (boundaries, contours)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-251"><mml:math id="mml-ieqn-251"><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow></mml:math></inline-formula></term>
<def>
<p>Loss function (cross-entropy or mean squared error)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-252"><mml:math id="mml-ieqn-252"><mml:mi>&#x03B7;</mml:mi></mml:math></inline-formula></term>
<def>
<p>Learning rate used in gradient-based optimization</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-253"><mml:math id="mml-ieqn-253"><mml:mtext>&#x003B5;</mml:mtext></mml:math></inline-formula></term>
<def>
<p>Threshold for displacement or error tolerance</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-254"><mml:math id="mml-ieqn-254"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Displacement of features across frames due to haze</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-255"><mml:math id="mml-ieqn-255"><mml:mi>T</mml:mi></mml:math></inline-formula></term>
<def>
<p>Time or frame index in temporal processing</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-256"><mml:math id="mml-ieqn-256"><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>License plate attribute vector (comprising size, color, etc.)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-257"><mml:math id="mml-ieqn-257"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Boundary attributes (e.g., bounding box for max/min regions)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-258"><mml:math id="mml-ieqn-258"><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Set of detected displaced features</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-259"><mml:math id="mml-ieqn-259"><mml:mi>&#x03B4;</mml:mi></mml:math></inline-formula></term>
<def>
<p>Haze-induced pixel variation or noise</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-260"><mml:math id="mml-ieqn-260"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula></term>
<def>
<p>Region assessment score (used in convergence calculations)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-261"><mml:math id="mml-ieqn-261"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula></term>
<def>
<p>Classification confidence or score</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-262"><mml:math id="mml-ieqn-262"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula></term>
<def>
<p>Neural network parameters (weights, biases)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-263"><mml:math id="mml-ieqn-263"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Maximum region extracted (e.g., whole license plate area)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-264"><mml:math id="mml-ieqn-264"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Minimum region extracted (e.g., plate text or fine details)</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-265"><mml:math id="mml-ieqn-265"><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></term>
<def>
<p>Convergence validation variable for matching displaced features</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-266"><mml:math id="mml-ieqn-266"><mml:mi mathvariant="normal">&#x2207;</mml:mi><mml:mrow><mml:mi>&#x02112;</mml:mi></mml:mrow></mml:math></inline-formula></term>
<def>
<p>Gradient of loss concerning model parameters</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-267"><mml:math id="mml-ieqn-267"><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:math></inline-formula></term>
<def>
<p>Ratio of correctly identified plates to total detected</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-268"><mml:math id="mml-ieqn-268"><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mspace width="thinmathspace" /><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:math></inline-formula></term>
<def>
<p>Harmonic mean of precision and recall</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-269"><mml:math id="mml-ieqn-269"><mml:mi>m</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi></mml:math></inline-formula></term>
<def>
<p>Mean Average Precision across all test samples</p>
</def>
</def-item>
<def-item>
<term><inline-formula id="ieqn-270"><mml:math id="mml-ieqn-270"><mml:mi>T</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>g</mml:mi><mml:mi>h</mml:mi><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula></term>
<def>
<p>Number of images processed per second</p>
</def>
</def-item>
</def-list>
</glossary>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ding</surname> <given-names>H</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yuan</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>An end-to-end contrastive license plate detector</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2023</year>;<volume>25</volume>(<issue>1</issue>):<fpage>503</fpage>&#x2013;<lpage>16</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Mu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>GroupPlate: toward multi-category license plate recognition</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2023</year>;<volume>24</volume>(<issue>5</issue>):<fpage>5586</fpage>&#x2013;<lpage>99</lpage>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fan</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>W</given-names></string-name></person-group>. <article-title>Improving robustness of license plates automatic recognition in natural scenes</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2022</year>;<volume>23</volume>(<issue>10</issue>):<fpage>18845</fpage>&#x2013;<lpage>54</lpage>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alshahir</surname> <given-names>A</given-names></string-name>, <string-name><surname>Kaaniche</surname> <given-names>K</given-names></string-name>, <string-name><surname>Abbas</surname> <given-names>G</given-names></string-name>, <string-name><surname>Mercorelli</surname> <given-names>P</given-names></string-name>, <string-name><surname>Albekairi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alanazi</surname> <given-names>MD</given-names></string-name></person-group>. <article-title>A study on the performance of adaptive neural networks for haze reduction with a focus on precision</article-title>. <source>Mathematics</source>. <year>2024</year>;<volume>12</volume>(<issue>16</issue>):<fpage>2526</fpage>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zou</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Yan</surname> <given-names>J</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>H</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>License plate detection and recognition based on YOLOv3 and ILPRNET</article-title>. <source>Signal Image Video Process</source>. <year>2022</year>;<volume>16</volume>(<issue>2</issue>):<fpage>473</fpage>&#x2013;<lpage>80</lpage>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Shao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>F</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>B</given-names></string-name>, <string-name><surname>Gong</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Research on license plate location and recognition in complex environment</article-title>. <source>J Real Time Image Process</source>. <year>2022</year>;<volume>19</volume>(<issue>4</issue>):<fpage>823</fpage>&#x2013;<lpage>37</lpage>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Luo</surname> <given-names>S</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Research on car license plate recognition based on improved YOLOv5m and LPRNet</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>:<fpage>93692</fpage>&#x2013;<lpage>700</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2022.3203388</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shakeel</surname> <given-names>PM</given-names></string-name>, <string-name><surname>Arunkumar</surname> <given-names>N</given-names></string-name>, <string-name><surname>Abdulhay</surname> <given-names>E</given-names></string-name></person-group>. <article-title>Automated multimodal background detection and shadow removal process using robust principal fuzzy gradient partial equation methods in intelligent transportation systems</article-title>. <source>Int J Heavy Veh Syst</source>. <year>2018</year>;<volume>25</volume>(<issue>3&#x2013;4</issue>):<fpage>271</fpage>&#x2013;<lpage>85</lpage>. doi:<pub-id pub-id-type="doi">10.1504/ijhvs.2018.094824</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Pan</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Tang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Tjahjadi</surname> <given-names>T</given-names></string-name></person-group>. <article-title>LPSRGAN: generative adversarial networks for super-resolution of license plate image</article-title>. <source>Neurocomputing</source>. <year>2024</year>;<volume>580</volume>:<fpage>127426</fpage>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lee</surname> <given-names>YY</given-names></string-name>, <string-name><surname>Halim</surname> <given-names>ZA</given-names></string-name>, <string-name><surname>Ab Wahab</surname> <given-names>MN</given-names></string-name></person-group>. <article-title>License plate detection using convolutional neural network-back to the basic with design of experiments</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>:<fpage>22577</fpage>&#x2013;<lpage>85</lpage>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jia</surname> <given-names>W</given-names></string-name>, <string-name><surname>Xie</surname> <given-names>M</given-names></string-name></person-group>. <article-title>An efficient license plate detection approach with deep convolutional neural networks in unconstrained scenarios</article-title>. <source>IEEE Access</source>. <year>2023</year>;<volume>11</volume>:<fpage>85626</fpage>&#x2013;<lpage>39</lpage>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ye</surname> <given-names>F</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Misshaped boundary classifier model for license plate detection in haze weather using entropy CNN</article-title>. <source>Inf Sci</source>. <year>2025</year>;<volume>690</volume>:<fpage>121530</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ins.2024.121530</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Pan</surname> <given-names>X</given-names></string-name>, <string-name><surname>Li</surname> <given-names>S</given-names></string-name>, <string-name><surname>Li</surname> <given-names>R</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>N</given-names></string-name></person-group>. <article-title>A hybrid deep learning algorithm for the license plate detection and recognition in vehicle-to-vehicle communications</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2022</year>;<volume>23</volume>(<issue>12</issue>):<fpage>23447</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.21203/rs.3.rs-3050753/v1</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ibrahim</surname> <given-names>H</given-names></string-name>, <string-name><surname>Fahmy</surname> <given-names>OM</given-names></string-name>, <string-name><surname>Elattar</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>License plate image analysis empowered by generative adversarial neural networks (GANs)</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>:<fpage>30846</fpage>&#x2013;<lpage>57</lpage>. doi:<pub-id pub-id-type="doi">10.1109/access.2022.3157714</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Pham</surname> <given-names>TA</given-names></string-name></person-group>. <article-title>Effective deep neural networks for license plate detection and recognition</article-title>. <source>Vis Comput</source>. <year>2023</year>;<volume>39</volume>(<issue>3</issue>):<fpage>927</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00371-021-02375-0</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Moussaoui</surname> <given-names>H</given-names></string-name>, <string-name><surname>Akkad</surname> <given-names>NE</given-names></string-name>, <string-name><surname>Benslimane</surname> <given-names>M</given-names></string-name>, <string-name><surname>El-Shafai</surname> <given-names>W</given-names></string-name>, <string-name><surname>Baihan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Hewage</surname> <given-names>C</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Enhancing automated vehicle identification by integrating YOLO v8 and OCR techniques for high-precision license plate detection and recognition</article-title>. <source>Sci Rep</source>. <year>2024</year>;<volume>14</volume>(<issue>1</issue>):<fpage>14389</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41598-024-65272-1</pub-id>; <pub-id pub-id-type="pmid">38909147</pub-id></mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Muhammad</surname> <given-names>J</given-names></string-name>, <string-name><surname>Altun</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Guiding genetic search algorithm with ANN based fitness function: a case study using structured HOG descriptors for license plate detection</article-title>. <source>Multimed Tools Appl</source>. <year>2023</year>;<volume>82</volume>(<issue>12</issue>):<fpage>17979</fpage>&#x2013;<lpage>97</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11042-022-14195-y</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Song</surname> <given-names>H</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Tao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Cross stage partial dilated convolution network for license plate recognition</article-title>. <source>Int J Control Autom Syst</source>. <year>2024</year>;<volume>22</volume>:<fpage>2029</fpage>&#x2013;<lpage>37</lpage>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Silva</surname> <given-names>SM</given-names></string-name>, <string-name><surname>Jung</surname> <given-names>CR</given-names></string-name></person-group>. <article-title>A flexible approach for automatic license plate recognition in unconstrained scenarios</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2021</year>;<volume>23</volume>(<issue>6</issue>):<fpage>5693</fpage>&#x2013;<lpage>703</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jiang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>F</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>H</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yao</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>An efficient and unified recognition method for multiple license plates in unconstrained scenarios</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2023</year>;<volume>24</volume>(<issue>5</issue>):<fpage>5376</fpage>&#x2013;<lpage>89</lpage>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>HY</given-names></string-name>, <string-name><surname>Li</surname> <given-names>YQ</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>DT</given-names></string-name></person-group>. <article-title>System implementation of multiple license plate detection and correction on wide-angle images using an instance segmentation network model</article-title>. <source>IEEE Trans Consum Electron</source>. <year>2023</year>;<volume>70</volume>(<issue>1</issue>):<fpage>4425</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tce.2023.3345534</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Yuan</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name></person-group>. <article-title>LSV-LP: large-scale video-based license plate detection and recognition</article-title>. <source>IEEE Trans Pattern Anal Mach Intell</source>. <year>2022</year>;<volume>45</volume>(<issue>1</issue>):<fpage>752</fpage>&#x2013;<lpage>67</lpage>; <pub-id pub-id-type="pmid">35196230</pub-id></mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ramajo-Ballester</surname> <given-names>&#x00C1;.</given-names></string-name>, <string-name><surname>Moreno</surname> <given-names>JMA</given-names></string-name>, <string-name><surname>de la Escalera Hueso</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Dual license plate recognition and visual features encoding for vehicle identification</article-title>. <source>Robot Auton Syst</source>. <year>2024</year>;<volume>172</volume>:<fpage>104608</fpage>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ke</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>G</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>W</given-names></string-name></person-group>. <article-title>An ultra-fast automatic license plate recognition approach for unconstrained scenarios</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2023</year>;<volume>24</volume>(<issue>5</issue>):<fpage>5172</fpage>&#x2013;<lpage>85</lpage>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cao</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Investigation of a convolutional neural network-based approach for license plate detection</article-title>. <source>J Opt</source>. <year>2024</year>;<volume>53</volume>(<issue>1</issue>):<fpage>697</fpage>&#x2013;<lpage>703</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s12596-023-01243-5</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Qin</surname> <given-names>S</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Towards end-to-end car license plate location and recognition in unconstrained scenarios</article-title>. <source>Neural Comput Appl</source>. <year>2022</year>;<volume>34</volume>(<issue>24</issue>):<fpage>21551</fpage>&#x2013;<lpage>66</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00521-021-06147-8</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>P</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>H</given-names></string-name></person-group>. <article-title>A GPU-free license plate detection based on fused color-edge and Retina approach</article-title>. <source>Multimed Tools Appl</source>. <year>2024</year>;<volume>83</volume>(<issue>7</issue>):<fpage>18649</fpage>&#x2013;<lpage>66</lpage>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kim</surname> <given-names>D</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>J</given-names></string-name>, <string-name><surname>Park</surname> <given-names>E</given-names></string-name></person-group>. <article-title>AFA-Net: adaptive feature attention network in image deblurring and super-resolution for improving license plate recognition</article-title>. <source>Comput Vis Image Underst</source>. <year>2024</year>;<volume>238</volume>:<fpage>103879</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cviu.2023.103879</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>B</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>S</given-names></string-name></person-group>. <article-title>TOCNet: a target occlusion contrast network for license plate detection in waterways</article-title>. <source>Expert Syst Appl</source>. <year>2024</year>;<volume>238</volume>:<fpage>122081</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.eswa.2023.122081</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Seo</surname> <given-names>TM</given-names></string-name>, <string-name><surname>Kang</surname> <given-names>DJ</given-names></string-name></person-group>. <article-title>A robust layout-independent license plate detection and recognition model based on attention method</article-title>. <source>IEEE Access</source>. <year>2022</year>;<volume>10</volume>:<fpage>57427</fpage>&#x2013;<lpage>36</lpage>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shahidi Zandi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Rajabi</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Deep learning based framework for Iranian license plate detection and recognition</article-title>. <source>Multimed Tools Appl</source>. <year>2022</year>;<volume>81</volume>(<issue>11</issue>):<fpage>15841</fpage>&#x2013;<lpage>58</lpage>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>D</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>N</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name></person-group>. <article-title>License plate recognition system in unconstrained scenes via a new image correction scheme and improved CRNN</article-title>. <source>Expert Syst Appl</source>. <year>2024</year>;<volume>243</volume>:<fpage>122878</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.eswa.2023.122878</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Vizcarra</surname> <given-names>C</given-names></string-name>, <string-name><surname>Alhamed</surname> <given-names>S</given-names></string-name>, <string-name><surname>Algosaibi</surname> <given-names>A</given-names></string-name>, <string-name><surname>Alnaeem</surname> <given-names>M</given-names></string-name>, <string-name><surname>Aldalbahi</surname> <given-names>A</given-names></string-name>, <string-name><surname>Aljaafari</surname> <given-names>N</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Deep learning adversarial attacks and defenses on license plate recognition system</article-title>. <source>Cluster Comput</source>. <year>2024</year>;<volume>27</volume>:<fpage>11627</fpage>&#x2013;<lpage>44</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10586-024-04513-4</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>G</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>H</given-names></string-name></person-group>. <article-title>EGSANet: edge-guided sparse attention network for improving license plate detection in the wild</article-title>. <source>Appl Intell</source>. <year>2022</year>;<volume>52</volume>:<fpage>4458</fpage>&#x2013;<lpage>72</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10489-021-02628-4</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ramasamy</surname> <given-names>S</given-names></string-name>, <string-name><surname>Selvarajan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Kaliyaperumal</surname> <given-names>V</given-names></string-name>, <string-name><surname>Aruchamy</surname> <given-names>P</given-names></string-name></person-group>. <article-title>A hybrid location-dependent ultra-convolutional neural network-based vehicle number plate recognition approach for intelligent transportation systems</article-title>. <source>Concurr Comput</source>. <year>2023</year>;<volume>35</volume>(<issue>8</issue>):<fpage>e7615</fpage>. doi:<pub-id pub-id-type="doi">10.1002/cpe.7615</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yan</surname> <given-names>R</given-names></string-name>, <string-name><surname>Hong</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>J</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Multilayer memristive neural network circuit based on online learning for license plate detection</article-title>. <source>IEEE Trans Comput Aided Des Integr Circuits Syst</source>. <year>2021</year>;<volume>41</volume>(<issue>9</issue>):<fpage>3000</fpage>&#x2013;<lpage>11</lpage>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Subramanian</surname> <given-names>R</given-names></string-name>, <string-name><surname>Aruchamy</surname> <given-names>P</given-names></string-name></person-group>. <article-title>An effective speech emotion recognition Model for multi-regional languages using threshold-based feature selection algorithm</article-title>. <source>Circ Syst Signal Process</source>. <year>2024</year>;<volume>43</volume>(<issue>4</issue>):<fpage>2477</fpage>&#x2013;<lpage>506</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00034-023-02571-4</pub-id>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>W</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>C</given-names></string-name>, <string-name><surname>Tian</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Vehicle re-identification method based on multi-task learning in foggy scenarios</article-title>. <source>Mathematics</source>. <year>2024</year>;<volume>12</volume>(<issue>14</issue>):<fpage>2247</fpage>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alharbi</surname> <given-names>F</given-names></string-name>, <string-name><surname>Zakariah</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alshahrani</surname> <given-names>R</given-names></string-name>, <string-name><surname>Albakri</surname> <given-names>A</given-names></string-name>, <string-name><surname>Viriyasitavat</surname> <given-names>W</given-names></string-name>, <string-name><surname>Alghamdi</surname> <given-names>AA</given-names></string-name></person-group>. <article-title>Intelligent transportation using wireless sensor networks blockchain and license plate recognition</article-title>. <source>Sensors</source>. <year>2023</year>;<volume>23</volume>(<issue>5</issue>):<fpage>2670</fpage>; <pub-id pub-id-type="pmid">36904873</pub-id></mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shashirangana</surname> <given-names>J</given-names></string-name>, <string-name><surname>Padmasiri</surname> <given-names>H</given-names></string-name>, <string-name><surname>Meedeniya</surname> <given-names>D</given-names></string-name>, <string-name><surname>Perera</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Automated license plate recognition: a survey on methods and techniques</article-title>. <source>IEEE Access</source>. <year>2020</year>;<volume>9</volume>:<fpage>11203</fpage>&#x2013;<lpage>25</lpage>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shashirangana</surname> <given-names>J</given-names></string-name>, <string-name><surname>Padmasiri</surname> <given-names>H</given-names></string-name>, <string-name><surname>Meedeniya</surname> <given-names>D</given-names></string-name>, <string-name><surname>Perera</surname> <given-names>C</given-names></string-name>, <string-name><surname>Nayak</surname> <given-names>SR</given-names></string-name>, <string-name><surname>Nayak</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>License plate recognition using neural architecture search for edge devices</article-title>. <source>Int J Intell Syst</source>. <year>2022</year>;<volume>37</volume>(<issue>12</issue>):<fpage>10211</fpage>&#x2013;<lpage>48</lpage>. doi:<pub-id pub-id-type="doi">10.1002/int.22471</pub-id>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Sayedelahl</surname> <given-names>MA</given-names></string-name></person-group>. <article-title>Enabling intelligent traffic systems: a deep learning method for accurate arabic license plate recognition</article-title>. <comment>arXiv:2408.02904</comment>. <year>2024</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Ultra-lightweight automatic license plate recognition system for microcontrollers: a cost-effective and energy-efficient solution</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2024</year>;<volume>25</volume>(<issue>12</issue>):<fpage>20419</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tits.2024.3480039</pub-id>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Agarwal</surname> <given-names>V</given-names></string-name>, <string-name><surname>Bansal</surname> <given-names>G</given-names></string-name></person-group>. <article-title>Automatic number plate detection and recognition using YOLO world</article-title>. <source>Comput Electr Eng</source>. <year>2024</year>;<volume>120</volume>:<fpage>109646</fpage>.</mixed-citation></ref>
</ref-list>
</back></article>