Secure Access Control and Large Scale Robust Representation for Online Multimedia Event Detection

Algorithm 1

The spanning binary permission tree.

(1) CreateTree(TNode  *root) ⊲

(2) TNode  *pNode,   *tNode;

(3) m_pAdo: (𝑟₁,𝑟₂,…,𝑟_𝑛)

   ={𝑟_𝑖|Parent_ID (𝑟_𝑖)=   ID(Root) };

(4) //Use m_pAdo to get the sub-tree of node root

(5) if (m_pAdo →RecordCount > 0){

(6)  m_pAdo →First();

(7)  for (int 𝑖=0; 𝑖<𝑚_𝑝𝐴𝑑𝑜→RecordCount;

     ++𝑖){

(8)   tNode = new TNode();

(9)   tNode →id = RES_ID(m_pAdo);

(10)   tNode →pps = PPS(m_pAdo);

(11)   / ****T_Rule: 𝑇_𝑚→𝑇_𝑏^∗∗∗∗/

(12)   if (𝑖==0) root →firstchild = tNode;

(13)   else pNode →nextsibling = tNode;

(14)   pNode = tNode;

(15)   CreateTree(tNode); //Recursive Invocation

(16)   / ****T_Rule: 𝑇_𝑚→𝑇_𝑏^∗∗∗∗/

(17)   m_pAdo →Next();

(18) }}

(19) ⊳