Key-Frame Extraction Based on HSV Histogram and Adaptive Clustering

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg3"><tr><td>(1)</td><td>Initialization: convert each video frame into a one-dimensional vector by HSV histogram</td></tr><tr><td>(2)</td><td>Optimal cluster number: calculate the maximum SC index for the value of <i>k</i></td></tr><tr><td>(3)</td><td>Calculate the distance between any two points and sort them in ascending order</td></tr><tr><td>(4)</td><td>Take the value at <i>t</i> = 2% of the incremental sequence as the cutoff distance <i>d</i><sub>c</sub></td></tr><tr><td>(5)</td><td>Calculate the <svg height="9.39034pt" id="M44" style="vertical-align:-3.42943pt" version="1.1" viewbox="-0.0498162 -5.96091 9.3404 9.39034" width="9.3404pt" 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="M516 277C516 378 460 448 376 448C335 448 288 434 240 401C158 345 127 277 107 159C53 -161 38 -221 23 -247L28 -261C43 -260 95 -250 114 -226C122 -216 129 -199 146 -75C152 -29 157 0 164 31C182 9 206 -12 237 -12C267 -12 325 8 376 46C451 102 516 179 516 277ZM432 259C432 134 366 40 259 40C236 40 204 48 171 76L195 203C219 327 253 400 326 400C398 400 432 336 432 259Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.162,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g></svg> and <svg height="12.5794pt" id="M45" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 9.57528 12.5794" width="9.57528pt" 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="M494 514C482 587 419 712 303 712C238 712 174 667 174 603C174 561 205 514 249 449C219 438 187 422 162 407C93 366 23 283 23 177C23 69 87 -12 190 -12C244 -12 288 5 328 33C406 87 444 170 444 249C444 329 404 391 331 475C265 550 222 605 222 627C222 647 238 657 267 657C355 657 421 585 484 499L494 514ZM359 234C359 143 319 30 219 30C172 30 114 75 114 178C114 275 163 343 195 378C212 397 241 415 269 425C305 382 359 313 359 234Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.396,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g></svg> for each frame and generate the decision graph</td></tr><tr><td>(6)</td><td>Combining the decision graph to select the <i>k</i> cluster centers in descending order of <svg height="12.7178pt" id="M46" style="vertical-align:-3.42947pt" version="1.1" viewbox="-0.0498162 -9.28833 42.4843 12.7178" width="42.4843pt" 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="M478 372C478 418 458 448 431 448C409 448 389 431 389 410C389 404 391 400 394 395C398 388 406 371 406 348C406 253 308 122 251 51H249C254 122 249 257 231 336C212 421 189 448 159 448C126 448 75 412 23 327L48 306C83 354 103 371 115 371C125 371 134 360 144 334C185 224 192 64 183 -19C146 -100 116 -202 110 -244L125 -261C154 -259 208 -234 222 -220C222 -194 225 -84 235 -23C247 -3 273 36 308 79C379 165 478 288 478 372Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,5.668,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.356,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,23.618,0)"><path d="M516 277C516 378 460 448 376 448C335 448 288 434 240 401C158 345 127 277 107 159C53 -161 38 -221 23 -247L28 -261C43 -260 95 -250 114 -226C122 -216 129 -199 146 -75C152 -29 157 0 164 31C182 9 206 -12 237 -12C267 -12 325 8 376 46C451 102 516 179 516 277ZM432 259C432 134 366 40 259 40C236 40 204 48 171 76L195 203C219 327 253 400 326 400C398 400 432 336 432 259Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,29.78,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g><g transform="matrix(.013,0,0,-0.013,32.836,0)"><path d="M494 514C482 587 419 712 303 712C238 712 174 667 174 603C174 561 205 514 249 449C219 438 187 422 162 407C93 366 23 283 23 177C23 69 87 -12 190 -12C244 -12 288 5 328 33C406 87 444 170 444 249C444 329 404 391 331 475C265 550 222 605 222 627C222 647 238 657 267 657C355 657 421 585 484 499L494 514ZM359 234C359 143 319 30 219 30C172 30 114 75 114 178C114 275 163 343 195 378C212 397 241 415 269 425C305 382 359 313 359 234Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,39.232,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z"></path></g></svg></td></tr></table></td></tr></table>

<div>DPCA clustering algorithm for key-frame extraction.</div>

Mathematical Problems in Engineering

alg3

Algorithm 3

Algorithm 3: Key-Frame Extraction Based on HSV Histogram and Adaptive Clustering 