eCommons

 

Efficient Parallel Algorithms for Covering Binary Images

Other Titles

Abstract

Given a black and white image, represented by an array of n x n binary valued pixels, we wish to cover the black pixels with a minimal set of (possible overlapping) maximal squares. It was recently shown that obtaining a minimum cover with squares for a polygonal binary image having holes is NP-hard. We derive a processor-time-optional parallel algorithm for the minimal square cover problem, which for any desired computation time T is [log n, n] runs on an EREW-PRAM with (n/T) processors. We also outline an implementation on a mesh architecture which runs in O ( n ) time, and is P-T-optimal. Finally, we also show how to obtain a speedup in the running time of our algorithm when polymorphic communication primitives are available on the mesh. The cornerstone of our algorithm is a novel data structure, the cover graph, which compactly represents the covering relationships between the maximal squares of the image. The size of the cover graph is linear in the number of pixels. This algorithm has applications to problems in VLSI mask generation, incremental update of raster displays, and image compression.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1989-05

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1013

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record