Security concerns in the transfer of medical images have drawn a lot of attention to the topic of medical picture encryption as of late. Furthermore, recent events have brought attention to the fact that medical photographs are constantly being produced and circulated online, necessitating safeguards against their inappropriate use. To improve the design of the AES algorithm standard for medical picture encryption, this research presents several new criteria. It was created so that needs for higher levels of safety and higher levels of performance could be met. First, the pixels in the image are diffused to randomly mix them up and disperse them all over the screen. Rather than using rounds, the suggested technique utilizes a cascaded-looking composition of F-functions in a quadrate architecture. The proposed F-function architecture is a three-input, three-output Type-3 AES-Feistel network with additional integer parameters representing the subkeys in use. The suggested system makes use of the AES block cipher as a function on a Type-3 AES-Feistel network. Blocks in the proposed system are 896 bits in length, whereas keys are 128 bits. The production of subkeys is encrypted using a chain of E8- algorithms. The necessary subkeys are then generated with a recursion. The results are reviewed to verify that the new layout improves the security of the AES block cipher when used to encrypt medical images in a computer system.
Faces blurring is one of the important complex processes that is considered one of the advanced computer vision fields. The face blurring processes generally have two main steps to be done. The first step has detected the faces that appear in the frames while the second step is tracking the detected faces which based on the information extracted during the detection step. In the proposed method, an image is captured by the camera in real time, then the Viola Jones algorithm used for the purpose of detecting multiple faces in the captured image and for the purpose of reducing the time consumed to handle the entire captured image, the image background is removed and only the motion areas are processe
... Show MoreFinding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over
... Show MoreObjective of this work is the mixing between human biometric characteristics and unique attributes of the computer in order to protect computer networks and resources environments through the development of authentication and authorization techniques. In human biometric side has been studying the best methods and algorithms used, and the conclusion is that the fingerprint is the best, but it has some flaws. Fingerprint algorithm has been improved so that their performance can be adapted to enhance the clarity of the edge of the gully structures of pictures fingerprint, taking into account the evaluation of the direction of the nearby edges and repeat. In the side of the computer features, computer and its components like human have uniqu
... Show MoreThis paper proposes and tests a computerized approach for constructing a 3D model of blood vessels from angiogram images. The approach is divided into two steps, image features extraction and solid model formation. In the first step, image morphological operations and post-processing techniques are used for extracting geometrical entities from the angiogram image. These entities are the middle curve and outer edges of the blood vessel, which are then passed to a computer-aided graphical system for the second phase of processing. The system has embedded programming capabilities and pre-programmed libraries for automating a sequence of events that are exploited to create a solid model of the blood vessel. The gradient of the middle c
... Show MoreThe automatic liquid filling system is used in different applications such as production of detergents, liquid soaps, fruit juices, milk products, bottled water, etc. The automatic bottle filling system is highly expensive. Where, the common filling systems required to complex changes in hardware and software in order to modify volume of liquid. There are many important variables in the filling process such as volume of liquid, the filling time, etc. This paper presents a new approach to develop an automatic liquid filling system. The new proposed system consists of a conveyor subsystem, filling stations, and camera to detect the level of the liquid at any instant during the filling process. The camera can detect accurately the leve
... Show MoreImage compression is a serious issue in computer storage and transmission, that simply makes efficient use of redundancy embedded within an image itself; in addition, it may exploit human vision or perception limitations to reduce the imperceivable information Polynomial coding is a modern image compression technique based on modelling concept to remove the spatial redundancy embedded within the image effectively that composed of two parts, the mathematical model and the residual. In this paper, two stages proposed technqies adopted, that starts by utilizing the lossy predictor model along with multiresolution base and thresholding techniques corresponding to first stage. Latter by incorporating the near lossless com
... Show MoreIn this work , we study different chaotic properties of the product space on a one-step shift of a finite type, as well as other spaces. We prove that the product is Lyapunove –unstable if and only if at least one or is Lyapunove –unstable. Also, we show that and locally everywhere onto (l.e.o) if and only if is locally everywhere onto (l.e.o) .