Skip to content

Box

bbox_to_points 

1
bbox_to_points(box)

Convert bounding box to list of points

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
4
5
6
7
def bbox_to_points(box: List[int]):
    """Convert bounding box to list of points"""
    x1, y1, x2, y2 = box
    return [(x1, y1), (x2, y1), (x2, y2), (x1, y2)]

points_to_bbox 

1
points_to_bbox(points)

Convert list of points to bounding box

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
10
11
12
13
14
def points_to_bbox(points: List[Tuple[int, int]]):
    """Convert list of points to bounding box"""
    all_x = [p[0] for p in points]
    all_y = [p[1] for p in points]
    return [min(all_x), min(all_y), max(all_x), max(all_y)]

scale_points 

1
scale_points(points, scale_factor=1.0)

Scale points by a scale factor

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
17
18
19
def scale_points(points: List[Tuple[int, int]], scale_factor: float = 1.0):
    """Scale points by a scale factor"""
    return [(int(pos[0] * scale_factor), int(pos[1] * scale_factor)) for pos in points]

union_points 

1
union_points(points)

Return union bounding box of list of points

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
22
23
24
25
26
27
def union_points(points: List[Tuple[int, int]]):
    """Return union bounding box of list of points"""
    all_x = [p[0] for p in points]
    all_y = [p[1] for p in points]
    bbox = (min(all_x), min(all_y), max(all_x), max(all_y))
    return bbox

scale_box 

1
scale_box(box, scale_factor=1.0)

Scale box by a scale factor

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
30
31
32
def scale_box(box: List[int], scale_factor: float = 1.0):
    """Scale box by a scale factor"""
    return [int(pos * scale_factor) for pos in box]

box_h 

1
box_h(box)

Return box height

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
35
36
37
def box_h(box: List[int]):
    "Return box height"
    return box[3] - box[1]

box_w 

1
box_w(box)

Return box width

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
40
41
42
def box_w(box: List[int]):
    "Return box width"
    return box[2] - box[0]

box_area 

1
box_area(box)

Return box area

Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
45
46
47
48
def box_area(box: List[int]):
    "Return box area"
    x1, y1, x2, y2 = box
    return (x2 - x1) * (y2 - y1)

get_rect_iou 

1
get_rect_iou(gt_box, pd_box, iou_type=0)

Intersection over union on layout rectangle

Parameters:

Name Type Description Default
gt_box List[tuple]

List[tuple] A list contains bounding box coordinates of ground truth

 required
pd_box List[tuple]

List[tuple] A list contains bounding box coordinates of prediction

 required
iou_type

int 0: intersection / union, normal IOU 1: intersection / min(areas), useful when boxes are under/over-segmented

 0
Input format

[(x1, y1), (x2, y1), (x2, y2), (x1, y2)]

 required
Annotation for each element in bbox
required

Returns:

Type Description
int

Intersection over union value
Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
def get_rect_iou(gt_box: List[tuple], pd_box: List[tuple], iou_type=0) -> int:
    """Intersection over union on layout rectangle

    Args:
        gt_box: List[tuple]
            A list contains bounding box coordinates of ground truth
        pd_box: List[tuple]
            A list contains bounding box coordinates of prediction
        iou_type: int
            0: intersection / union, normal IOU
            1: intersection / min(areas), useful when boxes are under/over-segmented

        Input format: [(x1, y1), (x2, y1), (x2, y2), (x1, y2)]
        Annotation for each element in bbox:
        (x1, y1)        (x2, y1)
            +-------+
            |       |
            |       |
            +-------+
        (x1, y2)        (x2, y2)

    Returns:
        Intersection over union value
    """

    assert iou_type in [0, 1], "Only support 0: origin iou, 1: intersection / min(area)"

    # determine the (x, y)-coordinates of the intersection rectangle
    # gt_box: [(x1, y1), (x2, y1), (x2, y2), (x1, y2)]
    # pd_box: [(x1, y1), (x2, y1), (x2, y2), (x1, y2)]
    x_left = max(gt_box[0][0], pd_box[0][0])
    y_top = max(gt_box[0][1], pd_box[0][1])
    x_right = min(gt_box[2][0], pd_box[2][0])
    y_bottom = min(gt_box[2][1], pd_box[2][1])

    # compute the area of intersection rectangle
    interArea = max(0, x_right - x_left) * max(0, y_bottom - y_top)

    # compute the area of both the prediction and ground-truth
    # rectangles
    gt_area = (gt_box[2][0] - gt_box[0][0]) * (gt_box[2][1] - gt_box[0][1])
    pd_area = (pd_box[2][0] - pd_box[0][0]) * (pd_box[2][1] - pd_box[0][1])

    # compute the intersection over union by taking the intersection
    # area and dividing it by the sum of prediction + ground-truth
    # areas - the intersection area
    if iou_type == 0:
        iou = interArea / float(gt_area + pd_area - interArea)
    elif iou_type == 1:
        iou = interArea / max(min(gt_area, pd_area), 1)

    # return the intersection over union value
    return iou

sort_funsd_reading_order 

1
sort_funsd_reading_order(lines, box_key_name='box')

Sort cell list to create the right reading order using their locations

Parameters:

Name Type Description Default
lines List[dict]

list of cells to sort

 required

Returns:

Type Description

a list of cell lists in the right reading order that contain

no key or start with a key and contain no other key
Source code in libs/kotaemon/kotaemon/loaders/utils/box.py 
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
def sort_funsd_reading_order(lines: List[dict], box_key_name: str = "box"):
    """Sort cell list to create the right reading order using their locations

    Args:
        lines: list of cells to sort

    Returns:
        a list of cell lists in the right reading order that contain
        no key or start with a key and contain no other key
    """
    sorted_list = []

    if len(lines) == 0:
        return lines

    while len(lines) > 1:
        topleft_line = lines[0]
        for line in lines[1:]:
            topleft_line_pos = topleft_line[box_key_name]
            topleft_line_center_y = (topleft_line_pos[1] + topleft_line_pos[3]) / 2
            x1, y1, x2, y2 = line[box_key_name]
            box_center_x = (x1 + x2) / 2
            box_center_y = (y1 + y2) / 2
            cell_h = y2 - y1
            if box_center_y <= topleft_line_center_y - cell_h / 2:
                topleft_line = line
                continue
            if (
                box_center_x < topleft_line_pos[2]
                and box_center_y < topleft_line_pos[3]
            ):
                topleft_line = line
                continue
        sorted_list.append(topleft_line)
        lines.remove(topleft_line)

    sorted_list.append(lines[0])

    return sorted_list