In modern times face recognition is one of the vital sides for computer vision. This is due to many reasons involving availability and accessibility of technologies and commercial applications. Face recognition in a brief statement is robotically recognizing a person from an image or video frame. In this paper, an efficient face recognition algorithm is proposed based on the benefit of wavelet decomposition to extract the most important and distractive features for the face and Eigen face method to classify faces according to the minimum distance with feature vectors. Faces94 data base is used to test the method. An excellent recognition with minimum computation time is obtained with accuracy reaches to 100% and recognition time decrease

Most of today’s techniques encrypt all of the image data, which consumes a tremendous amount of time and computational payload. This work introduces a selective image encryption technique that encrypts predetermined bulks of the original image data in order to reduce the encryption/decryption time and the
computational complexity of processing the huge image data. This technique is applying a compression algorithm based on Discrete Cosine Transform (DCT). Two approaches are implemented based on color space conversion as a preprocessing for the compression phases YCbCr and RGB, where the resultant compressed sequence is selectively encrypted using randomly generated combined secret key.
The results showed a significant reduct

In this work, an enhanced Photonic Crystal Fiber (PCF) based on Surface Plasmon Resonance (SPR) sensor using a sided polished structure for the detection of toxic ions Arsenic in water was designed and implemented. The SPR curve can be obtained by polishing the side of the PCF after coating the Au film on the side of the polished area, the SPR curve can be obtained. The proposed sensor has a clear SPR effect, according to the findings of the experiments. The estimated signal to Noise Ratio (SNR), sensitivity (S), resolution (R), and Figures of merit (FOM) are approaching; the SNR is 0.0125, S is 11.11 μm/RIU, the resolution is 1.8x〖10〗^(-4), and the FOM is 13.88 for Single-mode Fiber- Photonic Crystal Fiber- single mode Fiber (SMF-P

With wireless sensor network (WSN) wide applications in popularity, securing its data becomes a requirement. This can be accomplished by encrypting sensor node data. In this paper a new an efficient symmetric cryptographic algorithm is presented. This algorithm is called wireless sensor network wavelet curve ciphering system (WSN-WCCS).  The algorithm idea based on discrete wavelet transformation to generate keys for each node in WSN.  It implements on hierarchical clustering WSN using LEACH protocol. Python programming language version 2.7 was used to create the simulator of WSN framework and implement a WSN-WCCS algorithm. The simulation result of the proposed WSN-WCCS with other symmetric algorithms has show

Water quality sensors have recently received a lot of attention due to their impact on human health. Due to their distinct features, environmental sensors are based on carbon quantum dots (CQDs). In this study, CQDs were prepared using the electro-chemical method, where the structural and optical properties were studied. These quantum dots were used in the environmental sensor application after mixing them with three different materials: CQDs, Alq3 polymer and CQDs and Alq3 solutions using two different methods: drop casting and spin coating, and depositing them on silicon. The sensitivity of the water pollutants was studied for each case of the prepared samples after measuring the change in resistance of the samples at a temperature of

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall