toolbox_bandelets

function [M_list1,nbr_bits_geom] = perform_quadtree_transform(M_list,qt,dir,k,options) % perform_quadtree_transform - sub-function transform a quadtree % % [M_list1,nbr_bits_geom] = perform_quadtree_transform(M_list,qt,dir,k,options); % % 'k' is the number of the instancied quadtree. % % Copyright (c) 2004 Gabriel Peyr� options.null = 1; if nargin<3 dir = 1; end if nargin<4 k = 1; end if isfield(options, 'alpert_vm') alpert_vm = options.alpert_vm; else alpert_vm = -1; end % number of bit to code each geometric feature if isfield(options, 'nbr_bits_nogeom_token') nbr_bits_nogeom_token = options.nbr_bits_nogeom_token; else nbr_bits_nogeom_token = 1; end if isfield(options, 'nbr_bits_geom_token') nbr_bits_geom_token = options.nbr_bits_geom_token; else nbr_bits_geom_token = 1; end if isfield(options, 'nbr_bits_split_token') nbr_bits_split_token = options.nbr_bits_split_token; else nbr_bits_split_token = 1; end n = length(M_list{1}); nbr_bits_geom = 0; % size of the QT j_max = length(qt)-1; j_min = 0; while isempty(qt{j_min+1}) && j_min<j_max j_min = j_min + 1; end for j = j_min:j_max nl = qt{j+1}; % node list w = n/2^j; % size of the dyadic squares % compute the cost of coding the geometry if isfield(options, 'geom_epsi') && isfield(options, 'geom_s') && isfield(options, 'geom_d') G_list = sample_geometry(w, options.geom_d, options.geom_s, options.geom_epsi, options); nbr_G = size(G_list,2); clear G_list; else % hum, works only for exhaustive linear geoemtry nbr_G = w^2; end for kx=1:2^j for ky=1:2^j node = nl{kx,ky}; if node.type(k)==2 % this node is a leaf : perform transform % location of the square pos = ([kx ky]-1)/2^j; posn = pos*n+1; selx = posn(1):posn(1)+w-1; sely = posn(2):posn(2)+w-1; % the geometry choosen g = node.geometry(:,k); if g(1)~=Inf % square to transform for q=1:length(M_list) M{q} = M_list{q}(selx,sely); end % perform the transform M = perform_bandelet_transform_square(M,g,alpert_vm, dir); % assign the result for q=1:length(M_list) M_list{q}(selx,sely) = M{q}; end geom_cost = log2(nbr_G) + nbr_bits_geom_token; nbr_bits_geom = nbr_bits_geom + geom_cost; elseif length(g)>1 && g(2)>=1 % HAAR transform for q=1:length(M_list) if g(2)==1 M_list{q}(selx,sely) = perform_haar_transform(M_list{q}(selx,sely), dir); else A = M_list{q}(selx,sely); options.part_type = '2axis'; options.degree_type = 'sum'; [Y,X] = meshgrid(1:w,1:w); pos = [X(:)'; Y(:)']; A = perform_alpert_transform_2d(A(:), pos, g(2), dir, options); M_list{q}(selx,sely) = reshape( A, w, w ); end end else % NO GEOMETRY: NO TRANSFORM nbr_bits_geom = nbr_bits_geom + nbr_bits_nogeom_token; end elseif node.type(k)==1 if size(node.geometry, 1)>1 nbr_bits_geom = nbr_bits_geom + nbr_bits_split_token; end end end end end M_list1 = M_list; %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % subfunction : transform a dyadic square using a known geometry function M1 = perform_bandelet_transform_square(M,g,alpert_vm, dir); [n,p] = size(M{1}); % sampling location [Y,X] = meshgrid(1:p,1:n); pos = [X(:)'; Y(:)']; % warp the locations posr = perform_warping(pos,g); % X shoud be perpendicular to the discontinuity if g(1)==1 posr = posr(2:-1:1,:); end M1 = M; Jmin = 1; for q=1:length(M) if alpert_vm(1)<0 [tmp,I] = sort(posr(1,:)); if alpert_vm(1)==-1 %%%%%%%%%% HAAR TRANSFORM %%%%%%%%% M1{q}(I) = perform_haar_transform(M1{q}(I), Jmin, dir); else %%%%%%%%%% WAVELET TRANSFORM %%%%%% M1{q}(I) = perform_lifting_transform_byname(M1{q}(I), Jmin, dir, '7_9'); end else [M1{q}(:),info] = perform_alpert_transform_2d(M1{q}(:),posr,alpert_vm, dir); end end