NDLI: Fast binary image processing using binary decision diagrams

Content Provider	IEEE Xplore Digital Library
Author	Robert, L. Malandain, G.
Copyright Year	1997
Description	Author affiliation: INRIA-Sophia Antipolis, France (Robert, L.)
Abstract	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 show how binary decision diagrams can be used to produce automatically very efficient and compact code for such functions. The total number of operations performed by a generated function is at most one test and one branching for each input value (e.g., in the case of 3D thinning, 26 tests and branchings). At each stage, the function is guaranteed to examine only the pertinent input data, i.e., the values which affect the result. As an example, we consider the 3D simplicity test in digital topology, and thinning processes. We produce functions much faster than our previously optimized implementations and than any other implementation we know of. In the case of 3D simplicity test, on average, at each voxel only 8.7 neighboring voxel values are examined.
Starting Page	97
Ending Page	102
File Size	606251
Page Count	6
File Format	PDF
ISBN	0818678224
ISSN	10636919
DOI	10.1109/CVPR.1997.609305
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-06-17
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Image processing Data structures Boolean functions Testing Topology Binary decision diagrams Performance evaluation Pixel Joining processes Buildings
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Boolean decomposition of binary image operators

Boolean expression diagrams

Using Binary Decision Diagrams to Efficiently Represent Alpha-Beta Associative Memories

Fast discrete function evaluation using decision diagrams

Evaluation and improvement of Boolean comparison method based on binary decision diagrams

Fast spectrum computation for logic functions using binary decision diagrams

Protocol verification using concurrent paths

Fast computation of symmetries in Boolean functions

Efficient ordered binary decision diagrams minimization based on heuristics of cover pattern processing

Fast binary image processing using binary decision diagrams

Similar Documents

Boolean decomposition of binary image operators

Boolean expression diagrams

Using Binary Decision Diagrams to Efficiently Represent Alpha-Beta Associative Memories

Fast discrete function evaluation using decision diagrams

Evaluation and improvement of Boolean comparison method based on binary decision diagrams

Fast spectrum computation for logic functions using binary decision diagrams

Protocol verification using concurrent paths

Fast computation of symmetries in Boolean functions

Efficient ordered binary decision diagrams minimization based on heuristics of cover pattern processing

Fast binary image processing using binary decision diagrams