Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/icip/SalembierG98
%A Salembier, Philippe
%A Garrido, José Luis
%B ICIP (2)
%D 1998
%I IEEE Computer Society
%K dblp
%P 252-256
%T Binary Partition Tree as an Efficient Representation for Filtering Segmentation.
%U http://dblp.uni-trier.de/db/conf/icip/icip1998-2.html#SalembierG98
%@ 0-8186-8821-1
@inproceedings{conf/icip/SalembierG98,
added-at = {2023-03-24T00:00:00.000+0100},
author = {Salembier, Philippe and Garrido, José Luis},
biburl = {https://www.bibsonomy.org/bibtex/23d82f521729e06c2a78ee3d088152f92/dblp},
booktitle = {ICIP (2)},
crossref = {conf/icip/1998},
ee = {https://doi.ieeecomputersociety.org/10.1109/ICIP.1998.723358},
interhash = {8e4b37129a534acaa5982c10f3d6527a},
intrahash = {3d82f521729e06c2a78ee3d088152f92},
isbn = {0-8186-8821-1},
keywords = {dblp},
pages = {252-256},
publisher = {IEEE Computer Society},
timestamp = {2024-04-10T18:57:17.000+0200},
title = {Binary Partition Tree as an Efficient Representation for Filtering Segmentation.},
url = {http://dblp.uni-trier.de/db/conf/icip/icip1998-2.html#SalembierG98},
year = 1998
}