Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Muhammad Yousuf Irfan Zia has a total of 52 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    YO-CNN: A Hybrid Deep Learning Model for Prescription Mapping in Precision Agriculture

    by Syeda Iqra Hassan, Muhammad Yousuf Irfan Zia, Muhammad Umar Khan, Muhammad Rashid, Muhammad Mansoor Alam, Mazliham Mohd Su’Ud

    Modern agriculture is encountering a dilemma about increasing food production with minimum environmental damage. Current approaches to combating pests and monitoring the state of the soil are inadequate in terms of efficiency and require too much effort. Although the use of unmanned aerial vehicles (UAVs) in combination with artificial intelligence (AI) has partially resolved the situation, solutions are still too diverse and not optimally integrated with geographic information systems (GIS). This study proposes a lightweight, domain-adapted detector based on the YOLO framework, called YO-CNN. The algorithm is meant to be used in the field to instantly recognize early signs of crop stress, such as pest infestation or low plant density, by processing images obtained from UAVs. The results indicate that the method is suitable for practical applications such as prescription mapping. The main contributions are domain-specific model adaptation, the compact size of the solution that allows its implementation on hardware platforms in the field, and integrated analysis that allows prescriptions to be made. An experiment was conducted on a rice field of 40 acres in Tando Muhammad Khan, Pakistan, to evaluate the model. A set of 4200 annotated images (3000 pest and 1200 plant-stand images) was used to train and validate the algorithm. On the held-out validation images, the pest detector reached a precision of about 0.90, a recall of about 0.90, an mAP@0.5 of about 0.93 and an mAP@0.5:0.95 of about 0.69. In addition, the detections were used to generate prescription maps, which agronomists inspected qualitatively. Validation on independent farms and seasons, and field trials of the resulting prescriptions, are still required.

  • Open Access

    Anchor Node-Based Energy-Adaptive Non-Uniform Clustering Protocol (EANCP) for Reliable Underwater Acoustic Sensor Networks

    by Muhammad Umar Khan, Shakil Ahmed, Agha Yasir Ali, Muhammad Yousuf Irfan Zia, Muhammad Bilal, Ayman Alharbi

    Underwater Acoustic Sensor Networks (UASNs) play a critical role in underwater exploration, yet face challenges like high energy consumption, and uneven load distribution in multi-hop routing. While existing clustering protocols like Anchor Nodes assisted Cluster-based Routing Protocol (ANCRP) have improved energy-efficiency through uniform cluster formation, they still suffer from unequal energy depletion among cluster heads (CHs), particularly in shallower layers. This paper introduces key innovations that advance cluster-based routing in UASNs. We propose an Energy-Adaptive Non-uniform Clustering Protocol (EANCP) with three novel aspects: (1) depth-optimized cluster sizing where deeper CHs manage larger clusters with lower communication demands while shallower CHs handle smaller clusters to prevent early energy depletion; (2) an adaptive beaconing mechanism where transmission rate varies with depth to conserve energy in stable deep regions; and (3) a multi-criteria CH selection strategy considering residual energy, congestion, and distance to sink. The protocol was designed and simulated in Python, leveraging its scientific computing ecosystem (NumPy, SciPy, and Matplotlib) for flexible modeling of underwater acoustic channels and energy consumption. Unlike ANCRP’s uniform approach, EANCP’s depth-aware design addresses the uneven energy consumption in UASNs. Simulations demonstrate significant improvements: a 14% lower energy consumption, 11.5% longer network lifetime, 5−8% higher packet delivery ratio (PDR) and 20% lower delays compared to ANCRP. The protocol particularly excels in large-scale deployment by preventing routing bottlenecks through congestion-aware forwarding. These advancements make EANCP a significant improvement in underwater routing protocols, offering a more robust solution to balancing energy efficiency with reliable communication in harsh underwater environments.


  • YOLO-Based Object Detection for Intelligent Maritime Surveillance and Risk Identification

    by Syeda Iqra Hassan, Chandanlal Karnani, Muhammad Yousuf Irfan Zia

    Maritime safety plays a vital role in protection of coastal belt and ocean resources. With the growth of maritime traffic, the need of surveillance is also increasing. Traditional surveillance methods like Radio Detection and Ranging (RADAR), Sound Navigation and Ranging (SONAR) are useful and used to detect small objects in low-visibility sea conditions. This research presents a real-time maritime surveillance using the You Only Look Once (YOLO) deep learning architecture. A custom dataset was developed, that contains the images of ships, unidentified surface and aerial objects whose images are captured in dynamic weather conditions. The proposed model was trained and optimized to deliver accurate, real-time detection, integrating easily with data feeds from coastal cameras, UAVs, and radar systems to enhance situational awareness at sea. Experimental results show promising performance, achieving 89.7% precision, 90.5% recall, and a mean average precision (mAP@0.5) of 91.2%, outperforming common detection models such as Faster R-CNN and SSD. These findings highlight the effectiveness of deep learning in supporting safer, more efficient maritime operations. The proposed framework provides a scalable solution for coastal monitoring, marine traffic management, and environmental observation, with future development aimed at sensor fusion and improved visibility performance in challenging sea conditions.

  • A Systematic Review on Urban Road Traffic Congestion

    by Umair Jilani, Muhammad Asif, Muhammad Yousuf Irfan Zia, Munaf Rashid, Sarmad Shams, Pablo Otero


  • Open Access

    Throughput/Area-Efficient Accelerator of Elliptic Curve Point Multiplication over GF(2233) on FPGA

    by Muhammad Rashid, Omar S. Sonbul, Muhammad Yousuf Irfan Zia, Muhammad Arif, Asher Sajid, Saud S. Alotaibi

    This paper presents a throughput/area-efficient hardware accelerator architecture for elliptic curve point multiplication (ECPM) computation over GF(2233). The throughput of the proposed accelerator design is optimized by reducing the total clock cycles using a bit-parallel Karatsuba modular multiplier. We employ two techniques to minimize the hardware resources: (i) a consolidated arithmetic unit where we combine a single modular adder, multiplier, and square block instead of having multiple modular operators, and (ii) an Itoh–Tsujii inversion algorithm by leveraging the existing hardware resources of the multiplier and square units for multiplicative inverse computation. An efficient finite-state-machine (FSM) controller is implemented to facilitate control functionalities. To evaluate and compare the results of the proposed accelerator architecture against state-of-the-art solutions, a figure-of-merit (FoM) metric in terms of throughput/area is defined. The implementation results after post-place-and-route simulation are reported for reconfigurable field-programmable gate array (FPGA) devices. Particular to Virtex-7 FPGA, the accelerator utilizes 3584 slices, needs 7208 clock cycles, operates on a maximum frequency of 350 MHz, computes one ECPM operation in 20.59 μs, and the calculated value of FoM is 13.54. Consequently, the results and comparisons reveal that our accelerator suits applications that demand throughput and area-optimized ECPM implementations.


  • Open Access

    A Crypto Accelerator of Binary Edward Curves for Securing Low-Resource Embedded Devices

    by Asher Sajid, Omar S. Sonbul, Muhammad Rashid, Atif Raza Jafri, Muhammad Arif, Muhammad Yousuf Irfan Zia

    This research presents a novel binary Edwards curve (BEC) accelerator designed specifically for resource-constrained embedded systems. The proposed accelerator incorporates the fixed window algorithm, a two-stage pipelined architecture, and the Montgomery radix-4 multiplier. As a result, it achieves remarkable performance improvements in throughput and resource utilization. Experimental results, conducted on various Xilinx Field Programmable Gate Arrays (FPGAs), demonstrate impressive throughput/area ratios observed for GF(2233). The achieved ratios for Virtex-4, Virtex-5, Virtex-6, and Virtex-7 are 12.2, 19.07, 36.01, and 38.39, respectively. Furthermore, the processing time for one-point multiplication on a Virtex-7 platform is 15.87 µs. These findings highlight the effectiveness of the proposed accelerator for improved throughput and optimal resource utilization.


  • CDSS for Early Recognition of Respiratory Diseases based on AI Techniques: A Systematic Review

    by Syed Waqad Ali, Muhammad Asif, Muhammad Yousuf Irfan Zia, Munaf Rashid, Sidra Abid Syed, Enrique Nava


  • Open Access

    A Hybrid Approach for Efficient and Secure Point Multiplication on Binary Edwards Curves

    by Asher Sajid, Omar S. Sonbul, Muhammad Rashid, Muhammad Yousuf Irfan Zia

    The focus of this article is to present a novel crypto-accelerator architecture for a resource-constrained embedded system that utilizes elliptic curve cryptography (ECC). The architecture is built around Binary Edwards curves (BEC) to provide resistance against simple power analysis (SPA) attacks. Furthermore, the proposed architecture incorporates several optimizations to achieve efficient hardware resource utilization for the point multiplication process over GF(2m). This includes the use of a Montgomery radix-2 multiplier and the projective coordinate hybrid algorithm (combination of Montgomery ladder and double and add algorithm) for scalar multiplication. A two-stage pipelined architecture is employed to enhance throughput. The design is modeled in Verilog HDL and verified using Vivado and ISE design suites from Xilinx. The obtained results demonstrate that the proposed BEC accelerator offers significant performance improvements compared to existing solutions. The obtained throughput over area ratio for GF(2233) on Virtex-4, Virtex-5, Virtex-6, and Virtex-7 Xilinx FPGAs are 9.43, 14.39, 26.14, and 28.79, respectively. The computation time required for a single point multiplication operation on the Virtex-7 device is 19.61 µs. These findings indicate that the proposed architecture has the potential to address the challenges posed by resource-constrained embedded systems that require high throughput and efficient use of available resources.


  • Open Access

    Large Field-Size Elliptic Curve Processor for Area-Constrained Applications

    by Muhammad Rashid, Omar S. Sonbul, Muhammad Yousuf Irfan Zia, Nadeem Kafi, Mohammed H. Sinky, Muhammad Arif

    This article has proposed an efficient area-optimized elliptic curve cryptographic processor architecture over GF(2409) and GF(2571). The proposed architecture employs Lopez-Dahab projective point arithmetic operations. To do this, a hybrid Karatsuba multiplier of 4-split polynomials is proposed. The proposed multiplier uses general Karatsuba and traditional schoolbook multiplication approaches. Moreover, the multiplier resources are reused to implement the modular squares and addition chains of the Itoh-Tsujii algorithm for inverse computations. The reuse of resources reduces the overall area requirements. The implementation is performed in Verilog (HDL). The achieved results are provided on Xilinx Virtex 7 device. In addition, the performance of the proposed design is evaluated on ASIC 65 nm process technology. Consequently, a figure-of-merit is constructed to compare the FPGA and ASIC implementations. An exhaustive comparison to existing designs in the literature shows that the proposed architecture utilizes less area. Therefore, the proposed design is the right choice for area-constrained cryptographic applications.


  • Open Access

    Rice Crop Counting Using Aerial Imagery and GIS for the Assessment of Soil Health to Increase Crop Yield

    by Syeda Iqra Hassan, Muhammad Mansoor Alam, Muhammad Yousuf Irfan Zia, Muhammad Rashid, Usman Illahi, Mazliham Mohd Su’ud

    Rice is one of the vital foods consumed in most countries throughout the world. To estimate the yield, crop counting is used to indicate improper growth, identification of loam land, and control of weeds. It is becoming necessary to grow crops healthy, precisely, and proficiently as the demand increases for food supplies. Traditional counting methods have numerous disadvantages, such as long delay times and high sensitivity, and they are easily disturbed by noise. In this research, the detection and counting of rice plants using an unmanned aerial vehicle (UAV) and aerial images with a geographic information system (GIS) are used. The technique is implemented in the area of forty acres of rice crop in Tando Adam, Sindh, Pakistan. To validate the performance of the proposed system, the obtained results are compared with the standard plant count techniques as well as approved by the agronomist after testing soil and monitoring the rice crop count in each acre of land of rice crops. From the results, it is found that the proposed system is precise and detects rice crops accurately, differentiates from other objects, and estimates the soil health based on plant counting data; however, in the case of clusters, the counting is performed in semi-automated mode.