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.

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

Pavement crack and pothole identification are important tasks in transportation maintenance and road safety. This study offers a novel technique for automatic asphalt pavement crack and pothole detection which is based on image processing. Different types of cracks (transverse, longitudinal, alligator-type, and potholes) can be identified with such techniques. The goal of this research is to evaluate road surface damage by extracting cracks and potholes, categorizing them from images and videos, and comparing the manual and the automated methods. The proposed method was tested on 50 images. The results obtained from image processing showed that the proposed method can detect cracks and potholes and identify their severity levels wit

Due to the vast using of digital images and the fast evolution in computer science and especially the using of images in the social network.This lead to focus on securing these images and protect it against attackers, many techniques are proposed to achieve this goal. In this paper we proposed a new chaotic method to enhance AES (Advanced Encryption Standards) by eliminating Mix-Columns transformation to reduce time consuming and using palmprint biometric and Lorenz chaotic system to enhance authentication and security of the image, by using chaotic system that adds more sensitivity to the encryption system and authentication for the system.

With the increased development in digital media and communication, the need for methods to protection and security became very important factor, where the exchange and transmit date over communication channel led to make effort to protect these data from unauthentication access.

This paper present a new method to protect color image from unauthentication access using watermarking. The watermarking algorithm hide the encoded mark image in frequency domain using Discrete Cosine Transform. The main principle of the algorithm is encode frequent mark in cover color image. The watermark image bits are spread by repeat the mark and arrange in encoded method that provide algorithm more robustness and security. The propos

In the reverse engineering approach, a massive amount of point data is gathered together during data acquisition and this leads to larger file sizes and longer information data handling time. In addition, fitting of surfaces of these data point is time-consuming and demands particular skills. In the present work a method for getting the control points of any profile has been presented. Where, many process for an image modification was explained using Solid Work program, and a parametric equation of the profile that proposed has been derived using Bezier technique with the control points that adopted. Finally, the proposed profile was machined using 3-aixs CNC milling machine and a compression in dimensions process has been occurred betwe

New series of 4,4'-((2-(Aryl)-1H-benzo[d]imidazole1,3(2H)-diyl)bis(methylene))Diphenol(3a-g) was successfully synthesized from cyclization of the reduction product of bis Schiff bases (2) with aryl aldehydes bearing phenolic hydroxyl in the presence of acetic acid. The structure of these compounds was identified from FT-IR, 1H NMR, 13C NMR and EIMs. The Antioxidant capability was screened by DPPH and FRAP assays. Both assays showed antioxidant capability more than BHT as well. Compounds 3b and 3c showed antioxidant capacity slightly less than ascorbic acid. The docking study for theses compound was carried out as III DNA polymerase inhibitor. The results of docking demonstrated that the increase in hinderances around phenolic hy

New series of 4, 4'-((2-(Aryl)-1H-benzo [d] imidazole-1, 3 (2H)-diyl) bis (methylene)) Diphenol (3a-g) was successfully synthesized from cyclization of the reduction product of bis Schiff bases (2) with aryl aldehydes bearing phenolic hydroxyl in the presence of acetic acid. The structure of these compounds was identified from FT-IR, 1H NMR, 13C NMR and EIMs. The Antioxidant capability was screened by DPPH and FRAP assays. Both assays showed antioxidant capability more than BHT as well. Compounds 3b and 3c showed antioxidant capacity slightly less than ascorbic acid. The docking study for theses compound was carried out as III DNA polymerase inhibitor. The results of docking demonstrated that the increase in hinderances around phenolic hydr

    The aim of our work is to develop a new type of games which are related to (D, WD, LD) compactness of topological groups. We used an infinite game that corresponds to our work. Also, we used an alternating game in which the response of the second player depends on the choice of the first one. Many results of winning and losing strategies have been studied, consistent with the nature of the topological groups. As well as, we presented some topological groups, which fail to have winning strategies and we give some illustrated examples. Finally, the effect of functions on the aforementioned compactness strategies was studied.