Fariaa Abdalmajeed Hameed
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
Fariaa Abdalmajeed Hameed has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Abdullah Ahmed
Computer Science Dept, Kurdistan Technical Institute Sulaimani Heights, Sulaimani, Iraq
1 shared publication Harith Raad Hasan
Technical College of Informatics, Sulaimani Polytechnic University (SPU), Sulaimani, Iraq, Department of Software Engineering, Faculty of Engineering and Computer Science, Qaiwan International University (QIU), Sulaymaniyah, Iraq
1 shared publication- Harith Raad Hasan
Sulaimani polytechnic university, Kurdistan Technical Institute Sulaimani, Iraq
1 shared publication Kanar R. Tariq
Technical College of Informatics, Sulaimani Polytechnic University (SPU), Sulaimani, Iraq, Department of Software Engineering, Faculty of Engineering and Computer Science, Qaiwan International University (QIU), Sulaymaniyah, Iraq
1 shared publication- Omar Ismael Al-Sanjary
Management and Science University
1 shared publication Riyam Alaa Johni
Department of Computer Science, Kurdistan Technical Institute (KTI), Sulaymaniyah, Iraq
1 shared publication
Latest Publications
- Open Access
- 1 January 2024
- Published by University of Human Development in UHD Journal of Science and Technology
- Vol. 8 (1) , 99-107
Using the Cuckoo Optimization to Initialize the Harmony Memory in Harmony Search Algorithm to Find New Hybrid (CSHS) Algorithm
The current paper seeks to present a hybrid harmony search algorithm, using CS and HS. The proposed algorithm takes advantage of using a method to initialize the harmony memory (HM) with the help of the cuckoo search optimization algorithm. The HS algorithm is inspired by the method used by musicians to create and enhance harmony in music. It follows 3 main principles of pitch adjustment (PA), HM consideration (HMC), and random selection (RS). The performance of HS can be affected by its poor accuracy in optimization and speed of convergence, 2 main issues with it. However, to improve the HS algorithm, Cuckoo search can be used as it can do a local search using one parameter only, other than the size of the population, making it work more efficiently. This current method has been tested for its validity and efficiency in performance by being implemented on many international standard optimization problems. The results confirm the fact that the performance of the currently proposed algorithm is better and more efficient in finding solutions compared to HS and other algorithms.
- 1 January 2024
- Published by University of Human Development in UHD Journal of Science and Technology
- Vol. 8 (1) , 99-107
Open AccessUsing the Cuckoo Optimization to Initialize the Harmony Memory in Harmony Search Algorithm to Find New Hybrid (CSHS) Algorithm
The current paper seeks to present a hybrid harmony search algorithm, using CS and HS. The proposed algorithm takes advantage of using a method to initialize the harmony memory (HM) with the help of the cuckoo search optimization algorithm. The HS algorithm is inspired by the method used by musicians to create and enhance harmony in music. It follows 3 main principles of pitch adjustment (PA), HM consideration (HMC), and random selection (RS). The performance of HS can be affected by its poor accuracy in optimization and speed of convergence, 2 main issues with it. However, to improve the HS algorithm, Cuckoo search can be used as it can do a local search using one parameter only, other than the size of the population, making it work more efficiently. This current method has been tested for its validity and efficiency in performance by being implemented on many international standard optimization problems. The results confirm the fact that the performance of the currently proposed algorithm is better and more efficient in finding solutions compared to HS and other algorithms.
- Open Access
- 27 August 2017
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 2 (3) , 178-185
Writer Identification on Multi-Script Handwritten Using Optimum Features
Recognizing the writer of a text that has been handwritten is a very intriguing research problem in the field of document analysis and recognition. This study tables an automatic way of recognizing the writer from handwritten samples. Even though much has been done in previous researches that have presented other various methods, it is still clear that the field has a room for improvement. This particular method uses Optimum Features based writer characterization. Here, each of the samples written is grouped according to their set of features that are acquired from a computed codebook. This proposed codebook is different from the others which segment the samples into graphemes by fragmenting a certain part of the writing known as ending strokes. The proposed technique is employed to a locate and extract the handwriting fragments from ending zone and then grouped the similar fragments to generate a new cluster known as ending cluster. The cluster that comes in handy in the process of coming up with the ending codebook through picking out the center of the same fragment group. The process is finalized by evaluating the proposed method on four datasets of the various languages. This method being proposed had an impressive 97.12% identification rate which is rates the best result on the ICFHR dataset.
- 27 August 2017
- Published by Sulaimani Polytechnic University in Kurdistan Journal of Applied Research
- Vol. 2 (3) , 178-185
Open AccessWriter Identification on Multi-Script Handwritten Using Optimum Features
Recognizing the writer of a text that has been handwritten is a very intriguing research problem in the field of document analysis and recognition. This study tables an automatic way of recognizing the writer from handwritten samples. Even though much has been done in previous researches that have presented other various methods, it is still clear that the field has a room for improvement. This particular method uses Optimum Features based writer characterization. Here, each of the samples written is grouped according to their set of features that are acquired from a computed codebook. This proposed codebook is different from the others which segment the samples into graphemes by fragmenting a certain part of the writing known as ending strokes. The proposed technique is employed to a locate and extract the handwriting fragments from ending zone and then grouped the similar fragments to generate a new cluster known as ending cluster. The cluster that comes in handy in the process of coming up with the ending codebook through picking out the center of the same fragment group. The process is finalized by evaluating the proposed method on four datasets of the various languages. This method being proposed had an impressive 97.12% identification rate which is rates the best result on the ICFHR dataset.