skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Hough transform method for track finding in center drift chamber

Abstract

Hough transform is a global tracking method used which had been expected to be faster approach for tracking the circular pattern of electron moving in Center Drift Chamber (CDC), by transforming the point of hit into a circular curve. This paper present the implementation of hough transform method for the reconstruction of tracks in Center Drift Chamber (CDC) which have been generated by random number in C language programming. Result from implementation of this method shows higher peak of circle parameter value (xc,yc,rc) that indicate the similarity value of the parameter needed for circular track in CDC for charged particles in the region of CDC.

Authors:
; ;  [1]
  1. National Centre for Particle Physics, University of Malaya, 50603 Kuala Lumpur (Malaysia)
Publication Date:
OSTI Identifier:
22494537
Resource Type:
Journal Article
Resource Relation:
Journal Name: AIP Conference Proceedings; Journal Volume: 1704; Journal Issue: 1; Conference: iNuSTEC2015: International muclear science, technology and engineering conference 2015, Negeri Sembilan (Malaysia), 17-19 Aug 2015; Other Information: (c) 2016 AIP Publishing LLC; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; CHARGED PARTICLES; DIAGRAMS; DRIFT CHAMBERS; PARTICLE TRACKS; PEAKS; RANDOMNESS

Citation Formats

Azmi, K. A. Mohammad Kamal, E-mail: khasmidatul@siswa.um.edu.my, Wan Abdullah, W. A. T., E-mail: wat@um.edu.my, and Ibrahim, Zainol Abidin. Hough transform method for track finding in center drift chamber. United States: N. p., 2016. Web. doi:10.1063/1.4940083.
Azmi, K. A. Mohammad Kamal, E-mail: khasmidatul@siswa.um.edu.my, Wan Abdullah, W. A. T., E-mail: wat@um.edu.my, & Ibrahim, Zainol Abidin. Hough transform method for track finding in center drift chamber. United States. doi:10.1063/1.4940083.
Azmi, K. A. Mohammad Kamal, E-mail: khasmidatul@siswa.um.edu.my, Wan Abdullah, W. A. T., E-mail: wat@um.edu.my, and Ibrahim, Zainol Abidin. 2016. "Hough transform method for track finding in center drift chamber". United States. doi:10.1063/1.4940083.
@article{osti_22494537,
title = {Hough transform method for track finding in center drift chamber},
author = {Azmi, K. A. Mohammad Kamal, E-mail: khasmidatul@siswa.um.edu.my and Wan Abdullah, W. A. T., E-mail: wat@um.edu.my and Ibrahim, Zainol Abidin},
abstractNote = {Hough transform is a global tracking method used which had been expected to be faster approach for tracking the circular pattern of electron moving in Center Drift Chamber (CDC), by transforming the point of hit into a circular curve. This paper present the implementation of hough transform method for the reconstruction of tracks in Center Drift Chamber (CDC) which have been generated by random number in C language programming. Result from implementation of this method shows higher peak of circle parameter value (xc,yc,rc) that indicate the similarity value of the parameter needed for circular track in CDC for charged particles in the region of CDC.},
doi = {10.1063/1.4940083},
journal = {AIP Conference Proceedings},
number = 1,
volume = 1704,
place = {United States},
year = 2016,
month = 1
}
  • A method is proposed for determining the coordinate of the center of a particle track on a scanning automaton; the technique produces no deadband and is realized using a small number of microcircuits. The electronic circuitry is developed.
  • A strategy for finding tracks in the MAC central drift chamber is described. A computer program has been written and tested on the Colorado PDP-11/34.
  • Instead of using the base-2 number system, we use a base-m number system to represent the numbers used in the proposed algorithms. Such a strategy can be used to design an O(T) time, T = (log(sub m) N) + 1, prefix sum algorithm for a binary sequence with N-bit on a cross-bridge reconfigurable array of processors using N processors, where the data bus is m-bit wide. Then, this basic operation can be used to compute the histogram of an n x n image with G gray-level value in constant time using G x n x n processors, and compute themore » Hough transform of an image with N edge pixels and n x n parameter space in constant time using n x n x N processors, respectively. This result is better than the previously known results proposed in the literature. Also, the execution time of the proposed algorithms is tunable by the bus bandwidth. 43 refs.« less
  • This paper describes a parallel algorithm for a line-finding Hough transform that runs on a linearly connected, SIMD vector of processors. The authors show that a high-precision transform, usually considered to be an expensive global operation, can be performed efficiently, in two to three times real time, with only local communication on a long vector. The algorithm also illustrates a decomposition principle that has wide application in algorithm design for large linear arrays. They include a review of straight-line Hough transform implementations.