Circular track finding using hough transform with discretized polling
The objective of this paper was to show the results of single-parameter track finding based on the Hough transform method with discretized hits in an arbitrarily-sized Hough space. Each arbitrarily-sized Hough space was used to identify the most optimal hits with respect to a simulation-generated...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit Universiti Kebangsaan Malaysia
2020
|
| Online Access: | http://journalarticle.ukm.my/15406/ http://journalarticle.ukm.my/15406/1/19.pdf |
| _version_ | 1848813792969883648 |
|---|---|
| author | Khasmidatul Akma Mohammad Kamal Azmi, Wan Ahmad Tajuddin Wan Abdullah, Au Diya Fatihah, Mohammad Siddiq, |
| author_facet | Khasmidatul Akma Mohammad Kamal Azmi, Wan Ahmad Tajuddin Wan Abdullah, Au Diya Fatihah, Mohammad Siddiq, |
| author_sort | Khasmidatul Akma Mohammad Kamal Azmi, |
| building | UKM Institutional Repository |
| collection | Online Access |
| description | The objective of this paper was to show the results of single-parameter track finding based on the Hough transform
method with discretized hits in an arbitrarily-sized Hough space. Each arbitrarily-sized Hough space was used to
identify the most optimal hits with respect to a simulation-generated track. These hits will be useful in future studies
involving multiple tracks as an identification of single-track potential size which will decrease the computational
steps required to identify potential hits in multiple-track studies. These steps are well established in track finding
research. However, the discretized method has not been applied fully because of uncertainty in identifying true hits
in the Hough space. We have observed that by selecting the optimal discretized size, we can significantly improve the
identification of true hits as it reduces the number of unrelated hits. We show that these steps are a more insightful
technique compared to the traditional clustering technique by comparing our results to the K-Mean nearest neighbour
method. |
| first_indexed | 2025-11-15T00:23:50Z |
| format | Article |
| id | oai:generic.eprints.org:15406 |
| institution | Universiti Kebangasaan Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T00:23:50Z |
| publishDate | 2020 |
| publisher | Penerbit Universiti Kebangsaan Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:generic.eprints.org:154062020-10-23T01:27:54Z http://journalarticle.ukm.my/15406/ Circular track finding using hough transform with discretized polling Khasmidatul Akma Mohammad Kamal Azmi, Wan Ahmad Tajuddin Wan Abdullah, Au Diya Fatihah, Mohammad Siddiq, The objective of this paper was to show the results of single-parameter track finding based on the Hough transform method with discretized hits in an arbitrarily-sized Hough space. Each arbitrarily-sized Hough space was used to identify the most optimal hits with respect to a simulation-generated track. These hits will be useful in future studies involving multiple tracks as an identification of single-track potential size which will decrease the computational steps required to identify potential hits in multiple-track studies. These steps are well established in track finding research. However, the discretized method has not been applied fully because of uncertainty in identifying true hits in the Hough space. We have observed that by selecting the optimal discretized size, we can significantly improve the identification of true hits as it reduces the number of unrelated hits. We show that these steps are a more insightful technique compared to the traditional clustering technique by comparing our results to the K-Mean nearest neighbour method. Penerbit Universiti Kebangsaan Malaysia 2020-05 Article PeerReviewed application/pdf en http://journalarticle.ukm.my/15406/1/19.pdf Khasmidatul Akma Mohammad Kamal Azmi, and Wan Ahmad Tajuddin Wan Abdullah, and Au Diya Fatihah, and Mohammad Siddiq, (2020) Circular track finding using hough transform with discretized polling. Sains Malaysiana, 49 (5). pp. 1137-1144. ISSN 0126-6039 http://www.ukm.my/jsm/malay_journals/jilid49bil5_2020/KandunganJilid49Bil5_2020.html |
| spellingShingle | Khasmidatul Akma Mohammad Kamal Azmi, Wan Ahmad Tajuddin Wan Abdullah, Au Diya Fatihah, Mohammad Siddiq, Circular track finding using hough transform with discretized polling |
| title | Circular track finding using hough transform with discretized polling |
| title_full | Circular track finding using hough transform with discretized polling |
| title_fullStr | Circular track finding using hough transform with discretized polling |
| title_full_unstemmed | Circular track finding using hough transform with discretized polling |
| title_short | Circular track finding using hough transform with discretized polling |
| title_sort | circular track finding using hough transform with discretized polling |
| url | http://journalarticle.ukm.my/15406/ http://journalarticle.ukm.my/15406/ http://journalarticle.ukm.my/15406/1/19.pdf |