首页 | 本学科首页   官方微博 | 高级检索  
     


Widening the dynamic range of pictures using a minimum spanning tree algorithm
Authors:Orly Yadid-Pecht
Affiliation:(1) Electrical and Computer Engineering Department, Ben-Gurion University of the Negev, P.O.B. 653, Beer-Sheva 84105, Israel; e-mail: oyp@ee.bgu.ac.il , IL
Abstract:A novel method for widening the dynamic range of pictures, without requiring additional frame times or additional storage area in the pixel, is proposed. The sensor used enables local control over the integration time such that a suitable exposure could be defined for each area, and a new method based on the Minimum Spanning Tree algorithm is then incorporated for restoring the additional information representing the specific integration times. These restored integration times are used for reconstructing a wide dynamic range picture. Received: 30 September 1998 / Accepted: 5 October 1999
Keywords::Dynamic range –   Minimum-spanning tree –   Robot vision –   Image processing
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号