Click here to Skip to main content
13,045,790 members (46,543 online)
Rate this:
Please Sign up or sign in to vote.
See more:
binarization of an image is n^2.
blob detection is possibly n^2.
computation of image moments is also n^2.
feature extraction is also n^2.
clssification takes a long time given that our backpropagation
has 32-100-4 input, hidden and output units respectivelty.

is it even possible for us to solve a real-time character recognition
problem in less than 10 frames per second?
Posted 10-May-11 4:35am

1 solution

Rate this: bad
Please Sign up or sign in to vote.

Solution 1

You would be surprised to know what a (recent) computer can do in a little time.

If your images are not too big and all your algorithms "only" n^2, then go on.

In my job I personnaly handle 1000*750 images (16 bits per pixel) at a rate > 40 frames/second. I am doing a few processes for each frame, saving data on disk on the fly and so on...

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
Top Experts
Last 24hrsThis month

Advertise | Privacy | Mobile
Web01 | 2.8.170713.1 | Last Updated 10 May 2011
Copyright © CodeProject, 1999-2017
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100