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}
(2) 
_{Sep}

_{Oct}

_{Nov}
(1) 
_{Dec}
(11) 
2016 
_{Jan}
(10) 
_{Feb}
(1) 
_{Mar}

_{Apr}

_{May}

_{Jun}

_{Jul}

_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 


1
(2) 
2
(5) 
3

4
(2) 
5
(1) 
6

7

8

9

10

11

12

13

14

15

16
(4) 
17
(2) 
18
(5) 
19
(6) 
20

21

22

23
(2) 
24

25
(1) 
26

27

28

29
(2) 
30
(3) 




From: Gehua Yang <yangg2@rp...>  20041119 18:27:24

Recall that LM takes a vector of residuals BEFORE squaring. In this case, the function shall look like: fx[4*i] = x1[i][0]x1_h[i][0]; fx[4*i+1] = x1[i][1]x1_h[i][1]; fx[4*i+2] = x2[i][0]x2_h[i][0]; fx[4*i+3] = x2[i][1]x2_h[i][1]; > As for the number of residuals, I still do not quite > understand why it's 4n. Since each point > correspondence gives 2 residuals, i.e the squared > distances in 2 images are d(x_i, xhat_i)^2 and > d(xpri_i, xhatpri_i)^2. > it ought to be 2n. > > below is the code segment of function f in my class > derived from vnl_least_squares_function: > > void XXX:f(const vnl_vector<double>& x, > vnl_vector<double>& fx) > { > ...... > for ( int i = 0; i < n; i++ ) { > ... > fx[2*i] = squared_distance(x1[i], x1_h[i]); > fx[2*i+1] = squared_distance(x2[i], x2_h[i]); > } > } > > I will be very grateful if you would be patient to > give me a further explaination. > > Marc. > 
From: Ian Scott <ian.scott@st...>  20041119 17:03:20

Swati Setty wrote: > hello vxl, > i am trying to create the > vimt_gaussian_pyramid_builder_2d object with int datatype. > > But it is giving me unresolved external symbol vil_gauss_reduce_121<int> & vil_gauss_reduce<int> There is no exiting template instantiation for vil_gauss_reduce<int>, but it is easy to create your own. Create, compile and link in the following source file: #include <vxl_config.h> #include <vil/algo/vil_gauss_reduce.txx> VIL_GAUSS_REDUCE_INSTANTIATE(vxl_int_32 ); If you don't want to put it in your own project, put it in a file called $VXLSRC/core/vil/algo/Templates/vil_gauss_reduce+int32.cxx CMake should automatically add it to the vil_algo library when you next rebuild vxl. Ian. 
From: Amitha Perera <perera@cs...>  20041119 14:44:01

On Thu 18 Nov 2004, Marc Anderson wrote: > Next, what does BUILD_SHARED_LIBS mean? It means build shared (.so, .dll) instead of static (.a, .lib) libraries. It only works under Unix for now, because building DLLs under Windows requires either Microsoft extensions or generating an export file, which is not easy to do automatically. Amitha. 
From: Xiaowei Li <nemesis@bi...>  20041119 07:22:25

Hi, Marc I think your code would be modified as the follow which yields 4n residuals: void XXX:f(const vnl_vector<double>& x, vnl_vector<double>& fx) { ...... for ( int i = 0; i < n; i++ ) { ... fx[4*i] = (x1[i].first, x1_h[i].first)^2; fx[4*i+1] = (x1[i].second, x1_h[i].second)^2; fx[4*i+2] = (x2[i].first, x2_h[i].first)^2; fx[4*i+3] = (x2[i].second, x2_h[i].second)^2; } } in which,x1[i].first refers to the "x" element of a 2D point,and x1[i].second the "y" element. Shawrie Lee regards. 
From: Marc Anderson <yulq2004@ya...>  20041119 03:34:33

Hi all, When I build vxl1.0beta, there are some stuff that is not there. So where can I get them. Next, what does BUILD_SHARED_LIBS mean? Thanks Marc.  Do you Yahoo!? The allnew My Yahoo! Get yours free! 
From: Marc Anderson <yulq2004@ya...>  20041119 01:44:01

Gehua, Thanks for your reply! As I use the second edition of H&Z book, the algorithm on page 114 is 4.3. As for the number of residuals, I still do not quite understand why it's 4n. Since each point correspondence gives 2 residuals, i.e the squared distances in 2 images are d(x_i, xhat_i)^2 and d(xpri_i, xhatpri_i)^2. it ought to be 2n. below is the code segment of function f in my class derived from vnl_least_squares_function: void XXX:f(const vnl_vector<double>& x, vnl_vector<double>& fx) { ...... for ( int i = 0; i < n; i++ ) { ... fx[2*i] = squared_distance(x1[i], x1_h[i]); fx[2*i+1] = squared_distance(x2[i], x2_h[i]); } } I will be very grateful if you would be patient to give me a further explaination. Marc.  Gehua Yang <yangg2@...> wrote: > First of all, Page 114, or Algorithm 3.7 is the Gold > Standard Algorithm for > estimating an AFFINE transformation, not homography. > > If homography is to be estimated, refer to Algorithm > 3.3 on Page 98. There > are two choices: Sampson error or Gold Standard > error. For Sampson error, > there are only 9 parameters(or one can choose other > parameterization). As > for Gold Standard error, there are 2n+9 variables. > But there are 4n > residuals: > sum d(x_i, xhat_i)^2 + d(xpri_i, xhatpri_i)^2 > Recall that LM takes a vector of residuals before > squaring. for each d(.) > function, there are two residuals. Another way to > look at it is that each > ideal point x hat brings in two parameters, but > provides 4 constraints. > > > Gehua > >  Original Message  > From: Marc Anderson > To: vxlusers@... > Sent: Tuesday, November 16, 2004 9:58 PM > Subject: [Vxlusers] Premise of > vnl_levenberg_marquardt hold back Gold > standard? > > > > Hi, all vxl guys! > > > The class vnl_levenberg_marquardt checks if the > number of parameters is > > less than that of residuals before carrying out > the minimization process, > > otherwise it'll returns false. This requirement > prevents the estimation of > > homography between two images using the Gold > Standard algorithm(H&Z book, > > p114), in which case the number of parameters is > 2n+9 while the number of > > residuals is n. ( where n is the number of point > correspondences ). Would > > someone get the idea to figure this issue out? > Thanks! > > __________________________________ Do you Yahoo!? Meet the allnew My Yahoo!  Try it today! http://my.yahoo.com 