A challenging field in image processing and computer graphics is to have higher frequency details by super resolving facial images. Unlike similar papers in this field, this paper introduces a practical face hallucinating approach with higher quality output images. The image reconstruction was based on a set of high and low resolution image pairs. Each image is divided into defined patches with overlapped regions. A patch from a defined location is removed from the low resolution (LR) input image and is compared with the LR patches of the training images with the same location. Each defined LR patch has a defined high resolution (HR) patch. Based on the Euclidean distance comparison, each patch of every single image in the training images database receives a specific weight. This weight is transferred to its relevant HR patch identically. The sum of the gained weights for one specific location of a patch is equal to unity. The HR output image is constructed by integrating the HR hallucinated patches.

Segmentation of brain from magnetic resonance (MR) images has important applications in neuroimaging, in particular it facilitates in extracting different brain tissues such as cerebrospinal fluids, white matter and gray matter. That helps in determining the volume of the tissues in three-dimensional brain MR images, which yields in analyzing many neural disorders such as epilepsy and Alzheimer disease. The Fisher information is a measure of the fluctuations in the observations. In a sense, the Fisher information of an image specifies the quality of the image. In this paper, we developed a new thresholding method using the Fisher information measure and intensity contrast to segment medical images. It is the weighted sum of the Fisher information measure and intensity contrast between the object and background. This technique is a powerful method for noisy image segmentation. The method applied on a normal MR brain images and a glioma MR brain images. Experimental results show that the use of the Fisher information effectively segmented MR brain images.

Extraction of flower regions from complex background is a difficult task, it is an important part of flower image retrieval, and recognition .Image segmentation denotes a process of partitioning an image into distinct regions. A large variety of different segmentation approaches for images have been developed. Image segmentation plays an important role in image analysis. According to several authors, segmentation terminates when the observer's goal is satisfied. For this reason, a unique method that can be applied to all possible cases does not yet exist. This paper studies the flower image segmentation in complex background. Based on the visual characteristics differences of the flower and the surrounding objects, the flower from different backgrounds are separated into a single set of flower image pixels. The segmentation methodology on flower images consists of five steps. Firstly, the original image of RGB space is transformed into Lab color space. In the second step 'a' component of Lab color space is extracted. Then segmentation by two-dimension OTSU of automatic threshold in 'a-channel' is performed. Based on the color segmentation result, and the texture differences between the background image and the required object, we extract the object by the gray level co-occurrence matrix for texture segmentation. The GLCMs essentially represent the joint probability of occurrence of grey-levels for pixels with a given spatial relationship in a defined region. Finally, the segmentation result is corrected by mathematical morphology methods. The algorithm was tested on plague image database and the results prove to be satisfactory. The algorithm was also tested on medical images for nucleus segmentation.

Video Retrieval is a field, where many techniques and methods have been proposed and have claimed to perform reliably on the videos like broadcasting of news & sports events. As a movie contains a large amount of visual information varying in random manner, it requires a highly robust algorithm for automatic shot boundary detection as well as retrieval. In this paper, we described a new adaptive approach for shot boundary detection which is able to detect not only abrupt transitions like hard cuts but also special effects like wipes, fades, and dissolves as well in different movies. To partition a movie video into shots and retrieve many metrics were constructed to measure the similarity among video frames based on all the available video features. However, too many features will reduce the efficiency of the shot boundary detection. Therefore, it is necessary to perform feature reduction for every decision. For this purpose we are following a minimum features based algorithm.

In this paper we worked on the video watermarking technique wherein we took video as a cover medium and some binary images as watermark to be embedded behind the video. Specifically we concentrated on the transform domain technique and we made use of hybridization of the two of the most important and useful transformations, namely Discrete Wavelet Transform and Discrete Cosine Transform, for the purpose of digital watermarking. We evaluated the proposed method with some visual quality matrices and based on the results we concluded that the proposed method provides extra robustness against various attacks as compare to individual use of each transform.

Voice biometric is an easy and cost effective biometric technique which requires minimalistic hardware and software complexity. General voice biometric needs a voice phrase by user which is processed with Mel Filter and Vector Quantized features are extracted. Vector quantization reduces the codebook size but decreases the accuracy of recognition. Therefore we propose a voice biometric system where voice file's non quantized code books are matched with spoken phrase. In order to ensure security to such direct voice sample we embed the voice file in a randomly selected image using DWT technique. Imposters are exposed to only images and are unaware of the voice files. We show that the technique produces better efficiency in comparison to VQ based technique.

Video analytics refers to process the videos intelligently. Video analytics has its most important usage in the field of the surveillance. Surveillance has been used in various areas and one of them is the detection of unintentional fall of patients, senior citizens and children which can cause serious injuries and health threats to children as well as to old persons. Developed countries are progressing in the Surveillance and activity monitoring. But there are limitation and facing problems under certain circumstances. Advancement in the field of computer vision and the prominent decrease in the prices of digital cameras assisted and motivated researchers to propose very useful algorithms for fall detection. The proposed research work is based on the combination of motion history images and eclipse centroid calculation to detect the fall efficiently. The proposed system provides very effective and efficient results on the video sequences of simulated falls.

The paper proposes an advanced convexity based segmentation algorithm for heavily camouflaged images. The convexity of the intensity function is used to detect camouflaged objects from complex environments. We take advantage of operator for the detection of 3D concave or convex graylevels to exhibit the effectiveness of camouflage breaking based on convexity. The biological motivation behind operator and its high robustness make it suitable for camouflage breaking. The traditional convexity based algorithm identifies the desired targets but in addition also identifies sub-targets due to their three dimensional behavior. The problem is overcome by combining the conventional algorithm with thresholding. The proposed method is able to eliminate the sub-targets leaving behind only the target of interest in the input image. The proposed method is compared with the conventional operator. It is also compared with some conventional edge based operator for performance evaluation.