summaryrefslogtreecommitdiff
path: root/doc/rate_distortion.txt
diff options
context:
space:
mode:
authorDiego Biurrun <diego@biurrun.de>2012-12-19 18:48:21 +0100
committerDiego Biurrun <diego@biurrun.de>2012-12-21 00:18:34 +0100
commit511cf612ac979f536fd65e14603a87ca5ad435f3 (patch)
tree44bef1bf9a062368bf4ab89485279549af8bda90 /doc/rate_distortion.txt
parent6906b19346ae8a330bfaa1c16ce535be10789723 (diff)
miscellaneous typo fixes
Diffstat (limited to 'doc/rate_distortion.txt')
-rw-r--r--doc/rate_distortion.txt2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/rate_distortion.txt b/doc/rate_distortion.txt
index a7d2c878b2..e9711c2d5c 100644
--- a/doc/rate_distortion.txt
+++ b/doc/rate_distortion.txt
@@ -23,7 +23,7 @@ Let's consider the problem of minimizing:
rate is the filesize
distortion is the quality
-lambda is a fixed value choosen as a tradeoff between quality and filesize
+lambda is a fixed value chosen as a tradeoff between quality and filesize
Is this equivalent to finding the best quality for a given max
filesize? The answer is yes. For each filesize limit there is some lambda
factor for which minimizing above will get you the best quality (using your