You can subscribe to this list here.
2001 
_{Jan}

_{Feb}

_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}
(8) 
_{Nov}
(8) 
_{Dec}
(4) 

2002 
_{Jan}
(53) 
_{Feb}
(15) 
_{Mar}
(51) 
_{Apr}
(54) 
_{May}
(41) 
_{Jun}
(48) 
_{Jul}
(32) 
_{Aug}
(22) 
_{Sep}
(61) 
_{Oct}
(31) 
_{Nov}
(31) 
_{Dec}
(27) 
2003 
_{Jan}
(45) 
_{Feb}
(18) 
_{Mar}
(25) 
_{Apr}
(39) 
_{May}
(34) 
_{Jun}
(20) 
_{Jul}
(13) 
_{Aug}
(16) 
_{Sep}
(18) 
_{Oct}
(14) 
_{Nov}
(17) 
_{Dec}
(13) 
2004 
_{Jan}
(53) 
_{Feb}
(12) 
_{Mar}
(38) 
_{Apr}
(29) 
_{May}
(72) 
_{Jun}
(38) 
_{Jul}
(41) 
_{Aug}
(11) 
_{Sep}
(21) 
_{Oct}
(30) 
_{Nov}
(35) 
_{Dec}
(14) 
2005 
_{Jan}
(66) 
_{Feb}
(14) 
_{Mar}
(24) 
_{Apr}
(50) 
_{May}
(40) 
_{Jun}
(29) 
_{Jul}
(37) 
_{Aug}
(27) 
_{Sep}
(26) 
_{Oct}
(58) 
_{Nov}
(43) 
_{Dec}
(23) 
2006 
_{Jan}
(84) 
_{Feb}
(36) 
_{Mar}
(24) 
_{Apr}
(42) 
_{May}
(20) 
_{Jun}
(41) 
_{Jul}
(40) 
_{Aug}
(42) 
_{Sep}
(23) 
_{Oct}
(38) 
_{Nov}
(31) 
_{Dec}
(28) 
2007 
_{Jan}
(11) 
_{Feb}
(34) 
_{Mar}
(14) 
_{Apr}
(29) 
_{May}
(45) 
_{Jun}
(5) 
_{Jul}
(10) 
_{Aug}
(6) 
_{Sep}
(38) 
_{Oct}
(44) 
_{Nov}
(19) 
_{Dec}
(22) 
2008 
_{Jan}
(37) 
_{Feb}
(24) 
_{Mar}
(29) 
_{Apr}
(14) 
_{May}
(24) 
_{Jun}
(47) 
_{Jul}
(26) 
_{Aug}
(4) 
_{Sep}
(14) 
_{Oct}
(45) 
_{Nov}
(25) 
_{Dec}
(16) 
2009 
_{Jan}
(33) 
_{Feb}
(34) 
_{Mar}
(45) 
_{Apr}
(45) 
_{May}
(30) 
_{Jun}
(47) 
_{Jul}
(37) 
_{Aug}
(19) 
_{Sep}
(15) 
_{Oct}
(16) 
_{Nov}
(24) 
_{Dec}
(31) 
2010 
_{Jan}
(32) 
_{Feb}
(25) 
_{Mar}
(12) 
_{Apr}
(5) 
_{May}
(2) 
_{Jun}
(9) 
_{Jul}
(31) 
_{Aug}
(10) 
_{Sep}
(12) 
_{Oct}
(20) 
_{Nov}
(6) 
_{Dec}
(41) 
2011 
_{Jan}
(23) 
_{Feb}
(8) 
_{Mar}
(41) 
_{Apr}
(8) 
_{May}
(15) 
_{Jun}
(10) 
_{Jul}
(8) 
_{Aug}
(14) 
_{Sep}
(16) 
_{Oct}
(13) 
_{Nov}
(15) 
_{Dec}
(8) 
2012 
_{Jan}
(6) 
_{Feb}
(14) 
_{Mar}
(22) 
_{Apr}
(40) 
_{May}
(27) 
_{Jun}
(18) 
_{Jul}
(2) 
_{Aug}
(6) 
_{Sep}
(10) 
_{Oct}
(32) 
_{Nov}
(5) 
_{Dec}
(2) 
2013 
_{Jan}
(14) 
_{Feb}
(2) 
_{Mar}
(15) 
_{Apr}
(2) 
_{May}
(6) 
_{Jun}
(7) 
_{Jul}
(25) 
_{Aug}
(6) 
_{Sep}
(3) 
_{Oct}

