Skip navigation
Skip navigation

A scalable unsupervised feature merging approach to efficient dimensionality reduction of high-dimensional visual data

Liu, Lingqiao; Wang, Lei

Description

To achieve a good trade-off between recognition accuracy and computational efficiency, it is often needed to reduce high-dimensional visual data to medium-dimensional ones. For this task, even applying a simple full-matrix-based linear projection causes significant computation and memory use. When the number of visual data is large, how to efficiently learn such a projection could even become a problem. The recent feature merging approach offers an efficient way to reduce the dimensionality,...[Show more]

dc.contributor.authorLiu, Lingqiao
dc.contributor.authorWang, Lei
dc.coverage.spatialSydney Australia
dc.date.accessioned2015-12-10T23:07:51Z
dc.date.createdDecember 1-8 2013
dc.identifier.isbn9781479930227
dc.identifier.urihttp://hdl.handle.net/1885/63039
dc.description.abstractTo achieve a good trade-off between recognition accuracy and computational efficiency, it is often needed to reduce high-dimensional visual data to medium-dimensional ones. For this task, even applying a simple full-matrix-based linear projection causes significant computation and memory use. When the number of visual data is large, how to efficiently learn such a projection could even become a problem. The recent feature merging approach offers an efficient way to reduce the dimensionality, which only requires a single scan of features to perform reduction. However, existing merging algorithms do not scale well with high-dimensional data, especially in the unsupervised case. To address this problem, we formulate unsupervised feature merging as a PCA problem imposed with a special structure constraint. By exploiting its connection with k-means, we transform this constrained PCA problem into a feature clustering problem. Moreover, we employ the hashing technique to improve its scalability. These produce a scalable feature merging algorithm for our dimensionality reduction task. In addition, we develop an extension of this method by leveraging the neighborhood structure in the data to further improve dimensionality reduction performance. In further, we explore the incorporation of bipolar merging-a variant of merging function which allows the subtraction operation-into our algorithms. Through three applications in visual recognition, we demonstrate that our methods can not only achieve good dimensionality reduction performance with little computational cost but also help to create more powerful representation at both image level and local feature level.
dc.publisherIEEE
dc.relation.ispartofseries2013 14th IEEE International Conference on Computer Vision Workshops, ICCVW 2013
dc.sourceProceedings of the IEEE International Conference on Computer Vision
dc.titleA scalable unsupervised feature merging approach to efficient dimensionality reduction of high-dimensional visual data
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2013
local.identifier.absfor080309 - Software Engineering
local.identifier.ariespublicationU3488905xPUB763
local.type.statusPublished Version
local.contributor.affiliationLiu, Lingqiao, College of Engineering and Computer Science, ANU
local.contributor.affiliationWang, Lei, University of Wollongong
local.description.embargo2037-12-31
local.bibliographicCitation.startpage3008
local.bibliographicCitation.lastpage3015
local.identifier.doi10.1109/ICCV.2013.374
dc.date.updated2015-12-10T09:02:24Z
local.identifier.scopusID2-s2.0-84898785720
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Liu_A_scalable_unsupervised_2013.pdf430.96 kBAdobe PDF    Request a copy
02_Liu_A_scalable_unsupervised_2013.pdf54.2 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator