scholarly journals Efficient matching with invariant local descriptors

1998 ◽  
pp. 54-71 ◽  
Author(s):  
Roger Mohr ◽  
Patrick Gros ◽  
Cordelia Schmid
Keyword(s):  
Local Descriptors ◽  
Efficient Matching

Learning Local Descriptors with Multi-Level Feature Aggregation and Spatial Context Pyramid

2021 ◽  
Author(s):  
Pengpeng Liang ◽  
Haoxuanye Ji ◽  
Erkang Cheng ◽  
Yumei Chai ◽  
Liming Wang ◽  
...  
Keyword(s):  
Spatial Context ◽  
Local Descriptors ◽  
Feature Aggregation ◽  
Multi Level

scholarly journals Classification of Wild Animals based on SVM and Local Descriptors

2014 ◽  
Vol 9 ◽  
pp. 25-30 ◽  
Author(s):  
Slavomir Matuska ◽  
Robert Hudec ◽  
Patrik Kamencay ◽  
Miroslav Benco ◽  
Martina Zachariasova
Keyword(s):  
Wild Animals ◽  
Local Descriptors

Efficient matching algorithm by a hybrid Hopfield network for object recognition

1992 ◽  
Author(s):  
Jung H. Kim ◽  
Sung H. Yoon ◽  
Yong H. Kim ◽  
Evi H. Park ◽  
Celestine A. Ntuen ◽  
...  
Keyword(s):  
Object Recognition ◽  
Hopfield Network ◽  
Matching Algorithm ◽  
Efficient Matching

scholarly journals Smart imaging for power-efficient extraction of Viola-Jones local descriptors

2014 ◽  
Author(s):  
J. Fernández-Berni ◽  
R. A. Carmona-Galán ◽  
R. del Río ◽  
Juan A. Leñero-Bardallo ◽  
M. Suárez-Cambre ◽  
...  
Keyword(s):  
Power Efficient ◽  
Local Descriptors ◽  
Efficient Extraction

A Pattern Matching Algorithm for Double-Type Characters

2014 ◽  
Vol 571-572 ◽  
pp. 461-464
Author(s):  
Hai Yan Zhou
Keyword(s):  
Pattern Matching ◽  
Chinese Characters ◽  
Cross Link ◽  
Data Link ◽  
Matching Algorithm ◽  
Order Of Magnitude ◽  
Link Data ◽  
Efficient Matching ◽  
Link Table ◽  
Double Cross

A fast and efficient matching algorithm is proposed to address the issue on multi-pattern matching of double-byte string, for example Chinese characters, which has major difference with single-byte string matching algorithm. The algorithm capitalizes on double cross link data list and two finite prefix automata to match a double-byte character, so as to solve the storage expansion problems in which the double-byte cross data link table results. The method requires less storage in comparison with double-byte cross data link table, and has the same order of magnitude in efficiency as a single-byte cross-link table approach.

On the Optimal Design of a Bipartite Matching Queueing System

2021 ◽  
Author(s):  
Philipp Afèche ◽  
René Caldentey ◽  
Varun Gupta
Keyword(s):  
Optimal Design ◽  
Queueing System ◽  
Service Systems ◽  
Bipartite Matching ◽  
Efficient Matching

Designing Fair and Efficient Matching Service Systems

Local Descriptors without Orientation Normalization to Enhance Landmark Regconition

2014 ◽  
pp. 401-413 ◽  
Author(s):  
Dai-Duong Truong ◽  
Chau-Sang Nguyen Ngoc ◽  
Vinh-Tiep Nguyen ◽  
Minh-Triet Tran ◽  
Anh-Duc Duong
Keyword(s):  
Local Descriptors

Categorization of Aztec Potsherds Using 3D Local Descriptors

2015 ◽  
pp. 567-582 ◽  
Author(s):  
Edgar Roman-Rangel ◽  
Diego Jimenez-Badillo ◽  
Estibaliz Aguayo-Ortiz
Keyword(s):  
Local Descriptors
Sign in / Sign up

Export Citation Format

Share Document