A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems

<div>Gap comparison between <span class="nowrap"><svg height="9.48819pt" id="M245" style="vertical-align:-0.1802893pt" version="1.1" viewbox="-0.0498162 -9.3079 13.5659 9.48819" width="13.5659pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M517 51L485 54C448 58 441 63 441 115V712C404 700 337 684 285 678V653C357 648 362 645 362 580V437C339 446 309 449 295 449C159 449 38 340 38 201C38 61 143 -12 223 -12C234 -12 261 -6 301 17L362 53V-12C420 9 495 22 517 26V51ZM362 85C338 67 301 51 266 51C201 51 128 109 128 228C128 373 212 411 259 411C296 411 338 395 362 360V85Z"></path></g><g transform="matrix(.013,0,0,-0.013,6.812,0)"><path d="M152 404V712C115 698 54 683 7 677V654C71 648 73 642 73 579V24C128 -2 179 -12 220 -12C353 -12 471 92 471 238C471 357 381 449 274 449C262 449 249 446 233 439L152 404ZM152 374C170 384 202 393 230 393C313 393 382 326 382 213C382 97 330 26 246 26C194 26 165 62 158 81C154 91 152 101 152 116V374Z"></path></g></svg>-</span><svg height="6.03027pt" id="M246" style="vertical-align:-0.1802902pt" version="1.1" viewbox="-0.0498162 -5.84998 23.3003 6.03027" width="23.3003pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M319 325C317 349 306 409 297 431C277 440 250 449 209 449C117 449 57 389 57 319C57 243 122 209 182 182C232 159 261 135 261 91C261 48 227 21 190 21C130 21 85 79 68 145L41 140C41 104 51 36 58 22C75 7 121 -12 172 -12C252 -12 337 35 337 126C337 195 286 231 210 262C166 281 126 304 126 348C126 388 152 417 191 417C240 417 274 378 294 318L319 325Z"></path></g><g transform="matrix(.013,0,0,-0.013,4.875,0)"><path d="M390 111C344 68 312 56 269 56C212 56 118 102 118 241C118 346 175 401 241 401C277 401 312 388 342 360C350 352 355 349 361 349C372 349 394 371 394 392C394 403 391 411 378 422C362 436 329 449 288 449H287C250 449 190 432 138 392C71 341 37 274 37 197C37 90 112 -12 238 -12C297 -12 363 32 407 90L390 111Z"></path></g><g transform="matrix(.013,0,0,-0.013,10.414,0)"><path d="M433 39L423 65C413 59 399 54 387 54C370 54 352 69 352 114V299C352 352 342 392 307 422C285 440 255 449 225 449C168 437 102 399 75 379C56 365 44 353 44 339C44 315 69 296 87 296C101 296 111 303 116 319C124 349 133 371 145 385C156 397 171 404 190 404C241 404 275 364 275 291V274C253 256 180 229 120 209C65 190 39 159 39 110C39 47 88 -12 159 -12C189 -12 237 25 277 52C282 35 288 21 301 8C312 -3 333 -12 348 -12L433 39ZM275 84C256 65 221 48 195 48C164 48 124 73 124 124C124 161 146 180 185 198C206 208 254 229 275 240V84Z"></path></g><g transform="matrix(.013,0,0,-0.013,16.003,0)"><path d="M524 0V26C466 32 460 36 460 104V297C460 393 411 449 331 449C302 449 276 437 248 419C223 402 201 387 181 372V451C137 432 90 420 42 411V388C96 378 102 374 102 310V104C102 38 97 33 29 26V0H246V26C187 32 181 36 181 104V339C211 365 250 390 290 390C357 390 381 345 381 276V109C381 40 374 32 315 26V0H524Z"></path></g></svg> and <svg height="8.80315pt" id="M247" style="vertical-align:-0.04981041pt" version="1.1" viewbox="-0.0498162 -8.75334 15.0535 8.80315" width="15.0535pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M592 498C586 556 582 629 581 675H560C545 656 537 650 510 650H115C87 650 74 652 60 675H40C38 620 33 555 28 495H57C69 539 77 568 89 585C102 607 122 616 205 616H267V123C267 44 259 34 168 28V0H454V28C360 34 352 44 352 123V616H422C498 616 514 608 531 584C542 568 552 543 562 495L592 498Z"></path></g><g transform="matrix(.013,0,0,-0.013,8.021,0)"><path d="M493 503C489 551 484 614 483 650H43V622C120 616 128 611 128 525V126C128 40 120 34 40 28V0H312V28C221 34 213 40 213 126V307H316C407 307 412 296 424 227H453V420H424C412 355 407 346 316 346H213V584C213 613 216 616 246 616H322C398 616 419 607 436 579C449 559 455 539 464 499L493 503Z"></path></g></svg> algorithms for the SCP dataset.</div>

Computational Intelligence and Neuroscience

A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems

Figure 5