- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for IDCT (1.93 sec)
-
src/image/jpeg/scan.go
// to the image. func (d *decoder) reconstructBlock(b *block, bx, by, compIndex int) error { qt := &d.quant[d.comp[compIndex].tq] for zig := 0; zig < blockSize; zig++ { b[unzig[zig]] *= qt[zig] } idct(b) dst, stride := []byte(nil), 0 if d.nComp == 1 { dst, stride = d.img1.Pix[8*(by*d.img1.Stride+bx):], d.img1.Stride } else { switch compIndex { case 0:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 15.7K bytes - Viewed (0) -
RELEASE.md
`tf.linalg.matvec` convenience function. * `tf.einsum()`raises `ValueError` for unsupported equations like `"ii->"`. * Add DCT-I and IDCT-I in `tf.signal.dct` and `tf.signal.idct`. * Add LU decomposition op. * Add quantile loss to gradient boosted trees in estimator. * Add `round_mode` to `QuantizeAndDequantizeV2` op to select rounding algorithm.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 730.3K bytes - Viewed (0)