_{Nov}
(8) 
_{Dec}

2014 
_{Jan}
(3) 
_{Feb}
(3) 
_{Mar}
(3) 
_{Apr}

_{May}
(19) 
_{Jun}
(6) 
_{Jul}
(1) 
_{Aug}
(4) 
_{Sep}
(18) 
_{Oct}
(5) 
_{Nov}
(1) 
_{Dec}

2015 
_{Jan}
(2) 
_{Feb}
(4) 
_{Mar}
(2) 
_{Apr}
(1) 
_{May}
(17) 
_{Jun}
(1) 
_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 





1

2
(1) 
3

4

5

6

7

8
(1) 
9
(3) 
10

11
(1) 
12

13

14

15

16

17

18

19

20
(1) 
21

22

23

24

25
(1) 
26

27

28

29

30


From: Peter Vanroose <Peter.V<anroose@es...>  20011125 17:29:45

Date: Sun, 25 Nov 2001 23:0:40 +0800 From: pear <zhangpear@...> To: "vxl@..." <vxl@...> Subject: where are the errors of my program? Hello, all, I want to compute the Fmatrix using Robust Method, but I can't get the correct result. here are my program and data in attached file. Warning Monte Carlo sampling will not work. Not enough points to choose from: need 7, have 0. #include <vcl_iostream.h> #include <stdlib.h> #include <vcl_cmath.h> #include <mvl/FMatrixComputeLinear.h> #include <fstream.h> #include <iomanip.h> #include <mvl/FMatrixComputeRANSAC.h> #include <mvl/SimilarityMetric.h> #include <mvl/PairMatchSetCorner.h> #include <mvl/HomgInterestPointSet.h> void main() { vcl_vector<HomgPoint2D> points1(128); vcl_vector<HomgPoint2D> points2(128); SimilarityMetric metric=SimilarityMetric(512,512); // Read points ifstream datain("D://projects//temp//vxlTest//test.in";); if(datain.fail()) { return; } int i; double ptx1,pty1,ptx2,pty2; // vnl_double_2 t1,t2; for(i=0;i<128;i++) { datain>>ptx1>>pty1>>ptx2>>pty2; points1[i]=metric.image_to_homg(ptx1,pty1); points2[i]=metric.image_to_homg(ptx2,pty2); } datain.close(); HomgInterestPointSet *corners[2]; corners[0]=new HomgInterestPointSet(points1,&metric); corners[1]=new HomgInterestPointSet(points2,&metric); PairMatchSetCorner match; match.set(corners[0],corners[1]); FMatrixComputeRANSAC comput(true,0.75); FMatrix f1; f1=comput.compute(match); vcl_cout <<f1 << vcl_endl; } 
From: Amitha Perera <perera@cs...>  20011120 13:52:25

Hi all I've set up a Dart based dashboard for vxl at http://www.cs.rpi.edu/research/vision/vxl. I'd like to call for volunteers to submit nightly builds from different platform and compiler combinations. If you'd like to volunteer, let me know and I will send you more detailed instructions. Thanks, Amitha. 
From: Amitha Perera <perera@cs...>  20011111 15:37:22

