An efficient algorithm for finding all maximal square blocks in a matrix
| العنوان: | An efficient algorithm for finding all maximal square blocks in a matrix |
|---|---|
| المؤلفون: | Heinz Breu |
| المصدر: | Lecture Notes in Computer Science ISBN: 9783540515425 WADS |
| بيانات النشر: | Springer Berlin Heidelberg, 1989. |
| سنة النشر: | 1989 |
| مصطلحات موضوعية: | Combinatorics, Matrix (mathematics), Medial axis, Computer Science::Computer Vision and Pattern Recognition, Binary image, Matrix of ones, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Row, Square (algebra), ComputingMethodologies_COMPUTERGRAPHICS, Image (mathematics), Mathematics, Block (data storage) |
| الوصف: | An efficient algorithm for computing the medial axis transform of an an m by n binary image, that is, an image represented as a matrix of ones and zeros with m rows and n columns, is developed. The medial axis transform is, effectively, the set of all maximal square blocks of ones in the image where a square block is maximal if it is not contained by any other square blocks of ones. The algorithm presented requires O(mn) time and O(n) space and runs in a single pass through the image. This property makes it ideally suited to processing, in real time, images obtained from a linear array scanner since the memory requirements do not grow as the image is scanned and the medial axis is generated as the image is scanned. |
| ردمك: | 978-3-540-51542-5 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::9c2d35de5845e923d4bbdad1e867dd7a https://doi.org/10.1007/3-540-51542-9_38 |
| رقم الأكسشن: | edsair.doi...........9c2d35de5845e923d4bbdad1e867dd7a |
| قاعدة البيانات: | OpenAIRE |
| ردمك: | 9783540515425 |
|---|