Feature Learning Networks for Floor Sensor-based Gait Recognition
Bibliographic record
Abstract
Deep learning (DL) has become a powerful tool in many image classification applications but often requires large training sets to achieve high accuracy. For applications where the available data are limited, this can become a severely limiting factor in model performance. To address this limitation, feature learning network approaches that integrate traditional feature extraction methods with DL frameworks have been proposed. In this study, the performances of traditional methods: discrete wavelet transform (DWT), discrete cosine transform (DCT), independent component analysis (ICA), and principal component analysis (PCA); and their corresponding feature networks based on a convolutional neural network (CNN) framework: ScatNet (wavelet scattering network), DCTNet, ICANet, and PCANet, were investigated for use in pressure-based footstep recognition when the limited sample size is available for person authentication. The results show that the feature learning networks (90.6% accuracy) achieved significantly better performance on average than the conventional feature extraction methods (79.7% accuracy) (p < 0.05). Among the different feature networks, PCANet provided the best verification performance, with an accuracy of 92.2%. Feature learning networks are simple and effective approaches that can be a promising solution for applications like floor-based gait recognition in a security access scenario (such as workspace environment and border control) when small amounts of data are available for training models to differentiate between a larger group of users.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".