Representing medical images with partitioning trees

The binary space partitioning tree is a method of converting a discrete space representation to a particular continuous space representation. The conversion is accomplished using standard discrete space operators developed for edge detection, followed by a Hough transform to generate candidate hyperplanes that are used to construct the partitioning tree. The result is a segmented and compressed image represented in continuous space suitable for elementary computer vision operations and improved image transmission/storage. Examples of 256*256 medical images for which the compression is estimated to range between 1 and 0.5 b/pixel are given.<
>