Biometric Face Recognition System using SURF Based Approach

Face recognition can be viewed as the problem of robustly identifying an image of a human face, given some database of known faces [6]. We propose a novel, SURF based approach to the problem of face recognition. Although the results are not gratifying our proposed approach loosens the burden of creating the sub spaces as is done in PCA, LDA and the most recent Bayesian approach. Also, during the experiments even though we used an unturned program for the proposed approach, it outperforms the basic PCA and LDA based approaches in terms of consistency. This article presents a scale-invariant and novel rotation detector and descriptor known as SURF (Speeded-Up Robust Features). SURF outperforms previously defined schemes with respect to repeatability as well as distinctiveness and robustness. It’s computing and comparing can be much faster. This is done by relying on integral images for image convolutions; by making the strengths of the leading existing detectors and descriptors (specifically, using a Hessian matrix-based measure for the detector, and a distribution-based descriptor); and by simplifying these methods to the essential. Its result is a combination of novel detection, description, and finding match steps. The paper contains an overview of the detector and descriptor and then finds out the effects of the most important parameters. The article is concluded with SURF’s application to two challenging. Yet it converse goals i.e. camera calibration which is a special case of image registration and recognition of objects. Our experiments show that SURF is very useful in vast areas of computer vision

Drinfeld center of planar algebra

We introduce fusion, contragradient and braiding of Hilbert affine representations of a subfactor planar algebra $P$ (not necessarily having finite depth). We prove that if $N \subset M$ is a subfactor realization of $P$, then the Drinfeld center of the $N$-$N$-bimodule category generated by $_N L^2 (M)_M$, is equivalent to the category of Hilbert affine representations of $P$ satisfying certain finiteness criterion. As a consequence, we prove Kevin Walker's conjecture for planar algebras.Comment: 32 page

Perturbations of planar algebras

We analyze the effect of pivotal structures (on a 2-category) on the planar algebra associated to a 1-cell as in \cite{Gho08} and come up with the notion of {\em perturbations of planar algebras by weights} (a concept that appeared earlier in Michael Burns' thesis \cite{Bur03}); we establish a one-to-one correspondence between weights and pivotal structures. Using the construction of \cite{Gho08}, to each bifinite bimodule over $II_1$-factors, we associate a {\em bimodule planar algebra} in such a way that extremality of the bimodule corresponds to sphericality of the planar algebra. As a consequence of this, we reproduce an extension of Jones' theorem (\cite{Jon}) (of associating `subfactor planar algebras' to extremal subfactors). Conversely, given a bimodule planar algebra, we construct a bifinite bimodule whose associated bimodule planar algebra is the one which we start with, using perturbations and Jones-Walker-Shlyakhtenko-Kodiyalam-Sunder method of reconstructing an extremal subfactor from a subfactor planar algebra. The perturbation technique helps us to construct an example of a family of non-spherical planar algebras starting from a particular spherical one; we also show that this family is associated to a known family of subfactors constructed by Jones.Comment: 28 page

Slicing of Object-Oriented Software

Software maintenance activities generally account for more than one third of time during the software development cycle. It has been found out that certain regions of a program can cause more damage than other regions, if they contain bugs. In order to find these high-risk areas, we use slicing to obtain a static backward slice of a program. Our project deals with the implementation of different intermediate graphical representations for an input source program such as the Control Dependence Graph, the Program Dependence Graph, the Class Dependence Graph and the System Dependence Graph. Once a graphical representation of an input program is obtained, slicing is performed on the program using its System Dependence Graph and a two pass graph reachability algorithm proposed by Horwitz, to obtain a static backward slice

Effect of sowing dates and varieties for higher productivity of Indian mustard (Brassica juncea L.)

A field experiment was conducted at Agronomy Research Farm, N.D. University of Agriculture and Technology, Kumarganj, Faizabad during the Rabi season of 2011-12 to access the effect of sowing dates and varieties for higher productivity of Indian mustard (Brassica juncea L.). Treatments consisted of four dates of sowing viz. D1 (25th September), D2 (5th October), D3 (15th October) and D4 (25th October) was kept as main plot and five varieties viz.V1 (Rohini), V2 (Maya), V3 (Coral-437), V4 (Kranti) and V5 (PBR-357) was kept as sub plot replicated three under split plot design. Results revealed that all the growth, yield attributes and quality were increased significantly under 25th October sowing. The agronomical parameters like initial plant stand per running meter, plant height (cm), days taken to 50 % flowering, leaf area index, dry matter accumulation (g plant-1) and yield and yield attributes like number of siliquae plant-1, number of seed siliqua-1, length of siliqua (cm) and seed, stover yields (q ha-1) of mustard crop were significantly higher with variety Coral-437. The highest seed yield oil content % was computed under 25th October sowing with Coral-437 variety. 25th October sowing with Coral-437 variety proved the most remunerative and economically feasible for cultivation of Indian mustard under the agro climatic conditions of eastern U.P