Optimized Face Recognition Algorithm using Spatial and Transform Domain Techniques

The biometrics is used to identify or verify persons effectively in the real time scenario. In this paper, we propose Optimized Face Recognition Algorithm using Spatial and Transform Domain Techniques. The face images are preprocessed using Discrete Wavelet Transform (DWT), resize and filtering. The Compound Local Binary Pattern (CLBF) is used to generate magnitude and sign components from preprocessed face images. The histogram is applied on sign and magnitude components of CLBF to compress number of features. The generated histogram features are concatenated to form CLBP-Histogram features. The Fast Fourier Transformation (FFT) is applied on preprocessed image and FFT magnitude features are generated. The CLBP-Histogram features are fused with FFT magnitude features to generate final feature set. The final feature sets of test image and data base images are compared using Euclidian Distance (ED) to recognise a person. It is observed that the performance parameter of the proposed algorithm is better compared to existing algorithms

Graded Reliance Based Routing Scheme for Wireless Sensor Networks

In this paper Graded Reliance based routing algorithm is proposed to deal with defective nodes in Wireless Sensor Networks (WSN’s).The algorithm is intended to validated or build evidence that, by dynamically learning from previous experience and adapting the changes in the operational environment the application performance can be maximized and also enhance operative agility. Quality of service and social network measures are used to evaluate the confidence score of the sensor node. A dynamic model-based analysis is formulated for best reliance composition, aggregation, and formation to maximize routing performance. The results indicate that reliance based routing approaches yields better performance in terms of message delivery ratio and message delay without incurring substantial message overhead

Conditional Entrench Spatial Domain Steganography

Steganography is a technique of concealing the secret information in a digital carrier media, so that only the authorized recipient can detect the presence of secret information. In this paper, we propose a spatial domain steganography method for embedding secret information on conditional basis using 1-Bit of Most Significant Bit (MSB). The cover image is decomposed into blocks of 8*8 matrix size. The first block of cover image is embedded with 8 bits of upper bound and lower bound values required for retrieving payload at the destination. The mean of median values and difference between consecutive pixels of each 8*8 block of cover image is determined to embed payload in 3 bits of Least Significant Bit (LSB) and 1 bit of MSB based on prefixed conditions. It is observed that the capacity and security is improved compared to the existing methods with reasonable PSNR

Gauge coupling flux thresholds, exotic matter and the unification scale in F-SU(5) GUT

We explore the gauge coupling relations and the unification scale in F-theory SU(5) GUT broken down to the Standard Model by an internal U(1)Y gauge flux. We consider variants with exotic matter representations which may appear in these constructions and investigate their role in the effective field theory model. We make a detailed investigation on the conditions imposed on the extraneous matter to raise the unification scale and make the color triplets heavy in order to avoid fast proton decay. We also discuss in brief the implications on the gaugino masses.Comment: 20 pages, 3 figures, references and extended comments on KK thresholds effects adde

Viable mass production method for cotton pink bollworm, Pectinophora gossypiella (Saunders)

AbstractCotton seed based artificial diet has been standardized for continuous rearing of pink bollworm Pectinophora gossypiella (Saunders) at the Central Institute for Cotton Research, Regional Station, Coimbatore. The ingredients of the diet are easily available and are cost effective. Basic ingredients of the diet are cotton seed flour (processed) and chick pea flour, Carbohydrate, Protein, Fat sources, multi vitamin, antimicrobial agents and agar as thickening agent are used as other ingredients. Micro centrifuge tubes with lid were used as rearing containers. Individual neonate larvae were released on each piece of the diet inside the micro centrifuge tube and the lids were closed. This prevented larval escape, retaining them inside the tubes and also prevented diet dehydration. The recovery of insect reared on diet was recorded as 95.56%. Egg hatchability and adult emergence were 100% while pupal malformation was nil. Eggs, larval and pupal periods were recorded as 4.8±0.632, 25.10±0.994 and 7.9±0.88days, respectively. Larval and pupal weights were recorded as 21.40mg±3.63, 18.00mg±2.73, respectively

Fermion masses in SO(10) with a single adjoint Higgs field

It has recently been shown how to break SO(10) down to the Standard Model in a realistic way with only one adjoint Higgs. The expectation value of this adjoint must point in the B-L direction. This has consequences for the possible form of the quark and lepton mass matrices. These consequences are explored in this paper, and it is found that one is naturally led to consider a particular form for the masses of the heavier generations. This form implies typically that there should be large (nearly maximal) mixing of the mu- and tau-neutrinos. An explanation that does not involve large tan beta also emerges for the fact that b and tau are light compared to the top quark.Comment: 20 pages, LaTeX, clarification of statements about multiple adjoint Higgs fields in the context of superstring theor

