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

2011 17th International Conference on Digital Signal Processing (DSP)最新文献

筛选
英文 中文
Bandwidth-constrained motion estimation for real-time mobile video application 实时移动视频应用的带宽约束运动估计
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-08-30 DOI: 10.1109/ICDSP.2011.6004921
Jui-Hung Hsieh, Tian-Sheuan Chang
{"title":"Bandwidth-constrained motion estimation for real-time mobile video application","authors":"Jui-Hung Hsieh, Tian-Sheuan Chang","doi":"10.1109/ICDSP.2011.6004921","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004921","url":null,"abstract":"This paper addresses the memory bandwidth problem of motion estimation in resource limited mobile video applications by an integrated bandwidth rate distortion optimization framework. The simulation result shows up to 86% bandwidth saving while keeps equivalent rate-distortion (R-D) performance and meets real time target compared with H.264 reference software for low motion CIF size video. For high motion sequence, the result shows our algorithm could better allocate the available bandwidth for high motion macroblock without violating the real time constraint when search range is set to ±16.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129842142","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
Floating polygon soup 浮动多边形汤
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6005017
T. Colleu, L. Morin, S. Pateux, C. Labit
{"title":"Floating polygon soup","authors":"T. Colleu, L. Morin, S. Pateux, C. Labit","doi":"10.1109/ICDSP.2011.6005017","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6005017","url":null,"abstract":"This paper presents a new representation called floating polygon soup for applications like 3DTV and FTV (Free Viewpoint Television). This representation is based on 3D polygons and takes as input MVD data. It extends the previously proposed polygon soup representation [1] which is appropriate for both compression, transmission and rendering stages. The floating polygon soup conserves these advantages while also taking into account misalignments at the view synthesis stage due to modeling errors. The idea for reducing these misalignments is to morph the 3D geometry depending on the current viewpoint. Results show that artifacts in virtual views are reduced and objective quality is increased.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123076804","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
Intelligent systems for mixing multichannel audio 用于混合多声道音频的智能系统
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004988
J. Reiss
{"title":"Intelligent systems for mixing multichannel audio","authors":"J. Reiss","doi":"10.1109/ICDSP.2011.6004988","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004988","url":null,"abstract":"Multichannel signal processing techniques are usually concerned with extracting information about sources from several received signals. In this paper, we describe an emerging field of multichannel audio signal processing where the inter-channel relationships are exploited in order to manipulate the multichannel content. Applications to real-time, automatic audio production are described and the necessary technologies and the architecture of such systems are presented. The current state of the art is reviewed, and directions of future research are also discussed.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120934861","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}
引用次数: 77
Distributed min-max optimization in networks 网络中的分布式最小-最大优化
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004889
Kunal Srivastava, A. Nedić, D. Stipanović
{"title":"Distributed min-max optimization in networks","authors":"Kunal Srivastava, A. Nedić, D. Stipanović","doi":"10.1109/ICDSP.2011.6004889","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004889","url":null,"abstract":"We consider a setup where we are given a network of agents with their local objective functions which are coupled through a common decision variable. We provide a distributed stochastic gradient algorithm for the agents to compute an optimal decision variable that minimizes the worst case loss incurred by any agent. We establish almost sure convergence of the agent's estimates to a common optimal point. We demonstrate the use of our algorithm to a problem of min-max fair power allocation in a cellular network.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121045959","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}
引用次数: 27
A novel workspace for image clustering 一种新的图像聚类工作空间
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004884
M. Krinidis, S. Krinidis, V. Chatzis
{"title":"A novel workspace for image clustering","authors":"M. Krinidis, S. Krinidis, V. Chatzis","doi":"10.1109/ICDSP.2011.6004884","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004884","url":null,"abstract":"A novel image clustering method based on the image histogram, which is processed by the empirical mode decomposition (EMD) is presented. An intermediate step derived from the EMD, which can decompose any nonlinear and non-stationary data into a number of intrinsic mode functions (IMFs) is exploited. The IMFs of the image histogram have interesting characteristics and provide a novel workspace that is utilized in order to automatically detect the different clusters into the image under examination. The proposed method was applied to several real and synthetic images and the obtained results show good image clustering robustness.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127187988","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
Ambiguity detection methods for improving handwritten mathematical character recognition accuracy in classroom videos 提高课堂视频中手写数学字符识别准确率的模糊检测方法
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004896
Smita Vemulapalli, M. Hayes
{"title":"Ambiguity detection methods for improving handwritten mathematical character recognition accuracy in classroom videos","authors":"Smita Vemulapalli, M. Hayes","doi":"10.1109/ICDSP.2011.6004896","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004896","url":null,"abstract":"In classroom videos, recognizing mathematical content, handwritten on the whiteboard presents a unique opportunity in the form of audio content spoken by the instructor. This recognized audio content can be used to improve the character recognition accuracy by providing evidence in corroboration or contradiction of the output options generated by the primary, video based recognizer. However, such audio-video based disambiguation also has the potential to introduce errors in what may have been the correct output from the video based recognizer. In this paper, we focus on improving the character recognition accuracy by developing ambiguity detection methods that can be used to determine the set of potentially incorrect outputs from the video based recognizer and, for each such output, determining the subset of possibly correct output options that must be forwarded for audio-video based character disambiguation. In this paper, we propose, implement and evaluate a number of such ambiguity detection methods.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127457139","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 new hardware efficient reconfigurable fir filter architecture suitable for FPGA applications 一种新的硬件高效可重构fir滤波器架构，适用于FPGA应用
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004958
Asgar Abbaszadeh, Anasystem Azerbaijan, K. Dabbagh-Sadeghipour
{"title":"A new hardware efficient reconfigurable fir filter architecture suitable for FPGA applications","authors":"Asgar Abbaszadeh, Anasystem Azerbaijan, K. Dabbagh-Sadeghipour","doi":"10.1109/ICDSP.2011.6004958","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004958","url":null,"abstract":"Multistandard wireless communication systems require the reconfigurable FIR filters with low complexity architectures. The complexity of FIR filters is dominated by the coefficient multipliers. It is well known that partial product is an efficient technique to reduce the complexity of coefficient multipliers in high order FIR filters implementation. A new hardware efficient reconfigurable FIR filter architecture is proposed in this paper based on the proposed binary signed subcoefficient method. Using the proposed coefficient representation method, the hardware requirements for multiplexer units are reduced dramatically with respect to typical methods. FPGA synthesis results of the designed filter architecture show 33% and 27% reduction in the resources usage over previously reported two state of the art reconfigurable architectures.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125825890","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}
引用次数: 13
Stereoscopic visual fatigue measurement based on fusional response curve and eye-blinks 基于融合反应曲线和眨眼的立体视疲劳测量
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004999
Donghyun Kim, Sunghwan Choi, Sangil Park, K. Sohn
{"title":"Stereoscopic visual fatigue measurement based on fusional response curve and eye-blinks","authors":"Donghyun Kim, Sunghwan Choi, Sangil Park, K. Sohn","doi":"10.1109/ICDSP.2011.6004999","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004999","url":null,"abstract":"In this paper, we propose an experiment that assesses fusional response curve and eye-blink rate to measure visual fatigue induced by stereoscopic videos. A random dot stereogram was utilized to measure the reliable fusional limit and response curve acquired by determining the direction of Landolt C. The results were analyzed to discriminate the individual ability of 3D fusion and compared with the results of subjective evaluation and descriptive self-report. It shows that while watching 3D video, viewers who have slow fusional response and low fusional limits are more sensitive to visual fatigue. In addition, eye-blinks were measured using eye images captured by a camera. Eye-blinks were increased in the video with moderate visual fatigue than low visual fatigue and decreased more in the second half than the first half of the session.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114505317","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}
引用次数: 49
QTIB: Quick bit-reversed permutations on CPUs QTIB: cpu上的快速位反转排列
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004879
G. Knittel
{"title":"QTIB: Quick bit-reversed permutations on CPUs","authors":"G. Knittel","doi":"10.1109/ICDSP.2011.6004879","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004879","url":null,"abstract":"We present a fast algorithm for out-of-place bit-reversed permutation of large vectors for input to an FFT. It is an extension of two previously published methods with special consideration of advanced CPU hardware features. In particular, the method makes heavy use of cache prefetching, MMX and SSE units, and write-combining buffers. Implementations have been made in assembly language for 2-byte and 4-byte operands. In terms of efficiency the method significantly outperforms previously reported methods.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129107885","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
Adaptive step size independent vector analysis for blind source separation 盲源分离的自适应步长独立向量分析
2011 17th International Conference on Digital Signal Processing (DSP) Pub Date : 2011-07-06 DOI: 10.1109/ICDSP.2011.6004870
Yanfeng Liang, S. M. Naqvi, J. Chambers
{"title":"Adaptive step size independent vector analysis for blind source separation","authors":"Yanfeng Liang, S. M. Naqvi, J. Chambers","doi":"10.1109/ICDSP.2011.6004870","DOIUrl":"https://doi.org/10.1109/ICDSP.2011.6004870","url":null,"abstract":"In this paper, a novel adaptive step size independent vector analysis (ASS-IVA) method is proposed for blind source separation. Independent vector analysis (IVA) can successfully solve the classical permutation problem in the blind source separation (BSS) field. In the ASS-IVA method the step size is adjusted during learning to enhance the convergence behavior of the conventional IVA algorithm. The experimental results confirm that the proposed method improves the convergence speed greatly as compared to the original IVA method, whilst retaining the excellent separation properties of the IVA method.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"87 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113969696","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}
引用次数: 7
下一页 尾页
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学术官方微信