Matrix correlation distance for 2D image classification

Hyunsoek Choi, Jeongin Seo, Hyeyoung Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

In the field of visual information processing, there have been active studies on the efficient representation of visual data, such as local feature descriptors and tensor subspace analysis. Though these methods give a representation using matrix features, current methods for classification are mainly designed for 1D vector data, which may lead to loss of information included in 2D matrix data. To solve the problem, we propose a matrix correlation distance for 2D image data by extending the correlation distance for random vectors. Through a number of computational experiments on image data with various representations, we compare the performance of the proposed measure with conventional distances.

Original languageEnglish
Title of host publicationProceedings of the 29th Annual ACM Symposium on Applied Computing, SAC 2014
PublisherAssociation for Computing Machinery
Pages1741-1742
Number of pages2
ISBN (Print)9781450324694
DOIs
StatePublished - 2014
Event29th Annual ACM Symposium on Applied Computing, SAC 2014 - Gyeongju, Korea, Republic of
Duration: 24 Mar 201428 Mar 2014

Publication series

NameProceedings of the ACM Symposium on Applied Computing

Conference

Conference29th Annual ACM Symposium on Applied Computing, SAC 2014
Country/TerritoryKorea, Republic of
CityGyeongju
Period24/03/1428/03/14

Keywords

  • Correlation distance
  • Image classification
  • Matrix feature
  • Similarity measure

Fingerprint

Dive into the research topics of 'Matrix correlation distance for 2D image classification'. Together they form a unique fingerprint.

Cite this