Research Article
A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems
| (1) | Function Transition (, , ) | | (2) | Input , , | | (3) | Output | | (4) | for , in (, ) do | | (5) | if not in then | | (6) | getTransitionProbabily (, ) –equation (5) | | (7) | else | | (8) | getOutlierTransitionProbabily (, ) | | (9) | end if | | (10) | .append getBinaryPosition (, ) –equation (6) | | (11) | end for | | (12) | for in do | | (13) | Repair () | | (14) | end for | | (15) | return |
|
