text stringlengths 1 93.6k |
|---|
sentry = SiemTriggerCore()
|
sentry.run_triggers()
|
# <FILESEP>
|
from typing import Optional
|
import torch
|
from diffusers.utils.accelerate_utils import apply_forward_hook
|
from diffusers.models.autoencoders.vae import DecoderOutput, DiagonalGaussianDistribution
|
from diffusers.models.modeling_outputs import AutoencoderKLOutput
|
@apply_forward_hook
|
def encode(
|
self, x: torch.Tensor, return_dict: bool = True
|
):
|
"""
|
Encode a batch of images into latents.
|
Args:
|
x (`torch.Tensor`): Input batch of images.
|
return_dict (`bool`, *optional*, defaults to `True`):
|
Whether to return a [`~models.autoencoder_kl.AutoencoderKLOutput`] instead of a plain tuple.
|
Returns:
|
The latent representations of the encoded videos. If `return_dict` is True, a
|
[`~models.autoencoder_kl.AutoencoderKLOutput`] is returned, otherwise a plain `tuple` is returned.
|
"""
|
# print("encode shape xx: ", x.shape)
|
if self.use_slicing and x.shape[0] > 1:
|
encoded_slices = [self._encode(x_slice) for x_slice in x.split(1)]
|
h = torch.cat(encoded_slices)
|
else:
|
h = self._encode(x)
|
# print("encode shape: ", h.shape)
|
posterior = DiagonalGaussianDistribution(h)
|
if not return_dict:
|
return (posterior,)
|
return AutoencoderKLOutput(latent_dist=posterior)
|
def tiled_encode(self, x: torch.Tensor) -> torch.Tensor:
|
r"""Encode a batch of images using a tiled encoder.
|
When this option is enabled, the VAE will split the input tensor into tiles to compute encoding in several
|
steps. This is useful to keep memory use constant regardless of image size. The end result of tiled encoding is
|
different from non-tiled encoding because each tile uses a different encoder. To avoid tiling artifacts, the
|
tiles overlap and are blended together to form a smooth output. You may still see tile-sized changes in the
|
output, but they should be much less noticeable.
|
Args:
|
x (`torch.Tensor`): Input batch of videos.
|
Returns:
|
`torch.Tensor`:
|
The latent representation of the encoded videos.
|
"""
|
# For a rough memory estimate, take a look at the `tiled_decode` method.
|
batch_size, num_channels, num_frames, height, width = x.shape
|
overlap_height = int(self.encode_tile_sample_min_height *
|
(1 - self.encode_tile_overlap_factor_height))
|
overlap_width = int(self.encode_tile_sample_min_width *
|
(1 - self.encode_tile_overlap_factor_width))
|
blend_extent_height = int(
|
self.encode_tile_latent_min_height * self.encode_tile_overlap_factor_height)
|
blend_extent_width = int(
|
self.encode_tile_latent_min_width * self.encode_tile_overlap_factor_width)
|
row_limit_height = self.encode_tile_latent_min_height - blend_extent_height
|
row_limit_width = self.encode_tile_latent_min_width - blend_extent_width
|
frame_batch_size = 4
|
# Split x into overlapping tiles and encode them separately.
|
# The tiles have an overlap to avoid seams between tiles.
|
rows = []
|
for i in range(0, height, overlap_height):
|
row = []
|
for j in range(0, width, overlap_width):
|
# Note: We expect the number of frames to be either `1` or `frame_batch_size * k` or `frame_batch_size * k + 1` for some k.
|
num_batches = num_frames // frame_batch_size if num_frames > 1 else 1
|
time = []
|
for k in range(num_batches):
|
remaining_frames = num_frames % frame_batch_size
|
start_frame = frame_batch_size * k + \
|
(0 if k == 0 else remaining_frames)
|
end_frame = frame_batch_size * (k + 1) + remaining_frames
|
tile = x[
|
:,
|
:,
|
start_frame:end_frame,
|
i: i + self.encode_tile_sample_min_height,
|
j: j + self.encode_tile_sample_min_width,
|
]
|
tile = self.encoder(tile)
|
if self.quant_conv is not None:
|
tile = self.quant_conv(tile)
|
time.append(tile)
|
self._clear_fake_context_parallel_cache()
|
row.append(torch.cat(time, dim=2))
|
rows.append(row)
|
result_rows = []
|
for i, row in enumerate(rows):
|
result_row = []
|
for j, tile in enumerate(row):
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.