Binary Partition Tree for Image Processing

From LRDE

Revision as of 17:05, 9 January 2018 by Bot (talk | contribs) (Created page with "{{CSIReport | authors = Fabien Houang | title = Binary Partition Tree for Image Processing | year = 2017 | number = 1711 | abstract = Binary Partition Tree is an efficient str...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Abstract

Binary Partition Tree is an efficient structure to store region information for image processing, segmentation and information retrieval. It is a hierarchical structure to simplify operations and recognition on an image. It can use different region models and distance function calculation to create itself. Usually, we construct this tree on a segmented image for efficiency and time saving. All this parameters can variate and change the BPT representation of your image. The resistance of our tree to noise can also be studied, to find out what level of the tree is influenced by the noise.