With the fast growth of communication networks, the video data transmission from these networks is extremely vulnerable. Error concealment is a technique to estimate the damaged data by employing the correctly received data at the decoder. In this paper, an efficient boundary matching algorithm for estimating damaged motion vectors (MVs) is proposed. The proposed algorithm performs error concealment for each damaged macro block (MB) according to the list of identified priority of each frame. It then uses a classic boundary matching criterion or the proposed boundary matching criterion adaptively to identify matching distortion in each boundary of candidate MB. Finally, the candidate MV with minimum distortion is selected as an MV of damaged MB and the list of priorities is updated. Experimental results show that the proposed algorithm improves both objective and subjective qualities of reconstructed frames without any significant increase in computational cost. The PSNR for test sequences in some frames is increased about 4.7, 4.5, and 4.4 dB compared to the classic boundary matching, directional boundary matching, and directional temporal boundary matching algorithm, respectively.

Rain areas delineation proposed in this paper is based on the image fusion from geostationary Meteosat Second Generation (MSG) satellite, with the low-earth orbiting passive Tropical Rainfall Measuring Mission (TRMM) satellite. The fusion technique described in this work used an artificial neural network (ANN). It's has been developed to detect instantaneous rainfall by using information from the IR images of MSG satellite and from TRMM Microwave Imager (TMI). The study is carried out over north of Algeria. Seven spectral parameters are used as input data of ANN to identify raining or non - raining pixels. Corresponding data of raining /non-raining pixels are taken from a PR (precipitation radar) issued from TRMM. Results from the developed scheme are compared with the results of SI method (Scattering Index) taken as reference method. The results show that the developed model performs very well and overcomes the deficiencies of use a single satellite.

In this paper, we present a new image resolution enhancement algorithm based on cycle spinning and stationary wavelet subband padding. The proposed technique or algorithm uses stationary wavelet transformation (SWT) to decompose the low resolution (LR) image into frequency subbands. All these frequency subbands are interpolated using either bicubic or lanczos interpolation, and these interpolated subbands are put into inverse SWT process for generating intermediate high resolution (HR) image. Finally, cycle spinning (CS) is applied on this intermediate high resolution image for reducing blocking artifacts, followed by, traditional Laplacian sharpening filter is used to make the generated high resolution image sharper. This new technique has been tested on several satellite images. Experimental result shows that the proposed technique outperforms the conventional and the state-of-the-art techniques in terms of peak signal to noise ratio, root mean square error, entropy, as well as, visual perspective.

In this paper we propose a composite silence removal technique comprising of short time energy and statistical method. The performance of the proposed algorithm is compared with the Short Time Energy (STE) algorithm and the statistical method with varying Signal to Noise Ratio (SNR). In the presence of low SNR the performance of proposed algorithm is highly appreciable in compare to STE and statistical method. We have applied the proposed algorithm in the pre processing stage of speaker identification system. A comparison between the speaker identification rate including and excluding the silence removal technique shows around 20% increase in identification rate by the application of this proposed algorithm.

The aim of the algorithm described in this paper is to segment wound images from the normal and classify them according to the types of the wound. The segmentation of wounds extravagates color representation, which has been followed by an algorithm of grayscale segmentation based on the stack mathematical approach. Accurate classification of wounds and analyzing wound healing process is a critical task for patient care and health cost reduction at hospital. The tissue uniformity and flatness leads to a simplified approach but requires multispectral imaging for enhanced wound delineation. Contour Evolution method which uses multispectral imaging replaces more complex tools such as, SVM supervised classification, as no training step is required. In Contour Evolution, classification can be done by clustering color information, with differential quantization algorithm, the color centroids of small squares taken from segmented part of the wound image in (C1,C2) plane. Where C1, C2 are two chrominance components. Wound healing is identified by measuring the size of the wound through various means like contact and noncontact methods of wound. The wound tissues proportion is also estimated by a qualitative visual assessment based on the red-yellow-black code. Moreover, involving all the spectral response of the tissue and not only RGB components provides a higher discrimination for separating healed epithelial tissue from granulation tissue.

Blur is an undesirable phenomenon which appears as one of the most frequent causes of image degradation. Automatic blur detection is extremely enviable to restore barcode image or simply utilize them. That is to assess whether a given image is blurred or not. To detect blur, many algorithms have been proposed. These algorithms are different in their performance, time complexity, precision, and robustness in noisy environments. In this paper, we present an efficient method blur detection in barcode images, with no reference perceptual blur metric using wavelets.

The present paper presents a new age classification method by integrating the features derived from Grey Level Co-occurrence Matrix (GLCM) with a new structural approach derived from four distinct LBP's (4-DLBP) on a 3 x 3 image. The present paper derived four distinct patterns called Left Diagonal (LD), Right diagonal (RD), vertical centre (VC) and horizontal centre (HC) LBP's. For all the LBP's the central pixel value of the 3 x 3 neighbourhood is significant. That is the reason in the present research LBP values are evaluated by comparing all 9 pixels of the 3 x 3 neighbourhood with the average value of the neighbourhood. The four distinct LBP's are grouped into two distinct LBP's. Based on these two distinct LBP's GLCM is computed and features are evaluated to classify the human age into four age groups i.e: Child (0-15), Young adult (16-30), Middle aged adult (31-50) and senior adult (>50). The co-occurrence features extracted from the 4-DLBP provides complete texture information about an image which is useful for classification. The proposed 4-DLBP reduces the size of the LBP from 6561 to 79 in the case of original texture spectrum and 2020 to 79 in the case of Fuzzy Texture approach.

In this paper, pipelined Vedic-Array multiplier architecture is proposed. The most significant aspect of the proposed multiplier architecture method is that, the developed multiplier architecture is designed based on the Vedic and Array methods of multiplier architecture. The multiplier architecture is optimized in terms of multiplication and addition to achieve efficiency in terms of area, delay and power. This also gives chances for modular design where smaller block can be used to design the bigger one. So the design complexity gets reduced for inputs of larger number of bits and modularity gets increased. The proposed Vedic-Array multiplier is coded in Verilog, synthesized and simulated using EDA (Electronic Design Automation) tool - XilinxISE12.3, Spartan 3E, Speed Grade-4. Finally the results are compared with array and booth multiplier architectures. Proposed multiplier is better in terms of delay and area as compared to booth multiplier and array multiplier respectively. The proposed multiplier architecture can be used for high-speed requirements.