Cart (Loading....) | Create Account
Close category search window
 

Deconvolution of sparse spike trains by iterated window maximization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kaaresen, K.F. ; Dept. of Math., Oslo Univ., Norway

A new algorithm for deconvolution of sparse spike trains is presented. To maximize a joint MAP criterion, an initial configuration is iteratively improved through a number of small changes. Computational savings are achieved by precomputing and storing two correlation functions and by employing a window strategy. The resulting formulas are simple, intuitive, and efficient. In addition, they allow much more complicated transitions than state-space solutions such as Kormylo and Mendel's (1982) single most likely replacement algorithm. This makes it possible to reduce significantly the probability that the algorithm terminates in a local maximum. Synthetic data examples are presented that support these claims

Published in:

Signal Processing, IEEE Transactions on  (Volume:45 ,  Issue: 5 )

Date of Publication:

May 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.