1. Average Efficiency of Data Structures for Binary Image Processing
- Author
-
Claire Mathieu, Hossein Yahia, Claude Puech, INRIA Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Département d'informatique de l'École normale supérieure (DI-ENS), and École normale supérieure - Paris (ENS Paris)
- Subjects
Computer science ,ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY ,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] ,Binary number ,Image processing ,02 engineering and technology ,Theoretical Computer Science ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,Quadtree ,Analysis of algorithms ,[INFO]Computer Science [cs] ,ComputingMilieux_MISCELLANEOUS ,Branching process ,Chain code ,business.industry ,model of random image ,Binary image ,Pattern recognition ,Data structure ,Computer Science Applications ,branching process ,Signal Processing ,020201 artificial intelligence & image processing ,Artificial intelligence ,business ,Information Systems - Abstract
International audience; This letter adresses the problem of computing the average values associated to geometric decompositions of binary quadtrees, under a faisly general branching process probabilistic model adapted to these types of trees.
- Published
- 1987
- Full Text
- View/download PDF