├── gen ├── .gitignore ├── compile.sh └── hdr_sdr_gen.cpp ├── res └── .gitignore ├── .gitignore ├── compile.sh ├── src ├── hdr_sdr.cpp └── ffmpeg ├── README.md └── LICENSE.txt /gen/.gitignore: -------------------------------------------------------------------------------- 1 | hdr_sdr_gen 2 | -------------------------------------------------------------------------------- /res/.gitignore: -------------------------------------------------------------------------------- 1 | ffmpeg-custom 2 | ffprobe 3 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | .tmp 2 | dev 3 | dist 4 | 5 | test.sh 6 | deploy.sh 7 | -------------------------------------------------------------------------------- /gen/compile.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | set -e 4 | 5 | g++ --std=c++17 -o hdr_sdr_gen -fopenmp -O3 -march=native hdr_sdr_gen.cpp 6 | -------------------------------------------------------------------------------- /compile.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | set -e 4 | 5 | rm -r dist 6 | mkdir -p dist 7 | 8 | # Compile to Dist 9 | g++ --std=c++17 -pthread -o dist/hdr_sdr -fopenmp -fopenmp-simd -Ofast -frename-registers -funroll-loops -D_GLIBCXX_PARALLEL -flto src/hdr_sdr.cpp 10 | 11 | # Generate LUT8 12 | cd gen 13 | ./compile.sh 14 | ./hdr_sdr_gen ../dist/cnv.lut8 15 | cd - 16 | 17 | # Copy Things to Dist 18 | #~ cp src/hdr_sdr.cpp dist/ 19 | cp src/ffmpeg dist/ 20 | 21 | cp res/* dist/ 22 | -------------------------------------------------------------------------------- /src/hdr_sdr.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * This file is part of the fast-hdr project (https://git.sofusrose.com/so-rose/fast-hdr). 3 | * Copyright (c) 2020 Sofus Rose. 4 | * 5 | * This program is free software: you can redistribute it and/or modify 6 | * it under the terms of the GNU General Public License as published by 7 | * the Free Software Foundation, version 3. 8 | * 9 | * This program is distributed in the hope that it will be useful, but 10 | * WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12 | * General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | // ThreadQ.h 19 | #ifndef THREAD_Q 20 | #define THREAD_Q 21 | 22 | // Libraries 23 | #include 24 | #include 25 | #include 26 | 27 | using namespace std; 28 | 29 | template 30 | class ThreadQ { 31 | // A Thread Safe Queue for Threaded Messaging 32 | public: 33 | ThreadQ() : 34 | queue_unsafe(), 35 | queue_lock(), 36 | thread_msg() { } 37 | 38 | ~ThreadQ() { } 39 | 40 | void push(T v) { 41 | // Push to Queue 42 | 43 | // Aquire Lock 44 | lock_guard lock(queue_lock); 45 | 46 | // Push to Unsafe Queue 47 | queue_unsafe.push(v); 48 | 49 | // Notify One Waiting Thread to Continue 50 | // ONLY ONE: Otherwise a Data Race Occurs. 51 | thread_msg.notify_one(); 52 | } 53 | 54 | T pop() { 55 | // Pop from Queue 56 | 57 | // Aquire Lock 58 | unique_lock lock(queue_lock); 59 | 60 | // Release Lock Until queue_unsafe Has Elements 61 | while(queue_unsafe.empty()) { thread_msg.wait(lock); } 62 | 63 | // Aquire Front Element & Pop It 64 | T v = queue_unsafe.front(); 65 | queue_unsafe.pop(); 66 | 67 | // Return the Element 68 | return v; 69 | } 70 | 71 | private: 72 | // Internal, Unsafe Queue 73 | queue queue_unsafe; 74 | 75 | // Queue and Thread Messenger 76 | mutable mutex queue_lock; 77 | 78 | condition_variable thread_msg; 79 | }; 80 | #endif 81 | 82 | // Usage: | ./hdr_sdr [WIDTH] [HEIGHT] | 83 | 84 | // Libraries 85 | #include 86 | #include 87 | #include 88 | 89 | #include 90 | #include 91 | 92 | #include 93 | 94 | #include 95 | #include 96 | 97 | 98 | 99 | // User Defines 100 | #define IMG_BITS 8 101 | 102 | #define PAY_SIZE 1 // Images per (Processing) Payload 103 | #define BUFFER_SIZE 16 // Max Payloads to Keep in Memory 104 | 105 | 106 | 107 | // User Types 108 | typedef uint8_t img_uint; // Must Hold Image Data Point of >= IMG_BITS Size 109 | 110 | #define IMG_INT_MAX ((1 << IMG_BITS) - 1) 111 | #define IMG_INT_MAX_D ( (double) IMG_INT_MAX ) 112 | 113 | 114 | 115 | // Resolution and Size of LUTD (Dimensioned LUT 116 | #define LUTD_BITS IMG_BITS 117 | #define LUTD_CHNLS 3 118 | 119 | #define LUTD_RES (1 << LUTD_BITS) // 2**LUTD_BITS 120 | 121 | #define LUTD_SIZE (LUTD_RES * LUTD_RES * LUTD_RES * LUTD_CHNLS) 122 | 123 | // Each 8-Bit YUV Triplet => Corresponding YUV Triplet. 124 | // 4D LUT, Three "Cubes": Y Cube, U Cube, V Cube. 125 | // 0. To Advance One Y, U, V, C(hannel) vue, Advance by a Stride 126 | // 1. Use Old YUV to Find X,Y,Z Index On Cube(s). 127 | // 2. Compute New YUV by Indexing Each Cube Identically 128 | 129 | #define LUTD_Y_STRIDE(y) (y << (0 * LUTD_BITS)) // Y: Shift by (2**LUTD_BITS)**0 130 | #define LUTD_U_STRIDE(u) (u << (1 * LUTD_BITS)) // U: Shift by (2**LUTD_BITS)**1 131 | #define LUTD_V_STRIDE(v) (v << (2 * LUTD_BITS)) // V: Shift by (2**LUTD_BITS)**2 132 | #define LUTD_C_STRIDE(c) (c << (3 * LUTD_BITS)) // C: Shift by (2**LUTD_BITS)**3 133 | 134 | 135 | 136 | // Namespacing 137 | using namespace std; 138 | 139 | 140 | 141 | //########### 142 | // - LUT Methods 143 | //########### 144 | 145 | void read_lutd(img_uint *lutd, string path_lutd) { 146 | // The array must be sized as LUTD_SIZE. 147 | 148 | ifstream file_lutd(path_lutd, ifstream::binary); 149 | 150 | if (file_lutd.is_open()) { 151 | file_lutd.read(reinterpret_cast(lutd), LUTD_SIZE); 152 | } 153 | } 154 | 155 | void trans_lutd( 156 | img_uint *y, 157 | img_uint *u, 158 | img_uint *v, 159 | img_uint *lutd 160 | ) { 161 | // Returns YUV Transformed by LUT 162 | 163 | // Index the Flat LUTD Using Y,U,V Strides 164 | size_t ind_lutd = ( 165 | LUTD_Y_STRIDE(*y) + 166 | LUTD_U_STRIDE(*u) + 167 | LUTD_V_STRIDE(*v) 168 | ); 169 | 170 | *y = lutd[ind_lutd + LUTD_C_STRIDE(0)]; 171 | *u = lutd[ind_lutd + LUTD_C_STRIDE(1)]; 172 | *v = lutd[ind_lutd + LUTD_C_STRIDE(2)]; 173 | } 174 | 175 | 176 | 177 | //########### 178 | // - Processing Methods 179 | //########### 180 | 181 | void hdr_sdr(img_uint *pay, size_t size_pay, img_uint *lutd) { 182 | // Process the Payload Using Precomputed YUV Destinations 183 | 184 | for (size_t i_img = 0; i_img < PAY_SIZE; i_img++) { 185 | size_t size_img = size_pay / PAY_SIZE; 186 | size_t stride_img = size_img / 3; 187 | 188 | #pragma omp parallel for 189 | for (size_t i = i_img*size_img; i < i_img*size_img + stride_img; i++) { 190 | img_uint *y = &pay[i + 0*stride_img]; 191 | img_uint *v = &pay[i + 1*stride_img]; 192 | img_uint *u = &pay[i + 2*stride_img]; 193 | 194 | trans_lutd(y, u, v, lutd); 195 | } 196 | } 197 | } 198 | 199 | 200 | 201 | //########### 202 | // - Processing Loop 203 | //########### 204 | 205 | void read_stdin( 206 | ThreadQ &queue_read, 207 | ThreadQ &queue_proc, 208 | size_t size_pay 209 | ) { 210 | while (true) { 211 | // GET: An Unused Payload from START/WRITER. 212 | img_uint* pay = queue_read.pop(); 213 | 214 | // DO: Read Payload from STDIN. 215 | cin.read(reinterpret_cast(pay), size_pay); 216 | 217 | // PUT: A Read Payload to MAIN. 218 | queue_proc.push(pay); 219 | } 220 | } 221 | 222 | void proc( 223 | ThreadQ &queue_proc, 224 | ThreadQ &queue_write, 225 | size_t size_pay, 226 | 227 | img_uint *lutd 228 | ) { 229 | while (true) { 230 | // GET: A Read Payload from READER. 231 | img_uint* pay = queue_proc.pop(); 232 | 233 | // DO: Process the Payload! 234 | hdr_sdr(pay, size_pay, lutd); 235 | 236 | // PUT: A Processed Payload to WRITER. 237 | queue_write.push(pay); 238 | } 239 | } 240 | 241 | void write_stdout( 242 | ThreadQ &queue_write, 243 | ThreadQ &queue_read, 244 | size_t size_pay 245 | ) { 246 | while (true) { 247 | // GET: A Processed Payload from MAIN. 248 | img_uint* pay = queue_write.pop(); 249 | 250 | // DO: Write Payload to STDOUT. 251 | cout.write(reinterpret_cast(pay), size_pay); 252 | 253 | // PUT: An Unused Payload to READER. 254 | queue_read.push(pay); 255 | } 256 | } 257 | 258 | 259 | 260 | //########### 261 | // - Application 262 | //########### 263 | 264 | int main(int argc, char **argv) { 265 | 266 | // PARSE: (Width, Height) => Image Size, LUT Path from Command Line 267 | unsigned int x_res = 0; unsigned int y_res = 0; string path_lutd; 268 | if (argc == 4) { 269 | x_res = stoi(argv[1]); 270 | y_res = stoi(argv[2]); 271 | path_lutd = string(argv[3]); 272 | } else { 273 | cout << "Usage: ./hdr_sdr [WIDTH] [HEIGHT] [PATH_LUTD]" << endl; 274 | 275 | return 1; 276 | } 277 | 278 | // PAYLOAD: Allocate Payload Buffer 279 | size_t size_img = x_res * y_res * 3; // # Bytes per Image 280 | size_t size_pay = size_img * PAY_SIZE; // # Bytes per Processing Payload 281 | 282 | img_uint* buf_pay = (img_uint*) malloc( sizeof(img_uint) * size_pay * BUFFER_SIZE ); 283 | 284 | // LUTD: Allocate & Read LUTD 285 | img_uint *lutd = (img_uint*) malloc( sizeof(img_uint) * LUTD_SIZE ); 286 | read_lutd(lutd, path_lutd); 287 | 288 | 289 | // QUEUES: Setup Threaded Payload Processing Loop 290 | // --> READER ----> PROC ----> WRITER -- 291 | // THREADED : The slowest component decides the payload throughput. 292 | // UNTHREADED: Each component slows the payload throughput. 293 | ThreadQ queue_read = ThreadQ(); // Pointers to Read Payloads To 294 | ThreadQ queue_proc = ThreadQ(); // Pointers to Process Payloads In 295 | ThreadQ queue_write = ThreadQ(); // Pointers to Write Payloads From 296 | 297 | // QUEUES: Mark All Payloads as Unused 298 | for (size_t i = 0; i < BUFFER_SIZE; i++) { 299 | queue_read.push(buf_pay + i*size_pay); 300 | } 301 | 302 | // THREADS: Start READER, PROC, and WRITER 303 | thread th1_reader(read_stdin , ref(queue_read) , ref(queue_proc) , size_pay); 304 | thread th2_proc (proc , ref(queue_proc) , ref(queue_write), size_pay, lutd); 305 | thread th3_writer(write_stdout, ref(queue_write), ref(queue_read) , size_pay); 306 | 307 | // THREADS: Wait for Writer to Finish 308 | th3_writer.join(); 309 | } 310 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Fast HDR-->SDR Conversion Without a GPU 2 | 3 | A slightly insane solution to a devilishly irritating problem. 4 | 5 | 6 | 7 | ## Problem: What's the Problem? 8 | 9 | I like to master my 3D work in HDR, because, well, I can. I'm a color nerd without a reference monitor. 10 | 11 | When I want to show my friends, I try to stream this HDR content using the wonderful Jellyfin (Emby fork). Problems ensue: https://github.com/jellyfin/jellyfin/issues/415 . This isn't the first time somebody has wanted to do something like this, and had trouble: https://www.verizondigitalmedia.com/blog/best-practices-for-live-4k-video-ingestion-and-transcoding/ . 12 | 13 | Long story short? The colors look **WRONG**. It's all wrong. It irritates me. 14 | 15 | I am a normal person: I don't own an HDR screen, so like any normal person I spend days writing software to solve my irritations! 16 | 17 | *Plus, my screen just doesn't do BT.2020. I'm not sure any screen really does.* 18 | 19 | 20 | 21 | ## Problem: Isn't This Solved in VLC/mpv/etc. ? 22 | 23 | It is indeed! They do a very nice 2020/PQ --> 709 on the GPU, in real time, and with very nice tone mapping. 24 | 25 | However, ffmpeg cannot do this in realtime. This means, no live transcoding --> streaming of HDR clips through Jellyfin - and none of the other fun realtime imaging one wants to do on a when one isn't plugged into a loud ASIC more power-hungry than my refrigerator. 26 | 27 | 28 | 29 | ## Problem: How to Solve It? 30 | 31 | My approach is as follows: 32 | * **Piping**: We keep `ffmpeg` to decode, but have it spit out raw YUV444 data, which we process and spit back out to `ffmpeg` for encoding. 33 | * **Threaded I/O**: Read, Write, and Process happen in different threads - the slowest determines the throughput. 34 | * **8-Bit LUT**: The actual imaging operations are first precomputed into a `256x256x256x3` LUT. These arbitrarily complex global operations are then applied with a simple lookup (no interpolation - just pure 8-bit madness!). 35 | 36 | 37 | 38 | ## Problem: So - Was it Worth It? 39 | 40 | Well - all the optimization and reverse engineering aside, the colors in my HDR content looks right through Jellyfin. So? All is right with the world again! 41 | 42 | Though, to be honest, none of my non-technical peers quite understand where I've been the past couple days... 43 | 44 | 45 | 46 | # Features 47 | 48 | How can `fast-hdr` make your day brighter? 49 | * [**Hackable**] Want to easily implement arbitrarily complex global imaging operations, whilst seeing them executed with decent accuracy in real time? It's not like there's a lot of code to sift through - just spice up `hdr_sdr_gen.cpp` with your custom tonemapping function, or whatever you want! 50 | * [**CPU-Based**] There's no GPU here, which means flexibility. Run it on your Raspberry Pi! Run it on a phone! Run it cheaply in - dare I say it - the cloud! 51 | * [**Fast**] With FFMPEG as a decoder piped in, I get `30` FPS at 4K on a `Threadripper 1950X (16-core)`. 52 | * Of course, not all CPUs in the world are Threadrippers, so the `ffmpeg` wrapper sets the max resolution to `1080p`, which works like smooth butter; `80` FPS on my less-powerful-but-still-kinda-beefy server. Comment it out if you don't like it :P 53 | * [**Jellyfin-oriented `ffmpeg` Wrapper**] Designed for Jellyfin, there's a Python wrapper around `ffmpeg` which injects the HDR-->SDR conversion into any complex `ffmpeg` invocation! 54 | * Everyone uses `ffmpeg` - therefore, `fast-hdr` can run everywhere :) ! 55 | * [**Realtime, Arbitrarily Complex Global Operations**] With a `3 * 256^3` sized 8-Bit LUT (just 50MB in memory!) precomputed at compile-time by `hdr_sdr_gen.cpp`, you can perform arbitrarily complex global operations, and apply them to an image (each 8-bit YUV triplet has a corresponding triplet) without any interpolation whatsoever. In this case, that's just an inverse PQ operator, followed by a global tonemap, followed by an sRGB correction. 56 | * [**UNIX Philosophy**] `fast-hdr` does processing, and that's it. It's just a brick. You can use any decoder / encoder you want - as long as it spits out / gobbles up YUV444p data to `stdout`! Hell, I don't know, go crazy with OpenHEVC, or whatever shiny new thing ILM cooked up this time. (Though I'd probably use `ffmpeg` as it's less hard and at least tested). 57 | 58 | 59 | 60 | # How To Do 61 | 62 | 0. Make sure you're on Linux, and have `python3` and `gcc` (and can invoke `g++`). 63 | 1. Get your hands on a standalone `ffmpeg` and `ffprobe`, and put it in `res`. 64 | 2. Run `compile.sh`. It might take a sec, it has to precompute the `.lutd`. 65 | 66 | Then, let it play with some footage! For example, here's a complex ffmpeg invocation (run by Jellyfin): 67 | 68 | ```bash 69 | rm -rf .tmp 70 | 71 | FFMPEG="./dist/ffmpeg-custom" 72 | FFMPEG_PY="./dist/ffmpeg" 73 | HDR_SDR="./dist/hdr_sdr" 74 | LUT_PATH="./dist/cnv.lut8" 75 | 76 | # Test on a nice shot of a cute little catterpiller. 77 | TIME="00:01:28" 78 | FILE="./Life Untouched 4K Demo.mp4" 79 | HLS_SEG=".tmp/transcodes/hash_of_your_hdr_file_no_need_to_replace%d.ts" 80 | FILE_OUT=".tmp/transcodes/hash_of_your_hdr_file_no_need_to_replace.m3u8" 81 | 82 | TEST=true "$FFMPEG_PY" -ss "$TIME" -f mp4 -i file:"$FILE" -map_metadata -1 -map_chapters -1 -threads 0 -map 0:0 -map 0:1 -map -0:s -codec:v:0 libx264 -pix_fmt yuv420p -preset veryfast -crf 23 -maxrate 34541128 -bufsize 69082256 -profile:v high -level 4.1 -x264opts:0 subme=0:me_range=4:rc_lookahead=10:me=dia:no_chroma_me:8x8dct=0:partitions=none -force_key_frames:0 "expr:gte(t,0+n_forced*3)" -g 72 -keyint_min 72 -sc_threshold 0 -vf "scale=trunc(min(max(iw\,ih*dar)\,1920)/2)*2:trunc(ow/dar/2)*2" -start_at_zero -vsync -1 -codec:a:0 aac -strict experimental -ac 2 -ab 384000 -af "volume=2" -copyts -avoid_negative_ts disabled -f hls -max_delay 5000000 -hls_time 3 -individual_header_trailer 0 -hls_segment_type mpegts -start_number 0 -hls_segment_filename "$HLS_SEG" -hls_playlist_type vod -hls_list_size 0 -y "$FILE_OUT" 83 | ``` 84 | 85 | 86 | 87 | ## How To: Jellyfin 88 | 89 | To get Jellyfin to convert HDR footage when transcoding for web playback, follow the How To steps and make sure it works locally. 90 | 91 | Then: 92 | 0. Make sure the python script `ffmpeg`, the actual binaries `ffmpeg-custom` and `ffprobe`, the compiled binary `hdr_sdr`, and the generated LUT `cnd_lut8` are in `dist`. 93 | 1. Copy `dist` to somewhere on your server owned by the `jellyfin` user. Probably a good idea to `chmod` it too. 94 | 2. In the Jellyfin interface, in Playback -> `ffmpeg` Path, point it at the Python script `ffmpeg`. *It's critical that `ffprobe` is there too, otherwise Jellyfin will be unable to read header info about your files, like audio tracks or subtitle tracks.* 95 | 96 | Things to be aware of: 97 | - Seeking is super slow, as for some reason the wrapper doesn't understand keyframes, and will try to encode its way to wherever you seeked to. So don't seek :) Resuming works fine, however. 98 | - Occasionally, you might have to `killall ffmpeg-custom && killall hdr_sdr`, or they'll keep eating CPU cycles after you've stopped watching. I'm still not sure why. I have no idea why. 99 | 100 | 101 | 102 | # Testing / Stability / Modularization / Any Kind of Good Software Development Practices 103 | 104 | No 105 | 106 | 107 | 108 | # Contributing 109 | 110 | *Is that a `malloc` I see in your C++? In this devout Stroustrup'ian neighborhood? Blasphemy...* 111 | 112 | I like you, you insane monkey - if this horrible hack truly is actually useful to you then I'm speechless! 113 | 114 | I'm happy to help you make it work, help with bugs (make an Issue!), and/or (probably) accept any kind of PR. God knows there's enough wrong with this piece of software that it needs some fixing up... 115 | 116 | Development happens at https://git.sofusrose.com/so-rose/fast-hdr . 117 | 118 | 119 | 120 | # TODO 121 | 122 | It gets wilder! 123 | * **Seeking in Jellyfin**: One cannot seek from the Jellyfin interface. This may have something to do with the `ffmpeg` wrapper not catching the `q` to quit. 124 | * **Better Profiling**: Measuring performance characteristics of a threaded application like this isn't super easy, but probably worth it. 125 | * **Dithering**: There's a reason nobody precomputes transforms on every possible 8-bit YUV value: Posterization. We can solve this to a quite reasonable degree by dithering while applying the LUT! 126 | * **More Robust `ffmpeg` Wrapper**: It's a little touchy right now. Like, it throws an exception if you give it a wrong `-f`... 127 | * **More Vivid Image**: Personal preference, I like vivid! This is just a matter of tweaking the image processing pipeline. 128 | * **Verify Color Science**: Right now, it's all done a bit by trial and error. It does, however, match VLC's output quite well. 129 | * **10-bit LUT**: Who cares if this needs a 3GB buffer to compute? It solves posterization issues, and allows directly processing 10-bit footage to boot! 130 | * **Gamut Rendering**: Currently, there's no gamut mapping or rendering intent management. It coule be nice to have. 131 | * **Better Tonemapping**: The present tonemapping is arbitrarily chosen, even though it does look nice. 132 | * **Variable Input**: YUV444p isn't nirvana. Plus, imagine how fast clever LUT'ing directly on 4K YUV420p data might be. 133 | -------------------------------------------------------------------------------- /src/ffmpeg: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | 3 | # This file is part of the fast-hdr project (https://git.sofusrose.com/so-rose/fast-hdr). 4 | # Copyright (c) 2020 Sofus Rose. 5 | 6 | # This program is free software: you can redistribute it and/or modify 7 | # it under the terms of the GNU General Public License as published by 8 | # the Free Software Foundation, either version 3 of the License, or 9 | # (at your option) any later version. 10 | 11 | # This program is distributed in the hope that it will be useful, 12 | # but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | # GNU General Public License for more details. 15 | 16 | # You should have received a copy of the GNU General Public License 17 | # along with this program. If not, see . 18 | 19 | ############# 20 | ## - Imports 21 | ############# 22 | import os, sys 23 | import os.path 24 | import subprocess 25 | 26 | import datetime 27 | 28 | import curses 29 | 30 | 31 | 32 | ############# 33 | ## - Script Settings 34 | ############# 35 | 36 | try : 37 | if os.environ['TEST'] == 'true' : 38 | TEST = True 39 | else : 40 | TEST = False 41 | except : 42 | TEST = False 43 | 44 | SCRIPT_PATH = os.path.dirname( os.path.realpath(__file__) ) 45 | 46 | MAX_WIDTH = 1920 47 | MAX_HEIGHT = 1080 48 | 49 | # Set Paths based 50 | log_path = f'{SCRIPT_PATH}/hdr_sdr.log' 51 | 52 | ffmpeg = f'{SCRIPT_PATH}/ffmpeg-custom' 53 | hdr_sdr = f'{SCRIPT_PATH}/hdr_sdr' 54 | lut_path = f'{SCRIPT_PATH}/cnv.lut8' 55 | 56 | # Assemble Basic Output Command 57 | cmd_raw = [ffmpeg] + sys.argv[1:] 58 | 59 | 60 | 61 | ############# 62 | ## - Utility Functions 63 | ############# 64 | def runCommand(*command, workingDir=os.getcwd(), env=None, stream=False) : 65 | print( 66 | f"[COMMAND] {datetime.datetime.now()}", 67 | f"\tCommand: {' '.join(command)}", 68 | '\n', 69 | 70 | file = open(log_path, 'a'), 71 | sep = '\n' 72 | ) 73 | 74 | # Ensure all is printed that needs to be printed. 75 | sys.stdout.flush() 76 | 77 | # Change Directory to the working dir. 78 | cache_curdir = os.getcwd() 79 | 80 | if stream : 81 | os.chdir(workingDir) 82 | 83 | proc = subprocess.Popen(' '.join(command), stdin=subprocess.PIPE, stdout=subprocess.PIPE, stderr=subprocess.STDOUT, shell=True, env=env) 84 | proc_out = iter(lambda: proc.stdout.read(1), b'') 85 | 86 | while proc.poll() == None : 87 | print( next(proc_out).decode('utf-8'), end='' ) 88 | 89 | else : 90 | os.chdir(workingDir) 91 | 92 | result = subprocess.run(' '.join(command), stdout=subprocess.PIPE, stderr=subprocess.STDOUT, shell=True, env=env) 93 | 94 | os.chdir(cache_curdir) 95 | 96 | # Check the return code. Print the command output & exit if it's non-zero 97 | if result.returncode != 0 : 98 | print(result.stdout.decode('utf-8')) 99 | print( 100 | '[ERR]', 101 | 'Command Failed with message:\n', 102 | *['>>\t' + x + '\n' for x in result.stdout.decode('utf-8').split('\n')], 103 | file = open(log_path, 'a') 104 | ) 105 | sys.exit() 106 | 107 | return result.stdout.decode('utf-8') 108 | 109 | 110 | 111 | ############# 112 | ## - Metadata Mining 113 | ############# 114 | 115 | # Extract File Paths 116 | file_src = next(snip[5:] for snip in cmd_raw if snip[:5] == 'file:') 117 | hls_dst = next(cmd_raw[i+1] for (i, snip) in enumerate(cmd_raw) if snip == '-hls_segment_filename') 118 | file_dst = cmd_raw[-1] 119 | 120 | # Extract Audio Stream # 121 | audio_stream_num = 1 122 | for mapping in [cmd_raw[i+1] for (i, snip) in enumerate(cmd_raw) if snip == '-map'] : 123 | if mapping[-1] not in ('0', 's') : 124 | # The Audio Stream #! 125 | audio_stream_num = int(mapping[2]) 126 | 127 | # Extract Input Format 128 | inp_format = next(cmd_raw[i+1] for (i, snip) in enumerate(cmd_raw) if snip[:2] == '-f') 129 | 130 | # Extract Seek Information (may not exist)) 131 | try : 132 | seek_time = next(cmd_raw[i+1] for (i, snip) in enumerate(cmd_raw) if snip[:3] == '-ss') 133 | except : 134 | seek_time = "00:00:00" 135 | 136 | # Extract Resolution 137 | x_res = int( 138 | runCommand( 139 | 'mediainfo', 140 | '--Language=raw', 141 | '--Inform="Video;%Width%"', 142 | f'"{file_src}"', 143 | ) 144 | ) 145 | 146 | y_res = int( 147 | runCommand( 148 | 'mediainfo', 149 | '--Language=raw', 150 | '--Inform="Video;%Height%"', 151 | f'"{file_src}"', 152 | ) 153 | ) 154 | 155 | # Limit Resolution to 1920 Horizontal 156 | if x_res > MAX_WIDTH : 157 | fac = x_res / MAX_WIDTH 158 | 159 | x_res /= fac 160 | y_res /= fac 161 | 162 | elif y_res > MAX_HEIGHT : 163 | fac = y_res / MAX_HEIGHT 164 | 165 | x_res /= fac 166 | y_res /= fac 167 | 168 | # Extract Color Information 169 | primaries = runCommand( 170 | 'mediainfo', 171 | '--Language=raw', 172 | '--Inform="Video;%colour_primaries%"', 173 | f'"{file_src}"', 174 | ).strip() 175 | 176 | # Extract FPS Information 177 | fps = round(float( 178 | runCommand( 179 | 'mediainfo', 180 | '--Language=raw', 181 | '--Inform="Video;%FrameRate%"', 182 | f'"{file_src}"', 183 | ).strip() 184 | )) 185 | 186 | 187 | 188 | ############# 189 | ## - Reconstruct Command 190 | ############# 191 | 192 | # Inset Quotes Where Quotes Are Needed 193 | after_map_ind = None 194 | for i, snip in enumerate(cmd_raw) : 195 | # Record When Mapping Ends 196 | if snip[:8] == '-codec:v' : 197 | after_map_ind = i 198 | 199 | # Quote File Paths 200 | if snip[:5] == 'file:' : 201 | cmd_raw[i] = snip[:5] + '"' + snip[5:] + '"' 202 | 203 | # Quote Expressions 204 | if snip[:5] == 'expr:' : 205 | cmd_raw[i] = '"' + snip + '"' 206 | 207 | # Quote Video Filters 208 | if snip[:3] == '-vf' : 209 | cmd_raw[i+1] = '"' + cmd_raw[i+1] + '"' 210 | 211 | # Quote Audio Filters 212 | if snip[:3] == '-af' : 213 | cmd_raw[i+1] = '"' + cmd_raw[i+1] + '"' 214 | 215 | # Quote HLS Segment Filename 216 | if i == len(cmd_raw)-1 : 217 | cmd_raw[i] = '"' + cmd_raw[i] + '"' 218 | 219 | # Quote HLS Segment Filename 220 | if snip[:21] == '-hls_segment_filename' : 221 | cmd_raw[i+1] = '"' + cmd_raw[i+1] + '"' 222 | 223 | print( 224 | f"[CALLED] {datetime.datetime.now()}", 225 | f"\tCommand: {' '.join([os.path.realpath(__file__)] + cmd_raw[1:])}", 226 | '\n', 227 | 228 | file = open(log_path, 'a'), 229 | sep = '\n' 230 | ) 231 | 232 | 233 | ############# 234 | ## - Construct New Command 235 | ############# 236 | 237 | if TEST : 238 | test_write = [ 239 | # Video Encoding 240 | '-c:v' , 'libx264', 241 | '-pix_fmt' , 'yuv420p', 242 | '-preset' , 'veryfast', 243 | '-crf' , '23', 244 | '-maxrate' , '34541128', 245 | '-bufsize' , '69082256', 246 | '-level' , '4.1', 247 | '-profile:v', 'high', 248 | 249 | # Audio Encoding 250 | '-c:a', 'aac', 251 | 252 | # Output 253 | '-f' , 'avi', 254 | 'pipe:1', 255 | 256 | # PIPE 257 | '|', 258 | 259 | # Playback 260 | 'ffplay', 261 | '-hide_banner', 262 | '-loglevel panic', 263 | 'pipe:0' 264 | ] 265 | 266 | if primaries == "BT.2020" : 267 | # HDR Processing Path 268 | 269 | # Build New Command 270 | cmd_read = [ 271 | # Base 272 | ffmpeg, 273 | '-hide_banner', 274 | # ~ '-loglevel panic', 275 | 276 | # Input #0 277 | '-ss' , seek_time, 278 | '-f' , inp_format, 279 | '-i' , f'file:"{file_src}"', 280 | 281 | # Processing 282 | '-threads', '0', 283 | '-s' , f'{x_res:.0f}x{y_res:.0f}', 284 | 285 | # Encoding 286 | '-c:v' , 'rawvideo', 287 | '-pix_fmt', 'yuv444p', 288 | '-an', 289 | 290 | # Output 291 | '-f' , 'rawvideo', 292 | 'pipe:1', 293 | ] 294 | 295 | cmd_proc = [ 296 | hdr_sdr, 297 | f'{x_res}', 298 | f'{y_res}', 299 | f'{lut_path}', 300 | ] 301 | 302 | cmd_write = [ 303 | # Base 304 | ffmpeg, 305 | '-hide_banner', 306 | # ~ '-loglevel panic', 307 | 308 | # Input #0 309 | '-s' , f'{x_res:.0f}x{y_res:.0f}', 310 | '-pix_fmt', 'yuv444p', 311 | '-f' , 'rawvideo', 312 | '-r' , f'{fps}', 313 | '-i' , 'pipe:0', 314 | 315 | '-itsoffset 00:00:00.0', 316 | 317 | # Input #1 318 | '-ss' , seek_time, 319 | '-f' , inp_format, 320 | '-i' , f'file:"{file_src}"', 321 | 322 | # Mapping (all but video from 0) 323 | '-map_metadata', '-1', 324 | '-map_chapters', '-1', 325 | 326 | '-threads', '0', 327 | 328 | '-map', '0:v', 329 | '-map', f'1:{audio_stream_num:.0f}', 330 | '-map', '-1:s', 331 | ] 332 | 333 | if TEST : 334 | cmd_write += test_write 335 | else : 336 | # Allow the Rest of cmd_raw to remain untouched 337 | cmd_write += cmd_raw[after_map_ind:] 338 | 339 | # ~ cmd_write += [ 340 | # ~ # Video Encoding 341 | # ~ '-codec:v:0', 'libx264', 342 | # ~ '-pix_fmt' , 'yuv420p', 343 | # ~ '-preset' , 'veryfast', 344 | # ~ '-crf' , '23', 345 | # ~ '-maxrate' , '9229044', 346 | # ~ '-bufsize' , '18458088', 347 | # ~ '-profile:v', 'high', 348 | # ~ '-level' , '4.1', 349 | # ~ '-x264opts:0', 'subme=0:me_range=4:rc_lookahead=10:me=dia:no_chroma_me:8x8dct=0:partitions=none', 350 | 351 | # ~ '-force_key_frames:0', 352 | # ~ '"expr:gte(t,0+n_forced*3)"', 353 | 354 | # ~ '-g', '72', 355 | # ~ '-keyint_min', '72', 356 | # ~ '-sc_threshold', '0', 357 | 358 | # ~ '-vf', '"scale=trunc(min(max(iw\,ih*dar)\,1920)/2)*2:trunc(ow/dar/2)*2"', 359 | 360 | 361 | # ~ # Audio Encoding 362 | # ~ '-codec:a:0', 'aac', 363 | # ~ '-strict', 'experimental', 364 | # ~ '-ac', '2', 365 | # ~ '-ab', '384000', 366 | # ~ '-af', '"volume=2"', 367 | 368 | 369 | # ~ # Timestamp 370 | # ~ '-copyts', 371 | # ~ '-avoid_negative_ts', 'disabled', 372 | 373 | # ~ '-start_at_zero', 374 | # ~ '-vsync', '-1', 375 | 376 | # ~ # HLS Options 377 | # ~ '-f', 'hls', 378 | # ~ '-max_delay', '5000000', 379 | # ~ '-hls_time', '3', 380 | # ~ '-individual_header_trailer', '0', 381 | # ~ '-hls_segment_type', 'mpegts', 382 | # ~ '-start_number', '0', 383 | # ~ '-hls_segment_filename', f'"{hls_dst}"', 384 | # ~ '-hls_playlist_type', 'vod', 385 | # ~ '-hls_list_size', '0', 386 | 387 | # ~ # Output 388 | # ~ '-y', 389 | # ~ f'"{file_dst}"' 390 | # ~ ] 391 | 392 | cmd = cmd_read + ['|'] + cmd_proc + ['|'] + cmd_write 393 | # ~ cmd = cmd_read + ['|'] + cmd_write 394 | # ~ cmd = cmd_raw 395 | else : 396 | # SDR Processing Path- DO NOTHING! 397 | if TEST : 398 | cmd = cmd_raw[:after_map_ind] + test_write 399 | else : 400 | cmd = cmd_raw 401 | 402 | print( 403 | f"[INVOKE] {datetime.datetime.now()}", 404 | f"\tFile: {file_src}", 405 | f"\tPrimaries: {primaries}", 406 | f"\tTime: {seek_time}", 407 | f"\tRes: {x_res:.0f}x{y_res:.0f}", 408 | '\n', 409 | 410 | file = open(log_path, 'a'), 411 | sep = '\n' 412 | ) 413 | 414 | # Run Command 415 | runCommand(*cmd, stream = True) 416 | -------------------------------------------------------------------------------- /gen/hdr_sdr_gen.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | * This file is part of the fast-hdr project (https://git.sofusrose.com/so-rose/fast-hdr). 3 | * Copyright (c) 2020 Sofus Rose. 4 | * 5 | * This program is free software: you can redistribute it and/or modify 6 | * it under the terms of the GNU General Public License as published by 7 | * the Free Software Foundation, version 3. 8 | * 9 | * This program is distributed in the hope that it will be useful, but 10 | * WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12 | * General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | 19 | // Usage: | ./hdr_sdr [WIDTH] [HEIGHT] | 20 | 21 | // TODO: 22 | // - Desaturate Highlights 23 | // - Dithering 24 | 25 | // Libraries 26 | #include 27 | #include 28 | #include 29 | 30 | #include 31 | #include 32 | 33 | #include 34 | 35 | #include 36 | #include 37 | 38 | 39 | 40 | // User Defines 41 | #define IMG_BITS 8 42 | 43 | 44 | 45 | // User Types 46 | typedef uint8_t img_uint; // Must Hold Image Data Point of >= IMG_BITS Size 47 | 48 | #define IMG_INT_MAX ((1 << IMG_BITS) - 1) 49 | #define IMG_INT_MAX_D ( (double) IMG_INT_MAX ) 50 | 51 | 52 | 53 | // Resolution and Size of LUTD (Dimensioned LUT 54 | #define LUTD_BITS IMG_BITS 55 | #define LUTD_CHNLS 3 56 | 57 | #define LUTD_RES (1 << LUTD_BITS) // 2**LUTD_BITS 58 | 59 | #define LUTD_SIZE (LUTD_RES * LUTD_RES * LUTD_RES * LUTD_CHNLS) 60 | 61 | // Each 8-Bit YUV Triplet => Corresponding YUV Triplet. 62 | // 4D LUT, Three "Cubes": Y Cube, U Cube, V Cube. 63 | // 0. To Advance One Y, U, V, C(hannel) vue, Advance by a Stride 64 | // 1. Use Old YUV to Find X,Y,Z Index On Cube(s). 65 | // 2. Compute New YUV by Indexing Each Cube Identically 66 | 67 | #define LUTD_Y_STRIDE(y) (y << (0 * LUTD_BITS)) // Y: Shift by (2**LUTD_BITS)**0 68 | #define LUTD_U_STRIDE(u) (u << (1 * LUTD_BITS)) // U: Shift by (2**LUTD_BITS)**1 69 | #define LUTD_V_STRIDE(v) (v << (2 * LUTD_BITS)) // V: Shift by (2**LUTD_BITS)**2 70 | #define LUTD_C_STRIDE(c) (c << (3 * LUTD_BITS)) // C: Shift by (2**LUTD_BITS)**3 71 | 72 | 73 | 74 | // Namespacing 75 | using namespace std; 76 | 77 | 78 | 79 | //########### 80 | // - LUT Methods 81 | //########### 82 | 83 | void write_lutd(img_uint *lutd, string path_lutd) { 84 | // The array must be sized as LUTD_SIZE. 85 | 86 | ofstream file_lutd(path_lutd, ofstream::binary); 87 | 88 | if (file_lutd.is_open()) { 89 | file_lutd.write(reinterpret_cast(lutd), LUTD_SIZE); 90 | } 91 | } 92 | 93 | 94 | 95 | //########### 96 | // - Color Model Conversions 97 | //########### 98 | 99 | void yuv_rgb( 100 | img_uint *y, 101 | img_uint *u, 102 | img_uint *v, 103 | double *buf_rgb 104 | ) { 105 | int c = (double) *y; 106 | int d = (double) *u - 128.0; 107 | int e = (double) *v - 128.0; 108 | 109 | buf_rgb[0] = clamp( c + 1.370705 * e, 0.0, IMG_INT_MAX_D ) / IMG_INT_MAX_D; 110 | buf_rgb[1] = clamp( c - 0.698001 * d - 0.337633 * e, 0.0, IMG_INT_MAX_D ) / IMG_INT_MAX_D; 111 | buf_rgb[2] = clamp( c + 1.732446 * d , 0.0, IMG_INT_MAX_D ) / IMG_INT_MAX_D; 112 | } 113 | 114 | void rgb_yuv( 115 | double *buf_rgb, 116 | img_uint *y, 117 | img_uint *u, 118 | img_uint *v 119 | ) { 120 | double r = buf_rgb[0] * 255.0; 121 | double g = buf_rgb[1] * 255.0; 122 | double b = buf_rgb[2] * 255.0; 123 | 124 | *y = (img_uint) clamp( 0.257 * r + 0.504 * g + 0.098 * b + 16.0 , 0.0, IMG_INT_MAX_D); 125 | *u = (img_uint) clamp(-0.148 * r - 0.291 * g + 0.439 * b + 128.0, 0.0, IMG_INT_MAX_D); 126 | *v = (img_uint) clamp( 0.439 * r - 0.368 * g - 0.071 * b + 128.0, 0.0, IMG_INT_MAX_D); 127 | } 128 | 129 | void rgb_hsl( 130 | double *buf_rgb, 131 | double *buf_hsl 132 | ) { 133 | // RGB to HSL with Luma Lightness 134 | 135 | 136 | // Calculate Chroma 137 | double chnl_max = max(buf_rgb[0], max(buf_rgb[1], buf_rgb[2])); 138 | double chnl_min = min(buf_rgb[0], min(buf_rgb[1], buf_rgb[2])); 139 | 140 | double chroma = chnl_max - chnl_min; 141 | 142 | // Calculate Lightness 143 | buf_hsl[2] = (chnl_max + chnl_min) / 2; 144 | 145 | // Calculate Saturation 146 | if (buf_hsl[2] != 0.0 && buf_hsl[2] != 1.0) { 147 | buf_hsl[1] = chroma / ( 1 - abs(2 * buf_hsl[2] - 1) ); 148 | } else { 149 | buf_hsl[1] = 0.0; 150 | } 151 | 152 | // Calculate Hue (Degrees) 153 | if (chroma == 0) { 154 | buf_hsl[0] = 0.0; 155 | } else if (chnl_max == buf_rgb[0]) { 156 | buf_hsl[0] = (buf_rgb[1] - buf_rgb[2]) / chroma; 157 | } else if (chnl_max == buf_rgb[1]) { 158 | buf_hsl[0] = 2.0 + (buf_rgb[2] - buf_rgb[0]) / chroma; 159 | } else if (chnl_max == buf_rgb[2]) { 160 | buf_hsl[0] = 4.0 + (buf_rgb[0] - buf_rgb[1]) / chroma; 161 | } 162 | 163 | buf_hsl[0] *= 60.0; 164 | 165 | } 166 | 167 | void hsl_rgb( 168 | double *buf_hsl, 169 | double *buf_rgb 170 | ) { 171 | // HSL to RGB with Luma Lightness 172 | double buf_rgb_1[3] {0.0, 0.0, 0.0}; 173 | 174 | double chroma = ( 1 - abs(2 * buf_hsl[2] - 1) ) * buf_hsl[1]; 175 | 176 | double H_reduc = buf_hsl[0] / 60.0; 177 | double X = chroma * ( 1 - abs(fmod(H_reduc, 2.0) - 1) ); 178 | 179 | if (ceil(H_reduc) == 1) { 180 | buf_rgb_1[0] = chroma; 181 | buf_rgb_1[1] = X; 182 | buf_rgb_1[2] = 0.0; 183 | } else if (ceil(H_reduc) == 2) { 184 | buf_rgb_1[0] = X; 185 | buf_rgb_1[1] = chroma; 186 | buf_rgb_1[2] = 0.0; 187 | } else if (ceil(H_reduc) == 3) { 188 | buf_rgb_1[0] = 0.0; 189 | buf_rgb_1[1] = chroma; 190 | buf_rgb_1[2] = X; 191 | } else if (ceil(H_reduc) == 4) { 192 | buf_rgb_1[0] = 0.0; 193 | buf_rgb_1[1] = X; 194 | buf_rgb_1[2] = chroma; 195 | } else if (ceil(H_reduc) == 5) { 196 | buf_rgb_1[0] = X; 197 | buf_rgb_1[1] = 0.0; 198 | buf_rgb_1[2] = chroma; 199 | } else if (ceil(H_reduc) == 6) { 200 | buf_rgb_1[0] = chroma; 201 | buf_rgb_1[1] = 0.0; 202 | buf_rgb_1[2] = X; 203 | } else { 204 | buf_rgb_1[0] = 0.0; 205 | buf_rgb_1[1] = 0.0; 206 | buf_rgb_1[2] = 0.0; 207 | } 208 | 209 | double m = buf_hsl[2] - (chroma / 2); 210 | 211 | buf_rgb[0] = buf_rgb_1[0] + m; 212 | buf_rgb[1] = buf_rgb_1[1] + m; 213 | buf_rgb[2] = buf_rgb_1[2] + m; 214 | } 215 | 216 | void s_sat(double *buf_rgb, double fac_sat) { 217 | double buf_hsl[3] {0.0, 0.0, 0.0}; 218 | rgb_hsl(buf_rgb, buf_hsl); 219 | 220 | buf_hsl[1] *= fac_sat; 221 | 222 | hsl_rgb(buf_hsl, buf_rgb); 223 | 224 | //~ buf_rgb[0] = clamp(buf_rgb[0], 0.0, 1.0); 225 | //~ buf_rgb[1] = clamp(buf_rgb[1], 0.0, 1.0); 226 | //~ buf_rgb[2] = clamp(buf_rgb[2], 0.0, 1.0); 227 | } 228 | 229 | 230 | 231 | //########### 232 | // - HDR Transfer Curves 233 | //########### 234 | 235 | #define c1 0.8359375 236 | #define c2 18.8515625 237 | #define c3 18.6875 238 | 239 | #define m1 0.1593017578125 240 | #define m2 78.84375 241 | 242 | double gam_pq_lin(double v) { 243 | return pow( (pow(v, 1/m2) - c1) / (c2 - c3 * pow(v, 1/m2)), 1/m1 ); 244 | } 245 | 246 | double gam_lin_pq(double v) { 247 | return pow( (c1 + c2 * pow(v, m1)) / (1 + c3 * pow(v, m1)), m2 ); 248 | } 249 | 250 | 251 | 252 | //########### 253 | // - Colorspace Conversions 254 | //########### 255 | 256 | void bt2020_bt709(double *buf_rgb) { 257 | // bt2020_bt709 258 | double cmat[9] { 259 | 1.6605, -0.5876, -0.0728, 260 | -0.1246, 1.1329, -0.0083, 261 | -0.0182, -0.1006, 1.1187 262 | }; 263 | 264 | double r = buf_rgb[0]; 265 | double g = buf_rgb[1]; 266 | double b = buf_rgb[2]; 267 | 268 | buf_rgb[0] = r * cmat[0] + g * cmat[1] + b * cmat[2]; //Red 269 | buf_rgb[1] = r * cmat[3] + g * cmat[4] + b * cmat[5]; //Green 270 | buf_rgb[2] = r * cmat[6] + g * cmat[7] + b * cmat[8]; //Blue 271 | 272 | //~ buf_rgb[0] = r * cmat[0] + g * cmat[1] + b * cmat[2]; //Red 273 | //~ buf_rgb[1] = r * cmat[3] + g * cmat[4] + b * cmat[5]; //Green 274 | //~ buf_rgb[2] = r * cmat[6] + g * cmat[7] + b * cmat[8]; //Blue 275 | } 276 | 277 | float normal_pdf(double x, double m, double s) 278 | { 279 | static const double inv_sqrt_2pi = 0.3989422804014327; 280 | double a = (x - m) / s; 281 | 282 | return inv_sqrt_2pi / s * std::exp(-0.5f * a * a); 283 | } 284 | 285 | void render_gamut(double *buf_rgb) { 286 | // Calculate Lightness 287 | double chnl_max = max(buf_rgb[0], max(buf_rgb[1], buf_rgb[2])); 288 | double chnl_min = min(buf_rgb[0], min(buf_rgb[1], buf_rgb[2])); 289 | 290 | // Zebras 291 | if (chnl_min <= 0.0) { 292 | buf_rgb[0] = 0.0; 293 | buf_rgb[1] = 0.0; 294 | buf_rgb[2] = 1.0; 295 | } 296 | 297 | if (chnl_max >= 1.0) { 298 | double chroma = (chnl_max - chnl_min); 299 | 300 | buf_rgb[0] = 1.0; 301 | buf_rgb[1] = 0.0; 302 | buf_rgb[2] = 0.0; 303 | } 304 | 305 | //~ double luma = 0.2126 * buf_rgb[0] + 0.7152 * buf_rgb[1] + 0.0722 * buf_rgb[2]; 306 | //~ double L = (chnl_max + chnl_min) / 2; 307 | 308 | //~ // Scale Towards Gray Based on Luminance 309 | //~ double scl = normal_pdf(clamp(chroma, 0.0, 1.0), 1.0, 0.01) / 3.98942; 310 | 311 | //~ buf_rgb[0] = (1 - scl) * buf_rgb[0] + scl * luma; 312 | //~ buf_rgb[1] = (1 - scl) * buf_rgb[1] + scl * luma; 313 | //~ buf_rgb[2] = (1 - scl) * buf_rgb[2] + scl * luma; 314 | //~ buf_rgb[0] = (1 - chroma) * buf_rgb[0] + chroma * luma; 315 | //~ buf_rgb[1] = (1 - chroma) * buf_rgb[1] + chroma * luma; 316 | //~ buf_rgb[2] = (1 - chroma) * buf_rgb[2] + chroma * luma; 317 | //~ buf_rgb[0] = chroma; 318 | //~ buf_rgb[1] = chroma; 319 | //~ buf_rgb[2] = chroma; 320 | } 321 | 322 | 323 | 324 | //########### 325 | // - Tonemapping 326 | //########### 327 | 328 | double tm_cool(double v) { 329 | v *= 150.0; 330 | 331 | double A = 0.15; 332 | double B = 0.50; 333 | double C = 0.10; 334 | double D = 0.20; 335 | double E = 0.02; 336 | double F = 0.30; 337 | double W = 11.2; 338 | 339 | return ((v*(A*v+C*B)+D*E)/(v*(A*v+B)+D*F))-E/F; 340 | 341 | //~ return v / (v + 1); 342 | } 343 | 344 | 345 | 346 | //########### 347 | // - SDR Transfer Curves 348 | //########### 349 | double gam_lin_srgb(double v) { 350 | return v > 0.0031308 ? (( 1.055 * pow(v, (1.0f / 2.4)) ) - 0.055) : v * 12.92; 351 | } 352 | 353 | double gam_srgb_lin(double v) { 354 | return v > 0.04045 ? pow(( (v + 0.055) / 1.055 ), 2.4) : v / 12.92; 355 | } 356 | 357 | 358 | #define alpha 1.099 359 | #define beta 0.018 360 | #define zeta 0.081 361 | 362 | double gam_lin_709(double v) { 363 | if (v <= 0) { 364 | return 0.0; 365 | } else if (v < beta) { 366 | return 4.5 * v; 367 | } else if (v <= 1) { 368 | return alpha * pow(v, 0.45) - (alpha - 1); 369 | } else { 370 | return 1.0; 371 | } 372 | } 373 | 374 | double gam_709_lin(double v) { 375 | if (v <= 0) { 376 | return 0.0; 377 | } else if (v < zeta) { 378 | return v * (1 / 4.5); 379 | } else if (v <= 1) { 380 | return pow( (v + (alpha - 1)) / (alpha), (1 / 0.45) ); 381 | } else { 382 | return 1.0; 383 | } 384 | } 385 | 386 | 387 | 388 | //########### 389 | // - Processing Methods 390 | //########### 391 | 392 | void proc(img_uint *y, img_uint *u, img_uint *v) { 393 | 394 | // Create RGB Buffer 395 | double buf_rgb[3] {0.0, 0.0, 0.0}; 396 | 397 | // YUV to RGB 398 | yuv_rgb(y, u, v, buf_rgb); 399 | 400 | // PQ --> Lin 401 | for (int chnl = 0; chnl < 3; chnl++) { 402 | buf_rgb[chnl] = gam_pq_lin( buf_rgb[chnl] ); 403 | } 404 | 405 | // Global Tonemapping 406 | for (int chnl = 0; chnl < 3; chnl++) { 407 | buf_rgb[chnl] = tm_cool( buf_rgb[chnl] ); 408 | } 409 | 410 | // Lin --> sRGB 411 | for (int chnl = 0; chnl < 3; chnl++) { 412 | buf_rgb[chnl] = gam_lin_srgb( buf_rgb[chnl] ); 413 | } 414 | 415 | // RGB to YUV 416 | rgb_yuv(buf_rgb, y, u, v); 417 | } 418 | 419 | void gen_lutd(img_uint *lutd) { 420 | // Process the Payload Using Precomputed YUV Destinations 421 | #pragma omp parallel for 422 | for (size_t v = 0; v <= IMG_INT_MAX; v++) { 423 | for (size_t u = 0; u <= IMG_INT_MAX; u++) { 424 | for (size_t y = 0; y <= IMG_INT_MAX; y++) { 425 | size_t ind_lutd = ( 426 | LUTD_Y_STRIDE(y) + 427 | LUTD_U_STRIDE(u) + 428 | LUTD_V_STRIDE(v) 429 | ); 430 | 431 | // Get LUTD Pointers 432 | uint8_t *y_lutd = &lutd[ind_lutd + LUTD_C_STRIDE(0)]; 433 | uint8_t *u_lutd = &lutd[ind_lutd + LUTD_C_STRIDE(1)]; 434 | uint8_t *v_lutd = &lutd[ind_lutd + LUTD_C_STRIDE(2)]; 435 | 436 | // Set LUTD Values to Default 437 | *y_lutd = y; 438 | *u_lutd = u; 439 | *v_lutd = v; 440 | 441 | // Process Default LUTD Values 442 | proc(y_lutd, u_lutd, v_lutd); 443 | } 444 | } 445 | } 446 | } 447 | 448 | 449 | 450 | //########### 451 | // - Application 452 | //########### 453 | 454 | int main(int argc, char **argv) { 455 | 456 | // PARSE: (Width, Height) => Image Size, LUT Path from Command Line 457 | string path_lutd; 458 | if (argc == 2) { 459 | path_lutd = string(argv[1]); 460 | } else { 461 | cout << "Usage: ./hdr_sdr_gen [PATH_LUTD]" << endl; 462 | 463 | return 1; 464 | } 465 | 466 | // LUTD: Allocate LUTD 467 | img_uint *lutd = (img_uint*) malloc( sizeof(img_uint) * LUTD_SIZE ); 468 | 469 | // LUTD: Generate LUTD 470 | gen_lutd(lutd); 471 | 472 | // LUTD: Wrote LUTD 473 | write_lutd(lutd, path_lutd); 474 | } 475 | -------------------------------------------------------------------------------- /LICENSE.txt: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | --------------------------------------------------------------------------------