Algorithms for detecting m-dimensional objects in N-dimensional spaces
Related Experiment Video
Updated: May 29, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
Published on: March 1, 2022
1Department of Computer Science, Concordia University, Montreal, P.Q., Canada.
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.
Related Concept Videos
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
Collisions in Multiple Dimensions: Introduction
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Gaussian Elimination: Problem Solving
Two-Dimensional (2D) NMR: Overview
The first step is the preparation period, during which nucleus A is excited with a radiofrequency pulse.
Depth Perception and Spatial Vision

