Abstract
An attempt is made to develop a high-speed detection scheme for moving and stationary point targets registered in an IR (infrared) image sequence. An iterative approximate 3-D line searching algorithm (for non-manoeuvering targets in space) based upon the geometric representation of lines is derived. The convergence of the algorithm is proved. An analysis of the algorithm yields the theoretical detection performance. Statistical experiment results show the effectiveness and the computational efficiency of the algorithm in the case of low signal-to-noise ratio. The algorithm may be employed to satisfy the real-time processing requirement of an IR homing. >
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.