Human action recognition using Recursive Self Organizing map and longest common subsequence matching
Abstract: A little attention has been given to the use of recursive self organizing map (SOM) for human action recognition in the past years. This paper introduces an action recognition framework ...
"explanation": "Call LCS('ABC','AC',0,0)\n1. i=0,j=0: s1[0]='A', s2[0]='A' MATCH → return 1 + LCS('ABC','AC',1,1)\n Call LCS('ABC','AC',1,1)\n 2. i=1,j=1: s1[1]='B ...
The intuition is that by examining every subsequence (2^n possibilities for an array of length n), we can guarantee finding the longest bitonic one, though this is computationally expensive. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results