Searcharxiv⌕ Search

arXiv subjects

Ajay Kumar

Publications and source records attributed to Ajay Kumar.

At least 109 records · Page 6Linked to original sources

A Collaborative Approach using Ridge-Valley Minutiae for More Accurate Contactless Fingerprint Identification

Contactless fingerprint identification has emerged as an reliable and user friendly alternative for the personal identification in a range of e-business and law-enforcement applications. It is however quite known from the literature that the contactless fingerprint images deliver remarkably low matching accuracies as compared with those obtained from the contact-based fingerprint sensors. This paper develops a new approach to significantly improve contactless fingerprint matching capabilities available today. We systematically analyze the extent of complimentary ridge-valley information and introduce new approaches to achieve significantly higher matching accuracy over state-of-art fingerprint matchers commonly employed today. We also investigate least explored options for the fingerprint color-space conversions, which can play a key-role for more accurate contactless fingerprint matching. This paper presents experimental results from different publicly available contactless fingerprint databases using NBIS, MCC and COTS matchers. Our consistently outperforming results validate the effectiveness of the proposed approach for more accurate contactless fingerprint identification.

cs.CV↗

Radii of Starlikeness and Convexity of Bessel Functions

The radii of starlikeness and convexity associated with lemniscate of Bernoulli and the Janowski function, $(1+Az)/(1+Bz)$ for $-1\leq B<A\leq 1$, have been determined for normalizations of $q$-Bessel function, Bessel function of first kind of order $ν$, Lommel function of first kind and Legendre polynomial of odd degree.

math.CV↗

Matrix Product State Based Quantum Classifier

In recent years, interest in expressing the success of neural networks to the quantum computing has increased significantly. Tensor network theory has become increasingly popular and widely used to simulate strongly entangled correlated systems. Matrix product state (MPS) is the well-designed class of tensor network states, which plays an important role in processing of quantum information. In this paper, we have shown that matrix product state as one-dimensional array of tensors can be used to classify classical and quantum data. We have performed binary classification of classical machine learning dataset Iris encoded in a quantum state. Further, we have investigated the performance by considering different parameters on the ibmqx4 quantum computer and proved that MPS circuits can be used to attain better accuracy. Further, the learning ability of MPS quantum classifier is tested to classify evapotranspiration ($ET_{o}$) for Patiala meteorological station located in Northern Punjab (India), using three years of historical dataset (Agri). Furthermore, we have used different performance metrics of classification to measure its capability. Finally, the results are plotted and degree of correspondence among values of each sample is shown.

quant-ph↗

Lemniscate Convexity and Other Properties of Generalized Bessel Functions

Sufficient conditions on associated parameters $p,b$ and $c$ are obtained so that the generalized and \textquotedblleft{normalized}\textquotedblright{} Bessel function $u_p(z)=u_{p,b,c}(z)$ satisfies $|(1+(zu''_p(z)/u'_p(z)))^2-1|<1$ or $|((zu_p(z))'/u_p(z))^2-1|<1$. We also determine the condition on these parameters so that $-(4(p+(b+1)/2)/c)u'_p(z)\prec\sqrt{1+z}$. Relations between the parameters $μ$ and $p$ are obtained such that the normalized Lommel function of first kind $h_{μ,p}(z)$ satisfies the subordination $1+(zh''_{μ,p}(z)/h'_{μ,p}(z))\prec\sqrt{1+z}$. Moreover, the properties of Alexander transform of the function $h_{μ,p}(z) $ are discussed.

math.CV↗

Quantum finite automata: survey, status and research directions

Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for computations. Quantum automata can be classified thusly: quantum finite automata, quantum sequential machine, quantum pushdown automata, quantum Turing machine and orthomodular lattice-valued automata. These models are useful for determining the expressive power and boundaries of various computational features. In light of the current state of quantum computation theory research, a systematic review of the literature seems timely. This article seeks to provide a comprehensive and systematic analysis of quantum finite automata models, quantum finite automata models with density operators and quantum finite automata models with classical states, interactive proof systems, quantum communication complexity and query complexity as described in the literature. The statistics of quantum finite automata related papers are shown and open problems are identified for more advanced research. The current status of quantum automata theory is distributed into various categories. This research work also highlights the previous research, current status and future directions of quantum automata models.

cs.FL↗

Continuous abstract wavelet transform on homogeneous space

The support of wavelet transform associated with square integrable irreducible representation of a homogeneous space is shown to have infinite measure. Pointwise homogeneous approximation property for wavelet transform has been investigated. An analogue of Heisenberg type inequality has been also obtained for wavelet transform

math.RT↗

Uncertainty principles on nilpotent Lie groups

Hardy's type uncertainty principle on connected nilpotent Lie groups for the Fourier transform is proved. An analogue of Hardy's theorem for Gabor transform has been established for connected and simply connected nilpotent Lie groups. Finally Beurling's theorem for Gabor transform is discussed for groups of the form $\mathbb{R}_n \times K$, where $K$ is a compact group

math.RT↗

A Deep Learning based Framework to Detect and Recognize Humans using Contactless Palmprints in the Wild

Contactless and online palmprint identfication offers improved user convenience, hygiene, user-security and is highly desirable in a range of applications. This technical report details an accurate and generalizable deep learning-based framework to detect and recognize humans using contactless palmprint images in the wild. Our network is based on fully convolutional network that generates deeply learned residual features. We design a soft-shifted triplet loss function to more effectively learn discriminative palmprint features. Online palmprint identification also requires a contactless palm detector, which is adapted and trained from faster-R-CNN architecture, to detect palmprint region under varying backgrounds. Our reproducible experimental results on publicly available contactless palmprint databases suggest that the proposed framework consistently outperforms several classical and state-of-the-art palmprint recognition methods. More importantly, the model presented in this report offers superior generalization capability, unlike other popular methods in the literature, as it does not essentially require database-specific parameter tuning, which is another key advantage over other methods in the literature.

