Handwritten digit classification using higher order singular value decomposition

DOI10.1016/J.PATCOG.2006.08.004zbMATH Open1119.68188OpenAlexW2060225944MaRDI QIDQ856465FDOQ856465

Lars Eldén, Berkant Savas

Publication date: 7 December 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.08.004

Recommendations

• Handwritten digit recognition by combined classifiers.
• Handwritten digit recognition using an optimized nearest neighbor classifier
• Handwritten digit recognition by combining support vector machines using rule-based reasoning
• scientific article; zbMATH DE number 1055986

zbMATH Keywords

least squarestensorshigher order singular value decompositiontensor approximationhandwritten digit classification

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• The elements of statistical learning. Data mining, inference, and prediction
• Title not available (Why is that?)
• Pattern classification.
• Algorithm 862
• Title not available (Why is that?)
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Title not available (Why is that?)
• Pattern recognition by means of disjoint principal components models

Cited In (28)

• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• Tensor Approximation for Multidimensional and Multivariate Data
• Title not available (Why is that?)
• HOID: higher order interpolatory decomposition for tensors based on Tucker representation
• Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations
• An L-DEIM induced high order tensor interpolatory decomposition
• Spatio-temporal Koopman decomposition
• Matrix stretching
• The tensor rank problem over the quaternions
• Optimization landscape of Tucker decomposition
• Unfoldings and the rank-one approximation of the tensor
• Low rank tensor recovery via iterative hard thresholding
• Advances in Neural Networks – ISNN 2005
• Randomized algorithms for the low multilinear rank approximations of tensors
• Incremental tensor principal component analysis for handwritten digit recognition
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Decomposition for a quaternion tensor triplet with applications
• Tensor-train decomposition for image recognition
• Krylov-type methods for tensor computations.I
• Nonlinearly preconditioned optimization on Grassmann manifolds for computing approximate Tucker tensor decompositions
• The rank of a 2 × 2 × 2 tensor
• Structured multi-way arrays and their applications
• A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
• Factorization strategies for third-order tensors
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
• RA-HOOI: rank-adaptive higher-order orthogonal iteration for the fixed-accuracy low multilinear-rank approximation of tensors
• On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor

This page was built for publication: Handwritten digit classification using higher order singular value decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856465)