An adaptive algorithm for conversion from quadtree to chain codes

Document Type

Article

Publication Date

1-1-2001

Abstract

An adaptive algorithm is presented for converting the quadtree representation of a binary image to its chain code representation. Our algorithm has the advantage of constructing the chain codes of the resulting quadtree of the Boolean operation of two quadtrees by re-using the original chain codes. This algorithm is adaptive because it can adjust the total number of internal nodes to be stored and retrieve it later in the reconstruction stage. The algorithm possesses parallelism and is suited for pyramid architecture. Our algorithm requires time O(H + L) in sequential and time O(N) in parallel, where H is the height of the quadtree. L is the length of the chain code sequence generated, and N x N is the size of the input image. © 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Identifier

0035283685 (Scopus)

Publication Title

Pattern Recognition

External Full Text Location

https://doi.org/10.1016/S0031-3203(00)00008-X

ISSN

00313203

First Page

631

Last Page

639

Issue

3

Volume

34

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS