Finish 2012-11-07 16:00:00 UTC

checking_tw1

by Alfonso Nieto-Castanon

Status: Failed
Results: Failed (grading): Error using grade>validateSolution (line 64) Each point must have a unique l ...

Based on: checking (diff)
Basis for: checking_tw1 (diff)

Comments
Please login or create a profile.
Code
function xyOut = solver(a, xyIn, wts)

rand('seed',2) % Make xyIn cases independent. Currently optimizing as a whole set

N=length(wts);

[xyOut,nill]=svd(diag(sum(a))-a);
xyOut=xyOut(:,end-2:end-1); 

for ncut=1:2
    M=a+eye(size(a)); 
    Mbeta=(((0.9)*eye(N)+0.1*bsxfun(@rdivide,M,sum(M,2)))^10);
    for n1=1:120
        xyOut=Mbeta*xyOut;
        [c1,d1,c2]=svd(cov(xyOut,1));
        xyOut=(bsxfun(@minus,xyOut,mean(xyOut)))*c1*diag(1./sqrt(.1+diag(d1)))*c2'; %sqrtm(pinv(.1*eye(2)+cxyOut));
    end
    [i,j]=find(a>0.01); 
    dd=sum((xyOut(i,:)-xyOut(j,:)).^2,2);
    k=find(dd>4*mean(dd));
    if isempty(k), break; end
    a(i(k)+N*(j(k)-1))=0.009;
end
xyOut0=xyOut;

xyOut0=sqrt(N)*detrend(xyOut0,'constant')*diag(1./max(eps,std(xyOut0,1,1)));
% K=10;
k=1;
[sxyOut0,idxequal]=sortrows(round(15*xyOut0)/15);
idxequal=idxequal(all(~diff(sxyOut0,1,1),2));
xyOut=round(xyOut0);
while size(unique(xyOut,'rows'),1)~=N
    k=k*2;
    xyOut=xyOut0*k;
    xyOut(idxequal,:)=(xyOut0(idxequal,:)+randn(numel(idxequal),2)/10)*k;
    xyOut=round(xyOut);
end
if N<35 % small map knot lines
 xyOut=2*xyOut+(randi(3,N,2)-2);
end


xyOut = bsxfun(@minus,xyOut,round(wts*(xyOut-xyIn)./sum(wts))); % AV's

end