Noise-Resistant Video Channel Identification

Algorithm 3

N-LCS solver.

	Input:
	bitrate fingerprint ;
	traffic fingerprint ;
	Output:
	the length of subsequence
(1)	= len ; define matrix [k][k] and [k][k]
(2)	for iterate and do
(3)	if [i] - [j] then
(4)	if [i] >  [j] then
(5)	[i][j] =  [i − 1][j − 1] + 1, mark i and j as matched points in matrix
(6)	else
(7)	[i][j] =  [i − 1][j − 1]
(8)	end if
(9)	else if [i − 1][j] >  [i][j − 1] then
(10)	[i][j] =  [i − 1][j]
(11)	else
(12)	[i][j] =  [i][j − 1], mark i and j as noise points in matrix
(13)	end if
(14)	end for
(15)	i = .length; j = .length
(16)	while iterate similarity path in do
(17)	if [i][j] holds noise points then
(18)	++
(19)	end if
(20)	end while
(21)	i = .length - ; j = .length
(22)	while iterate similarity path in do
(23)	if [i][j] holds matched points then
(24)	++
(25)	end if
(26)	end while