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 Jan 01 2017
Journal Name
Pertanika Journal Of Science & Technology
Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring
...Show More Authors

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res

... Show More
Scopus (9)
Scopus
Publication Date
Fri Dec 01 2023
Journal Name
Bulletin Of Electrical Engineering And Informatics
A comparative study of Gaussian mixture algorithm and K-means algorithm for efficient energy clustering in MWSN
...Show More Authors

Wireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener

... Show More
View Publication
Scopus (5)
Crossref (4)
Scopus Crossref
Publication Date
Fri Aug 01 2008
Journal Name
2008 First International Conference On The Applications Of Digital Information And Web Technologies (icadiwt)
Hybrid canonical genetic algorithm and steepest descent algorithm for optimizing likelihood estimators of ARMA (1, 1) model
...Show More Authors

This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc

... Show More
View Publication
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Sun Jun 14 2026
Journal Name
International Journal Of Data And Network Science
Multi-objective of wind-driven optimization as feature selection and clustering to enhance text clustering
...Show More Authors

Text Clustering consists of grouping objects of similar categories. The initial centroids influence operation of the system with the potential to become trapped in local optima. The second issue pertains to the impact of a huge number of features on the determination of optimal initial centroids. The problem of dimensionality may be reduced by feature selection. Therefore, Wind Driven Optimization (WDO) was employed as Feature Selection to reduce the unimportant words from the text. In addition, the current study has integrated a novel clustering optimization technique called the WDO (Wasp Swarm Optimization) to effectively determine the most suitable initial centroids. The result showed the new meta-heuristic which is WDO was employed as t

... Show More
View Publication Preview PDF
Crossref (1)
Scopus Crossref
Publication Date
Tue Aug 15 2023
Journal Name
Al-academy
Narrative infrastructure and its impact on building open and closed endings in the feature film
...Show More Authors

The topic of the research tagged (narrative structure and its impact on building open and closed endings in the fictional film) is summarized by studying the mechanism of employing closed and open endings in the fictional film. novelist, then the need for it, as well as the objectives of the research and clarifying its limits as well as its importance. Then moving to the theoretical framework, which included three topics, where the first topic was entitled (the cinematic construction of the film narrative), either the second topic (the structure of complexity and narrative solutions), or the third topic dealt with the subject (the structure of the end and its relationship to the construction of the narrative). After completing the theore

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Nov 03 2015
Journal Name
Journal Of Natural Sciences Research
Implementation of remote sensing for vegetation studying using vegetation indices and automatic feature space plot
...Show More Authors

Publication Date
Sun Dec 16 2018
Journal Name
Al-academy
The Eloquence of the Sound in the Production of Mental Image in the Feature Film
...Show More Authors

View Publication
Crossref
Publication Date
Mon May 27 2019
Journal Name
Al-academy
The Symbolic Construction of Scenes of Love in the Feature Film: محمد عبد الحميد ضيدان
...Show More Authors

Scenes of love constitute a large space within the orbit of the movies, so that there is almost no film (no matter what kind) void of these scenes, as they are associated with many dimensions and they constitute a major attraction for viewers, and thus the direction solutions and their connection to the director's vision constitute a large part in the process of employing signs to highlight what should be highlighted or to refer to it symbolically on the grounds that the director does not have full freedom in the transfer of scenes of love at all levels as they are in reality. The research included three sections within the theoretical framework:The first section: the concept of image and its rhetorical importance. This section discussed

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Jan 17 2023
Journal Name
International Journal Of Online And Biomedical Engineering (ijoe)
An Image Feature Extraction to Generate a Key for Encryption in Cyber Security Medical Environments
...Show More Authors

Cyber security is a term utilized for describing a collection of technologies, procedures, and practices that try protecting an online environment of a user or an organization. For medical images among most important and delicate data kinds in computer systems, the medical reasons require that all patient data, including images, be encrypted before being transferred over computer networks by healthcare companies. This paper presents a new direction of the encryption method research by encrypting the image based on the domain of the feature extracted to generate a key for the encryption process. The encryption process is started by applying edges detection. After dividing the bits of the edge image into (3×3) windows, the diffusions

... Show More
View Publication
Scopus (9)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Mon Jul 07 2025
Journal Name
Letters In Biomathematics
Exploring the B-Spline Transform for Estimating Lévy Process Parameters: Applications in Finance and Biomodeling
...Show More Authors

Exploring the B-Spline Transform for Estimating Lévy Process Parameters: Applications in Finance and Biomodeling Exploring the B-Spline Transform for Estimating Lévy Process Parameters: Applications in Finance and Biomodeling Letters in Biomathematics · Jul 7, 2025Letters in Biomathematics · Jul 7, 2025 Show publication This paper, presents the application of the B-spline transform as an effective and precise technique for estimating key parameters i.e., drift, volatility, and jump intensity for Lévy processes. Lévy processes are powerful tools for representing phenomena with continuous trends with abrupt changes. The proposed approach is validated through a simulated biological case study on animal migration in which movements are mo

... Show More
View Publication