Skip to main content
SpringerLink
Log in

Widening the dynamic range of pictures using a minimum spanning tree algorithm

  • Original papers
  • Published:
Machine Vision and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  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

    Orly Yadid-Pecht

Authors
  1. Orly Yadid-Pecht
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 30 September 1998 / Accepted: 5 October 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yadid-Pecht, O. Widening the dynamic range of pictures using a minimum spanning tree algorithm. Machine Vision and Applications 12, 1–6 (2000). https://doi.org/10.1007/s001380050118

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001380050118

Search

Navigation