Preferred Language
Articles
/
9Bew5I8BVTCNdQwCVn-K
Copy Move Image Forgery Detection using Multi-Level Local Binary Pattern Algorithm
...Show More Authors

Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different resolutions. By considering features from multiple levels, the detection algorithm can better capture both global and local characteristics of the manipulated regions, enhancing the accuracy of forgery detection. To achieve a high accuracy rate, this paper presents a variety of scenarios based on a machine-learning approach. In Copy-Move detection, artifacts and their properties are used as image features and support Vector Machine (SVM) to determine whether an image is tampered with. The dataset is manipulated to train and test each classifier; the target is to learn the discriminative patterns that detect instances of copy-move forgery. Media Integration and Call Center Forgery (MICC-F2000) were utilized in this paper. Experimental evaluations demonstrate the effectiveness of the proposed methodology in detecting copy-move. The implementation phases in the proposed work have produced encouraging outcomes. In the case of the best-implemented scenario involving multiple trials, the detection stage achieved a copy-move accuracy of 97.8 %. 

Crossref
Publication Date
Thu Apr 30 2020
Journal Name
Journal Of Economics And Administrative Sciences
Comparison Branch and Bound Algorithm with Penalty Function Method for solving Non-linear Bi-level programming with application
...Show More Authors

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

View Publication
Crossref
Publication Date
Thu Feb 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Comparison Some Robust Estimators for Estimate parameters logistic regression model to Binary Response – using simulation)).
...Show More Authors

 

 The logistic regression model of the most important regression models a non-linear which aim getting estimators have a high of efficiency, taking character more advanced in the process of statistical analysis for being a models appropriate form of Binary Data.                                                          

Among the problems that appear as a result of the use of some statistical methods I

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
...Show More Authors

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Thu Jun 30 2016
Journal Name
Al-kindy College Medical Journal
Pattern of Cystoid Macular Edema
...Show More Authors

Background: Cystoid Macular Edema (CME) in its various forms can be considered one of the leading causes of central vision loss in the developed world. It is not a disease itself, It represents a common pathologic sequel of the retina and occurs in a variety of pathological conditions such as, diabetic retinopathy, central or branch retinal vein occlusion(CRVO,BRVO), intraocular inflammation and following cataract extraction. Objective: This study was done to investigate the pattern of CME in patient attending Erbil Teaching Hospitals.Type of the study: Cross- sectional study.Methods and Materials: This is a hospital base cross- sectional study that included 61 patients (75 eyes) conducted at Erbil Teaching Hospitals for six months. All

... Show More
View Publication Preview PDF
Publication Date
Sat Jan 12 2013
Journal Name
Pierb
RADAR SENSING FEATURING BICONICAL ANTENNA AND ENHANCED DELAY AND SUM ALGORITHM FOR EARLY-STAGE BREAST CANCER DETECTION
...Show More Authors

A biconical antenna has been developed for ultra-wideband sensing. A wide impedance bandwidth of around 115% at bandwidth 3.73-14 GHz is achieved which shows that the proposed antenna exhibits a fairly sensitive sensor for microwave medical imaging applications. The sensor and instrumentation is used together with an improved version of delay and sum image reconstruction algorithm on both fatty and glandular breast phantoms. The relatively new imaging set-up provides robust reconstruction of complex permittivity profiles especially in glandular phantoms, producing results that are well matched to the geometries and composition of the tissues. Respectively, the signal-to-clutter and the signal-to-mean ratios of the improved method are consis

... Show More
Publication Date
Sat Feb 09 2019
Journal Name
Journal Of The College Of Education For Women
Medical Image Segmentation using Modified Interactive Thresholding Technique
...Show More Authors

Medical image segmentation is one of the most actively studied fields in the past few decades, as the development of modern imaging modalities such as magnetic resonance imaging (MRI) and computed tomography (CT), physicians and technicians nowadays have to process the increasing number and size of medical images. Therefore, efficient and accurate computational segmentation algorithms become necessary to extract the desired information from these large data sets. Moreover, sophisticated segmentation algorithms can help the physicians delineate better the anatomical structures presented in the input images, enhance the accuracy of medical diagnosis and facilitate the best treatment planning. Many of the proposed algorithms could perform w

... Show More
View Publication Preview PDF
Publication Date
Wed Jun 01 2022
Journal Name
V. International Scientific Congress Of Pure, Applied And Technological Sciences
Lightweight Image Compression Using Polynomial and Transform Coding
...Show More Authors

Publication Date
Tue Jan 01 2013
Journal Name
International Journal Of Computer Applications
Content-based Image Retrieval (CBIR) using Hybrid Technique
...Show More Authors

Image retrieval is used in searching for images from images database. In this paper, content – based image retrieval (CBIR) using four feature extraction techniques has been achieved. The four techniques are colored histogram features technique, properties features technique, gray level co- occurrence matrix (GLCM) statistical features technique and hybrid technique. The features are extracted from the data base images and query (test) images in order to find the similarity measure. The similarity-based matching is very important in CBIR, so, three types of similarity measure are used, normalized Mahalanobis distance, Euclidean distance and Manhattan distance. A comparison between them has been implemented. From the results, it is conclud

... Show More
View Publication
Publication Date
Sat Dec 01 2018
Journal Name
Al-nahrain Journal Of Science
Image Classification Using Bag of Visual Words (BoVW)
...Show More Authors

In this paper two main stages for image classification has been presented. Training stage consists of collecting images of interest, and apply BOVW on these images (features extraction and description using SIFT, and vocabulary generation), while testing stage classifies a new unlabeled image using nearest neighbor classification method for features descriptor. Supervised bag of visual words gives good result that are present clearly in the experimental part where unlabeled images are classified although small number of images are used in the training process.

View Publication Preview PDF
Crossref (19)
Crossref
Publication Date
Fri Sep 09 2022
Journal Name
Research Anthology On Improving Medical Imaging Techniques For Analysis And Intervention
Groupwise Non-Rigid Image Alignment Using Few Parameters
...Show More Authors

Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff

... Show More
View Publication