cs.CV↗

McEliece Cryptosystem Based On Extended Golay Code

With increasing advancements in technology, it is expected that the emergence of a quantum computer will potentially break many of the public-key cryptosystems currently in use. It will negotiate the confidentiality and integrity of communications. In this regard, we have privacy protectors (i.e. Post-Quantum Cryptography), which resists attacks by quantum computers, deals with cryptosystems that run on conventional computers and are secure against attacks by quantum computers. The practice of code-based cryptography is a trade-off between security and efficiency. In this chapter, we have explored The most successful McEliece cryptosystem, based on extended Golay code [24, 12, 8]. We have examined the implications of using an extended Golay code in place of usual Goppa code in McEliece cryptosystem. Further, we have implemented a McEliece cryptosystem based on extended Golay code using MATLAB. The extended Golay code has lots of practical applications. The main advantage of using extended Golay code is that it has codeword of length 24, a minimum Hamming distance of 8 allows us to detect 7-bit errors while correcting for 3 or fewer errors simultaneously and can be transmitted at high data rate.

cs.CR↗

On the Power of Quantum Queue Automata in Real-time

This paper proposed a quantum analogue of classical queue automata by using the definition of the quantum Turing machine and quantum finite-state automata. However, quantum automata equipped with storage medium of a stack has been considered, but the concept of quantum queue automata has not been introduced so far. The classical Turing machines can be simulated by classical queue automata. Motivated by the efficiency of the quantum Turing machine and nature of classical queue automata, we have introduced the notion of quantum queue automata using unitary criteria. Our contributions are as follows. We have also introduced a generalization of real-time deterministic queue automata, the real-time quantum queue automata which work in real-time i.e. the input head can move towards the right direction only and takes exactly one step per input symbol. We have shown that real-time quantum queue automata is more superior than its real-time classical variants by using quantum transitions. We have proved the existence of the language that can be recognized by real-time quantum queue automata and cannot be recognized by real-time deterministic (reversible) queue automata. Further, we have shown that there is a language that can be recognized by real-time quantum queue automata but not by real-time non-deterministic queue automata.

quant-ph↗

Starlikeness associated with lemniscate of Bernoulli

For an analytic function $f$ on the unit disk $\mathbb{D}=\{z:|z|<1\}$ satisfying $f(0)=0=f'(0)-1,$ we obtain sufficient conditions so that $f$ satisfies $|(zf'(z)/f(z))^2-1|<1.$ The technique of differential subordination of first or second order is used. The admissibility conditions for lemniscate of Bernoulli are derived and employed in order to prove the main results.

math.CV↗

Certain Classes of Cohen-Macaulay Multipartite Graphs

The Cohen-Macaulay property of a graph arising from a poset has been studied by various authors. In this article, we study the Cohen-Macaulay property of a graph arising from a family of reflexive and antisymmetric relations on a set. We use this result to find classes of multipartite graphs which are Cohen-Macaulay.

math.AC↗

Variations of completely bounded maps on operator spaces

We introduce weighted cb maps and $Λ_μ$-cb maps on operator spaces which are generalizations of completely bounded maps and a certain class of bilinear maps on operator spaces which we call $λ_μ$-cb bilinear maps. Some basic properties of these maps and an operator space tensor product associated to $λ_μ$-cb bilinear maps have been studied.

math.OA↗

Polynomials in operator space theory: matrix ordering and algebraic aspects

We extend the $λ$-theory of operator spaces given by Defant and Wiesner (2014), that generalizes the notion of the projective, Haagerup and Schur tensor norm for operator spaces to matrix ordered spaces and Banach $*$-algebras. Given matrix regular operator spaces and operator systems, we introduce cones related to $λ$ for the algebraic tensor product that respect the matricial structure of matrix regular operator spaces and operator systems, respectively. The ideal structure of $λ$-tensor product of $C^*$-algebras has also been discussed.

math.OA↗

Hardy's Theorem for Gabor transform

We establish analogues of Hardy's theorem for Gabor transform on locally compact abelian groups, Euclidean motion group and several general classes of nilpotent Lie groups which include Heisenberg groups, thread-like nilpotent Lie groups, $2$-NPC nilpotent Lie groups and low-dimensional nilpotent Lie groups.

math.RT↗

$λ$-tensor product of operator spaces

We propose a theory of $λ$-tensor product of operator spaces which extends the theory of Blecher-Paulsen and Effros-Ruan for the operator space projective tensor product \cite{blecp}, \cite{effros}, \cite{eff} and that of Rajpal-Kumar-Itoh for the Schur tensor product \cite{vandee4} of operator spaces.

math.FA↗

Embeddings and $C^*$-envelopes of exact operator systems

We prove a necessary and sufficient condition for embeddability of an operator system into $\mathcal{O}_2$. Using Kirchberg's theorems on a tensor product of $\mathcal{O}_2$ and $\mathcal{O}_{\infty}$, we establish results on their operator system counterparts $\mathcal{S}_2$ and $\mathcal{S}_{\infty}$. Applications of the results proved, including some examples describing $C^*$-envelopes of operator systems, are also discussed.

math.OA↗