Many classical image processing tasks can be realized as evaluations of a boolean function over subsets of an image. For instance, the simplicity test used in 3D thinning requires examining the 26 neighbors of each voxel and computing a single boolean function of these inputs. In this article, we sh
Binary superposed quantum decision diagrams
โ Scribed by David Rosenbaum
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 661 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1570-0755
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We consider the use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases, and show that, from the view point of space requirement, the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNFbased and/or model-based repr
An ordered binary decision diagram (OBDD) is a graph representation of a Boolean function. In this paper, the size of ordered binary decision diagrams representing threshold functions is discussed. We consider two cases: the case when a variable ordering is given and the case when it is adaptively c