Time Complexity Analysis of Binary Space Partitioning Scheme for Image Compression

TL;DR

This paper analyzes the computational complexity of the Binary Space Partitioning (BSP) scheme used for image compression, which involves recursive image segmentation and hierarchical binary tree construction.

Contribution

The paper provides a detailed analysis of the time complexity of the BSP image coding scheme, highlighting its computational challenges.

Findings

BSP scheme involves recursive partitioning using bisecting lines.

The algorithm has high computational complexity and execution time.

Time complexity analysis helps understand the scheme's efficiency limitations.

Abstract

Segmentation-based image coding methods provide high compression ratios when compared with traditional image coding approaches like the transform and sub band coding for low bit-rate compression applications. In this paper, a segmentation-based image coding method, namely the Binary Space Partition scheme, that divides the desired image using a recursive procedure for coding is presented. The BSP approach partitions the desired image recursively by using bisecting lines, selected from a collection of discrete optional lines, in a hierarchical manner. This partitioning procedure generates a binary tree, which is referred to as the BSP-tree representation of the desired image. The algorithm is extremely complex in computation and has high execution time. The time complexity of the BSP scheme is explored in this work.