Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1505.05840

Comparative Evaluation of Symmetric SVD Algorithms for Real-time Face and Eye Tracking

Tapan Pradhan·Aurobinda Routray·Bibek Kabi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Computation of singular value decomposition (SVD) has been a topic of concern by many numerical linear algebra researchers. Fast SVD has been a very effective tool in computer vision in a number of aspects, such as: face recognition, eye tracking etc. At the present state of the art fast and fixed-point power efficient SVD algorithm needs to be developed for real-time embedded computing. The work in this paper is the genesis of an attempt to build an on-board real-time face and eye tracking system for human drivers to detect loss of attention due to drowsiness or fatigue. A major function of this on-board system is quick customization. This is carried out when a new driver comes in. The face and eye images are recorded while instructing the driver for making specific poses. The eigen faces and eigen eyes are generated at several resolution levels and stored in the on-board computer. The discriminating eigen space of face and eyes are determined and stored in the on-board flash memory for detection and tracking of face and eyes and classification of eyes (open or closed) as well. Therefore, fast SVD of image covariance matrix at various levels of resolution needs to be carried out to generate the eigen database. As a preliminary step, we review the existing symmetric SVD algorithms and evaluate their feasibility for such an application. In this article, we compare the performance of (1) Jacobi's, (2) Hestenes', (3) Golub-Kahan, (4) Tridiagonalization and Symmetric QR iteration and (5) Tridiagonalization and Divide and Conquer algorithms. A case study has been demonstrated as an example.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tapan Pradhan, Aurobinda Routray, Bibek Kabi. 2015-05-21. Comparative Evaluation of Symmetric SVD Algorithms for Real-time Face and Eye Tracking. https://doi.org/10.1007/978-3-642-30232-9_13

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fully spectral scheme for the linear BGK equation on the whole space

In this article, we design a fully spectral method in both space and velocity for a linear inhomogeneous kinetic equation with mass, momentum and energy conservation. We focus on the linear BGK equation with a confinement potential $Φ$, even if the method could be applied to different collision operators. It is based upon the projection on Hermite polynomials in velocity and orthonormal polynomials with respect to the weight $e^{-$Φ$}$ in space. The potential $Φ$ is assumed to be a polynomial. It is, to the author's knowledge, the first scheme which preserves hypocoercive behavior in addition to the conservation laws. These different properties are illustrated numerically on both quadratic and double well potential.

math.NA↗
arXiv2026

Inverse inequalities for kernel-based approximation on bounded domains and Riemannian manifolds

This paper establishes inverse inequalities for kernel-based approximation spaces defined on bounded Lipschitz domains in $\mathbb{R}^d$ and compact Riemannian manifolds. While inverse inequalities are well-studied for polynomial spaces, their extension to kernel-based trial spaces poses significant challenges. For bounded Lipschitz domains, we extend prior Bernstein inequalities, which only apply to a limited range of Sobolev orders, to the full range of lower and upper orders, and derive Nikolskii inequalities that bound $L_\infty$ norms by $L_2$ norms. For compact Riemannian manifolds, we focus on restricted kernels, which are defined as the restriction of positive definite kernels from the ambient Euclidean space to the manifold, and prove their counterparts.

math.NA↗
arXiv2026

Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks

This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.

math.NA↗