Maximum-Likelihood Estimation With a Contracting-Grid Search Algorithm

A fast search algorithm capable of operating in multi-dimensional spaces is introduced. As a sample application, we demonstrate its utility in the 2D and 3D maximum-likelihood position-estimation problem that arises in the processing of PMT signals to derive interaction locations in compact gamma ca...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on nuclear science. - 1988. - 57(2010), 3 vom: 01. Juni, Seite 1077-1084
1. Verfasser: Hesterman, Jacob Y (VerfasserIn)
Weitere Verfasser: Caucci, Luca, Kupinski, Matthew A, Barrett, Harrison H, Furenlid, Lars R
Format: Aufsatz
Sprache:English
Veröffentlicht: 2010
Zugriff auf das übergeordnete Werk:IEEE transactions on nuclear science
Schlagworte:Journal Article
LEADER 01000caa a22002652 4500
001 NLM201411938
003 DE-627
005 20250211234437.0
007 tu
008 231223s2010 xx ||||| 00| ||eng c
028 5 2 |a pubmed25n0671.xml 
035 |a (DE-627)NLM201411938 
035 |a (NLM)20824155 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Hesterman, Jacob Y  |e verfasserin  |4 aut 
245 1 0 |a Maximum-Likelihood Estimation With a Contracting-Grid Search Algorithm 
264 1 |c 2010 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Revised 20.10.2021 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a A fast search algorithm capable of operating in multi-dimensional spaces is introduced. As a sample application, we demonstrate its utility in the 2D and 3D maximum-likelihood position-estimation problem that arises in the processing of PMT signals to derive interaction locations in compact gamma cameras. We demonstrate that the algorithm can be parallelized in pipelines, and thereby efficiently implemented in specialized hardware, such as field-programmable gate arrays (FPGAs). A 2D implementation of the algorithm is achieved in Cell/BE processors, resulting in processing speeds above one million events per second, which is a 20× increase in speed over a conventional desktop machine. Graphics processing units (GPUs) are used for a 3D application of the algorithm, resulting in processing speeds of nearly 250,000 events per second which is a 250× increase in speed over a conventional desktop machine. These implementations indicate the viability of the algorithm for use in real-time imaging applications 
650 4 |a Journal Article 
700 1 |a Caucci, Luca  |e verfasserin  |4 aut 
700 1 |a Kupinski, Matthew A  |e verfasserin  |4 aut 
700 1 |a Barrett, Harrison H  |e verfasserin  |4 aut 
700 1 |a Furenlid, Lars R  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on nuclear science  |d 1988  |g 57(2010), 3 vom: 01. Juni, Seite 1077-1084  |w (DE-627)NLM098149350  |x 0018-9499  |7 nnns 
773 1 8 |g volume:57  |g year:2010  |g number:3  |g day:01  |g month:06  |g pages:1077-1084 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 57  |j 2010  |e 3  |b 01  |c 06  |h 1077-1084