Preferred Language
Articles
/
ARclzY0BVTCNdQwCkxwy
DeepFake Detection Improvement for Images Based on a Proposed Method for Local Binary Pattern of the Multiple-Channel Color Space
...Show More Authors

DeepFake is a concern for celebrities and everyone because it is simple to create. DeepFake images, especially high-quality ones, are difficult to detect using people, local descriptors, and current approaches. On the other hand, video manipulation detection is more accessible than an image, which many state-of-the-art systems offer. Moreover, the detection of video manipulation depends entirely on its detection through images. Many worked on DeepFake detection in images, but they had complex mathematical calculations in preprocessing steps, and many limitations, including that the face must be in front, the eyes have to be open, and the mouth should be open with the appearance of teeth, etc. Also, the accuracy of their counterfeit detection in all previous studies was less than what this paper achieved, especially with the benchmark Flickr faces high-quality dataset (FFHQ). This study proposed, a new, simple, but powerful method called image Re-representation by combining the local binary pattern of multiple-channel (IR-CLBP-MC) color space as an image re-representation technique improved DeepFake detection accuracy. The IRCLBP- MC is produced using the fundamental concept of the multiple-channel of the local binary pattern (MCLBP), an extension of the original LBP. The primary distinction is that in our method, the LBP decimal value is calculated in each local patch channel, merging them to re-represent the image and producing a new image with three color channels. A pretrained convolutional neural network (CNN) was utilized to extract the deep textural features from twelve sets of a dataset of IR-CLBP-MC images made from different color spaces: RGB, XYZ, HLS, HSV, YCbCr, and LAB. Other than that, the experimental results by applying the overlap and non-overlap techniques showed that the first technique was better with the IR-CLBP-MC, and the YCbCr image color space is the most accurate when used with the model and for both datasets. Extensive experimentation is done, and the high accuracy obtained are 99.4% in the FFHQ and 99.8% in the CelebFaces Attributes dataset (Celeb-A).

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Apr 23 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Proposed Speech Analyses Method Using the Multiwavelet Transform
...Show More Authors

  Speech is the first invented way of communication that human used age before the invention of writing. In this paper, proposed method for speech analyses to extract features by using multiwavelet Transform (Repeated Row Preprocessing).The proposed system depends on the Euclidian differences of the coefficients of the multiwavelet Transform to determine the beast features of speech recognition. Each sample value in the reference file is computed by taking the average value of four samples for the same data (four speakers for the same phoneme). The result of the input data to every frame value in the reference file using the Euclidian distance to determine the frame with the minimum distance is said to be the "Best Match". Simulatio

... Show More
View Publication Preview PDF
Publication Date
Sat Oct 30 2021
Journal Name
Iraqi Journal Of Science
Small Binary Codebook Design for Image Compression Depending on Rotating Blocks
...Show More Authors

     The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding procedure, with very small distortion per block, by designing s

... Show More
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Mon Mar 01 2010
Journal Name
Journal Of Economics And Administrative Sciences
Planning the main production tables using the correct binary programming method
...Show More Authors

This research include building mathematical models for aggregating planning and shorting planning by using integer programming technique for planning master production scheduling in order to control on the operating production for manufacturing companies to achieve their objectives of increasing the efficiency of utilizing resources and reduce storage and  improving customers service  through  deliver in the actual dates and reducing delays.

View Publication Preview PDF
Crossref
Publication Date
Tue Jan 01 2019
Journal Name
Iop
Water cut comparison for a really similar gridding system (line drive pattern)
...Show More Authors

Scopus
Publication Date
Wed Sep 01 2021
Journal Name
Expert Systems With Applications
A long short-term recurrent spatial-temporal fusion for myoelectric pattern recognition
...Show More Authors

View Publication
Scopus (21)
Crossref (21)
Scopus Clarivate Crossref
Publication Date
Sun Jun 11 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Digital Watermarking in Color Image Based On Joint Between DCT and DWT
...Show More Authors

The massive distribution and development in the digital images field with friendly software, that leads to produce unauthorized use. Therefore the digital watermarking as image authentication has been developed for those issues. In this paper, we presented a method depending on the embedding stage and extraction stag. Our development is made by combining Discrete Wavelet Transform (DWT) with Discrete Cosine Transform (DCT) depending on the fact that combined the two transforms will reduce the drawbacks that appears during the recovered watermark or the watermarked image quality of each other, that results in effective rounding method, this is achieved by changing the wavelets coefficients of selected DWT sub bands (HL or HH), followed by

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Aug 23 2022
Journal Name
Int. J. Nonlinear Anal. Appl.
Face mask detection based on algorithm YOLOv5s
...Show More Authors

Determining the face of wearing a mask from not wearing a mask from visual data such as video and still, images have been a fascinating research topic in recent decades due to the spread of the Corona pandemic, which has changed the features of the entire world and forced people to wear a mask as a way to prevent the pandemic that has calmed the entire world, and it has played an important role. Intelligent development based on artificial intelligence and computers has a very important role in the issue of safety from the pandemic, as the Topic of face recognition and identifying people who wear the mask or not in the introduction and deep education was the most prominent in this topic. Using deep learning techniques and the YOLO (”You on

... Show More
Publication Date
Thu Jul 01 2021
Journal Name
Computers & Electrical Engineering
A new proposed statistical feature extraction method in speech emotion recognition
...Show More Authors

View Publication
Scopus (38)
Crossref (27)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2017
Journal Name
Australian Journal Of Basic And Applied Sciences
Block-based Image Steganography for Text Hiding Using YUV Color Model and Secret Key Cryptography Methods
...Show More Authors

Preview PDF
Publication Date
Mon Apr 17 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Simulation Expirment for Proofing the Theoretical Assumption of Time Complexity for Binary Search Tree
...Show More Authors

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th

... Show More
View Publication Preview PDF