Introduction
Introduction Statistics Contact Development Disclaimer Help
blind-matrix-translate.1 - blind - suckless command-line video editing utility
git clone git://git.suckless.org/blind
Log
Files
Refs
README
LICENSE
---
blind-matrix-translate.1 (1478B)
---
1 .TH BLIND-MATRIX-TRANSLATE 1 blind
2 .SH NAME
3 blind-matrix-translate - Create an affine 2D-transformation matrix for t…
4 .SH SYNOPSIS
5 .B blind-matrix-translate
6 [-c]
7 .SH DESCRIPTION
8 .B blind-matrix-translate
9 creates an affine 2D-transformation matrix for
10 translation. The parameters for the matrix is read
11 in stdin in format of a blind video, one matrix
12 per frame in stdin created and printed to stdout
13 in format of a blind video.
14 .P
15 Each frame in stdin shall contain exactly 2 pixel,
16 the first pixel holds the number of pixels the
17 image shall be translated rightwards, and the
18 second pixel holds the number of pixels the
19 image shall be translated downwards.
20 .P
21 The luma (encoding in the Y-channel, the second
22 channel) multiplied by the alpha (the fourth channel)
23 of the input pixels are used as the values. Each
24 values in the resulting matrices are stored
25 in all channels.
26 .SH OPTIONS
27 .TP
28 .B -c
29 Create different matrices for each channel. Use
30 values from each channel in stdin to create
31 matrices whose values are stored in the same
32 channels in stdout.
33 .SH NOTES
34 The image upwards rather than downwards if the
35 Y-axis grows upwards rather than downwards.
36 .SH SEE ALSO
37 .BR blind (7),
38 .BR blind-from-text (1),
39 .BR blind-matrix-orthoproject (1),
40 .BR blind-matrix-reflect (1),
41 .BR blind-matrix-rotate (1),
42 .BR blind-matrix-scale (1),
43 .BR blind-matrix-shear (1),
44 .BR blind-matrix-transpose (1),
45 .BR blind-multiply-matrices (1)
46 .SH AUTHORS
47 Mattias Andrée
48 .RI < [email protected] >
You are viewing proxied material from suckless.org. The copyright of proxied material belongs to its original authors. Any comments or complaints in relation to proxied material should be directed to the original authors of the content concerned. Please see the disclaimer for more details.