A New Local Descriptor Based on Strings for Face Recognition

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg2"><tr><td colspan="2"><b>Input:</b> Train image (matrix)</td></tr><tr><td colspan="2"><b>Sortie:</b> Freeman Chain Code (FCC)</td></tr><tr><td>(1)</td><td> Select a starting point <span class="nowrap"><svg height="12.5794pt" id="M14" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 41.4661 12.5794" width="41.4661pt" 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="M338 0V35C263 42 255 49 255 133V516C255 602 263 608 338 615V650H37V615C112 608 121 602 121 516V133C121 49 112 42 37 35V0H338Z"></path></g><g transform="matrix(.013,0,0,-0.013,4.914,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"></path></g><g transform="matrix(.013,0,0,-0.013,9.412,0)"><path d="M494 0V32C450 38 426 53 393 105L296 260C330 305 354 338 375 361C411 396 421 401 476 410V442H293V410C332 402 337 394 323 371C311 351 295 324 274 293L227 371C213 393 218 402 252 410V442H16V410C70 402 80 391 108 344L196 199C166 159 140 123 115 95C81 54 61 43 7 32V0H196V32C156 41 150 53 167 81C182 105 199 138 219 166L269 79C287 49 283 38 245 32V0H494Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,15.678,3.132)"><path d="M245 635C92 635 37 457 37 312C37 149 91 -12 244 -12C395 -12 449 166 449 312C449 469 395 635 245 635ZM243 598C332 598 358 454 358 312C358 173 334 26 245 26C158 26 128 174 128 313S152 598 243 598Z"></path></g><g transform="matrix(.013,0,0,-0.013,20.624,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z"></path></g><g transform="matrix(.013,0,0,-0.013,25.768,0)"><path d="M483 442H303V410C352 401 362 388 351 355C333 298 299 198 276 142L201 363C190 396 197 401 240 410V442H-7V410C40 403 52 391 70 348C89 304 144 162 196 18C202 1 204 -14 199 -30C196 -41 190 -53 180 -71C161 -103 138 -122 99 -143C78 -156 71 -165 71 -181C71 -217 114 -245 142 -245C158 -245 172 -240 179 -218C196 -162 216 -99 284 63C342 202 375 285 400 338C425 392 435 402 483 410V442Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,31.813,3.132)"><path d="M245 635C92 635 37 457 37 312C37 149 91 -12 244 -12C395 -12 449 166 449 312C449 469 395 635 245 635ZM243 598C332 598 358 454 358 312C358 173 334 26 245 26C158 26 128 174 128 313S152 598 243 598Z"></path></g><g transform="matrix(.013,0,0,-0.013,36.759,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z"></path></g></svg>.</span></td></tr><tr><td>(2)</td><td> Find the first coding (D, G, H or B) from the starting point.</td></tr><tr><td>(3)</td><td> Store the first coder.</td></tr><tr><td>(4)</td><td> New starting point = coding point.</td></tr><tr><td>(5)</td><td> <b>While</b> New starting point <svg height="12.5794pt" id="M15" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 52.7575 12.5794" width="52.7575pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,7.673,0)"><path d="M-161 592L-215 609L-427 -83L-372 -100L-161 592Z"></path></g><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,11.292,0)"><path d="M338 0V35C263 42 255 49 255 133V516C255 602 263 608 338 615V650H37V615C112 608 121 602 121 516V133C121 49 112 42 37 35V0H338Z"></path></g><g transform="matrix(.013,0,0,-0.013,16.206,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z"></path></g><g transform="matrix(.013,0,0,-0.013,20.704,0)"><path d="M494 0V32C450 38 426 53 393 105L296 260C330 305 354 338 375 361C411 396 421 401 476 410V442H293V410C332 402 337 394 323 371C311 351 295 324 274 293L227 371C213 393 218 402 252 410V442H16V410C70 402 80 391 108 344L196 199C166 159 140 123 115 95C81 54 61 43 7 32V0H196V32C156 41 150 53 167 81C182 105 199 138 219 166L269 79C287 49 283 38 245 32V0H494Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,26.97,3.132)"><path d="M245 635C92 635 37 457 37 312C37 149 91 -12 244 -12C395 -12 449 166 449 312C449 469 395 635 245 635ZM243 598C332 598 358 454 358 312C358 173 334 26 245 26C158 26 128 174 128 313S152 598 243 598Z"></path></g><g transform="matrix(.013,0,0,-0.013,31.916,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z"></path></g><g transform="matrix(.013,0,0,-0.013,37.059,0)"><path d="M483 442H303V410C352 401 362 388 351 355C333 298 299 198 276 142L201 363C190 396 197 401 240 410V442H-7V410C40 403 52 391 70 348C89 304 144 162 196 18C202 1 204 -14 199 -30C196 -41 190 -53 180 -71C161 -103 138 -122 99 -143C78 -156 71 -165 71 -181C71 -217 114 -245 142 -245C158 -245 172 -240 179 -218C196 -162 216 -99 284 63C342 202 375 285 400 338C425 392 435 402 483 410V442Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,43.104,3.132)"><path d="M245 635C92 635 37 457 37 312C37 149 91 -12 244 -12C395 -12 449 166 449 312C449 469 395 635 245 635ZM243 598C332 598 358 454 358 312C358 173 334 26 245 26C158 26 128 174 128 313S152 598 243 598Z"></path></g><g transform="matrix(.013,0,0,-0.013,48.05,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z"></path></g></svg><b>do</b></td></tr><tr><td>(5.1)</td><td>  Find the next coder.</td></tr><tr><td>(5.2)</td><td>  Store the coder.</td></tr><tr><td>(6)</td><td> <b>End while</b></td></tr><tr><td>(7)</td><td> <b>Return</b> coding chain</td></tr></table></td></tr></table>

Journal of Electrical and Computer Engineering

alg2

Algorithm 2

Algorithm 2: A New Local Descriptor Based on Strings for Face Recognition 