DocumentCode :
1116890
Title :
Algorithms for Detecting M-Dimensional Objects in N-Dimensional Spaces
Author :
Alagar, Vangalur S. ; Thiel, Larry H.
Author_Institution :
Department of Computer Science, Concordia University, Montreal, P.Q., Canada.
Issue :
3
fYear :
1981
fDate :
5/1/1981 12:00:00 AM
Firstpage :
245
Lastpage :
256
Abstract :
Exact and approximate algorithms for detecting lines in a two-dimensional image space are discussed. For the case of uniformly distributed noise within an image space, transform methods and different notions of probability measures governing the parameters of the transforms are described. It is shown that different quantization schemes of the transformed space are desirable for different probabilistic assumptions. The quantization schemes are evaluated and compared. For one of the procedures that uses a generalized Duda-Hart procedure and a mixed quantization scheme, the time complexity to find all m-flats in n-space is shown to be bounded by O(ptm(n-m)2), where p is the number of points and t is a user parameter. For this procedure more true flats in a given orientation have been found and the number of spurious flats is small.
Keywords :
Character recognition; Extraterrestrial measurements; Image recognition; Noise measurement; Noise shaping; Object detection; Pattern recognition; Quantization; Shape; Working environment noise; Beta distribution; Hough transform; generalized Duda-Hart procedure; geometric probability; m-flat detection in n-space; mixed quantization;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.1981.4767097
Filename :
4767097
Link To Document :
بازگشت