FAST MASKING ALGORITHMS FOR IMAGE-ANALYSIS

被引：0

作者：

STASINSKI, R

NANDI, AK

机构：

[1] UNIV STRATHCLYDE,DEPT ELECTR & ELECT ENGN,GLASGOW G1 1XW,SCOTLAND

[2] POZNAN TECH UNIV,DEPT ELECTR & COMMUN,PL-60965 POZNAN,POLAND

来源：

ELECTRONICS LETTERS | 1992年 / 28卷 / 18期

关键词：

ALGORITHMS; CONVOLUTION; IMAGE PROCESSING;

D O I：

10.1049/el:19921068

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The possibility and the construction of a number of fast algorithms for the two-dimensional masking of small mask sizes is clearly demonstrated. These are based on nesting and represent extension of the ideas of Stasinski (1990). Moreover, the Letter explains how to make the optimal choice of the algorithm depending on the computational machine available.

引用

页码：1680 / 1681

页数：2

共 10 条

[1]

BLAHUT RE, 1985, FAST ALGORITHMS DIGI

[2]

BLAHUT RE, 1985, FAST FOURIER TRANSFO

[3]

Gonzales R., 1987, READING

[4]

Jain A. K., 1989, FUNDAMENTALS DIGITAL

[5] BLOCK SIZE CONSIDERATIONS FOR MULTIDIMENSIONAL CONVOLUTION AND CORRELATION [J].

LI, XH ;

QIAN, GH .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1992, 40 (05) :1271-1273

[6]

NANDI AK, 1992, P EUSIPCO 92

[7]

Nussbaumer H.J., 1982, FAST FOURIER TRANSFO

[8] EXTENDING SIZES OF EFFECTIVE CONVOLUTION ALGORITHMS [J].

STASINSKI, R .

ELECTRONICS LETTERS, 1990, 26 (19) :1602-1604

[9]

STASINSKI R, 1992, P ICASSP 92, V5, P1

[10]

STASINSKI R, 1991, METODY ALGEBRY WIELO

← 1 →