检索结果-内蒙古大学图书馆

5th International IEEE Engineering-in-Medicine-and-Biology-Society (EMBS) Conference on Neural Engineering (NER)

作者： Dangi, Siddharth Gowda, Suraj Heliot, Rodolphe Carmena, Jose M. Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)9781424441419

Brain-Machine Interface (BMI) decoding algorithms are often trained offline, but this paradigm ignores both the non-stationarity of neural signals and the feedback that exists in online, closed-loop control. To address these problems, we have developed an Adaptive Kalman Filter (AKF), a Kalman filter variant that adaptively updates its model parameters during training. For a Kalman filter decoder, batch retraining methods require completely re-estimating the parameter matrices from sufficient data to perform regression accurately, even if only small changes are necessary. Conversely, the AKF is designed to update the decoder parameters continuously and more intelligently. We simulated a population of 41 neurons learning to control a 2D computer cursor. The AKF yielded significantly faster skill acquisition and better robustness to perturbation and neuron loss than a standard Kalman filter with periodic batch retraining.

关键词： AKF BMI decoding Equations Kalman filters Kinematics Mathematical model Neurons Training adaptive Kalman filtering adaptive Kalman filters batch retraining brain-computer interfaces closed loop systems closed-loop brain-machine interface closed-loop control decoding decoding algorithms medical control systems neural signals neurophysiology training

来源：评论

学校读者我要写书评

暂无评论

Capacity-Approaching codes on the q-ary symmetric channel for large q

Capacity-Approaching codes on the <i>q</i>-ary symmetric cha...

引用

IEEE Information Theory Workshop

作者： Shokrollahi, A Ecole Polytech Fed Lausanne Dept Math CH-1015 Lausanne Switzerland

We give a short survey of several techniques to construct codes on GF(q) that approach the capacity of the q-ary symmetric channel.

ISBN: (纸本)0780387201

We give a short survey of several techniques to construct codes on GF(q) that approach the capacity of the q-ary symmetric channel.

关键词： error statistics channel capacity Galois fields decoding channel coding q-ary symmetric channel decoding algorithms capacity-approaching codes

来源：评论

学校读者我要写书评

暂无评论

A UNIVERSAL decoding ALGORITHM FOR t-EC/AUED CODES

A UNIVERSAL DECODING ALGORITHM FOR t-EC/AUED CODES

引用

2011 IEEE International Conference on Information Theory and Information Security(ICITIS 2011)

作者： Thabit Sultan Mohammed ECE Department Dhofar University.Engineering CollegeP.O.Box 2509211 SalalahOman.

The All Unidirectional Error Detection （AUED） codes are among the ways of guarding against erroneous correction,and a t-Error Correction （EC）/A11 Unidirectional Error Detection （AUED） code can be constructed by appending a single check symbol （P） to a linear t-EC code to achieve the AUED *** a t-EC/AUED code is used to encode information in a transmission side such information need to be decoded at the receiving *** and techniques proposed in literature for constructing t-EC/AUED codes are either come with no decoding algorithm or if a decoding a algorithm is proposed,it lacks the mathematical *** paper adopts a decoding algorithm from the literature and derives a mathematical proof for *** software is also developed and results for the encoding and decoding processes of four different encoding methods are *** on the mathematical proof and the simulation results obtained,this paper claims that the adopted algorithm is a universal decoding algorithm.

关键词： codes error-correction codes t-EC/AUED decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

Explicit measurements with almost optimal thresholds for compressed sensing

Explicit measurements with almost optimal thresholds for com...

引用

33rd IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Parvaresh, Farzad Hassibi, Babak CALTECH Ctr Math Informat 1200 E Calif Pasadena CA 91125 USA CALTECH Dept Elect Engn Pasadena CA 91125 USA

ISBN: (纸本)9781424414833

We consider the deterministic construction of a measurement matrix and a recovery method for signals that are block sparse. A signal that has dimension N = nd, which consists of n blocks of size d, is called (s, d)-block sparse if only s blocks out of n are nonzero. We construct an explicit linear mapping Phi that maps the (s, d)-block sparse signal to a measurement vector of dimension M, where s . d < N (1 - (1 -M/N) (d/d+1)) - o(1). We show that if the (s, d)-N block sparse signal is chosen uniformly at random then the signal can almost surely be reconstructed from the measurement vector in O(N-3) computations.

