Efficient blind adaptive Karhunen–Loéve transform via parallel search

This article introduces a new algorithm that constructs an efficient search strategy, called parallel search, for blind adaptive Karhunen–Loéve transform. Unlike anterior Karhunen–Loéve transform, the proposed algorithm converges quickly by searching for solutions in different directions simultaneou...

Full description

Bibliographic Details
Main Authors: Wenbiao Tian, Guosheng Rui, Daoguang Dong, Jian Kang
Format: Article
Language:English
Published: Hindawi - SAGE Publishing 2018-06-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1177/1550147718782371
_version_ 1797726318427635712
author Wenbiao Tian
Guosheng Rui
Daoguang Dong
Jian Kang
author_facet Wenbiao Tian
Guosheng Rui
Daoguang Dong
Jian Kang
author_sort Wenbiao Tian
collection DOAJ
description This article introduces a new algorithm that constructs an efficient search strategy, called parallel search, for blind adaptive Karhunen–Loéve transform. Unlike anterior Karhunen–Loéve transform, the proposed algorithm converges quickly by searching for solutions in different directions simultaneously. Moreover, the process is “blind,” which means that minimal information about the original data is used. The new algorithm also avoids repeating the Karhunen–Loéve transform basis learning step in data compression applications. Numerical simulation results verify the validity of the theory and illustrate the capability of the proposed algorithm.
first_indexed 2024-03-12T10:43:53Z
format Article
id doaj.art-b07061eefaee44d5a463bdc85cd8199c
institution Directory Open Access Journal
issn 1550-1477
language English
last_indexed 2024-03-12T10:43:53Z
publishDate 2018-06-01
publisher Hindawi - SAGE Publishing
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj.art-b07061eefaee44d5a463bdc85cd8199c2023-09-02T07:52:15ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772018-06-011410.1177/1550147718782371Efficient blind adaptive Karhunen–Loéve transform via parallel searchWenbiao TianGuosheng RuiDaoguang DongJian KangThis article introduces a new algorithm that constructs an efficient search strategy, called parallel search, for blind adaptive Karhunen–Loéve transform. Unlike anterior Karhunen–Loéve transform, the proposed algorithm converges quickly by searching for solutions in different directions simultaneously. Moreover, the process is “blind,” which means that minimal information about the original data is used. The new algorithm also avoids repeating the Karhunen–Loéve transform basis learning step in data compression applications. Numerical simulation results verify the validity of the theory and illustrate the capability of the proposed algorithm.https://doi.org/10.1177/1550147718782371
spellingShingle Wenbiao Tian
Guosheng Rui
Daoguang Dong
Jian Kang
Efficient blind adaptive Karhunen–Loéve transform via parallel search
International Journal of Distributed Sensor Networks
title Efficient blind adaptive Karhunen–Loéve transform via parallel search
title_full Efficient blind adaptive Karhunen–Loéve transform via parallel search
title_fullStr Efficient blind adaptive Karhunen–Loéve transform via parallel search
title_full_unstemmed Efficient blind adaptive Karhunen–Loéve transform via parallel search
title_short Efficient blind adaptive Karhunen–Loéve transform via parallel search
title_sort efficient blind adaptive karhunen loeve transform via parallel search
url https://doi.org/10.1177/1550147718782371
work_keys_str_mv AT wenbiaotian efficientblindadaptivekarhunenloevetransformviaparallelsearch
AT guoshengrui efficientblindadaptivekarhunenloevetransformviaparallelsearch
AT daoguangdong efficientblindadaptivekarhunenloevetransformviaparallelsearch
AT jiankang efficientblindadaptivekarhunenloevetransformviaparallelsearch