Computer Vision Foundations · 免费预览

分析与综合

每个图像变换都是一对矩阵:一个将图像投影到模板上,另一个从系数重建图像。

1. The last lesson and a new frame

The last lesson and a new frame

2. Three sampling regimes

Three sampling regimes

3. Self-inverting transforms

Self-inverting transforms

4. A map of what follows

A map of what follows

5. Which regime

A transform analyzes a 256-pixel image into 1024 coefficients using templates stacked in a tall matrix P\mathbf{P}. The analysis is complete, meaning suitable coefficient vectors can rebuild any image. Which statement is correct?

6. Self-inverting round trip

A self-inverting transform satisfies PPT=I\mathbf{P}\mathbf{P}^T = \mathbf{I}. An image goes through analysis r=PTℓ\mathbf{r} = \mathbf{P}^T\boldsymbol{\ell} and then synthesis with Q=P\mathbf{Q} = \mathbf{P}. What is the reconstructed image, and what does PTP\mathbf{P}^T\mathbf{P} equal in general?

7. Round trip error

A self-inverting transform has PPT=I\mathbf{P}\mathbf{P}^T = \mathbf{I}. An image ℓ\boldsymbol{\ell} is analyzed to coefficients r=PTℓ\mathbf{r} = \mathbf{P}^T\boldsymbol{\ell} and synthesized back with Q=P\mathbf{Q} = \mathbf{P}. Compute the squared reconstruction error ∥Pr−ℓ∥2\|\mathbf{P}\mathbf{r} - \boldsymbol{\ell}\|^2 and write it as a number.

进入交互式练习

免费注册 · 即时批改 · 自动安排间隔复习。

免费开始这门课