关键词： convex optimization sparse signals Reed-Solomon codes decoding algorithms compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Current challenges in the development of a cortical brain-machine interface

Current challenges in the development of a cortical brain-ma...

引用

25th Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society

作者： Hatsopoulos, NG O'Leary, J Joshi, J Univ Chicago Dept Organismal Biol & Anat Chicago IL 60637 USA

ISBN: (纸本)0780377893

Recent advances in cortically controlled brain-machine interfaces (BMIs) have demonstrated that goal-directed movement of external devices is possible in real-time using multi-electrode recordings from cortex. A number of challenges are currently being confronted to further advance BMI research to the next level. These include choosing the optimal decoding algorithm for the type of control to be performed, localizing the optimal cortical site for reliable control, and focusing on the most suitable electrophysiological signal for practical use in a BMI. We present results that attempt to address these challenges based on multi-electrode recording from multiple motor cortical areas in behaving monkeys.

关键词： brain-machine interfaces decoding algorithms motor and premotor cortex single unit recording multi-unit recording local field potential recording

来源：评论

学校读者我要写书评

暂无评论

Guessing Secrets Efficiently via List decoding

引用

ACM TRANSACTIONS ON algorithms 2007年第4期3卷 42–es页

作者： Alon, Noga Guruswami, Venkatesan Kaufman, Tali Sudan, Madhu Tel Aviv Univ Sch Comp Sci Tel Aviv Israel Univ Washington Seattle WA 98195 USA Inst Adv Study Princeton NJ 08540 USA MIT Cambridge MA 02139 USA

We consider the guessing secrets problem defined by Chung et al. [2001]. This is a variant of the standard 20 questions game where the player has a set of k > 1 secrets from a universe of N possible secrets. The player is asked Boolean questions about the secret. For each question. the player picks one of the k secrets adversarially, and answers according to this secret. We present an explicit set of O(log N) questions together with an efficient (i.e., poly(log N) time) algorithm to solve the guessing secrets problem for the case of 2 secrets. This answers the main algorithmic question left unanswered by Chung et al. [2001]. The main techniques we use are small e- biased spaces and the notion of list decoding. We also establish bounds on the number of questions needed to solve the k-secrets game for k > 2, and discuss how list decoding can be used to get partial information about the secrets, specifically to find a small core of secrets that must intersect the actual set of k secrets.

关键词： 20 questions decoding algorithms error-correcting codes epsilon-biased spaces k-universal sets

来源：评论

学校读者我要写书评

暂无评论

E2E Segmentation in a Two-Pass Cascaded Encoder ASR Model 48

E2E Segmentation in a Two-Pass Cascaded Encoder ASR Model

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Huang, W. Ronny Chang, Shuo-Yiin Sainath, Tara N. He, Yanzhang Rybach, David David, Robert Prabhavalkar, Rohit Allauzen, Cyril Peyser, Cal Strohman, Trevor D. Google Research United States

ISBN: (纸本)9781728163277

We explore unifying a neural segmenter with two-pass cascaded encoder ASR into a single model. A key challenge is allowing the segmenter (which runs in real-time, synchronously with the decoder) to finalize the non-causal 2nd pass (which runs 900 ms behind real-time) without introducing user-perceived latency or deletion errors during inference. We propose a design where the neural segmenter is integrated with the causal 1st pass decoder to emit a end-of-segment (EOS) signal in real-time. The EOS signal is then used to finalize the non-causal 2nd pass. We experiment with different ways to finalize the 2nd pass, and find that a dummy frame injection strategy allows for simultaneous high quality 2nd pass results and low finalization latency. On a real-world long-form captioning task (YouTube), we achieve 2.4% relative WER and 140 ms EOS latency gains over a baseline VAD-based segmenter with the same cascaded encoder. © 2023 IEEE.

关键词： ASR decoding algorithms segmentation

来源：评论

学校读者我要写书评

