Main.Research History

Show minor edits - Show changes to output

August 16, 2013, at 09:16 AM by 174.7.101.79 -
Changed lines 12-13 from:
[[FLANN/FLANN | FLANN home page ]]
to:
[[http://www.cs.ubc.ca/research/flann | FLANN home page ]]
December 11, 2008, at 12:47 AM by 128.189.250.220 -
Changed lines 4-5 from:
[+'''(Marius Muja and David Lowe)'''+]
to:
%center%[+'''(Marius Muja and David Lowe)'''+]
Added lines 7-8:

\\
December 11, 2008, at 12:44 AM by 128.189.250.220 -
Added line 9:
\\
December 11, 2008, at 12:27 AM by 128.189.250.220 -
Deleted line 1:
December 11, 2008, at 12:21 AM by 128.189.250.220 -
Changed lines 7-11 from:
%lfloat margin=10px% Attach:nn.jpg"FLANN"

The most time consuming part of performing object recognition in large databases is to identify the closest matches for high-dimensional vectors among millions of similar vectors. There are typically no exact algorithms for solving this problem faster than linear search, so it is necessary to use approximate algorithms that sometimes return a slightly less than optimal answer but can be thousands of times faster. We have implemented the best known previous algorithms for approximate nearest neighbor search and developed our own improved methods. Different algorithms are the best choices for different problems, so we have also developed an automated algorithm configuration system that selects the best algorithm and parameters for particular data. This software, FLANN, is being released as open source. It requires only a few library calls in Python, Matlab, or C++ to select and apply the best algorithm for any dataset.

to:
%lfloat margin=10px margin-top=20px% [[FLANN/FLANN | Attach:nn.jpg"FLANN" ]]

The most time consuming part of performing object recognition in large databases is to identify the closest matches for high-dimensional vectors among millions of similar vectors. There are typically no exact algorithms for solving this problem faster than linear search, so it is necessary to use approximate algorithms that sometimes return a slightly less than optimal answer but can be thousands of times faster. We have implemented the best known previous algorithms for approximate nearest neighbor search and developed our own improved methods. Different algorithms are the best choices for different problems, so we have also developed an automated algorithm configuration system that selects the best algorithm and parameters for particular data. This software, FLANN, is being released as open source. It requires only a few library calls in Python, Matlab, or C++ to select and apply the best algorithm for any dataset. \\
[[FLANN/FLANN | FLANN home page ]]
December 11, 2008, at 12:14 AM by 128.189.250.220 -
Changed lines 3-5 from:
[[ FLANN/FLANN| %rfloat height=150px% Attach:kmeans_tree.jpg"FLANN"]]

!!FLANN
to:

!!FLANN: Fast Library for Approximate Nearest Neighbor Matching
[+'''(Marius Muja and David Lowe)'''+]

%lfloat margin=10px% Attach:nn.jpg"FLANN"

The most time consuming part of performing object recognition in large databases is to identify the closest matches for high-dimensional vectors among millions of similar vectors. There are typically no exact algorithms for solving this problem faster than linear search, so it is necessary to use approximate algorithms that sometimes return a slightly less than optimal answer but can be thousands of times faster. We have implemented the best known previous algorithms for approximate nearest neighbor search and developed our own improved methods. Different algorithms are the best choices for different problems, so we have also developed an automated algorithm configuration system that selects the best algorithm and parameters for particular data. This software, FLANN, is being released as open source. It requires only a few library calls in Python, Matlab, or C++ to select and apply the best algorithm for any dataset.

December 10, 2008, at 11:19 PM by 128.189.250.220 -
Changed lines 1-6 from:
Comming soon..
to:
! Research Projects

[[ FLANN/FLANN| %rfloat height=150px% Attach:kmeans_tree.jpg"FLANN"]]

!!FLANN
October 03, 2007, at 08:54 AM by 10.10.10.7 -
Added line 1:
Comming soon..