180 lines
6.1 KiB
Python
180 lines
6.1 KiB
Python
import sys
|
|
import os
|
|
|
|
import torch
|
|
|
|
sys.path.insert(0, os.path.join(os.path.dirname(os.path.realpath(__file__)), "comfy"))
|
|
|
|
|
|
IMAGE_SIZE = 1472
|
|
TILE_SIZE = 4096
|
|
OVERLAP = 64
|
|
|
|
|
|
# Splits an image in four tiles and returns them as a list
|
|
class TileSplit:
|
|
@classmethod
|
|
def INPUT_TYPES(s):
|
|
return {
|
|
"required": {
|
|
"image": ("IMAGE",),
|
|
"tile_height": ("INT", {"default": 64, "min": 64, "max": 4096}),
|
|
"tile_width": ("INT", {"default": 64, "min": 64, "max": 4096}),
|
|
"overlap": ("INT", {"default": 64, "min": 0, "max": 4096}),
|
|
}
|
|
}
|
|
|
|
RETURN_TYPES = ("IMAGE",)
|
|
FUNCTION = "split"
|
|
CATEGORY = "utils"
|
|
|
|
def split(self, image, tile_height, tile_width, overlap):
|
|
height, width = image.shape[1], image.shape[2]
|
|
overlap_x = overlap
|
|
overlap_y = int(overlap * (tile_height / tile_width))
|
|
|
|
tiles = []
|
|
for y in range(0, height - tile_height + 1, tile_height - overlap_y):
|
|
for x in range(0, width - tile_width + 1, tile_width - overlap_x):
|
|
tile = image[:, y : y + tile_height, x : x + tile_width, :]
|
|
tiles.append(tile)
|
|
|
|
# Convert tiles list to a tensor if needed
|
|
tiles_tensor = torch.stack(tiles).squeeze(1)
|
|
|
|
return [tiles_tensor]
|
|
|
|
|
|
class TileMerge:
|
|
@classmethod
|
|
def INPUT_TYPES(s):
|
|
return {
|
|
"required": {
|
|
"images": ("IMAGE",),
|
|
"overlap": ("INT", {"default": 64, "min": 0, "max": 4096}),
|
|
"blend": ("INT", {"default": 64, "min": 0, "max": 4096}),
|
|
"final_height": ("INT", {"default": 2048, "min": 0, "max": 9 * 4096}),
|
|
"final_width": ("INT", {"default": 2048, "min": 0, "max": 9 * 4096}),
|
|
}
|
|
}
|
|
|
|
RETURN_TYPES = ("IMAGE",)
|
|
FUNCTION = "blend_tiles"
|
|
CATEGORY = "utils"
|
|
|
|
def blend_tiles(self, images, overlap, blend, final_height, final_width):
|
|
tiles = images
|
|
tile_height, tile_width = images.shape[1], images.shape[2]
|
|
original_shape = (1, final_height, final_width, 3)
|
|
overlap_x = overlap
|
|
overlap_y = int(overlap * (tile_height / tile_width))
|
|
|
|
batch, height, width, channels = original_shape
|
|
output = torch.zeros(original_shape, dtype=tiles.dtype)
|
|
count = torch.zeros(original_shape, dtype=tiles.dtype)
|
|
idx = 0
|
|
|
|
# for 3x3: custom_order = [0, 2, 6, 8, 1, 3, 5, 7, 4] # First 4 corners, then the sides, then the center
|
|
|
|
# Calculate grid dimensions
|
|
rows = (height - tile_height) // (tile_height - overlap_y) + 1
|
|
cols = (width - tile_width) // (tile_width - overlap_x) + 1
|
|
|
|
# Calculate the center of the grid
|
|
center_row, center_col = rows // 2, cols // 2
|
|
|
|
print("Rows: {}, Cols: {}".format(rows, cols))
|
|
print("Center row: {}, Center col: {}".format(center_row, center_col))
|
|
|
|
# Calculate the order in which to blend the tiles
|
|
# Order based on distance from center
|
|
distances = []
|
|
for i in range(rows):
|
|
for j in range(cols):
|
|
distance = abs(i - center_row) + abs(j - center_col)
|
|
distances.append(distance)
|
|
|
|
# Sort the tiles based on distance from center
|
|
reverse_custom_order = sorted(range(len(distances)), key=lambda k: distances[k])
|
|
custom_order = reverse_custom_order[::-1]
|
|
|
|
print("Custom order: {}".format(custom_order))
|
|
|
|
ys = [y for y in range(0, height - tile_height + 1, tile_height - overlap_y)]
|
|
xs = [x for x in range(0, width - tile_width + 1, tile_width - overlap_x)]
|
|
for idx in custom_order:
|
|
y = ys[idx // len(ys)]
|
|
x = xs[idx % len(xs)]
|
|
|
|
tile = tiles[idx]
|
|
|
|
weight_matrix = torch.ones((tile_height, tile_width, channels))
|
|
# if not center tile
|
|
for i in range(blend):
|
|
weight = float(i) / blend
|
|
weight_matrix[i, :, :] *= weight # Top rows
|
|
weight_matrix[-(i + 1), :, :] *= weight # Bottom rows
|
|
weight_matrix[:, i, :] *= weight # Left columns
|
|
weight_matrix[:, -(i + 1), :] *= weight # Right columns
|
|
|
|
old_tile = output[:, y : y + tile_height, x : x + tile_width, :]
|
|
old_tile_count = count[:, y : y + tile_height, x : x + tile_width, :]
|
|
|
|
weight_matrix = (
|
|
weight_matrix * (old_tile_count != 0).float()
|
|
+ (old_tile_count == 0).float()
|
|
)
|
|
|
|
# Blend the old tile with the new tile
|
|
tile = tile * weight_matrix + old_tile * (1 - weight_matrix)
|
|
|
|
output[:, y : y + tile_height, x : x + tile_width, :] = tile
|
|
count[:, y : y + tile_height, x : x + tile_width, :] = 1
|
|
|
|
# Normalize the output and return
|
|
# output /= count
|
|
|
|
return [output]
|
|
|
|
|
|
class TileCalc:
|
|
@classmethod
|
|
def INPUT_TYPES(s):
|
|
return {
|
|
"required": {
|
|
"tile_height": ("INT", {"default": 64, "min": 64, "max": 4096}),
|
|
"tile_width": ("INT", {"default": 64, "min": 64, "max": 4096}),
|
|
"overlap": ("INT", {"default": 64, "min": 0, "max": 4096}),
|
|
"tile_width_n": ("INT", {"default": 3, "min": 1, "max": 9}),
|
|
"tile_height_n": ("INT", {"default": 3, "min": 1, "max": 9}),
|
|
}
|
|
}
|
|
|
|
RETURN_TYPES = ("INT", "INT")
|
|
RETURN_NAMES = ("final_height", "final_width")
|
|
FUNCTION = "calc"
|
|
CATEGORY = "utils"
|
|
|
|
def calc(self, tile_height, tile_width, overlap, tile_width_n, tile_height_n):
|
|
overlap_x = overlap
|
|
overlap_y = int(overlap * (tile_height / tile_width))
|
|
|
|
final_height = tile_height * tile_height_n - overlap_y * (tile_height_n - 1)
|
|
final_width = tile_width * tile_width_n - overlap_x * (tile_width_n - 1)
|
|
print("Final height: {}, Final width: {}".format(final_height, final_width))
|
|
|
|
return [final_height, final_width]
|
|
|
|
|
|
NODE_CLASS_MAPPINGS = {
|
|
"TileSplit": TileSplit,
|
|
"TileMerge": TileMerge,
|
|
"TileCalc": TileCalc,
|
|
}
|
|
|
|
NODE_DISPLAY_NAME_MAPPINGS = {
|
|
"TileSplit": "TileSplit",
|
|
"TileMerge": "TileMerge",
|
|
"TileCalc": "TileCalc",
|
|
}
|