Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Using Chebyshev Polynomials for Interpreting Structured Light Images

Published

Author(s)

Michael O. Shneier, W Rutowski, Tsai H. Hong

Abstract

A method is described of representing curved or line-like segments of 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.
Proceedings Title
Proceedings of the IEEE International Conference on Robotics and Automation
Conference Dates
April 1, 1985
Conference Location
, USA
Conference Title
IEEE International Conference on Robotics and Automation

Keywords

Range-Finder

Citation

Shneier, M. , Rutowski, W. and Hong, T. (1985), Using Chebyshev Polynomials for Interpreting Structured Light Images, Proceedings of the IEEE International Conference on Robotics and Automation, , USA, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=820266 (Accessed October 18, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created March 31, 1985, Updated October 12, 2021
Was this page helpful?