Skip to main content

Table 4 Complexity comparison

From: Musical note analysis of solo violin recordings using recursive regularization

 

Numbers of matrix multiplications

Big-O

Update rules

(m−k+1)(2n r k+2r2n+2r2k+2r n+2r k)

O(mkrn)

of NMF

  

Proposed

(m−k)(2r2n+9r n+2r3+15r2+4r)

O(m r2n)

update rules

+(2r2n+2k r n+4r3+(2k+2)r2)

 
  1. The complexity of the proposed update rule is compared with the NMF update method.