text stringlengths 0 93.6k |
|---|
output_type: Optional[str] = "pil", |
): |
if torch_device is None: |
torch_device = "cuda" if torch.cuda.is_available() else "cpu" |
if isinstance(prompt, str): |
batch_size = 1 |
elif isinstance(prompt, list): |
batch_size = len(prompt) |
else: |
raise ValueError(f"`prompt` has to be of type `str` or `list` but is {type(prompt)}") |
if height % 8 != 0 or width % 8 != 0: |
raise ValueError(f"`height` and `width` have to be divisible by 8 but are {height} and {width}.") |
self.unet.to(torch_device) |
self.vae.to(torch_device) |
self.text_encoder.to(torch_device) |
self.safety_checker.to(torch_device) |
# get prompt text embeddings |
text_input = self.tokenizer( |
prompt, |
padding="max_length", |
max_length=self.tokenizer.model_max_length, |
truncation=True, |
return_tensors="pt", |
) |
text_embeddings = self.text_encoder(text_input.input_ids.to(torch_device))[0] |
# here `guidance_scale` is defined analog to the guidance weight `w` of equation (2) |
# of the Imagen paper: https://arxiv.org/pdf/2205.11487.pdf . `guidance_scale = 1` |
# corresponds to doing no classifier free guidance. |
do_classifier_free_guidance = guidance_scale > 1.0 |
# get unconditional embeddings for classifier free guidance |
if do_classifier_free_guidance: |
max_length = text_input.input_ids.shape[-1] |
uncond_input = self.tokenizer( |
[""] * batch_size, padding="max_length", max_length=max_length, return_tensors="pt" |
) |
uncond_embeddings = self.text_encoder(uncond_input.input_ids.to(torch_device))[0] |
# For classifier free guidance, we need to do two forward passes. |
# Here we concatenate the unconditional and text embeddings into a single batch |
# to avoid doing two forward passes |
text_embeddings = torch.cat([uncond_embeddings, text_embeddings]) |
# get the intial random noise |
latents = torch.randn( |
(batch_size, self.unet.in_channels, height // 8, width // 8), |
generator=generator, |
device=torch_device, |
) |
# set timesteps |
accepts_offset = "offset" in set(inspect.signature(self.scheduler.set_timesteps).parameters.keys()) |
extra_set_kwargs = {} |
if accepts_offset: |
extra_set_kwargs["offset"] = 1 |
self.scheduler.set_timesteps(num_inference_steps, **extra_set_kwargs) |
# if we use LMSDiscreteScheduler, let's make sure latents are mulitplied by sigmas |
if isinstance(self.scheduler, LMSDiscreteScheduler): |
latents = latents * self.scheduler.sigmas[0] |
# prepare extra kwargs for the scheduler step, since not all schedulers have the same signature |
# eta (η) is only used with the DDIMScheduler, it will be ignored for other schedulers. |
# eta corresponds to η in DDIM paper: https://arxiv.org/abs/2010.02502 |
# and should be between [0, 1] |
accepts_eta = "eta" in set(inspect.signature(self.scheduler.step).parameters.keys()) |
extra_step_kwargs = {} |
if accepts_eta: |
extra_step_kwargs["eta"] = eta |
for i, t in tqdm(enumerate(self.scheduler.timesteps)): |
# expand the latents if we are doing classifier free guidance |
latent_model_input = torch.cat([latents] * 2) if do_classifier_free_guidance else latents |
if isinstance(self.scheduler, LMSDiscreteScheduler): |
sigma = self.scheduler.sigmas[i] |
latent_model_input = latent_model_input / ((sigma**2 + 1) ** 0.5) |
# predict the noise residual |
noise_pred = self.unet(latent_model_input, t, encoder_hidden_states=text_embeddings)["sample"] |
# perform guidance |
if do_classifier_free_guidance: |
noise_pred_uncond, noise_pred_text = noise_pred.chunk(2) |
noise_pred = noise_pred_uncond + guidance_scale * (noise_pred_text - noise_pred_uncond) |
# compute the previous noisy sample x_t -> x_t-1 |
if isinstance(self.scheduler, LMSDiscreteScheduler): |
latents = self.scheduler.step(noise_pred, i, latents, **extra_step_kwargs)["prev_sample"] |
else: |
latents = self.scheduler.step(noise_pred, t, latents, **extra_step_kwargs)["prev_sample"] |
# scale and decode the image latents with vae |
latents = 1 / 0.18215 * latents |
image = self.vae.decode(latents) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.