[vnl] angle(a,b) now returns acos( a.b / ab ), but is not instantiated for complexvalued vectors, since we lack an implementation for acos(complex). Amitha. On Mon, Oct 29, 2001 at 03:03:29PM 0500, Amitha Perera wrote: > > Apparently this is meant to give "symmetric" output, i.e., > > angle(a,b) == angle(b,a). > > By definition of the cos_angle, it is already symmetric: > cos_angle(a,b) = cos_angle(b,a) = a.b/(ab). The current > implementation gives > > ^ > / > / > A / B > </..... > > B as the "angle", which is the smallest angle provided the "vectors" > are undirected. Is this what is intended? I think it should simply be > acos( a.b / ab ) > since that is what most people refer to as the angle between two > vectors. > > Amitha. 
From: Peter Vanroose <Peter.V<anroose@es...>  20011109 17:44:49

> > No, it is just acos( a.b / ab ), which is in general a complex > > number. > > How is acos( complex ) defined? Such a function does not exist in vcl, > so the template instantiations for vnl_vector<complex> fail. Since cos(complex) is well defined ( cos(a+ib) = cos(a)*cosh(b)  i sin(a)*sinh(b) if I did not make a mistake) also acos(complex) is well defined, e.g. by using the (Taylor) series expansion. I don't have an implementation at hand. And it's indeed a rather unusual function. We could of course decide to ensure it is defined in vcl, but that would probably not really be ANSI conformant. > > acos( a.b / ab ) cannot be correct since then the angle between > > (1,0) and (1,1) would be 45 degrees instead of 135 degrees. > > Certainly, for realvalued vectors. However, for complexvalued > vectors, perhaps it is "good enough"? No: it should be defined consistently for real and complex arguments. Doing it like this would not be consistent. Peter. 
From: Amitha Perera <perera@cs...>  20011109 15:52:19

> No, it is just acos( a.b / ab ), which is in general a complex > number. How is acos( complex ) defined? Such a function does not exist in vcl, so the template instantiations for vnl_vector<complex> fail. > acos( a.b / ab ) cannot be correct since then the angle between > (1,0) and (1,1) would be 45 degrees instead of 135 degrees. Certainly, for realvalued vectors. However, for complexvalued vectors, perhaps it is "good enough"? Either way, it doesn't really solve the problem of implementation. Amitha. 
From: Peter.V<anroose@es...>  20011109 12:16:57

> how is the angle between two complex vectors defined? > Is it acos( a.b / ab ) ? No, it is just acos( a.b / ab ), which is in general a complex number. This does not really make sense, i.e., there is no natural interpretation of this kind of angles, but it is the only sensible extension of "real" angles. acos( a.b / ab ) cannot be correct since then the angle between (1,0) and (1,1) would be 45 degrees instead of 135 degrees. Peter. 
From: Amitha Perera <perera@cs...>  20011108 18:44:01

Forgive my ignorance: how is the angle between two complex vectors defined? Is it acos( a.b / ab ) ? If so, is there a clean way to compute the norm for complex types, and not compute the norm for real types? And does this lead to an inconsistency in the semantics of the function call? On Mon, Oct 29, 2001 at 08:13:33PM 0000, Andrew Fitzgibbon wrote: > > Amitha: > > I think it should simply be > > acos( a.b / ab ) > > since that is what most people refer to as the angle between two > > vectors. > > Agreed. 
From: Amitha Perera <perera@cs...>  20011102 19:51:24

Dear all, The RPI team has added two libraries to the vxl tree: rpl/rrel (robust estimation) and rpl/rsdl (spatial data structures). The robust estimation library implements various robust estimation techniques that are used in computer vision and statistics. The basic design is outlined in rpl/rrel/introduction_doxy.txt, which should make it to Manchester's documentation page on the next update. Any comments and suggestions on the design will be welcome. The spatial data structures library currently implements a KDtree and a 2D binning structure, both of which provides for efficient retrieval of points. The KD tree elements can be normal cartesian coordinates or angular coordinates. We hope to have book chapters written soon, describing the libraries in more detail. Chuck Stewart Amitha Perera 