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

2016 24th European Signal Processing Conference (EUSIPCO)最新文献

筛选
英文 中文
Video semantic indexing using object detection-derived features 基于目标检测衍生特征的视频语义索引
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760456
Kotaro Kikuchi, K. Ueki, Tetsuji Ogawa, Tetsunori Kobayashi
{"title":"Video semantic indexing using object detection-derived features","authors":"Kotaro Kikuchi, K. Ueki, Tetsuji Ogawa, Tetsunori Kobayashi","doi":"10.1109/EUSIPCO.2016.7760456","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760456","url":null,"abstract":"A new feature extraction method based on object detection to achieve accurate and robust semantic indexing of videos is proposed. Local features (e.g., SIFT and HOG) and convolutional neural network (CNN)-derived features, which have been used in semantic indexing, in general are extracted from the entire image and do not explicitly represent the information of meaningful objects that contributes to the determination of semantic categories. In this case, the background region, which does not contain the meaningful objects, is unduly considered, exerting a harmful effect on the indexing performance. In the present study, an attempt was made to suppress the undesirable effects derived from the redundant background information by incorporating object detection technology into semantic indexing. In the proposed method, a combination of the meaningful objects detected in the video frame image is represented as a feature vector for verification of semantic categories. Experimental comparisons demonstrate that the proposed method facilitates the TRECVID semantic indexing task.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130707380","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}
引用次数: 3
Sequential image completion for high-speed large-pixel number sensing 用于高速大像素数感测的顺序图像补全
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760388
A. Hirabayashi, Naoki Nogami, Takashi Ijiri, Laurent Condat
{"title":"Sequential image completion for high-speed large-pixel number sensing","authors":"A. Hirabayashi, Naoki Nogami, Takashi Ijiri, Laurent Condat","doi":"10.1109/EUSIPCO.2016.7760388","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760388","url":null,"abstract":"We propose an algorithm that enhances the number of pixels for high-speed camera imaging to suppress its main problem. That is, the number of pixels reduces when the number of frames per second (fps) increases. To this end, we suppose an optical setup that block-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, two types of sparsity are exploited. One is within each frame and the other is induced from the similarity between adjacent frames. The latter further means not only in the image domain but also in a sparsifying transformed domain. Since the cost function we define is convex, we can find the optimal solution using a convex optimization technique with small computational cost. Simulation results show that the proposed method outperforms the standard approach for image completion by the nuclear norm minimization.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"431 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114620329","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
Conjugate priors for Gaussian emission plsa recommender systems 高斯发射plsa推荐系统的共轭先验
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760618
Stefan Ingi Adalbjornsson, Johan Sward, Magnus Orn Berg, Søren Vang Andersen, A. Jakobsson
{"title":"Conjugate priors for Gaussian emission plsa recommender systems","authors":"Stefan Ingi Adalbjornsson, Johan Sward, Magnus Orn Berg, Søren Vang Andersen, A. Jakobsson","doi":"10.1109/EUSIPCO.2016.7760618","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760618","url":null,"abstract":"Collaborative filtering for recommender systems seeks to learn and predict user preferences for a collection of items by identifying similarities between users on the basis of their past interest or interaction with the items in question. In this work, we present a conjugate prior regularized extension of Hofmann's Gaussian emission probabilistic latent semantic analysis model, able to overcome the over-fitting problem restricting the performance of the earlier formulation. Furthermore, in experiments using the EachMovie and MovieLens data sets, it is shown that the proposed regularized model achieves significantly improved prediction accuracy of user preferences as compared to the latent semantic analysis model without priors.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129565882","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
Adaptive LASSO based on joint M-estimation of regression and scale 基于回归和尺度联合m估计的自适应LASSO
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760637
E. Ollila
{"title":"Adaptive LASSO based on joint M-estimation of regression and scale","authors":"E. Ollila","doi":"10.1109/EUSIPCO.2016.7760637","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760637","url":null,"abstract":"The adaptive Lasso (Least Absolute Shrinkage and Selection Operator) obtains oracle variable selection property by using cleverly chosen adaptive weights for regression coefficients in the ℓ1-penalty. In this paper, in the spirit of M-estimation of regression, we propose a class of adaptive M-Lasso estimates of regression and scale as solutions to generalized zero subgradient equations. The defining estimating equations depend on a differentiable convex loss function and choosing the LS-loss function yields the standard adaptive Lasso estimate and the associated scale statistic. An efficient algorithm, a generalization of the cyclic coordinate descent algorithm, is developed for computing the proposed M-Lasso estimates. We also propose adaptive M-Lasso estimate of regression with preliminary scale estimate that uses a highly-robust bounded loss function. A unique feature of the paper is that we consider complex-valued measurements and regression parameter. Consistent variable selection property of the adaptive M-Lasso estimates are illustrated with a simulation study.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124038268","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}
引用次数: 6
3D localization of multiple audio sources utilizing 2D DOA histograms 利用2D DOA直方图对多个音频源进行3D定位
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760493
Symeon Delikaris-Manias, Despoina Pavlidi, V. Pulkki, A. Mouchtaris
{"title":"3D localization of multiple audio sources utilizing 2D DOA histograms","authors":"Symeon Delikaris-Manias, Despoina Pavlidi, V. Pulkki, A. Mouchtaris","doi":"10.1109/EUSIPCO.2016.7760493","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760493","url":null,"abstract":"Steered response power (SRP) techniques have been well appreciated for their robustness and accuracy in estimating the direction of arrival (DOA) when a single source is active. However, by increasing the number of sources, the complexity of the resulting power map increases, making it challenging to localize the separate sources. In this work, we propose an efficient 2D histogram processing approach which is applied on the local DOA estimates, provided by SRP, and reveals the DOA of multiple audio sources in an iterative fashion. Driven by the results, we also apply the same methodology to local DOA estimates of a known subspace method and improve its accuracy. The performance of the presented algorithms is validated with numerical simulations and real measurements with a rigid spherical microphone array in different acoustical conditions: for multiple audio sources with different angular separations, various reverberation and signal-to-noise ratio (SNR) values.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126336063","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}
引用次数: 21
Self-backhauling full-duplex access node with massive antenna arrays: Power allocation and achievable sum-rate 具有大规模天线阵列的自回程全双工接入节点:功率分配和可实现的和速率
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760522
D. Korpi, T. Riihonen, M. Valkama
{"title":"Self-backhauling full-duplex access node with massive antenna arrays: Power allocation and achievable sum-rate","authors":"D. Korpi, T. Riihonen, M. Valkama","doi":"10.1109/EUSIPCO.2016.7760522","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760522","url":null,"abstract":"This paper analyzes a self-backhauling inband full-duplex access node that has massive antenna arrays for transmission and reception. In particular, the optimal transmit powers for such a system are solved in a closed form, taking into account the self-interference as well as backhaul capacity requirements and incorporating the role of downlink-uplink traffic ratio in sum-rate maximization. Numerical results are also provided, where the obtained analytical expressions are evaluated with realistic system parameter values. All in all, the presented theory and the numerical results provide insights into the proposed system, indicating that a self-backhauling access node could greatly benefit from being capable of inband full-duplex communication.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122152770","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}
引用次数: 8
Variational Bayesian multi-channel robust NMF for human-voice enhancement with a deformable and partially-occluded microphone array 变分贝叶斯多通道鲁棒NMF用于可变形和部分遮挡麦克风阵列的人声增强
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760402
Yoshiaki Bando, Katsutoshi Itoyama, M. Konyo, S. Tadokoro, K. Nakadai, Kazuyoshi Yoshii, HIroshi G. Okuno
{"title":"Variational Bayesian multi-channel robust NMF for human-voice enhancement with a deformable and partially-occluded microphone array","authors":"Yoshiaki Bando, Katsutoshi Itoyama, M. Konyo, S. Tadokoro, K. Nakadai, Kazuyoshi Yoshii, HIroshi G. Okuno","doi":"10.1109/EUSIPCO.2016.7760402","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760402","url":null,"abstract":"This paper presents a human-voice enhancement method for a deformable and partially-occluded microphone array. Although microphone arrays distributed on the long bodies of hose-shaped rescue robots are crucial for finding victims under collapsed buildings, human voices captured by a microphone array are contaminated by non-stationary actuator and friction noise. Standard blind source separation methods cannot be used because the relative microphone positions change over time and some of them are occasionally shaded by rubble. To solve these problems, we develop a Bayesian model that separates multichannel amplitude spectrograms into sparse and low-rank components (human voice and noise) without using phase information, which depends on the array layout. The voice level at each microphone is estimated in a time-varying manner for reducing the influence of the shaded microphones. Experiments using a 3-m hose-shaped robot with eight microphones show that our method outperforms conventional methods by the signal-to-noise ratio of 2.7 dB.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116700876","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}
引用次数: 10
Worst-case jamming signal design and avoidance for MIMO radars MIMO雷达最坏干扰信号设计与避免
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760643
Tuomas Aittomäki, V. Koivunen
{"title":"Worst-case jamming signal design and avoidance for MIMO radars","authors":"Tuomas Aittomäki, V. Koivunen","doi":"10.1109/EUSIPCO.2016.7760643","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760643","url":null,"abstract":"We optimize the jamming signal for disrupting the operation of a MIMO radar system in order to understand the threat jamming poses to such systems. The jamming signal optimization is formulated as a minimax problem minimizing the maximum SINR that the receivers can achieve, resulting in a semidefinite program for a Toeplitz jamming covariance matrix or a second-order cone program for a circulant approximation. In the simplest case of optimizing the average SINR of a single receiver, a waterfilling-type solution is obtained. Numerical studies suggest that distributed radar systems with waveform agility and mismatched filtering capabilities are resilient against jamming.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115571343","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
Antialiased soft clipping using an integrated bandlimited ramp 使用集成带宽限制坡道的抗锯齿软裁剪
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760407
Fabian Esqueda, V. Välimäki, S. Bilbao
{"title":"Antialiased soft clipping using an integrated bandlimited ramp","authors":"Fabian Esqueda, V. Välimäki, S. Bilbao","doi":"10.1109/EUSIPCO.2016.7760407","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760407","url":null,"abstract":"A new method for aliasing reduction in soft-clipping nonlinearities is proposed. Digital implementations of saturating systems introduce harmonic distortion which, if untreated, gets reflected at the Nyquist limit and is mixed with the signal. This is called aliasing and is heard as a disturbance. A new correction function, derived by integrating the bandlimited ramp function, is presented. This function reduces the level of aliasing distortion seen at the output of soft clippers by quasi-bandlimiting the discontinuities introduced in the second derivative of the signal. The proposed method increases the quality of the signal by attenuating those aliased components that lie on the lower end of the spectrum, which are known to be perceptually important. The four-point version of the algorithm reduces aliasing at low frequencies by up to about 50 dB. This work extends our understanding of aliasing in nonlinear systems and provides a new tool for its suppression in virtual analog models.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128045024","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}
引用次数: 3
A better metric in kernel adaptive filtering 核自适应滤波中一个更好的度量
2016 24th European Signal Processing Conference (EUSIPCO) Pub Date : 2016-11-28 DOI: 10.1109/EUSIPCO.2016.7760514
Airi Takeuchi, M. Yukawa, K. Müller
{"title":"A better metric in kernel adaptive filtering","authors":"Airi Takeuchi, M. Yukawa, K. Müller","doi":"10.1109/EUSIPCO.2016.7760514","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2016.7760514","url":null,"abstract":"The metric in the reproducing kernel Hilbert space (RKHS) is known to be given by the Gram matrix (which is also called the kernel matrix). It has been reported that the metric leads to a decorrelation of the kernelized input vector because its autocorrelation matrix can be approximated by the (down scaled) squared Gram matrix subject to some condition. In this paper, we derive a better metric (a best one under the condition) based on the approximation, and present an adaptive algorithm using the metric. Although the algorithm has quadratic complexity, we present its linear-complexity version based on a selective updating strategy. Numerical examples validate the approximation in a practical scenario, and show that the proposed metric yields fast convergence and tracking performance.","PeriodicalId":127068,"journal":{"name":"2016 24th European Signal Processing Conference (EUSIPCO)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126335337","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
首页 上一页 下一页 尾页
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学术官方微信