| Date | File | Comment by | Comment | Rating |
|---|---|---|---|---|
| 18 Oct 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | su su | Great Work.
|
|
| 18 Oct 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | su su | ||
| 31 Jul 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | Myronenko, Andriy | Hi Steffen,
angle=0.1;
and then run the registration with your settings. You should get an accurate registration result. Perhaps, more systematic solution would be to run the rigid registration with several different rotation initializations.
|
|
| 31 Jul 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | Steffen | I checked the code and found out that one cannot use normalization and fixed scaling together. So, I set opt.normalize=0. however, the computed transformation seems to be far away from the optimal transformation. here is my test code: function test_rigidTranform_noScaling( ) X = [121.3102 58.0957 46.3863
Y = [36.7239 68.1019 52.6539
% Set the options
opt.normalize=0; % normalize to unit variance and zero mean before registering (default)
opt.max_it=100; % max number of iterations
% registering Y to X
figure,cpd_plot_iter(X, Y); title('Before');
% compute error as mean minimum distance between points
function [E, D] = computeError(X, Y)
Any idea, what's going on? I noticed that in cpd_rigid.m the value of ntol can be negative: ntol=(L-L_old)/L; I'm not sure if this is intended. I changed it to ntol=abs((L-L_old)/L). The registration result is only slightly better, though. Another minor thing. In cpd_register.m the line
Best,
|
|
| 31 Jul 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | Steffen | great work, Andriy. Is there any way to register with translation and rotation only without scaling? I set the .scale option to 0, but the scaling value in the computed transformation is not equal to 1. |
|
| 19 Jul 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | zhao, jichao | thanks, Andrily. It is working perfectly, cheers,jichao |
|
| 16 Jul 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | Myronenko, Andriy | 2Jichao Zhao:
|
|
| 16 Jul 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | zhao, jichao | why I have the following errors? thanks ??? Undefined function or method 'cpd_normalize' for input arguments of type 'double'. Error in ==> cpd_register at 129
Error in ==> cpd_affine_example1 at 13
|
|
| 29 May 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | Paris, Sebastien | ||
| 29 May 2009 | Point set registration (Rigid and Non-rigid). Rigid, Affine and Non-rigid point set registration toolbox. Coherent Point Drift (CPD) algorithm. | Rosa, Luigi | Excellent work. It could be used for many patter recognition problems. |
|
| 28 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | Myronenko, Andriy | To candelabro
newsize=[M N K]; % Define padded size of the 3D array;
2) The positive and negative frequencies is only appropriate for fft. If you really want to have the analogy with fft, then remember that DCT gives an output for positive frequencies. And negative frequencies can be obtained by mirror flip. |
|
| 28 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | candelabro, candelabro | In tree dimensions how I can obtain the part corresponding to the negative frequencies, that is, the output can be centered with the fftshift fucntion? |
|
| 28 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | candelabro, candelabro | These functions can be changed to allows for zero padding?
|
|
| 26 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | Myronenko, Andriy | A 'row' vector bug solved and corrected. |
|
| 22 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | Myronenko, Andriy | to Paul Matthews,
I was surprised by your results at first, then I find out that your results in 1D are correct only for ROW vectors. Try the same with COLUMN vectors, please: tic; for i=1:3000;x=rand(512,1);dct(x);end; toc % 0.81s
tic; for i=1:3000;x=rand(512,1);mirt_dctn(x);end; toc % 0.66s
For the larger 1D vectors, mirt_dctn (and mirt_idctn) performance improvement is even bigger
PS: I'll take a look why my 'row' vector processing takes longer, and correct it shortly. |
|
| 22 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | Matthews, Paul | It doesnt seem faster than dct to me.
tic; for i=1:3000;x=rand(1,512);dct(x);end; toc % 1.5
tic; for i=1:3000;x=rand(1,512);mirt_dctn(x);end; toc % 3.0
But for 2d it seems about twice as fast as dct. It is a mystery to me why Matlab have not written a fast dct |
|
| 22 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | Matthews, Paul | ||
| 14 May 2009 | Multidimensional Discrete Cosine Transform (DCT) Fast forward and inverse Multidimensional Discrete Cosine Transforms (DCT, IDCT). | Berg, Mike | Great job. Thanks. |
|
NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content. Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available via MATLAB Central. Read the complete Terms prior to use.
Contact us at files@mathworks.com