Teknomo–Fernandez algorithm: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Alter: url. Add: eprint, class, year. Removed parameters. Some additions/deletions were actually parameter name changes. | You can use this bot yourself. Report bugs here. | Activated by Neko-chan | Category:Image processing‎ | via #UCB_Category
m Stray word removed
 
(4 intermediate revisions by 3 users not shown)
Line 3:
The '''Teknomo–Fernandez algorithm (TF algorithm)''', is an efficient algorithm for generating the background image of a given video sequence.
 
By assuming that the background image is shown in the majority of the video, the algorithm is able to generate a good background image of a video in <math>O(R)</math>-time using only a small number of [[binary operations]] and Boolean Bitbit operations, which require a small amount of memory and has built-in operators found in many programming languages such as [[C (programming language)|C]], [[C++]], and [[Java (programming language)|Java]].<ref name="TF">{{cite arxivarXiv | last1 = Teknomo | first1 = Kardi | last2 = Fernandez | first2 = Proceso| title = Background Image Generation Using Boolean Operations | year = 2015 | class = cs.CV | eprint =1510.00889}}</ref><ref name="PCTF">{{cite journalbook | last1 = Abu | first1 = Patricia Angela | last2 = Fernandez | first2 = Proceso| title = 2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM) | chapter = Performance Comparison of the Teknomo-Fernandez Algorithm on the RGB and HSV Colour Spaces | urlyear =https:/ 2014 | pages = 1–6 | doi = 10.1109/wwwHNICEM.semanticscholar2014.org/paper/Performance7016262 | isbn = 978-comparison1-of4799-the4020-Teknomo-Fernandez-al-Abu-Fernandez/c45c7e300e2bbc800f269ddfe22596a8fe7b301f2 | s2cid = 15493318 }}</ref><ref name="ITF" />
 
==History==
Line 16:
* The camera is stationary.
* The light of the environment changes only slowly relative to the motions of the people in the scene.
* The number of people does not occupy the scene for the most of the time at the same place.
 
Generally, however, the algorithm will certainly work whenever the following single important assumption holds: <blockquote>For each pixel position, the majority of the pixel values in the entire video contain the pixel value of the actual background image (at that position).<ref name="TF" /></blockquote>As long as each part of the background is shown in the majority of the video, the entire background image needs not to appear in any of its frames. The algorithm is expected to work accurately.<ref name="TF" />
Line 34:
At level <math>\ell</math>, the probability <math>p_\ell</math> that the modal bit predicted is the actual modal bit is represented by the equation <math>p_\ell = (p_{\ell-1})^3 + 3(p_{\ell-1})^2(1-p_{\ell-1})</math>.
The table below gives the computed probability values across several levels using some specific initial probabilities. It can be observed that even if the modal bit at the considered position is at a low 60% of the frames, the probability of accurate modal bit determination is already more than 99% at 6 levels.<ref name="TF" />
[[File:Probability Table.png|framed|center|400px|alt=Computed probabilities table|This table gives the computed probability values across several levels using some specific initial probabilities. It can be observed that even if the modal bit at the considered position is at a low 60% of the frames, the probability of accurate modal bit determination is already more than 99% at six levels.]]
 
==Space complexity==