暂无评论

A New Scheme Based on Pixel-Intense Motion Block Algorithm for Residual Distributed Video Coding

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2013年第11期9卷 1-7页

作者： Sun, Lijuan Lin, Zhaoxiao Xiao, Fu Guo, Jian Nanjing Univ Posts & Telecommun Coll Comp Nanjing 210003 Jiangsu Peoples R China Jiangsu High Technol Res Key Lab Wireless Sensor Nanjing 210003 Peoples R China Nanjing Univ Posts & Telecommun Key Lab Broadband Wireless Commun & Sensor Networ Minist Educ Nanjing 210003 Jiangsu Peoples R China

Residual Distributed Video Coding (RDVC) is a branch of the Distributed Video Coding (DVC). By reducing the coding rate, the RDVC scheme gets a better rate-distortion performance. The overall performance of the traditional pixel-based RDVC scheme is better than the traditional transform-based domain DVC scheme. But the traditional RDVC scheme also has some application limitations;for example, the performance of RDVC is bad when it is applied to intense motion regions. And the pixel-based RDVC scheme cannot fully exploit the spatial correlations of the original information. In this paper, we propose a new approach of residual coding combined IMB (intense motion block) extraction algorithm with Low Density Parity Check (LDPC) and Baum-Welch iterative decoding algorithm. Experimental results show that the proposed scheme achieves better rate-distortion performance compared to traditional DVC and RDVC scheme.

关键词： algorithms VIDEO coding (Computer science) VIDEO codecs LOW density parity check codes ERROR-correcting codes (Information theory) VIDEO compression -- Software decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

Beyond the edge of chaos: Amplification and temporal integration by recurrent networks in the chaotic regime

引用

Physical Review E 2011年第5期84卷 051908-051908页

作者： T. Toyoizumi L. F. Abbott RIKEN Brain Science Institute Wako-shi Saitama 351-0198 Japan

Randomly connected networks of neurons exhibit a transition from fixed-point to chaotic activity as the variance of their synaptic connection strengths is increased. In this study, we analytically evaluate how well a small external input can be reconstructed from a sparse linear readout of network activity. At the transition point, known as the edge of chaos, networks display a number of desirable features, including large gains and integration times. Away from this edge, in the nonchaotic regime that has been the focus of most models and studies, gains and integration times fall off dramatically, which implies that parameters must be fine tuned with considerable precision if high performance is required. Here we show that, near the edge, decoding performance is characterized by a critical exponent that takes a different value on the two sides. As a result, when the network units have an odd saturating nonlinear response function, the falloff in gains and integration times is much slower on the chaotic side of the transition. This means that, under appropriate conditions, good performance can be achieved with less fine tuning beyond the edge, within the chaotic regime.

关键词： CHAOS theory NEURAL transmission VARIANCES NONLINEAR models (Statistics) decoding algorithms

来源：评论

学校读者我要写书评

暂无评论

On the Performance of Quasiorthogonal STBC with Relay Selection and Phase Rotation Techniques for Decode and Forward Cooperative Communications

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2013年第2期9卷 1-11页

作者： Sutthisangiam, Nikorn Pirak, Chaiyod Ascheid, Gerd King Mongkuts Univ Technol N Bangkok Sirindhorn Int Thai German Grad Sch Engn TGGS Bangkok 10800 Thailand Rhein Westfal TH Aachen D-52056 Aachen Germany

The performance of quasiorthogonal space-time block code with relay-selection and phase-rotation techniques applied to cooperative communications for four communication nodes is investigated. Specifically, by applying relay-selection and phase-rotation techniques, a diversity gain of four can be achieved. In addition, a symbol error rate (SER) performance analysis with closed form expression and power allocation are investigated and compared with simulation results. The results show that theoretical SER curves are close to the simulation results. In addition, a code rate of the proposed scheme is two times higher than ordinary cooperative communications. The computer simulation results also show a significant probability of error improvement of about 2.8 dB over the conventional decode-and-forward protocol.

关键词： ERROR rates COMPUTER simulation SIMULATION methods & models decoding algorithms MAXIMUM likelihood decoding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：