man/cwebp.1: wording, change the date

options were added since the last date refresh

Change-Id: I3899ebd429ba0260a28ce02bb973e1ee015c6e6e
This commit is contained in:
James Zern 2012-07-19 12:15:35 -07:00
parent 3e5bbe1c2e
commit 3976dcd59f

View File

@ -1,5 +1,5 @@
.\" Hey, EMACS: -*- nroff -*-
.TH CWEBP 1 "January 24, 2012"
.TH CWEBP 1 "July 19, 2012"
.SH NAME
cwebp \- compress an image file to a WebP file
.SH SYNOPSIS
@ -43,7 +43,7 @@ values result in a lossy compression. The default is 100.
Specify the strength of the deblocking filter, between 0 (no filtering)
and 100 (maximum filtering). A value of 0 will turn off any filtering.
Higher value will increase the strength of the filtering process applied
after decoding the picture. The higher the smoother the picture will
after decoding the picture. The higher the value the smoother the picture will
appear. Typical values are usually in the range of 20 to 50.
.TP
.B \-preset string
@ -63,12 +63,12 @@ and where else to better transfer these bits. The possible range goes from
.TP
.B \-m int
Specify the compression method to use. This parameter controls the
tradeoff between encoding speed and the compressed file size and quality.
trade off between encoding speed and the compressed file size and quality.
Possible values range from 0 to 6. Default value is 4.
When higher values are used, the encoder will spend more time inspecting
additional encoding possibilities and decide on the quality gain.
Lower value can result is faster processing time at the expense of
larger filesize and lower compression quality.
larger file size and lower compression quality.
.TP
.B \-af
Turns auto-filter on. This algorithm will spend additional time optimizing
@ -143,7 +143,7 @@ and has currently no effect.
.B \-alpha_filter string
Specify the predictive filtering method for the alpha plane. One of 'none',
\&'fast' or 'best', in increasing complexity and slowness order. Default is
\&'fast'. Internally, alpha filtering is performed using four possible
\&'fast'. Internally, alpha filtering is performed using four possible
predictions (none, horizontal, vertical, gradient). The 'best' mode will try
each mode in turn and pick the one which gives the smaller size. The 'fast'
mode will just try to form an a-priori guess without testing all modes.