A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="http://www.iaescore.com/journals/index.php/IJEECS/article/download/7912/7680">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Institute of Advanced Engineering and Science">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/trvfti3jm5hnxhei7rl7owpcqq" style="color: black;">Indonesian Journal of Electrical Engineering and Computer Science</a>
Key frame extraction is an essential technique in the computer vision field. The extracted key frames should brief the salient events with an excellent feasibility, great efficiency, and with a high-level of robustness. Thus, it is not an easy problem to solve because it is attributed to many visual features. This paper intends to solve this problem by investigating the relationship between these features detection and the accuracy of key frames extraction techniques using TRIZ. An improved<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11591/ijeecs.v7.i3.pp818-829">doi:10.11591/ijeecs.v7.i3.pp818-829</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pgztlagddfbblaesudpynm2u74">fatcat:pgztlagddfbblaesudpynm2u74</a> </span>
more »... rithm for key frame extraction was then proposed based on an accumulative optical flow with a self-adaptive threshold (AOF_ST) as recommended in TRIZ inventive principles. Several video shots including original and forgery videos with complex conditions are used to verify the experimental results. The comparison of our results with the-state-of-the-art algorithms results showed that the proposed extraction algorithm can accurately brief the videos and generated a meaningful compact count number of key frames. On top of that, our proposed algorithm achieves 124.4 and 31.4 for best and worst case in KTH dataset extracted key frames in terms of compression rate, while the the-state-of-the-art algorithms achieved 8.90 in the best case.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427181826/http://www.iaescore.com/journals/index.php/IJEECS/article/download/7912/7680" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a5/ff/a5ffc60140aa358e689dba295368494aa97c0561.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11591/ijeecs.v7.i3.pp818-829"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>