Using chebyshev polynomials for interpreting structured light images
Michael O. Shneier, Wallace S. Rutkowski, Tsai-Hong Hong · 2005
A method is described of representing curved or line-like segments in images using Chebyshev polynomials. The advantages of the approximations include fast computation minimum error over the sampling interval, and the reduction of the data to a concise description consisting of a few coefficients. An implementation is discussed that uses images obtained from a structured-light ranging system.