Preferred Language
Articles
/
ijs-8757
Improved Naked Mole-Rat Algorithm Based on Variable Neighborhood Search for the N-Queens Problem
...Show More Authors

     Solving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of time is the main goal of the NMRAVNS algorithm. The improvement of the proposed algorithm boosts the exploitation capability of the basic NMRA and gives a greater possibility, with the emerging search strategies, to find the global best solution. This algorithm proved successful and outperformed other algorithms and studies with a remarkable target. A detailed comparison is performed, and the data results are presented with the relevant numbers and values. NMRA and NMRAVNS comparisons are implemented and recorded. Later on, a comparison between the Meerkat Clan Algorithm, Genetic Algorithm, Particle Swarm Optimization, and NMRAVNS is tested and presented. Finally, NMRAVNS is evaluated against the examined genetic-based algorithm and listed to prove the success of the proposed algorithm. NMRAVNS outperformed previous findings and scored competitive results with a high number of queen sizes, where an average time reduction reached about 87% of other previous findings.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Jan 01 2011
Journal Name
Iraqi Journal Of Science
A CRYPTOGRAPHIC TECHNIQUE BASED ON AVL TREE
...Show More Authors

Publication Date
Thu Feb 28 2019
Journal Name
Multimedia Tools And Applications
Shot boundary detection based on orthogonal polynomial
...Show More Authors

View Publication
Scopus (40)
Crossref (33)
Scopus Clarivate Crossref
Publication Date
Thu Mar 30 2023
Journal Name
Iraqi Journal Of Science
Effective Image Watermarking Method Based on DCT
...Show More Authors

Most includeding techniques of digital watermark even now working through the direct inclusion in the pixel without taking into account the level of compression (attack) that can go wrong, which makes digital watermark can be discarded easily. In this research, a method was proposed to overcome this problem, which is based on DCT (after image partitioned into non overlapped blocks with size 8×8 pixel), accompanied by a quantization method. The watermark (digital image) is embedded in DCT frequency domain seeking the blocks have highest standard deviation (the checking is only on the AC coefficients) within a predetermined threshold value, then the covered image will compressed (attacked) varying degrees of compression. The suggested met

... Show More
View Publication Preview PDF
Publication Date
Sun Jul 04 2010
Journal Name
Journal Of The Faculty Of Medicine Baghdad
CT Image Segmentation Based on clustering Methods.
...Show More Authors

Background: image processing of medical images is major method to increase reliability of cancer diagnosis.
Methods: The proposed system proceeded into two stages: First, enhancement stage which was performed using of median filter to reduce the noise and artifacts that present in a CT image of a human lung with a cancer, Second: implementation of k-means clustering algorithm.
Results: the result image of k-means algorithm compared with the image resulted from implementation of fuzzy c-means (FCM) algorithm.
Conclusion: We found that the time required for k-means algorithm implementation is less than that of FCM algorithm.MATLAB package (version 7.3) was used in writing the programming code of our w

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Feb 16 2022
Journal Name
Iraqi Journal Of Science
New Arabic Stemming based on Arabic Patterns
...Show More Authors

Algorithms for Arabic stemming available in two main types which are root-based approach and stem-based approach. Both types have problems which have been solved in the proposed stemmer which combined rules of both main types and based on Arabic patterns (Tafealat1) to find the added letters. The proposed stemmer achieved root exploration ratio (99.08) and fault ratio (0.9).

View Publication Preview PDF
Publication Date
Sat Aug 03 2024
Journal Name
Proceedings Of Ninth International Congress On Information And Communication Technology
Offline Signature Verification Based on Neural Network
...Show More Authors

The investigation of signature validation is crucial to the field of personal authenticity. The biometrics-based system has been developed to support some information security features.Aperson’s signature, an essential biometric trait of a human being, can be used to verify their identification. In this study, a mechanism for automatically verifying signatures has been suggested. The offline properties of handwritten signatures are highlighted in this study which aims to verify the authenticity of handwritten signatures whether they are real or forged using computer-based machine learning techniques. The main goal of developing such systems is to verify people through the validity of their signatures. In this research, images of a group o

... Show More
Publication Date
Thu Dec 30 2021
Journal Name
Iraqi Journal Of Science
3D Model Watermarking based on Wavelet Transform
...Show More Authors

      In the last decade, 3D models gained interest in many applications, such as games, the medical field, and manufacture. It is necessary to protect these models from unauthorized copying, distribution, and editing. Digital watermarking is the best way to solve this problem. This paper introduces a robust watermarking method by embedding the watermark in the low-frequency domain, then selecting the coarsest level for embedding the watermark based on the strength factor. The invisibility of the watermark for the proposed algorithm is tested by using different measurements, such as HD and PSNR. The robustness was tested by using different types of attacks; the correlation coefficient was applied for the evaluati

... Show More
View Publication Preview PDF
Scopus (8)
Crossref (2)
Scopus Crossref
Publication Date
Mon May 08 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Image Retrieval Based on Coefficient Correlation Index
...Show More Authors

Image retrieval is an active research area in image processing, pattern recognition, and
computer vision. In this proposed method, there are two techniques to extract the feature
vector, the first one is applying the transformed algorithm on the whole image and the second
is to divide the image into four blocks and then applying the transform algorithm on each part
of the image. In each technique there are three transform algorithm that have been applied
(DCT, Walsh Transform, and Kekre’s Wavelet Transform) then finding the similarity and
indexing the images, useing the correlation between feature vector of the query image and
images in database. The retrieved method depends on higher indexing number. <

... Show More
View Publication Preview PDF
Publication Date
Thu Dec 29 2016
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Proposed Steganography Method Based on DCT Coefficients
...Show More Authors

      In this paper an algorithm for Steganography using DCT for cover image and DWT for hidden image with an embedding order key is proposed. For more security and complexity the cover image convert from RGB to YIQ, Y plane is used and divided into four equally parts and then converted to DCT domain. The four coefficient of the DWT of the hidden image are embedded into each part of cover DCT, the embedding order based on the order key of which is stored with cover in a database table in both the sender and receiver sender. Experimental results show that the proposed algorithm gets successful hiding information into the cover image. We use Microsoft Office Access 2003 database as DBMS, the hiding, extracting algo

... Show More
View Publication Preview PDF
Publication Date
Mon May 20 2019
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Modeling Dynamic Background based on Linear Equation
...Show More Authors

     Detection moving car in front view is difficult operation because of the dynamic background due to the movement of moving car and the complex environment that surround the car, to solve that, this paper proposed new method based on linear equation to determine the region of interest by building more effective background model to deal with dynamic background scenes. This method exploited the permitted region between cars according to traffic law to determine the region (road) that in front the moving car which the moving cars move on. The experimental results show that the proposed method can define the region that represents the lane in front of moving car successfully with precision over 94%and detection rate 86

... Show More
View Publication Preview PDF
Crossref