530 likes | 690 Views
Image Synthesis. HDRI. Problem. The world and our visual system has a HDR… … but not our digital equipment. Need to find ways to. Record Store Process HDR Data Convert and output. Recording. Engineering versus Nature.
E N D
Image Synthesis HDRI
Problem The world and our visual system has a HDR… … but not our digital equipment
Need to find ways to • Record • Store • Process HDR Data • Convertand output
Recording Engineering versus Nature
Chromatic aberration Human Engineer
Chromatic aberration Human Engineer
Resolution Retina CCD - Charge-coupled Device
Resolution Estimated overall resolution:15 to 576 megapixels
Dynamic Range From: 100:1 (single focus) to 1,000,000:1 (Purkinjeeffect) 16384:1
Nature the clear looser? Not really excessive post processing
Post processing… …is executed parallel and hierarchical
Alternatives HDR Cameras Multiple Exposures expensive dynamic scenes
Merging multiple exposures • camera exposure curve • rescale and addweighted mean in overlap regions
Color Encoding • Primary colorsRGB, CMYK, XYZwith transformation formula (often a matrix) • color gamut • quantization
Encoding Schemes • Pixar Log Encoding (TIFF)11 bit log/exponential encoding • Radiance RGBE Encoding (HDR)8bit RGB mantissa, 8bit shared exponent • SGI LogLuv (TIFF)16bit logarithmic luminance+ 2 * 8bit u,vcoords • ILM OpenEXR (EXR)16bit floating point format (half)
Processing • load data • convert to 3 * 32bit float / 3 * 16bit float • compute whatever you want • encode down into preferred file formatand store
Output Solution 1: Get a HDR Screen (BRIGHTSIDE)
Output Solution 2: Tone Mapping
Image arithmetic Applystandardarithmeticorlogicaloperationstoimages (pixelvalues) • Output pixelonlydepends on correspondingpixels in inputimages • Images must havethe same size • Veryefficient in termsofperformanceandmemoryrequirements • No intermediate resultneeded
Image arithmetic Operators • Addition, Subtraction • Overlay, backgroundremoval, noisereduction • Multiplication (Scaling) • Brighten, darken • Blending/compositing (weightedaverage) • Multi-modalityfusion • Logical bitwiseoperations • AND/NAND (Intersection) • OR/NOR (Union) • Invert/Logical NOT
Image arithmetic Examples Intensity scaling A & B !A & !B A B Detect object that did not move
Image arithmetic • Example • Outline edges in the original image + Wrap around of pixel values!
Image arithmetic • Example (cont.) • Generate mask by thresholding and AND the inverted mask with the image
Image arithmetic • Example (cont.) • Add unthresholded mask to original image
Image arithmetic • Example • Blending X • P0 + (1-X) • P1 • Reduces contrast before adding X=0.7 X=0.5
Point operators • Thresholding • Cut arbitraryranges • Normalization (contraststretching) • Sout = (Sin – Min) / (Max – Min) • Logarithmic/exponentialoperators • Enhance/supresslowintensitypixels • Histogramequalization • monotonic, non-linear modificationofthedynamicintensityrange Histogram Histogramshowsthedistributionofpixelsamongintensityvalues
Point operators • Histogram equalization • Re-assign intensities • Output image has uniform intensity distribution • Cannot be achieved in general • Find transfer function that maps input values a to output values b such as to approximate a flat histogram • Relative order (in terms of intensity) of pixels will not be destroyed
Point operators • Consider probability density function p(x) and probability distribution function P(x) • P(a) is the probability that a brightness chosen from a region is less than or equal to a given brightness value a • P(a) =x=0a p(x) • The probability that a brightness in a region falls between a and a+a is p(a)a = dP(a)/daa • Brightness probability density function is given by the histogram
Point operators • Mapping F (ab) forhistogramequalization • pa(a)da = pb(b)db dF=db=pa(a)da/pb(b) • Becausepb(b) shouldbeconstantto (1/(2B-1)): F(a)=(2B-1)P(a) • Digital implementation: f(a)=max(0,round(2B-1 • na/N)-1) na: numberofpixelswithintensity a N: Numberofpixels
Point operators Beforeand after histogramequalization
Point operators Beforeand after histogramequalization
Point operators Beforeand after histogramequalization
Point operators • Before and after histogram equalization
Tone Mapping • Visibility is reproducedyou can see an object on the display iff you can see it in the real scene • Viewing the image produces the same subjective experience as viewing the real scene
Tone Mapping • Setting the brightest pixel to 1 scaling the rest linearly • Light sources are multiple orders of magnitude brighter Scene is almost entirely black • Setting the brightest non light-source pixel to 1-e scaling the rest linearly/logarithmic • Light sources are still mapped to 1 • Visibility is preserved • but experience is not preserved • changes in light emission have no effect on the image
Tone Mapping [Ward 97] Compute Luminance Histogram
Tone Mapping Compute Histogram Equalization
Tone Mapping Apply Linear Ceiling
Tone Mapping Apply just noticeable difference ceiling
Tone Mapping Apply veiling luminance effects (blooming)