1 files changed, 36 insertions, 0 deletions
diff --git a/src/lib/seg/mask_data.c b/src/lib/seg/mask_data.c
index 00e4807..2ff58a8 100644
--- a/src/lib/seg/mask_data.c
+++ b/src/lib/seg/mask_data.c
@@ -173,3 +173,39 @@ struct AVLNode* increase_label_perimeter_alloc(struct AVLNode* root, uint16_t la
   }
   return new_root;
 }
+
+// Comparison of uint16_ts
+bool_t compare_uint16_t(uint16_t* s1, uint16_t* s2)
+{
+  return *s1 < *s2;
+}
+
+// In-order traversal print pointer
+void print_in_order_uint16_t(struct AVLNode* root)
+{
+  if (root != NULL) {
+    print_in_order_uint16_t(root->left);
+    printf("%d ", *((uint16_t*)root->data));
+    print_in_order_uint16_t(root->right);
+  }
+}
+
+// Filter out small masks
+//  Assumption: Contiguous labeling
+struct AVLNode* get_small_labels(struct AVLNode* removal_tree, struct AVLNode* label_tree, size_t min_area, size_t min_perimeter)
+{
+  struct AVLNode* return_tree = removal_tree;
+  if (label_tree != NULL) {
+    return_tree = get_small_labels(return_tree, label_tree->left, min_area, min_perimeter);
+    struct MaskData* node_data = (struct MaskData*)label_tree->data;
+    if ((node_data->area < min_area) || (node_data->perimeter < min_perimeter)) {
+      // Insert
+      struct Result result = avl_insert(return_tree, &node_data->label, (bool_t (*)(void*,void*))compare_uint16_t);
+      if (result.success) {
+	return_tree = result.data;
+      }
+    }
+    return_tree = get_small_labels(return_tree, label_tree->right, min_area, min_perimeter);
+  }
+  return return_tree;
+}