Najdavan Abduljawad Kako

Dr. Najdavan Abduljawad Kako

Artificial intelligence, Duhok Polytechnic University, Dahūk, Iraq
orcid
Dasinya Journal for Engineering and Informatics

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2024 in Heliyon
Verified
Journal Article
Open access
Najdavan Abduljawad KakoNajdavan Abduljawad Kako
Najdavan Abduljawad Kako
AAAdnan Mohsin Abdulazeez
Adnan Mohsin Abdulazeez
DADiler N. Abdulqader
Diler N. Abdulqader
Early diagnosis and continuous monitoring of patients with eye diseases are critical in computer-aided detection (CAD) techniques. Semantic segmentation, a key component in computer vision, enables pixel-level classification and provides detailed information about objects within images. In this study, we present three U-Net models designed for multi-class semantic segmentation, leveraging the U-Net architecture with transfer learning. To generate ground truth for the HRF dataset, we combine two U-Net models, namely MSU-Net and BU-Net, to predict probability maps for the optic disc and cup regions. Binary masks are then derived from these probability maps to extract the optic disc and cup regions from retinal images. The dataset used in this study includes pre-existing blood vessels and manually annotated peripapillary atrophy zones (alpha and beta) provided by expert ophthalmologists. This comprehensive dataset, integrating existing blood vessels and expert-marked peripapillary atrophy zones, fulfills the study's objectives. The effectiveness of the proposed approach is validated by training nine pre-trained models on the HRF dataset comprising 45 retinal images, successfully segmenting the optic disc, cup, blood vessels, and peripapillary atrophy zones (alpha and beta). The results demonstrate 87.7 % pixel accuracy, 87 % Intersection over Union (IoU), 86.9 % F1 Score, 85 % mean IoU (mIoU), and 15 % model loss, significantly contributing to the early diagnosis and monitoring of glaucoma and optic nerve disorders.

24 February 2021
Verified
Conference Paper
Closed access
Najdavan Abduljawad KakoNajdavan Abduljawad Kako
Najdavan Abduljawad Kako
AAAdnan Mohsin Abdulazeez
Adnan Mohsin Abdulazeez
NKNajdavan A. Kako
Najdavan A. Kako
DZDilovan A. Zebari
Dilovan A. Zebari
DZDiyar Q. Zeebaree
Diyar Q. Zeebaree
Nature-inspired algorithms are often used by several diverse areas of engineering and science due to their easiness and versatility. Because metaheuristics operate by structurally changing and improving an established problem, they can often be extended to any optimization issues. The recent creation of metaheuristic algorithms has rendered them effective tools for solving NP problems. This paper presents a hybrid meta-heuristic method based on the Differential Evolution and Bird Mating Optimizer techniques to solve problems of global optimization. Bird Mating Optimizer is a novel method and is inspired by mating behavior of birds. Bird Mating Optimizer has some drawbacks such as producing poor results, trapping into local optima and slow convergence speed. Therefore, to conquer these insufficient it is hybridized with Differential Evolution approach. Differential Evolution technique is utilized to retain a preferable balance between both searches local and global. The performance and effectiveness of new Differential Evolution and Bird Mating Optimizer algorithm is tested and evaluated on 15 different functions of benchmark. The results of the experiment have shown the proposed technique possesses excellent performance in convergence speed, stability, and robustness, as compared to the well-known algorithms. It is proved that the Differential Evolution and Bird Mating Optimizer algorithm is very effective and superior to solve problems of global optimization. Experimental results indicate that the proposed hybrid Differential Evolution and Bird Mating Optimizer method is superior to previous existing state-of-the-art metaheuristic algorithms.

1 November 2022 in Current Medical Imaging
Verified
Journal Article
Closed access
PDF file
Najdavan Abduljawad KakoNajdavan Abduljawad Kako
Najdavan Abduljawad Kako
AAAdnan Mohsin Abdulazeez
Adnan Mohsin Abdulazeez
Information-based image processing and computer vision methods are utilized in several healthcare organizations to diagnose diseases. The irregularities in the visual system are identified over fundus images with a fundus camera. Among ophthalmology diseases, glaucoma is the most common case leading to neurodegenerative illness. The unsuitable fluid pressure inside the eye within the visual system is described as the major cause of those diseases. Glaucoma has no symptoms in the early stages, and if it is not treated, it may result in total blindness. Diagnosing glaucoma at an early stage may prevent permanent blindness. Manual inspection of the human eye may be a solution, but it depends on the skills of the individuals involved. The diagnosis of glaucoma by applying a consolidation of computer vision, artificial intelligence, and image processing can aid in the prevention and detection of those diseases. In this review article, we aim to introduce numerous approaches based on peripapillary atrophy segmentation and classification that can detect these diseases, as well as details regarding the publicly available image benchmarks, datasets, and measurement of performance. The review article highlights the research carried out on numerous available study models that objectively diagnose glaucoma via peripapillary atrophy from the lowest level of feature extraction to the current direction based on deep learning. The advantages and disadvantages of each method are addressed in detail, and tabular descriptions are included to highlight the results of each category. Moreover, the frameworks of each approach and fundus image datasets are provided. Our study would help in providing possible future work directions to diagnose glaucoma.

