Holistic Word Recognition algorithm in detail

ⅰ亾dé卋堺 提交于 2019-12-02 02:44:27

For an algorithm that is quite suitable for FPGA implementation (embarrassingly parallel) you might look at:

http://en.wikipedia.org/wiki/Cross-correlation

It is fast, and easily implemented.

The only thing is: it recognizes a shape (in your case some text) DEPENDENT of the rotation and size / stretch / skew etc. But if that isn't a problem, it can be very fast and is quite robust. You should only watch out for interpretation problems with characters that are similar (like o and c).

I used it to find default texts on scanned forms to obtain bearings where Region of Interests are and searching in those images (6M pixels) only took around 15 ms with our implementation on a Core2 CPU in a single thread.

易学教程内所有资源均来自网络或用户发布的内容,如有违反法律规定的内容欢迎反馈
该文章没有解决你所遇到的问题?点击提问,说说你的问题,让更多的人一起探讨吧!