Yichao Zhou, Xiyuan Hu, Zhenmin Tang, Andrew C. Ahn
{"title":"Denoising and baseline correction of ECG signals using sparse representation","authors":"Yichao Zhou, Xiyuan Hu, Zhenmin Tang, Andrew C. Ahn","doi":"10.1109/SiPS.2015.7344997","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7344997","url":null,"abstract":"Removing noise and other artifacts in the electrocardiogram (ECG) is a critical preprocessing step for further heart disease analysis and diagnosis. In this paper, we propose a sparse representation based ECG signal denoising and baseline wandering (BW) correction algorithm. Unlike the traditional filtering-based methods, like Fourier or Wavelet transform, which use fixed basis, the proposed algorithm models the ECG signal as superposition of few inner structures plus additive random noise, while those structures can be learned from the input signal or a training set. Using those learned inner structures and their properties, we can accurately approximate the original ECG signal and remove noise and other artifacts like baseline wandering. To demonstrate the robustness and efficacy of the proposed algorithm, we compare it to several state-of-the-art algorithms through both simulated and real-life ECG recordings.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"13 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114019938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive resource scheduling for energy efficient QRD processor with DVFS","authors":"Yangxurui Liu, H. Prabhu, Liang Liu, V. Öwall","doi":"10.1109/SiPS.2015.7345022","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7345022","url":null,"abstract":"This paper presents an energy efficient adaptive QR decomposition scheme for Long Term Evolution Advance (LTE-A) downlink system. The proposed scheme provides a performance robustness to fluctuating wireless channels while maintaining lower workload on a reconfigurable hardware. A statistic based algorithm-switching strategy is employed in the scheme to achieve workload reduction and stable computing resource requirement for QR decomposition. With run time resource allocation, computing resources are assigned to highest performance gain segments to reduce performance loss. By utilizing the dynamic voltage and frequency scaling (DVFS) technique, we further exploit the potential of power saving in various workload situation while maintaining fixed throughput. The proposed technique brings power reduction upto 57.8% in EVA-5 scenario and 24.4% with a maximum SNR loss of 1dB in EVA-70 scenario, when mapped on a coarse grain reconfigurable vector-based platform.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132527426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning sparse representation for dynamic gesture recogniton","authors":"Minglei Tong, Hong Han","doi":"10.1109/SiPS.2015.7345021","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7345021","url":null,"abstract":"His Gesture recognition is an important task for gesture-based Human Computer Interaction. A novel gesture recognition model based on sparse representation is proposed in this paper. The model mainly consists of the following four stages: firstly, the spatial-temporal interest points are detected from the video sequences; secondly, a cuboid is founded around each spatial-temporal interest point and the 3D SIFT features are extracted based on the cuboids; thirdly, we encode local 3D SIFT features within the sparse coding framework. In so doing, each local 3D SIFT is transformed to a linear combination of a few atoms in a pre-trained dictionary. Finally, we employ an max pooling strategy to get the final representation of a video and we use multi-class linear SVM to accomplish the classification task. We test our model in the video dataset made by ourselves and get a good performance.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122447955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Hirabayashi, Nogami Nogami, Jeremy White, Laurent Condat
{"title":"Pixel enlargement in high-speed camera image acquisition based on 3D sparse representations","authors":"A. Hirabayashi, Nogami Nogami, Jeremy White, Laurent Condat","doi":"10.1109/SiPS.2015.7345011","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7345011","url":null,"abstract":"We propose an algorithm that enhances the pixel number in high-speed camera image acquisition. In high-speed cameras, there is a principle problem that the number of pixels reduces when the number of frames per second (FPS) increases. To suppress this problem, we first propose an optical setup that randomly selects some percent of pixels in an image. Then, the proposed algorithm reconstructs the entire image from the selected partial pixels. In this algorithm, we exploit not only sparsity within each frame but also sparsity induced from the similarity between adjacent frames. Based on the two types of sparsity, we define a cost function for image reconstruction. Since this function is convex, we can find the optimal solution by using a convex optimization technique, in particular the Douglas-Rachford Splitting method, with small computational cost. Simulation results show that the proposed method outperforms a conventional method for sequential image reconstruction with sparsity prior.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"975 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116212891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Parallel block-layered nonbinary QC-LDPC decoding on GPU","authors":"Huyen Thi Pham, S. Ajaz, Hanho Lee","doi":"10.1109/SiPS.2015.7345000","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7345000","url":null,"abstract":"This paper presents an efficient implementation of a parallel block-layered nonbinary quasi-cyclic low-density parity-check (NB-QC-LDPC) decoder on a graphics processing unit (GPU) to achieve significant improvements in both flexibility and scalability. An efficient block-layered scheme and a data structure suitable for parallel computing are proposed to perform decoding on the GPU. The scheme is applied to a min-max decoding algorithm that exploits the inherent massive parallelization capabilities of NB-QC-LDPC decoder. The results of the proposed approach demonstrate that the layered scheme can be efficiently implemented in a GPU device. Moreover, experimental results show that the proposed GPU-based block-layered NB-QC-LDPC decoder provides a faster decoding runtime compare to CPU-based implementation and obtains a coding gain under a low 10-10 BER and low 10-7 FER.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123877493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A real-time embedded system for human gait analysis","authors":"Yen Wen Chien, C. Chiu, I-Zan Wu","doi":"10.1109/SiPS.2015.7345003","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7345003","url":null,"abstract":"The gait analysis plays an important role in different kinds of applications such as the disease symptoms, health condition, medical analysis, kinesiology and so forth. In this paper, we use one single video camera to extract the human body and establish the human body model by the distance map measured between the gravity center and human body contour. The obtained human body model includes seven parts such as head, upper body, lower body, left arm, right arm, left leg and right leg. To analyze the walking behaviour, we extract the angle and pace information of different body parts. Besides, we implement our proposed algorithm into an embedded system that can perform real-time pace analysis. The pace distance, walking speed, bending angle of each body parts and hand waving angle can be obtained in real-time at 30fps.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125491416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Novel frame rate up-conversion algorithm based on prediction and recursive search","authors":"Inseo Hwang, Ho Sun Jung, M. Sunwoo","doi":"10.1109/SiPS.2015.7345014","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7345014","url":null,"abstract":"This paper proposes a novel frame rate up-conversion (FRUC) algorithm to enhance the motion continuity of video sequences. The proposed algorithm, called the prediction based recursive search (PBRS), can provide a better prediction for frame interpolation. The texture based block partitioning can effectively represent the detailed motions around the object boundaries and thus, the proposed PBRS can find more accurate motions. Thus, the notable image quality improvement can be obtained using PBRS. Experimental results show that the proposed algorithm improves the average PSNR and SSIM of the interpolated frames by up to 2.42 dB and 0.0252, respectively, with relatively low computational complexity compared to the existing algorithms.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128177269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic group allocation reconstruction for group sparse signals","authors":"Yi-Mu Tu, Michael C. Chang, Yu-Min Lin, A. Wu","doi":"10.1109/SiPS.2015.7344996","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7344996","url":null,"abstract":"The reconstruction process in compressive sensing is an underdetermined problem. Existing reconstruction algorithms in compressive sensing approaches this problem using the standard sparsity model, where nonzero terms are randomly isolated among the signal. However, natural signals are tended to show group sparsity which may help in the reduction of computational complexity and acceleration of recovery processes of signals if being incorporated in algorithm designs. GOMP, modified from OMP, includes the concept of groups, yet because of fixed group division, GOMP suffers low column selection accuracy. Besides, the group distribution is unknown in most cases, fixed group division in GOMP is impractical. In this paper, we propose a new reconstruction algorithm, dynamic group allocation reconstruction (DGAR). The results show that the proposed method has better column selection accuracy in the context of group sparsity compared to its predecessors. Proposed DGAR algorithm is 50% and 100% higher in accuracy compared to GOMP algorithm and StOMP respectively when sparsity is 40 and group sparsity is 2.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114541118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yun Chen, Qichen Zhang, Yuanzhou Hu, Na Ding, Xiaoyang Zeng
{"title":"An implementation of turbo equalization using cyclic prefix in LTE downlink system","authors":"Yun Chen, Qichen Zhang, Yuanzhou Hu, Na Ding, Xiaoyang Zeng","doi":"10.1109/SiPS.2015.7345030","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7345030","url":null,"abstract":"In this paper, an implementation of turbo equalization using cyclic prefix in LTE downlink system is proposed. In comparison with conventional equalization schemes, the using of cyclic prefix can enhance the SNR performance by about 1 dB in AWGN channel and more in multi-path channel with Doppler frequency influence [3]. In this paper, the turbo equalizer presented in [3] is extended to 16QAM and 64QAM to support LTE system. Furthermore turbo encoder and decoder, scrambler and interleaver are designed according to the demands of LTE standard. The simulation results show that the algorithms can achieve ideal performance enhancement in LTE system comparing to conventional schemes.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132829186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Programming strategies to improve energy efficiency and reliability of ReRAM memory systems","authors":"Manqing Mao, Yu Cao, Shimeng Yu, C. Chakrabarti","doi":"10.1109/SiPS.2015.7344980","DOIUrl":"https://doi.org/10.1109/SiPS.2015.7344980","url":null,"abstract":"Resistive RAM (ReRAM) has fast access time, ultra-low stand-by power and high reliability, making it a viable memory technology to replace DRAM for main memory. The 1-transistor-1-resistor (1T1R) ReRAM array has density comparable to that of a DRAM array and the advantages of lower programming energy and higher reliability compared to the ultra-high density ReRAM cross-point array. In this paper, we propose several novel write strategies for 1T1R ReRAM aiming at high performance, low power and high reliability. We reduce the write latency significantly compared to the baseline scheme by using the same WL voltages and improve energy consumption and endurance by choosing proper set line, bit line and word line settings. The SPICE simulation results demonstrate that appropriate choice of circuit operation parameters can help obtain 10× improvement in lifetime with 33.6% reduction in energy compared to the baseline. Also, among all proposed systems, configurations which consume higher write energy also have higher endurance. We evaluate the system-level parameters of a 1GB ReRAM memory using CACTI and GEM5. We show that all the proposed ReRAM systems can achieve a lifetime of 30 years by employing error control coding (ECC). Finally, we show that the ReRAM based main memory can outperform DRAM main memory with respect to IPC (5.5% higher) and energy consumption (39.4% lower) through proper choice of write scheme configurations.","PeriodicalId":138530,"journal":{"name":"2015 IEEE Workshop on Signal Processing Systems (SiPS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130482311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}