Open AccessCompressive sensing via sparse difference and fractal and entropy recognition for mass spectrometry sensing data
Author(s) -
Liu Jixin,
Sun Quansen
Publication year - 2013
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
eISSN - 1751-9683
pISSN - 1751-9675
DOI - 10.1049/iet-spr.2011.0219
Subject(s) - compressed sensing , bottleneck , computer science , sparse approximation , entropy (arrow of time) , pattern recognition (psychology) , curse of dimensionality , fractal , computation , precondition , signal processing , algorithm , artificial intelligence , data mining , mathematics , physics , mathematical analysis , telecommunications , radar , quantum mechanics , programming language , embedded system
This study presents a novel compressive sensing (CS) framework to solve the high dimensional mass spectrometry (MS) signal processing in Bioinformatics. As a hot research topic, CS has attracted a great deal of attention in many fields. In theory, high sparsity is one precondition for any CS framework. However, in Bioinformatics, one application bottleneck is that only a few MS data can be considered as sparse. So sparse representation (SR) become necessary. However, this will create a new problem that the SR computation cost will be too huge to MS signal because of its high data dimensionality (usually tens of thousands or more). Therefore the authors propose theconcept ofsparse difference (SD) to realise a new CS framework. Firstly, it canacquire the prior MS information through fractal and entropy recognition. Secondly, the original signal can be perfectly recovered by SD based on the previous recognition result. The feasibility and validity of this CS framework isproved by experiments.