VIDEO TRACKING USING DUAL-TREE WAVELET POLAR MATCHING AND PARTICLE FILTERING S. K. Pang, J. D. B. Nelson, S. J. Godsill, and N. G. Kingsbury University of Cambridge Signal Processing and Communications Laboratory CUED, T

Source URL: www-sigproc.eng.cam.ac.uk

Tracking Ground Based Targets in Aerial Video with Dual-Tree Complex Wavelet Polar Matching and Particle Filtering J. D. B. Nelson, S. K. Pang, N. G. Kingsbury, and S. J. Godsill University of Cambridge Signal Processing

Source URL: sigproc.eng.cam.ac.uk

2015 IEEE International Conference on Big Data (Big Data) Effectively Crowdsourcing the Acquisition and Analysis of Visual Data for Disaster Response Hien To, Seon Ho Kim, Cyrus Shahabi Integrated Media Systems Center

Source URL: infolab.usc.edu

• Computing
• Information technology
• Information
• Data management
• Quadtree
• Video search engine
• Grid
• K-d tree
• YouTube
• Big data

Cost Prediction in Ray Tracing Erik Reinhard1 , Arjan J. F. Kok2 , Frederik W. Jansen1 1 Faculty of Technical Mathematics and Informatics, Delft University of Technology

Source URL: www.cg.its.tudelft.nl

• 3D computer graphics
• Computer graphics
• Optics
• Geometrical optics
• 3D rendering
• Global illumination algorithms
• Ray tracing
• Octree
• Rendering
• Space partitioning
• K-d tree
• Radiance

Microsoft Word - idp-gmesdoc

Source URL: foibg.com

• Computing
• Learning
• Computer science
• R-tree
• Data types
• Binary trees
• Arrays
• Spatial database
• Web mapping
• Quadtree
• Z-order curve
• K-d tree

LARGE-SCALE MUSIC SIMILARITY SEARCH WITH SPATIAL TREES Brian McFee Computer Science and Engineering University of California, San Diego ABSTRACT

Source URL: eceweb.ucsd.edu

• Statistics
• Search algorithms
• Information science
• Information
• Dimension reduction
• K-d tree
• K-means clustering
• Normal distribution
• K-nearest neighbors algorithm
• Principal component analysis
• Locality-sensitive hashing
• Nearest neighbor search

FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION Marius Muja, David G. Lowe Computer Science Department, University of British Columbia, Vancouver, B.C., Canada ,

Source URL: www.geog.ucsb.edu

• Search algorithms
• Information science
• Computing
• Computer programming
• Machine learning
• Data mining
• Approximation algorithms
• Discrete geometry
• Nearest neighbor search
• K-d tree
• K-nearest neighbors algorithm
• K-means clustering

Faster Cover Trees Mike Izbicki Christian Shelton University of California Riverside, 900 University Ave, Riverside, CAAbstract

Source URL: rlair.cs.ucr.edu

• Computer programming
• Computing
• Learning
• Machine learning
• Binary trees
• K-d tree
• R-tree
• Nearest neighbor search
• Oblivious data structure
• Cover tree
• T-tree
• B-tree

T h e H a d o o p Di s t r i b u t e d Fi l e S y s K o n s t a n t i n V. S h v a c h k o HDFS scalability: the limits to growth Konstantin V. Shvachko is a principal software engineer at Yahoo!, where he develops HDFS

Source URL: static.usenix.org

• Computing
• Software
• System software
• Network file systems
• Distributed data storage
• Apache Hadoop
• Apache Software Foundation
• Cloud infrastructure
• Parallel computing
• IBM General Parallel File System
• B-tree
• Lustre

ypages-scale-time-budget.eps

Source URL: flamingo.ics.uci.edu

• R-tree
• K-d tree
• R* tree
• B-tree
• Search engine indexing
• Spatial database
• Nearest neighbor search