Preferred Language
Articles
/
jRb5BIcBVTCNdQwCLi3k
Fast Overlapping Block Processing Algorithm for Feature Extraction
...Show More Authors

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally that the speed up of the proposed method compared with traditional approaches approximately reaches up to 20 times depending on the block parameters.

Scopus Clarivate Crossref
View Publication
Publication Date
Mon Jan 01 2007
Journal Name
2007 Ieee International Conference On Signal Processing And Communications
Fast Multi-level Image Vector Quantization
...Show More Authors

View Publication
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Mon Sep 11 2017
Journal Name
Journal Of Mathematical Imaging And Vision
Fast Recursive Computation of Krawtchouk Polynomials
...Show More Authors

View Publication
Scopus (45)
Crossref (44)
Scopus Clarivate Crossref
Publication Date
Sat Jan 06 2024
Journal Name
International Journal Of Applied Engineering & Technology
A PROPOSED LIGHTWEIGHT BLOCK CIPHER SYSTEM EMPLOYING DNA CODES
...Show More Authors

Publication Date
Wed Jul 29 2020
Journal Name
Iraqi Journal Of Science
Fractal Image Compression Using Block Indexing Technique: A Review
...Show More Authors

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

... Show More
Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Mar 01 2019
Journal Name
2019 9th International Ieee/embs Conference On Neural Engineering (ner)
Differences in EMG Feature Space between Able-Bodied and Amputee Subjects for Myoelectric Control
...Show More Authors

View Publication
Scopus (24)
Crossref (22)
Scopus Clarivate Crossref
Publication Date
Tue Mar 26 2024
Journal Name
World Electric Vehicle Journal
Fast Finite-Time Composite Controller for Vehicle Steer-by-Wire Systems with Communication Delays
...Show More Authors

The modern steer-by-wire (SBW) systems represent a revolutionary departure from traditional automotive designs, replacing mechanical linkages with electronic control mechanisms. However, the integration of such cutting-edge technologies is not without its challenges, and one critical aspect that demands thorough consideration is the presence of nonlinear dynamics and communication network time delays. Therefore, to handle the tracking error caused by the challenge of time delays and to overcome the parameter uncertainties and external perturbations, a robust fast finite-time composite controller (FFTCC) is proposed for improving the performance and safety of the SBW systems in the present article. By lumping the uncertainties, parameter var

... Show More
View Publication
Scopus (14)
Crossref (11)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Medical Journal Of Babylon
His- Ventricle (HV) Interval And Syncope As Predictor For Pacemaker Implantation In Patients With Bifascicular Block (BFB)
...Show More Authors

Transient drop in the heart beat or transient heart block (AVB) may be consider the main cause of syncope or presyncope inpatients with bifascicular block and syncope According to the Guidelines for cardiac pacing pacemaker consider part of treatment. Aims of our study were to evaluate whether there is role for EPS in patients BFB and to evaluate the symptoms after pacing. 42 patients were enrolled in this study, with mean age value (63.4± 12.2years), suffer from interventricular conductive defect and syncope; patients underwent EPS on admission time, and pacemaker implantation accordingly and programmed follow up for the device in the last four years. Our patients were 25 (59.5%) male and 17 (40.5%)female, all of them with syncope o

... Show More
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption
...Show More Authors

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

... Show More
View Publication
Scopus (15)
Crossref (4)
Scopus Crossref
Publication Date
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

... Show More
View Publication Preview PDF
Scopus (26)
Crossref (23)
Scopus Clarivate Crossref
Publication Date
Sun Jun 20 2021
Journal Name
Baghdad Science Journal
Multifactor Algorithm for Test Case Selection and Ordering
...Show More Authors

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (2)
Scopus Clarivate Crossref