𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalization of the binary pattern matching in image processing

✍ Scribed by K. Veréb

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
783 KB
Volume
38
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis

we would like to show a possible generalization of the binary pattern matching by thresholding in such a way that the matching should be leas sensitive for over-and under-exposing. The matching is executed on the basis of the difference between the grayscale values of the image and the pattern. We introduce a distance function Di7j, and a measuring number T,,~ that gives information about the error of the matching. The modified measuring numbers ri,j make the counting easier and matching should become faster. We give the counting algorithm of the estimation and discuss the transformation of the matching into scale invariant.

📜 SIMILAR VOLUMES

Generation of noise in binary images
Generation of noise in binary images
✍ Xiaohua Zhou; Richard Gordon 📂 Article 📅 1991 🏛 Elsevier Science ⚖ 224 KB

We present an algorithm for binary noise generation, with which noisy images with specific noise levels can be generated for any given binary image. It should facilitate the experimental evaluation of different image processing and classification algorithms on binary images.

Tree pattern matching with a more genera
Tree pattern matching with a more general notion of occurrence of the pattern
✍ Cedric Chauve 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Since the initial paper of Hoffmann and O'Donnell [J. ACM 29 (1) (1982) 68-95], tree pattern matching has been studied by many authors. However, all the papers proposing algorithms for this problem deal with a restricted notion of pattern occurrence in the subject. In this note, we consider a more g