发布求助
文献互助 智能选刊 最新文献

2019 27th European Signal Processing Conference (EUSIPCO)最新文献

筛选
英文 中文
Imaging Experiment of Multi-Pinhole Based X-Ray Fluorescence Computed Tomography Using Rat Head Phantoms 基于多针孔的x射线荧光计算机断层扫描大鼠头部影像成像实验
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903048
T. Sasaya, Tsuyoshi Oouchi, T. Yuasa, Seung-Jun Seo, Jae-Geun Jeon, Jong-Ki Kim, N. Sunaguchi, K. Hyodo, T. Zeniya
{"title":"Imaging Experiment of Multi-Pinhole Based X-Ray Fluorescence Computed Tomography Using Rat Head Phantoms","authors":"T. Sasaya, Tsuyoshi Oouchi, T. Yuasa, Seung-Jun Seo, Jae-Geun Jeon, Jong-Ki Kim, N. Sunaguchi, K. Hyodo, T. Zeniya","doi":"10.23919/EUSIPCO.2019.8903048","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903048","url":null,"abstract":"Multi-pinhole based x-ray fluorescence computed tomography (mp-XFCT) delineates the spatial distribution of the non-radioactive agent in a living body by using fluorescent x-ray photons, which are emitted from the agent on de-excitation soon after extrinsic excitation and acquired with a multi-pinhole collimator and a 2-D detector. One of the potential applications is to image brain of small animals for development of treatment techniques and new drugs of brain disease in preclinical study. However, the measured photons are limited because a brain is covered with a skull which is a highly absorbing object. In this research, in order to investigate the applicability to brain imaging, we performed imaging experiments with phantoms to simulate a rat head using an actual mp-XFCT system, constructed at beamline AR-NE7A in KEK.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115419605","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}
引用次数: 0
Indoor Sound Source Localization based on Sparse Bayesian Learning and Compressed Data 基于稀疏贝叶斯学习和压缩数据的室内声源定位
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903069
Zonglong Bai, Jinwei Sun, J. Jensen, M. G. Christensen
{"title":"Indoor Sound Source Localization based on Sparse Bayesian Learning and Compressed Data","authors":"Zonglong Bai, Jinwei Sun, J. Jensen, M. G. Christensen","doi":"10.23919/EUSIPCO.2019.8903069","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903069","url":null,"abstract":"In this paper, the problems of indoor sound source localization using a wireless acoustic sensor network are addressed and a new sparse Bayesian learning based algorithm is proposed. Using time delays for the direct paths from candidate source locations to microphone nodes, the proposed algorithm estimates the most likely source location. To reduce the amount of data that must be exchanged between microphone nodes, a Gaussian measurement matrix is multiplied on to each channel and the proposed method operates directly on the compressed data. This is achieved by exploiting sparsity in both the frequency and space domains. The performance is analysed in numerical simulations, where the performance as a function of the reverberation times in investigated, and the results show that the proposed algorithm is robust to reverberation.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115696906","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}
引用次数: 5
Sensor Selection and Rate Distribution Based Beamforming in Wireless Acoustic Sensor Networks 无线声传感器网络中基于速率分布的波束形成和传感器选择
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903015
Jie Zhang, R. Heusdens, R. Hendriks
{"title":"Sensor Selection and Rate Distribution Based Beamforming in Wireless Acoustic Sensor Networks","authors":"Jie Zhang, R. Heusdens, R. Hendriks","doi":"10.23919/EUSIPCO.2019.8903015","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903015","url":null,"abstract":"Power usage is an important aspect of wireless acoustic sensor networks (WASNs) and reducing the amount of information that is to be transmitted is one effective way to save it. In previous contributions, we presented sensor selection as well as rate distribution methods to reduce the power usage of beamforming algorithms in WASNs. Taking only transmission power into account, it was shown that rate distribution is a generalization of sensor selection and that rate distribution is more efficient than sensor selection with respect to the power usage versus performance trade-off. However, this excludes the energy consumption that it takes to keep the WASN nodes activated. In this paper, we present a more detailed comparison between sensor selection and rate-allocation by taking also into account the power to keep sensors activated for centralized WASNs. The framework is formulated by minimizing the total power usage, while lower bounding the noise reduction performance. Numerical results show that whether rate distribution is more efficient than sensor selection depends on the actual power that is used to keep sensors activated.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115792444","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}
引用次数: 2
Perception of non-native phoneme contrasts in 8-13 months infants: tensor-based analysis of EEG signals 8-13个月婴儿对非母语音素对比的感知:基于张量的脑电图信号分析
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903174
M. Aghabeig, B. Bałaj, J. Dreszer, M. Lewandowska, R. Milner, N. Pawlaczyk, Tomasz Piotrowski, M. Szmytke, Wlodzislaw Duch
{"title":"Perception of non-native phoneme contrasts in 8-13 months infants: tensor-based analysis of EEG signals","authors":"M. Aghabeig, B. Bałaj, J. Dreszer, M. Lewandowska, R. Milner, N. Pawlaczyk, Tomasz Piotrowski, M. Szmytke, Wlodzislaw Duch","doi":"10.23919/EUSIPCO.2019.8903174","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903174","url":null,"abstract":"Result of analysis of EEG responses of infants between 8-13 months of age to the syllable speech sounds are presented. We conducted an ERP experiment with an oddball paradigm consisting of two types of deviant stimuli (easy and hard) and standard stimulus. A nonnegative Tucker tensor decomposition (NTD) was used to characterize differences in processing of stimuli using a time-frequency-spatial (multi-domain) features. We extracted the multi-domain features for a reliable representation of the underlying infant brain activity to analyze the processing of standard and deviant stimuli. between standard and deviant stimuli and may be interpreted in terms of mismatch negativity (MMN) and acoustic change complex (ACC) evoked potentials. Moreover, these results serve as a proof-of-concept for application of tensor decomposition-based analyses for challenging infant EEG data.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124231718","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}
引用次数: 1
Precise Response Control of Transmit-Receive Two-Dimensional Beampattern in FDA-MIMO Radar FDA-MIMO雷达发射-接收二维波束图的精确响应控制
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903071
Lan Lan, Jingwei Xu, G. Liao, Yuhong Zhang, Y. Huang
{"title":"Precise Response Control of Transmit-Receive Two-Dimensional Beampattern in FDA-MIMO Radar","authors":"Lan Lan, Jingwei Xu, G. Liao, Yuhong Zhang, Y. Huang","doi":"10.23919/EUSIPCO.2019.8903071","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903071","url":null,"abstract":"Frequency diverse array (FDA) has sparked intense interest in recent years because of its range-angle-dependent beampattern. By combining with the multiple-input and multiple-output (MIMO) technique, additional degrees of freedom (DOFs) are provided. However, dynamic environments require the design of a precisely controlled beampattern to enhance the robustness of the radar system. In this paper, the precise response control (PRC) algorithm is studied in the FDA-MIMO radar by imposing artificial interferences within rectangular regions in the joint transmit-receive spatial frequency domain. The algorithm is performed via two stages. In the first stage, artificial interferences are concurrently imposed to iteratively adjust the responses. In the second stage, extra artificial interferences are added to satisfy the predefined response requirement for all regions. The jammer-plus-noise covariance matrix is constructed accordingly and the weight vector is updated. Particularly, the jammer-to-noise ratio (JNR) of each artificial interference is figured out. Numerical results are provided to corroborate the performance of the transmit-receive two-dimensional beampattern in FDA-MIMO.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117302293","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}
引用次数: 1
Improving the Performance of Lightweight CNN models using Minimum Enclosing Ball Regularization 用最小封闭球正则化改进轻量级CNN模型的性能
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903011
Maria Tzelepi, A. Tefas
{"title":"Improving the Performance of Lightweight CNN models using Minimum Enclosing Ball Regularization","authors":"Maria Tzelepi, A. Tefas","doi":"10.23919/EUSIPCO.2019.8903011","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903011","url":null,"abstract":"The aim of this paper is two-fold. First, we propose lightweight CNN models, capable of effectively operating on-drone for various classification problems, emerging in the context of media coverage of specific sport events by drones, i.e. crowd, football player, and bicycle detection. Subsequently, we propose a regularization method, namely Minimum Enclosing Ball regularization, in order to improve the generalization ability of the proposed models. The experimental evaluation on three datasets indicates the effectiveness of the proposed regularizer.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123448441","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}
引用次数: 0
Shuffled Bits in the Low-Detectability Regime 低可探测性体制下的洗牌比特
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903111
S. Maranò, P. Willett
{"title":"Shuffled Bits in the Low-Detectability Regime","authors":"S. Maranò, P. Willett","doi":"10.23919/EUSIPCO.2019.8903111","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903111","url":null,"abstract":"We consider a decision problem in which data are unordered (unlabeled). Recent studies of this problem provide a complete asymptotic characterization of the decision performance for large data size, which is the solution of a convex optimization problem. While this is fully satisfactory from a numerical viewpoint, limited insight is offered because a closed-form explicit expression for the decision performance is, in general, not available. For binary observations and the challenging regime of low-detectability, we derive an extremely simple analytical solution, investigate its properties and discuss the obtained physical insights.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124087441","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}
引用次数: 5
A Novel Design Method for Digital FIR/IIR Filters Based on the Shuffle Frog-Leaping Algorithm 基于Shuffle跳蛙算法的数字FIR/IIR滤波器设计新方法
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903129
Daniel Jiménez-Galindo, P. Casaseca-de-la-Higuera, L. M. San-José-Revuelta
{"title":"A Novel Design Method for Digital FIR/IIR Filters Based on the Shuffle Frog-Leaping Algorithm","authors":"Daniel Jiménez-Galindo, P. Casaseca-de-la-Higuera, L. M. San-José-Revuelta","doi":"10.23919/EUSIPCO.2019.8903129","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903129","url":null,"abstract":"The design of both FIR and IIR digital filters is a multi-variable optimization problem, where traditional algorithms fail to obtain optimal solutions. A modified Shuffled Frog Leaping Algorithm (SFLA) is here proposed for the design of FIR and IIR discrete-time filters as close as possible to the desired filter frequency response. This algorithm can be considered a type of memetic algorithm. In this paper, simulations prove the obtained filters outperform those designed using the traditional bilinear Z transform (BZT) method with elliptic approximation. Besides, results are close to, and even slightly better, than those reported in recent bio-inspired approaches using algorithms such as particle swarm optimization (PSO), differential evolution (DE) and regularized global optimization (RGA).","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126137916","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}
引用次数: 1
Segmentation of Piecewise ARX Processes by Exploiting Sparsity in Tight-Dimensional Spaces 基于紧维空间稀疏性的分段ARX过程分割
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8903060
Hiroki Kuroda, M. Yamagishi, I. Yamada
{"title":"Segmentation of Piecewise ARX Processes by Exploiting Sparsity in Tight-Dimensional Spaces","authors":"Hiroki Kuroda, M. Yamagishi, I. Yamada","doi":"10.23919/EUSIPCO.2019.8903060","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8903060","url":null,"abstract":"Segmentation of piecewise Auto-Regressive eXogenous (ARX) processes has been a major challenge in time-series segmentation and change detection. In this paper, for piecewise ARX process segmentation, we exploit hidden sparsity in tight-dimensional representation spaces. More precisely, we strategically design a tight-dimensional linear transformation which reveals sparsity hidden in samples following piecewise ARX processes. Experiments on synthetic and real-world data demonstrate the effectiveness of the proposed method.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"11 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124612669","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}
引用次数: 1
Spectrum Insensitive Sparse Recovery with Iterative Affine Projections 迭代仿射投影的谱不敏感稀疏恢复
2019 27th European Signal Processing Conference (EUSIPCO) Pub Date : 2019-09-01 DOI: 10.23919/EUSIPCO.2019.8902581
Nicolae Cleju, I. Ciocoiu
{"title":"Spectrum Insensitive Sparse Recovery with Iterative Affine Projections","authors":"Nicolae Cleju, I. Ciocoiu","doi":"10.23919/EUSIPCO.2019.8902581","DOIUrl":"https://doi.org/10.23919/EUSIPCO.2019.8902581","url":null,"abstract":"We propose a novel greedy algorithm for $ell_{0}$-based sparse signal recovery, inspired by Iterative Hard Thresholding, which alternates a gradient descent step towards minimizing the sparsity error with a projection step on the affine solution space y = A x. We provide a theoretical guarantee based on Restricted Isometry Property for successful recovery of exact sparse signals, in the noiseless case, which does not depend on the singular values spectrum of the dictionary. This improves signal recovery by providing robustness in case of ill-conditioned dictionaries, as learned and coherent dictionaries tend to be. Simulation results on noiseless exact-sparse recovery indicate improvements compared to similar algorithms, especially in the case of ill-conditioned dictionaries.","PeriodicalId":319233,"journal":{"name":"2019 27th European Signal Processing Conference (EUSIPCO)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125050676","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书