52 lines
1.8 KiB
Python
52 lines
1.8 KiB
Python
from collections import namedtuple
|
|
from functools import partial
|
|
from itertools import compress, starmap
|
|
from typing import Iterable, List
|
|
|
|
from cv_analysis.utils.structures import Rectangle
|
|
|
|
|
|
def remove_overlapping(rectangles: Iterable[Rectangle]) -> List[Rectangle]:
|
|
def overlap(a: Rectangle, rect2: Rectangle) -> float:
|
|
return a.intersection(rect2) > 0
|
|
|
|
def does_not_overlap(rect: Rectangle, rectangles: Iterable[Rectangle]) -> list:
|
|
return not any(overlap(rect, rect2) for rect2 in rectangles if not rect == rect2)
|
|
|
|
rectangles = list(filter(partial(does_not_overlap, rectangles=rectangles), rectangles))
|
|
return rectangles
|
|
|
|
|
|
def remove_included(rectangles: Iterable[Rectangle]) -> List[Rectangle]:
|
|
keep = [rect for rect in rectangles if not rect.is_included(rectangles)]
|
|
return keep
|
|
|
|
|
|
def __remove_isolated_unsorted(rectangles: Iterable[Rectangle]) -> List[Rectangle]:
|
|
def is_connected(rect: Rectangle, rectangles: Iterable[Rectangle]):
|
|
return any(rect.adjacent(rect2) for rect2 in rectangles if not rect == rect2)
|
|
|
|
rectangles = list(filter(partial(is_connected, rectangles=list(rectangles)), rectangles))
|
|
return rectangles
|
|
|
|
|
|
def __remove_isolated_sorted(rectangles: Iterable[Rectangle]) -> List[Rectangle]:
|
|
def is_connected(left, center, right):
|
|
return any([left.adjacent(center), center.adjacent(right)])
|
|
|
|
rectangles = list(rectangles)
|
|
lefts = [None, *rectangles[:-1]]
|
|
rights = [*rectangles[1:], None]
|
|
mask = starmap(is_connected, zip(lefts, rectangles, rights))
|
|
|
|
rectangles = list(compress(rectangles, mask))
|
|
return rectangles
|
|
|
|
|
|
def remove_isolated(rectangles: Iterable[Rectangle], input_unsorted=True) -> List[Rectangle]:
|
|
return (__remove_isolated_unsorted if input_unsorted else __remove_isolated_sorted)(rectangles)
|
|
|
|
|
|
def has_no_parent(hierarchy):
|
|
return hierarchy[-1] <= 0
|