Research Article
An Efficient Feature Selection Method for Video-Based Activity Recognition Systems
Algorithm 1
Procedures of quantization.
| Input: Y, I(1...K), and | | Output: Z, and J(1...K) | | begin | | Let Z = 2 | | while 1 do | | MaxEr = −1e + 8 | | for x = 1 to K do | | lower = min(I(x)) | | upper = max(I(x)) | | Step = (upper−lower)/Z | | Fac = [lower:Step:upper] | | BC = [lower-Step, lower:Step: | | upper][J(x), QEr] = | | Quantiz(I(x)), Divider, BC | | if QEr > MaxErthen | | MaxEr = QEr | | end | | end | | if MaxEr < then | | Break | | end | | Z = K + 1 | | end | | end |
|