|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM206809530 |
| 003 |
DE-627 |
| 005 |
20231224000729.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2011 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2011.62
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0689.xml
|
| 035 |
|
|
|a (DE-627)NLM206809530
|
| 035 |
|
|
|a (NLM)21422486
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Hasinoff, Samuel W
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Light-efficient photography
|
| 264 |
|
1 |
|c 2011
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 24.02.2012
|
| 500 |
|
|
|a Date Revised 01.12.2011
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a In this paper, we consider the problem of imaging a scene with a given depth of field at a given exposure level in the shortest amount of time possible. We show that by 1) collecting a sequence of photos and 2) controlling the aperture, focus, and exposure time of each photo individually, we can span the given depth of field in less total time than it takes to expose a single narrower-aperture photo. Using this as a starting point, we obtain two key results. First, for lenses with continuously variable apertures, we derive a closed-form solution for the globally optimal capture sequence, i.e., that collects light from the specified depth of field in the most efficient way possible. Second, for lenses with discrete apertures, we derive an integer programming problem whose solution is the optimal sequence. Our results are applicable to off-the-shelf cameras and typical photography conditions, and advocate the use of dense, wide-aperture photo sequences as a light-efficient alternative to single-shot, narrow-aperture photography
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Kutulakos, Kiriakos N
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 33(2011), 11 vom: 15. Nov., Seite 2203-14
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:33
|g year:2011
|g number:11
|g day:15
|g month:11
|g pages:2203-14
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2011.62
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 33
|j 2011
|e 11
|b 15
|c 11
|h 2203-14
|