Hierarchical Manifold Sensing with Foveation and Adaptive Partitioning of the Dataset
The authors present a novel method, Hierarchical Manifold Sensing, for adaptive and efficient visual sensing. As opposed to the previously introduced Manifold Sensing algorithm, the new version introduces a way of learning a hierarchical partitioning of the dataset based on k-means clustering. The algorithm can perform on whole images but also on a foveated dataset, where only salient regions are sensed. The authors evaluate the proposed algorithms on the COIL, ALOI, and MNIST datasets. Although they use a very simple nearest-neighbor classifier, on the easier benchmarks, COIL and ALOI, perfect recognition is possible with only six or ten sensing values. Moreover, they show that their sensing scheme yields a better recognition performance than compressive sensing with random projections. On MNIST, state-of-the-art performance cannot be reached, but they show that a large number of test images can be recognized with only very few sensing values. However, for many applications, performance on challenging benchmarks may be less relevant than the simplicity of the solution (processing power, bandwidth) when solving a less challenging problem.
Document Type: Research Article
Publication date: 2016-03-01
The Journal of Imaging Science and Technology (JIST) is dedicated to the advancement of imaging science knowledge, the practical applications of such knowledge, and how imaging science relates to other fields of study. The pages of this journal are open to reports of new theoretical or experimental results, and to comprehensive reviews. Only original manuscripts that have not been previously published, nor currently submitted for publication elsewhere, should be submitted.
IS&T's JIST-first publication option allows authors wishing to present their work at conferences, but have a journal citation for their paper, to submit a paper to JIST that follows the same rigorous peer-review vetting and publication process as traditional JIST articles, but with the benefit of a condensed time-to-publication time frame and guaranteed conference presentation slot.
Please note: For purposes of its Digital Library content, IS&T defines Open Access as papers that will be downloadable in their entirety for free in perpetuity. Copyright restrictions on papers vary; see individual paper for details.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Membership Information
- Information for Advertisers
- Terms & Conditions
- Information for JIST-First Authors
- Ingenta Connect is not responsible for the content or availability of external websites