✦ LIBER ✦

New learning subspace method for image feature extraction

✍ Scribed by Jian-hai Cao; Long Li; Chang-hou Lu

Publisher: Tianjin University of Technology
Year: 2006
Tongue: English
Weight: 386 KB
Volume: 2
Category: Article
ISSN: 1673-1905
DOI: 10.1007/bf03033645

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A multi-manifold discriminant analysis m

A multi-manifold discriminant analysis method for image feature extraction

✍ Wankou Yang; Changyin Sun; Lei Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 725 KB

Random subspace method for multivariate

Random subspace method for multivariate feature selection

✍ Carmen Lai; Marcel J.T. Reinders; Lodewyk Wessels 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Hebbian learning subspace method: A new

Hebbian learning subspace method: A new approach

✍ M. Prakash; M.Narasimha Murty 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 697 KB

In this paper, we propose a new learning algorithm for the Subspace Pattern Recognition Method (SPRM) called the Hebbian Learning Subspace Method (HLSM). It uses the notion of a weighted squared orthogonal projection distance winch gives different weightages to different basis vectors in the computa

A new method of semantic feature extract

A new method of semantic feature extraction for medical images data

✍ Xie Conghua; Song Yuqing; Chang Jinyi 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 886 KB

Image covariance-based subspace method f

Image covariance-based subspace method for face recognition

✍ Chunghoon Kim; Chong-Ho Choi 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 663 KB

Probabilistic Feature Relevance Learning

Probabilistic Feature Relevance Learning for Content-Based Image Retrieval

✍ Jing Peng; Bir Bhanu; Shan Qing 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 695 KB

Most of the current image retrieval systems use "one-shot" queries to a database to retrieve similar images. Typically a Knearest neighbor kind of algorithm is used, where weights measuring feature importance along each input dimension remain fixed (or manually tweaked by the user), in the computati