Hybrid domain based face recognition using DWT, FFT and compressed CLBP

The characteristics of human body parts and behaviour are measured with biometrics, which are used to authenticate a person. In this paper, we propose Hybrid Domain based Face Recognition using DWT, FFT and Compressed CLBP. The face images are preprocessed to enhance sharpness of images using Discrete Wavelet Transform (DWT) and Laplacian filter. The Compound Local Binary Pattern (CLBP) is applied on sharpened preprocessed face image to compute magnitude and sign components. The histogram is applied on CLBP components to compress number of features. The Fast Fourier Transformation (FFT) is applied on preprocessed image and compute magnitudes. The histogram features and FFT magnitude features are fused to generate final feature. The Euclidian Distance (ED) is used to compare final features of test face images with data base face images to compute performance parameters. It is observed that the percentage recognition rate is high in the case of proposed algorithm compared to existing algorithms

Power law enhancement of neutrino mixing angles in extra dimensions

We study the renormalization of the $llHH$-type Majorana neutrino mass operator in a scenario where there is a compactified extra dimension and the fields involved correspond to only the standard model particles and their Kaluza-Klein excitations. We observe that in a two flavour scenario, where one of the neutrinos is necessarily $\nu_\tau$, it is indeed possible to generate a large mixing at $\sim$ 100 GeV starting from a very small mixing near the ultra-violet cutoff $\sim$ 30 TeV. {\em En passant}, we also derive the Higgs mass upper and lower limits from perturbative unitarity and stability of the potential, respectively.Comment: Latex, 6 pages, one pslatex figure; v2: clarifying remarks added, minor typos corrected, references updated, version to appear in Phys. Rev.

Relative toxicity of insecticides against cotton mealybug Phenacoccus solenopsis Tinsley (Hemiptera:Pseudococcidae) and its fortuous parasitod Aenasius bambawalei Hayat (Hymenoptera: Encyrtidae)

Nineteen insecticidal formulations from 10 groups of insecticides were evaluated for their relative toxicity against cotton mealybug Phenacoccus solenopsis Tinsley and its fortuous parasitoid Aenasius bambawalei Hayat. Insects were exposed to cotton leaves dipped in insecticidal solutions and their mortality was recorded at 24-h intervals. Within 24 h of exposure, Quinalphos, Chlorpyriphos, Thiamethoxam and Profenophos have detrimental effect on both P. solenospis and A. bambawalei recorded more than 70% mortality. Thiodicarb was extremely toxic to P. solenopsis and least toxic to A. bambawalei where as Spinosad was less toxic to P. solenopsis and extremely toxic to A. bambawalei. Profenophos, Thiamethoxam and Chlorpyriphos results into > 90% mortality of P. solenospsis while 100% kill of A. bambawalei with Spinosad, Acephate and Chlorpyriphos up to 48 hours. More than 80% mortality of P. solenopsis with Chlorpyriphos, Profenophos, Monocrotophos, Thiamethoxam, Spinosad and of A. bambawalei with Profenophos, Monocrotophos, Flonicamid, Buprofezin, Imidacloprid, Thiamethoxam, Chlorantraniliprole, Flonicamid and Indoxacarb recorded 72 hours after exposure. While at 96 hours, cent per cent mortality of P. solenopsis was recorded with Monocrotophos which was equivalent to Acephate and Spinosad. Least LT50 values were found with Thiodicarb, Quinalphos and Thiamethoxam for P. solenopsis and higher in case of Thiodicarb for A. bambawalei. Spinosad, Chlorpyriphos and Quinalphos were found to be extremely toxic to A. bambawalei. Among the tested insecticides Thiodicarb was found effective against P. solenopsis and relatively safer to A. bambawalei may be used judiciously to manage P. solenopsis that have least implications on the environment

Low-Power and Area-Efficient Carry Select Adder

Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. From the structure of the CSLA, it is clear that there is scope for reducing the area and power consumption in the CSLA. This work uses a simple and efficient gate-level modification to significantly reduce the area and power of the CSLA. Based on this modification 8-, 16-, 32-, and 64-b square-root CSLA (SQRT CSLA) architecture have been developed and compared with the regular SQRT CSLA architecture. The proposed design has reduced area and power as compared with the regular SQRT CSLA with only a slight increase in the delay. This work evaluates the performance of the proposed designs in terms of delay, area, power, and their products by hand with logical effort and through custom design and layout in CMOS process technology. The results analysis shows that the proposed CSLA structure takes only 30.385 ns which is better than the regular SQRT CSLA