Integral Images: Efficient Algorithms for Their Computation Systems of Speeded-Up Robust Features (Surf)

2022 ◽  
pp. 663-672
Author(s):  
M. Jagadeeswari ◽  
C. S. Manikandababu ◽  
M. Aiswarya
Keyword(s):  
Efficient Algorithms ◽  
Speeded Up Robust Features ◽  
Integral Images

scholarly journals Integral Images: Efficient Algorithms for Their Computation and Storage in Resource-Constrained Embedded Vision Systems

Sensors ◽  
2015 ◽  
Vol 15 (7) ◽  
pp. 16804-16830 ◽  
Author(s):  
Shoaib Ehsan ◽  
Adrian Clark ◽  
Naveed Rehman ◽  
Klaus McDonald-Maier
Keyword(s):  
Efficient Algorithms ◽  
Resource Constrained ◽  
Vision Systems ◽  
Embedded Vision ◽  
Integral Images ◽  
And Storage ◽  
Embedded Vision Systems

A Solution for Image Matching Error in SURF

2013 ◽  
Vol 717 ◽  
pp. 523-528
Author(s):  
Xing Xiong ◽  
Byung Jae Choi
Keyword(s):  
Real Time ◽  
Image Matching ◽  
Extraction Method ◽  
Matching Error ◽  
Speeded Up Robust Features ◽  
Time Performance ◽  
Integral Images

SURF (Speeded Up Robust Features) is known to be a famous and strong but computationally still expensive.It has not attained real-time performance yet. In this paper we analysis the SURF in orientation and descriptors extraction method forresolvingsome problems. For example, matching images through the SURF algorithm spends too much time and causes some errors by integral images. We propose a novel orientation and descriptor algorithm to improve the conventional SURF. Theproposed method shows some advantages such as a faster speed.

Tidal Flow: A Fast and Teachable Maximum Flow Algorithm

2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE
Keyword(s):  
Computer Science ◽  
Tidal Flow ◽  
Maximum Flow ◽  
Efficient Algorithms ◽  
Science Students ◽  
Flow Algorithm ◽  
Maximum Flows

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.

Efficient Algorithms for the Partial Sum Dispersion Problem

2020 ◽  
Vol E103.A (10) ◽  
pp. 1206-1210
Author(s):  
Toshihiro AKAGI ◽  
Tetsuya ARAKI ◽  
Shin-ichi NAKANO
Keyword(s):  
Efficient Algorithms ◽  
Partial Sum ◽  
Dispersion Problem

Energy-Efficient Algorithms for Distributed File System HDFS

2014 ◽  
Vol 36 (5) ◽  
pp. 1047-1064 ◽  
Author(s):  
Bin LIAO ◽  
Jiong YU ◽  
Tao ZHANG ◽  
Xing-Yao YANG
Keyword(s):  
Energy Efficient ◽  
File System ◽  
Efficient Algorithms ◽  
Distributed File System

Network Energy Consumption Models and Energy Efficient Algorithms

2012 ◽  
Vol 35 (3) ◽  
pp. 603-615 ◽  
Author(s):  
Fa ZHANG ◽  
Antonio Fernandez Anta ◽  
Lin WANG ◽  
Chen-Ying HOU ◽  
Zhi-Yong LIU
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Efficient Algorithms

Development of Efficient Algorithms for Predicting Aircraft's Braking Mode

2020 ◽  
Vol 81 (10) ◽  
pp. 1884-1895
Author(s):  
A. M. Shevchenko ◽  
G. N. Nachinkina ◽  
M. V. Gorodnova
Keyword(s):  
Efficient Algorithms
Sign in / Sign up

Export Citation Format

Share Document