Preferred Language
Articles
/
bsj-2405
Scale-Invariant Feature Transform Algorithm with Fast Approximate Nearest Neighbor
...Show More Authors

There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that it operates on a big number of key-points, the only drawback it has is that it is rather time consuming. In the suggested approach, the system deploys SIFT to perform its basic tasks of matching and description is focused on minimizing the number of key-points which is performed via applying Fast Approximate Nearest Neighbor algorithm, which will reduce the redundancy of matching leading to speeding up the process. The proposed application has been evaluated in terms of two criteria which are time and accuracy, and has accomplished a percentage of accuracy of up to 100%, in addition to speeding up the processes of matching and description.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Sep 24 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Algorithm to Solve Linear Volterra Fractional Integro-Differential Equation via Elzaki Transform
...Show More Authors

In this work, Elzaki transform (ET) introduced by Tarig Elzaki is applied to solve linear Volterra fractional integro-differential equations (LVFIDE). The fractional derivative is considered in the Riemman-Liouville sense. The procedure is based on the application of (ET) to (LVFIDE) and using properties of (ET) and its inverse. Finally, some examples are solved to show that this is computationally efficient and accurate.

View Publication Preview PDF
Publication Date
Tue May 24 2022
Journal Name
International Journal Of Interactive Mobile Technologies (ijim)
A Blind Video Copyright Protection Technique in Maximum and Minimum Energy Frames Based on The Fast Walsh Hadamard Transform (FWHT) and Discrete Wavelet Transform (DWT) and Arnold Map
...Show More Authors

Video copyright protection is the most generally acknowledged method of preventing data piracy. This paper proposes a blind video copyright protection technique based on the Fast Walsh Hadamard Transform (FWHT), Discrete Wavelet Transform (DWT), and Arnold Map. The proposed method chooses only frames with maximum and minimum energy features to host the watermark. It also exploits the advantages of both the fast Walsh Hadamard transform (FWHT) and discrete wavelet transforms (DWT) for watermark embedding. The Arnold map encrypts watermarks before the embedding process and decrypts watermarks after extraction. The results show that the proposed method can achieve a fast embedding time, good transparency, and robustness against various

... Show More
View Publication
Scopus (1)
Scopus Crossref
Publication Date
Tue Mar 30 2021
Journal Name
Iraqi Journal Of Science
Weighted k-Nearest Neighbour for Image Spam Classification
...Show More Authors

E-mail is an efficient and reliable data exchange service. Spams are undesired e-mail messages which are randomly sent in bulk usually for commercial aims. Obfuscated image spamming is one of the new tricks to bypass text-based and Optical Character Recognition (OCR)-based spam filters. Image spam detection based on image visual features has the advantage of efficiency in terms of reducing the computational cost and improving the performance. In this paper, an image spam detection schema is presented. Suitable image processing techniques were used to capture the image features that can differentiate spam images from non-spam ones. Weighted k-nearest neighbor, which is a simple, yet powerful, machine learning algorithm, was used as a clas

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (3)
Scopus Crossref
Publication Date
Thu Sep 30 2021
Journal Name
Iraqi Journal Of Science
On Invariant Approximations in Modular Spaces
...Show More Authors

     This article is devoted to presenting results on invariant approximations over a non-star-shsped weakly compact subset of a complete modular space by introduced a new notion called S-star-shaped with center f:  if   be a mapping and , . Then the existence of common invariant best approximation is proved for Banach operator pair of mappings by combined the hypotheses with Opial’s condition or demi-closeness condition

View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Sun Jan 01 2017
Journal Name
International Journal Of Advanced Computer Science And Applications
Fast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
...Show More Authors

View Publication
Crossref
Publication Date
Sun Jul 01 2012
Journal Name
2012 International Symposium On Innovations In Intelligent Systems And Applications
Edge detection for fast block-matching motion estimation to enhance Mean Predictive Block Matching algorithm
...Show More Authors

View Publication
Scopus (5)
Crossref (3)
Scopus Crossref
Publication Date
Sun Oct 20 2024
Journal Name
Baghdad Science Journal
Modules Whose St-Closed Submodules are Fully Invariant
...Show More Authors

The duo module plays an important role in the module theory. Many researchers generalized this concept such as Ozcan AC, Hadi IMA and Ahmed MA. It is known that in a duo module, every submodule is fully invariant. This paper used the class of St-closed submodules to work out a module with the feature that all St-closed submodules are fully invariant. Such a module is called an Stc-duo module. This class of modules contains the duo module properly as well as the CL-duo module which was introduced by Ahmed MA. The behaviour of this new kind of module was considered and studied in detail,for instance, the hereditary property of the St-duo module was investigated, as the result; under certain conditions, every St-cl

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Jan 10 2016
Journal Name
British Journal Of Applied Science & Technology
Illumination - Invariant Facial Components Extraction Using Adaptive Contrast Enhancement Methods
...Show More Authors

The process of accurate localization of the basic components of human faces (i.e., eyebrows, eyes, nose, mouth, etc.) from images is an important step in face processing techniques like face tracking, facial expression recognition or face recognition. However, it is a challenging task due to the variations in scale, orientation, pose, facial expressions, partial occlusions and lighting conditions. In the current paper, a scheme includes the method of three-hierarchal stages for facial components extraction is presented; it works regardless of illumination variance. Adaptive linear contrast enhancement methods like gamma correction and contrast stretching are used to simulate the variance in light condition among images. As testing material

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Dec 06 2021
Journal Name
Iraqi Journal Of Science
Images Compression Using Bezier curve with Ridgelet Transform
...Show More Authors

The data compression is a very important process in order to reduce the size of a large data to be stored or transported, parametric curves such that Bezier curve is a suitable method to return gradual change and mutability of this data. Ridghelet transform solve the problems in the wavelet transform and it can compress the image well but when it uses with Bezier curve, the equality of compressed image become very well. In this paper, a new compression method is proposed by using Bezier curve with Ridgelet transform on RGB images. The results showed that the proposed method present good performance in both subjective and objective experiments. When the PSNR values equal to (34.2365, 33.4323 and 33.0987), they were increased in the propos

... Show More
View Publication
Publication Date
Sat Sep 30 2023
Journal Name
Iraqi Journal Of Science
Image Compression Using Mapping Transform with Pixel Elimination
...Show More Authors

     In today's world, digital image storage and transmission play an essential role,where images are mainly involved in data transfer. Digital images usually take large storage space and bandwidth for transmission, so image compression is important in data communication. This paper discusses a unique and novel lossy image compression approach. Exactly 50% of image pixels are encoded, and other 50% pixels are excluded. The method uses a block approach. Pixels of the block are transformed with a novel transform. Pixel nibbles are mapped as a single bit in a transform table generating more zeros, which helps achieve compression. Later, inverse transform is applied in reconstruction, and a single bit value from the table is rem

... Show More
View Publication Preview PDF
Scopus Crossref