<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Sparse bounded component analysis

Loading...
Thumbnail Image

Departments

School / College / Institute

Item type:Organizational Unit,

Program

Organization Authors

Co-Authors

Babatas, Eren

Date

Language

Embargo Status

N/A

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

Bounded Component Analysis (BCA) is a recent approach which enables the separation of both dependent and independent signals from their mixtures. This article introduces a novel deterministic instantaneous BCA approach for the separation of sparse bounded sources. The separation problem is posed as a geometric maximization problem, where the objective is the volume ratio of two geometric objects related to the separator output samples, namely the principal hyperellipsoid and bounding l1 norm ball. The global maxima of the corresponding objective are proven to be perfect separators. The article also provides an iterative algorithm corresponding to this objective. The numerical experiments illustrate the potential benefit of the proposed approach relative to existing algorithms.

Source

Publisher

IEEE Computer Society

Citation

item.page.haspartof

Source

IEEE International Workshop on Machine Learning for Signal Processing, MLSP

item.page.ispartofseries

item.page.edition

DOI

10.1109/MLSP.2016.7738906

item.page.datauri

item.page.link

Rights

N/A

Copyrights Note

Rights and licensing

N/A

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators