Abstract
Optimization techniques are nowadays one of the most important branches of computer science due to the limitations of the computing power availability especially in cases of mobile platforms. Algorithms which can be used on such units have to be optimized for memory and computing power. In the paper we focused on optimization techniques for image analysis algorithms by limiting the number of necessary operations. The optimized algorithm has been designed to detect and follow a specified marker, known <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a priori</i> , and is based on the correlation coefficient match between the acquired template and the current image. The acquired template is taken from the previous processed frame. The match operation is based on Pearson’s correlation coefficient, so the whole mechanism is therefore highly demanding in terms of computing power. Optimization is performed mainly using the Region of Interest (ROI) to exclude irrelevant parts of the image. The algorithm is optimized using Grünvald - Letnikov fractional - order backward difference to estimate the position of the marker in a sequence of images. This limits the number of operations required to maintain the precision of the algorithm. Based on the position of the object in previous frames, a fractional order mathematical tool is able to estimate at relatively low cost and with high accuracy the probable position of the object in the incoming image. Here, we explain the workflow of the template detection and following algorithm, as well as the mathematical basis of the fractional order derivative optimization tool. The processor load connected to the optimized algorithm was reduced by over 35%.
Highlights
Optimization techniques are nowadays one of the most important branches of computer science due to the limitations of the computing power availability
On the other hand in this paper the authors use fractional calculus in order to maintain prediction accuracy over 99.99% and to reduce Region of Interest (ROI) positioning error by over 35% which leads to downsizing the ROI
Given that the first and the second order derivatives take into account only the last two values of the marker trajectory, the template tracking algorithm was vulnerable to rapid marker movements
Summary
Optimization techniques are nowadays one of the most important branches of computer science due to the limitations of the computing power availability. The main problem described in this paper was the determination of the ROI position so precise to make it as small as possible to not loose the execution accuracy This lead to introduction of advanced mathematical tool into the optimization method and downsizing the ROI, which resulted significant efficiency improvement. Various approaches to the detection and tracking problem are presented, 2) Section III presents the author’s template detection and tracking algorithm, 3) Section IV describes the Prediction Module and the concept of it’s optimization using the fractional calculus, 4) Section V covers the mathematical background of the tool used to optimization, 5) Section VI shows the implementation details and the test results including comparison to the other movement prediction techniques, 6) Section VII concludes the paper
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
