A   snake   is   an   energy-minimizing   spline   guided   by   external

constraint forces and influenced by image forces that pull it toward features such as lines and edges. Snakes are active contour models: they lock onto nearby edges, localizing them accurately. Snakes provide a unified account of a number of visual problems, including detection of edges, lines, and motion tracking. We have used snakes successfully for segmentation, in  which  user-imposed  constraint forces guide the snake near features of interest (anatomical structures). Magnetic Resonance Image (MRI) data set and Ultrasound images are used for our experiments.

The activation and reaction energies of the C-C and C-H bonds cleavage in pyrene molecule are calculated applying the Density Functional Theory and 6-311G Gaussian basis. Different values for the energies result for the different bonds, depending on the location of the bond and the structure of the corresponding transition states. The C-C bond cleavage reactions include H atom migration, in many cases, leading to the formation of CH2 groups and H-C≡C- acetylenic fragments. The activation energy values of the C-C reactions are greater than 190.00 kcal/mol for all bonds, those for the C-H bonds are greater than 160.00 kcal/mol. The reaction energy values for the C-C bonds range between 56.497 to 191.503 kcal/mol. As for the C-H cleavage rea

With the development of information technology and means for information transfer it has become necessary to protect sensitive information. The current research presents a method to protect secret colored images which includes three phases: The first phase calculates hash value using one of hash functions to ensure that no tampering with or updating the contents of the secret image. The second phase is encrypting image and embedding it randomly into appropriate cover image using Random Least Significant Bit (RLSB) technique. Random hiding provides protection of information embedded inside cover image for inability to predict the hiding positions, as well as the difficult of determining the concealment positions through the analysis of im

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

As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c