27 May 2017
Verified
Book Chapter
Closed access
PDF file
Haval Tariq SadeeqHaval Tariq Sadeeq
Haval Tariq Sadeeq
AAAdnan Mohsin Abdulazeez
Adnan Mohsin Abdulazeez
Najdavan Abduljawad KakoNajdavan Abduljawad Kako
Najdavan Abduljawad Kako
AAAraz Abrahim
Araz Abrahim

1 May 2020 in Indonesian Journal of Electrical Engineering and Computer Science
Verified
Journal Article
Open access
Najdavan Abduljawad KakoNajdavan Abduljawad Kako
Najdavan Abduljawad Kako
Haval Tariq SadeeqHaval Tariq Sadeeq
Haval Tariq Sadeeq
AAAraz Rajab Abrahim
Araz Rajab Abrahim
In this paper, a new Playfair cipher built on bits level symmetric key cryptographic was proposed for the purpose of converting pairs of letters (digraphs) into single letters. The proposed algorithm is capable to overcome many of the shortcoming and vulnerabilities that exist in the current classical version of Playfair algorithm. The Playfair cipher is exceedingly complex than a classical substitution cipher, but still simple to hack using automated tactics. It is famous as a digraph cipher because two letters are exchanged by other two letters. This destroys any solo letter occurrence statistics, but the digraph statistics still unaffected (frequencies of two letters). Unluckily letter pairs have a flatter distribution than the one letter frequencies, so this intricacy matters for solving the code using pen and paper procedures. The suggested encryption process is conducted as follows; letters are first arranged in a spiral manner in Polybius square, afterwards, each pair will be replaced utilizing before-after technique if we are arranging pairs horizontally and down-up technique (vertically). The former process produces pairs of Plaintext that will be converted to binary bit stream then will be divided over blocks with stable sizes. Bits of these blocks are taken from pairs then fit them into square matrix of suitable order to put the concept of row-wise and revers row-wise matrix. Bits of this matrix are split into 2x2 square matrixes. The sub-matrixes are formed 8 bits. Here the XNOR operation is taken into consideration for bitwise operation to generate the keys for decryption and produce the cipher-text.

1 January 2025 in Decision Science Letters
Verified
Journal Article
Closed access
Haval Tariq SadeeqHaval Tariq Sadeeq
Haval Tariq Sadeeq
AAAraz Abrahim
Araz Abrahim
THThamer Hameed
Thamer Hameed
Najdavan Abduljawad KakoNajdavan Abduljawad Kako
Najdavan Abduljawad Kako
RMReber Mohammed
Reber Mohammed
DADindar Ahmed
Dindar Ahmed
Metaheuristic algorithms are a class of optimization techniques that have revolutionized problem-solving across various domains. These algorithms provide a versatile and powerful approach to finding near-optimal solutions for complex, combinatorial, and computationally intensive problems. They draw inspiration from natural processes, such as evolution, swarm behavior, or annealing, to iteratively refine solutions by intelligently navigating the problem space. Metaheuristics have become indispensable tools in both academia and industry, helping researchers and practitioners address real-world problems efficiently and effectively. The Pelican optimization algorithm (POA) is a recently developed metaheuristic algorithm that simulates the hunting behavior of pelicans. In complex optimization problems, an POA may have slow convergence or fall in sub-optimal regions, especially in high complex ones. In this paper, Levy flight is integrated into the exploration phase to enhance its search capabilities. Furthermore, a novel exponential parameter has been introduced to enhance the algorithm's overall performance by facilitating a smoother shift between exploration and exploitation phases. These modifications are intended to keep the algorithm from being locked in local optima. The developed algorithm named as IPOA was tested using widely recognized twenty-three benchmark functions with a variety of characteristics, a set of CEC2022 test suites, and five different engineering constrained problems. The results demonstrate the superiority and effectiveness of IPOA in tackling function optimization and constrained design engineering problems.