论文信息 - Image Shrinking and Expanding on a Pyramid

Image Shrinking and Expanding on a Pyramid

Develops two algorithms to perform the q step shrinking and expanding of an N*N binary image on a pyramid computer with an N*N base. The time complexity of both algorithms is O( square root q). However, one uses O( square root q) space per processor, while the per-processor space requirement of the other is O(1). >

Sartaj Sahni | Jing-Fu Jenq

[1] Azriel Rosenfeld. A note on shrinking and expanding operations in pyramids , 1987, Pattern Recognit. Lett..

[2] Sartaj Sahni,et al. Hypercube algorithms for image processing and pattern recognition , 1990 .

[3] Sartaj Sahni,et al. Hypercube Algorithms: with Applications to Image Processing and Pattern Recognition , 1990 .

[4] Sartaj Sahni,et al. Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[5] Sartaj Sahni,et al. Hypercube Algorithms for Image Transformations , 1989, ICPP.

[6] E. Dubois,et al. Digital picture processing , 1985, Proceedings of the IEEE.