Many approaches of different complexity already exist to edge detection in
color images. Nevertheless, the question remains of how different are the results
when employing computational costly techniques instead of simple ones. This
paper presents a comparative study on two approaches to color edge detection to
reduce noise in image. The approaches are based on the Sobel operator and the
Laplace operator. Furthermore, an efficient algorithm for implementing the two
operators is presented. The operators have been applied to real images. The results
are presented in this paper. It is shown that the quality of the results increases by
using second derivative operator (Laplace operator). And noise reduced in a good

Recently, the internet has made the users able to transmit the digital media in the easiest manner. In spite of this facility of the internet, this may lead to several threats that are concerned with confidentiality of transferred media contents such as media authentication and integrity verification. For these reasons, data hiding methods and cryptography are used to protect the contents of digital media. In this paper, an enhanced method of image steganography combined with visual cryptography has been proposed. A secret logo (binary image) of size (128x128) is encrypted by applying (2 out 2 share) visual cryptography on it to generate two secret share. During the embedding process, a cover red, green, and blue (RGB) image of size (512

Image compression plays an important role in reducing the size and storage of data while increasing the speed of its transmission through the Internet significantly. Image compression is an important research topic for several decades and recently, with the great successes achieved by deep learning in many areas of image processing, especially image compression, and its use is increasing Gradually in the field of image compression. The deep learning neural network has also achieved great success in the field of processing and compressing various images of different sizes. In this paper, we present a structure for image compression based on the use of a Convolutional AutoEncoder (CAE) for deep learning, inspired by the diversity of human eye

The deep learning algorithm has recently achieved a lot of success, especially in the field of computer vision. This research aims to describe the classification method applied to the dataset of multiple types of images (Synthetic Aperture Radar (SAR) images and non-SAR images). In such a classification, transfer learning was used followed by fine-tuning methods. Besides, pre-trained architectures were used on the known image database ImageNet. The model VGG16 was indeed used as a feature extractor and a new classifier was trained based on extracted features.The input data mainly focused on the dataset consist of five classes including the SAR images class (houses) and the non-SAR images classes (Cats, Dogs, Horses, and Humans). The Conv

Background: Melanin pigmentation of the gingiva appears in all ethnicities. Excessive pigmentation is an esthetic concern that has increased awareness about depigmentation procedures. This epidemiological study aims to find the correlation between skin color and gingival pigmentation in Sulaimani Governorate, Kurdistan/Iraq.

Subjects and Methods: A total of 820 apparently healthy and non-smokers, including 338 males and 482 females with healthy gingiva, aged between (18-40 years old) were enrolled in this study. Clinical examination on the participants’ gingivae was performed to assess color, and the distribution of pigmentations. Afterward the of participants skin color were

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Due to the need for controlling and regulating of feed pellet. Pellet that is imported or locally manufactured is accompanied by cracking and crumbling percentage that occur during transporting and distributing to animals, using conveyors and mechanical feeders. This study aimed to determine the effect of particle size and die holes diameter in the machine on broiler feed pellets quality in pellet durability, pellet direct measurement, pellet expansion, and pellet length. Three particle size 2, 4, and 6 mm, and three diameters of die holes in the machine 3, 4, and 5 mm, have been used. The results showed that changing the particle size from 2 to 4 then to 6 mm led to a significant decrease in pellet durability and pellet lengths, pe

???? ?? ??? ????? ???? ?????? ?????????? ????? ??????? ???? ?????? ????? ??? ??? ????? ?? ???? ??? ????? ????? ???? ????? ????? ?? 0-3cm, 10cm, 20cm, 30cm, 40cm ???????? ????? ?? ???? ????? ???????? ?? ???? ????? ?????? CR-39??????? ?? ??? ??? ?????????? ???????????? ???????? ???? n.cm-2.s-1 5 x 103?? ?????? ?????????? Am241- Be??? ???? ??????? ????????? ??? ?? ???? ????? ?????????? ??? ?? ????? ??????? ?????? 0.881±0.086??? ?? ??????? ????? ??? ????? ??? ?? ????? ????? ??? ???????? ???0.441±0.036 ??? ?? ???????