@article {aVilaplana08,
	title = {Binary partition trees for object detection},
	journal = {IEEE transactions on image processing},
	volume = {17},
	number = {11},
	year = {2008},
	pages = {1{\textendash}16},
	abstract = {<div class="article"><p style="text-align: justify;">This paper discusses the use of binary partition trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regions that covers the image support and that spans various levels of resolution. They are attractive for object detection as they tremendously reduce the search space. In this paper, several issues related to the use of BPT for object detection are studied. Concerning the tree construction, we analyze the compromise between computational complexity reduction and accuracy. This will lead us to define two parts in the BPT: one providing accuracy and one representing the search space for the object detection task. Then we analyze and objectively compare various similarity measures for the tree construction. We conclude that different similarity criteria should be used for the part providing accuracy in the BPT and for the part defining the search space and specific criteria are proposed for each case. Then we discuss the object detection strategy based on BPT. The notion of node extension is proposed and discussed. Finally, several object detection examples illustrating the generality of the approach and its efficiency are reported.</p></div>},
	issn = {1057-7149},
	doi = {10.1109/TIP.2008.2002841},
	author = {Ver{\'o}nica Vilaplana and Marqu{\'e}s, F. and Salembier, P.}
}
