In this paper, we consider the problem of fast and efficient indexing techniques for sequences evolving in non-Euclidean spaces. This problem has several applications in the areas of human activity analysis, where there is a need to perform fast search, and recognition in very high dimensional spaces. The problem is made more challenging when representations such as landmarks, contours, and human skeletons etc. are naturally studied in a non-Euclidean setting where even simple operations are much more computationally intensive than their Euclidean counterparts. We propose a geometry and data adaptive symbolic framework that is shown to enable the deployment of fast and accurate algorithms for activity recognition, dynamic texture recognition, motif discovery. Toward this end, we present generalizations of key concepts of piece-wise aggregation and symbolic approximation for the case of non-Euclidean manifolds. We show that one can replace expensive geodesic computations with much faster symbolic computations with little loss of accuracy in activity recognition and discovery applications. The framework is general enough to work across both Euclidean and non-Euclidean spaces, depending on appropriate feature representations without compromising on the ultra-low bandwidth, high speed and high accuracy. The proposed methods are ideally suited for real-time systems and low complexity scenarios.
Vector-Symbolic Architecture for Event-Based Optical Flow
University of Electronic Science and Technology of China(电子科技大学);Guilin University of Electronic Technology(桂林电子科技大学);SynSense Tech. Co. Ltd.(SynSense科技有限公司)
Adaptive Deconvolution-based stereo matching Net for Local Stereo Matching
School of Information Science and Engineering, Shandong University(山东大学信息科学与工程学院);College of Geomatics, Shandong University of Science and Technology(山东科技大学测绘学院);Shenzhen Research Institute, Shandong University(山东大学深圳研究院);School of Control Science and Engineering, Shandong University(山东大学控制科学与工程学院)
AdaStereo: A Simple and Efficient Approach for Adaptive Stereo Matching
SenseTime Research(商汤科技研究院);The Chinese University of Hong Kong(香港中文大学);Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences(中国科学院深圳先进技术研究院);Shanghai AI Laboratory(上海人工智能实验室);Qing Yuan Research Institute, Shanghai Jiao Tong University(上海交通大学清源研究院)
Robust Subpixel Localization of Diagonal Markers in Large-Scale Navigation via Multi-Layer Screening and Adaptive Matching
College of Aerospace Science and Engineering(航空航天科学与工程学院);National University of Defense Technology(国防科技大学);Hunan Provincial Key Laboratory of Image Measurement and Vision Navigation(湖南省图像测量与视觉导航重点实验室)
FireANTs: Adaptive Riemannian Optimization for Multi-Scale Diffeomorphic Matching
Computer and Information Science, University of Pennsylvania(宾夕法尼亚大学计算机与信息科学系);Penn Image Computing and Science Laboratory, University of Pennsylvania(宾夕法尼亚大学宾夕法尼亚图像计算与科学实验室);Electrical and Systems Engineering, University of Pennsylvania(宾夕法尼亚大学电子与系统工程系);Radiology, Perelman School of Medicine, University of Pennsylvania(宾夕法尼亚大学放射学系)
AdaStereo: An Efficient Domain-Adaptive Stereo Matching Approach
SenseTime Group Limited(商汤科技集团);Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences(中国科学院深圳先进技术研究院);Chinese University of Hong Kong(香港中文大学);ShanghaiTech University(上海科技大学)
Local Structure Matching Driven by Joint-Saliency-Structure Adaptive Kernel Regression
Shanghai Jiao Tong University(上海交通大学);University College London(伦敦大学学院);Shanghai Renji Hospital, School of Medicine, Shanghai Jiaotong University(上海交通大学医学院附属上海仁济医院);University of the West of England(西英格兰大学)