Re: video capture library

we used some other library. anyway, i was looking at the second tutorial and it seems usable... much of the code is already written.

On Wed, Oct 21, 2009 at 8:37 PM, Hollow Man <evanescentpv@gmail.com> wrote:

by capture if u mean storing every frame as an image, havent we done that already (7th sem) using ffmpeg?

Prateek

On Wed, Oct 21, 2009 at 8:23 PM, Sayandeep Purkayasth <deepcyan@gmail.com> wrote:

what say we use ffmpeg this time?
if so, find appropriate tutorials http://www.inb.uni-luebeck.de/~boehme/using_libavcodec.html (outdated code) and http://www.dranger.com/ffmpeg/tutorial01.html (not checked yet)

On Wed, Oct 21, 2009 at 4:44 PM, Sayandeep Purkayasth <deepcyan@gmail.com> wrote:

one promising one

• Simple, Thread-safe Approximate Nearest Neighbor (STANN) C++
  

Re: video capture library

by capture if u mean storing every frame as an image, havent we done that already (7th sem) using ffmpeg?

Prateek

On Wed, Oct 21, 2009 at 8:23 PM, Sayandeep Purkayasth <deepcyan@gmail.com> wrote:

what say we use ffmpeg this time?
if so, find appropriate tutorials http://www.inb.uni-luebeck.de/~boehme/using_libavcodec.html (outdated code) and http://www.dranger.com/ffmpeg/tutorial01.html (not checked yet)

On Wed, Oct 21, 2009 at 4:44 PM, Sayandeep Purkayasth <deepcyan@gmail.com> wrote:

one promising one

• Simple, Thread-safe Approximate Nearest Neighbor (STANN) C++
  

video capture library

what say we use ffmpeg this time?
if so, find appropriate tutorials http://www.inb.uni-luebeck.de/~boehme/using_libavcodec.html (outdated code) and http://www.dranger.com/ffmpeg/tutorial01.html (not checked yet)

On Wed, Oct 21, 2009 at 4:44 PM, Sayandeep Purkayasth <deepcyan@gmail.com> wrote:

one promising one

• Simple, Thread-safe Approximate Nearest Neighbor (STANN) C++
  

Re: the clustering search

one promising one

• Simple, Thread-safe Approximate Nearest Neighbor (STANN) C++
  

the clustering search

some libraries for clustering and (in general) for machine learning are listed below

• SGI MLC++ http://www.sgi.com/tech/mlc/
• OpenCV MLL
• The Open Source C Clustering Library
• The Wikipedia-Clustering project
• a specialized K-means library from The University of Mariland

these and some others to be looked up.

MTP discussions

one optimization technique springs to mind:

we can break up the initial 2d array into lots of small 2d arrays and optimise each each separately. then we can stitch them back. this can probably give better results.

MTP discussions

in section 4.1 of the paper, the authors say they used a sparse variant of the levenberg marquardt algo. the levmar site (http://www.ics.forth.gr/~lourakis/levmar/) you found earlier is exactly that. i don't think gsl wala has sparse matrix support. so will switch to levmar.