Abstract
The reconstruction of tracks left by particles in a scintillating fiber detector from a high energy experiment is discussed. The track reconstruction algorithm is based on the Hough transform and achieves an efficiency above 86%. The algorithm is implemented in a 16-node parallel machine using two parallelism approaches in order to speed up the application of the Hough transform, which is known to have large computational cost.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Anselmo, F. Block, L. Cifarelli, C. D’Ambrosio, T. Gys, G. La Commare. H. Leutz, M. Marino and S. Qian. “Track recognition with a central two-shell scintillating fiber tracker (SFT)”. CERN-ECP/94-7, 1994.
T. Sjöstrand, Pythia 5.6 and Jetset 7.3-Physics and Manual CERN-TH/6488-92.
R. Brun et al., GEANT3. CERN-DD/EE/84-1.
Illingworth, J. and Kittler, J.. “A Survey of the Hough Transform”. Computer Vision, Graphics, and Image Processing 44, pp. 87–116, 1988.
Ohlsson, Mattias and Peterson, Carsten. “Track finding with deformable templates-the elastic arms approach”. Computer Physics Communications 71, pp. 77–98, 1992.
Telmat Multinode. “TN310 System Manual and Training Set”. France, 1995.
“Networks, Routers and Transputers”. Edited by M. Jane et al. SGS-Thomson, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dantas, A.C.H., Manoel de Seixas, J., França, F.M.G. (2001). Parallel Implementation of a Track Recognition System Using Hough Transform. In: Palma, J.M.L.M., Dongarra, J., Hernández, V. (eds) Vector and Parallel Processing — VECPAR 2000. VECPAR 2000. Lecture Notes in Computer Science, vol 1981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44942-6_38
Download citation
DOI: https://doi.org/10.1007/3-540-44942-6_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41999-0
Online ISBN: 978-3-540-44942-3
eBook Packages: Springer Book Archive