An Efficient Feature Selection Method for Video-Based Activity Recognition Systems

Algorithm 2

Mutual information-based feature section along with greedy forwarding algorithm.

	Input: Z^s, K, I^xy, C^y,
	Output: S^k
	begin
	S =
	for k =  1 to K do
	= St. Dev. of I^k
	^k = Average value of I^k
	I^k = I^k−^k
	I^n = I^k/^k
	end
	= Quantiz(I)
	for i = 1 to K do
	for j = 1 to Z do
	Calculate f^p(j)
	end
	s = argmaxis(fp (i)
	S = S  s
	end
	end