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
Tue Jun 06 2023
Journal Name
Journal Of University Of Anbar For Pure Science (juaps)
Approximate Solution of Emden-Fowler Equation Using the Galerkin Method
...Show More Authors

Publication Date
Mon Dec 31 2012
Journal Name
Al-khwarizmi Engineering Journal
Speech Compression Using Multecirculerletet Transform
...Show More Authors

Compressing the speech reduces the data storage requirements, leading to reducing the time of transmitting the digitized speech over long-haul links like internet. To obtain best performance in speech compression, wavelet transforms require filters that combine a number of desirable properties, such as orthogonality and symmetry.The MCT bases functions are derived from GHM bases function using 2D linear convolution .The fast computation algorithm methods introduced here added desirable features to the current transform. We further assess the performance of the MCT in speech compression application. This paper discusses the effect of using DWT and MCT (one and two dimension) on speech compression. DWT and MCT performances in terms of comp

... Show More
View Publication Preview PDF
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
Improved Firefly Algorithm with Variable Neighborhood Search for Data Clustering
...Show More Authors

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

... Show More
View Publication Preview PDF
Scopus (14)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Thu Dec 01 2022
Journal Name
Ieee Transactions On Human-machine Systems
Myoelectric Control With Fixed Convolution-Based Time-Domain Feature Extraction: Exploring the Spatio–Temporal Interaction
...Show More Authors

View Publication
Scopus (30)
Crossref (28)
Scopus Clarivate Crossref
Publication Date
Sat Jan 01 2022
Journal Name
Ieee Transactions On Power Delivery
Optimal Dielectric Design of Medium Voltage Toroidal Transformer with Electrostatic Shield under Fast Front Excitation
...Show More Authors

Accurate calculation of transient overvoltages and dielectric stresses from fast-front excitations is required to obtain an optimal dielectric design of power components subjected to these conditions, which are commonly due to switching and lightning, as well as utilization of power-electronic devices. Toroidal transformers are generally used at the low voltage level. However, recent investigations and developments have explored their use at the medium voltage level. This paper analyzes the model-based improvement of the insulation design of medium voltage toroidal transformers. Lumped and distributed parameter models are used and compared to predict the transient response and dielectric stress along the transformer winding. The parameters

... Show More
Scopus (1)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Thu Oct 01 2020
Journal Name
Ieee Transactions On Very Large Scale Integration (vlsi) Systems
Low-Power, Highly Reliable Dynamic Thermal Management by Exploiting Approximate Computing
...Show More Authors

With the continuous downscaling of semiconductor processes, the growing power density and thermal issues in multicore processors become more and more challenging, thus reliable dynamic thermal management (DTM) is required to prevent severe challenges in system performance. The accuracy of the thermal profile, delivered to the DTM manager, plays a critical role in the efficiency and reliability of DTM, different sources of noise and variations in deep submicron (DSM) technologies severely affecting the thermal data that can lead to significant degradation of DTM performance. In this article, we propose a novel fault-tolerance scheme exploiting approximate computing to mitigate the DSM effects on DTM efficiency. Approximate computing in hardw

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Approximate Numerical Solutions for Linear Volterra Integral Equations Using Touchard Polynomials
...Show More Authors

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.

View Publication Preview PDF
Scopus (6)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Mon Jun 01 2009
Journal Name
Al-khwarizmi Engineering Journal
Image Zooming Using Inverse Slantlet Transform
...Show More Authors

Digital image is widely used in computer applications. This paper introduces a proposed method of image zooming based upon inverse slantlet transform and image scaling. Slantlet transform (SLT) is based on the principle of designing different filters for different scales.

      First we apply SLT on color image, the idea of transform color image into slant, where large coefficients are mainly the   signal and smaller one represent the noise. By suitably modifying these coefficients , using scaling up image by  box and Bartlett filters so that the image scales up to 2X2 and then inverse slantlet transform from modifying coefficients using to the reconstructed image .

  &nbs

... Show More
View Publication Preview PDF
Publication Date
Sun Sep 04 2011
Journal Name
Baghdad Science Journal
An Embedded Data Using Slantlet Transform
...Show More Authors

Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Fractional Hartley Transform and its Inverse
...Show More Authors

The Hartley transform generalizes to the fractional Hartley transform (FRHT) which gives various uses in different fields of image encryption. Unfortunately, the available literature of fractional Hartley transform is unable to provide its inversion theorem. So accordingly original function cannot retrieve directly, which restrict its applications. The intension of this paper is to propose inversion theorem of fractional Hartley transform to overcome this drawback. Moreover, some properties of fractional Hartley transform are discussed in this paper.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref