Code covered by the BSD License
-
A =padtomakepowof2(A,varargin...
% if required then add padvalue (defualt 0)
-
I=qtreedecode(S,values)
% Decode QuadTree Represenation of Image given as Sparse matrix 'S' and
-
I=qtreergbdecode(S,valRGB)
% Decode QuadTree date that is decomposed (encode) by qt3ddecom method
-
S=trimsparse(S)
% trim sparse matrix by removing extra rows/columns that have all elements zeros.
-
[S,keys]=delsparsekeybyxANDy(...
-
[S,valRGB]=qt3ddecom(I,vararg...
% This method uses three thresholds for red,green and blue blocks.
-
[b1r,b1c,b2r,b2c,b3r,b3c,b4r,...
% The method uses three thresholds for red,green and blue blocks.
-
[b1r,b1c,b2r,b2c,b3r,b3c,b4r,...
% given the size of rectangle (matrix end points), it split into four
-
avg=avgofmatblks(mat,i,j,w,h)
% finds average of different blocks of input matrix
-
drawquadblocks(S)
% draw square quad blocks of quadtree in eight basic colors.
-
fillrect_ulwh(ul,w,h,varargin...
% fill the rectangle region specified by upper left corner width
-
flag=ispowerof2(n)
-
rgbimgnew =padrgbtomakepowof2...
% if required then add padvalue (defualt 0)
-
var=converttoclass(var,type)
-
main.m
-
View all files
from
Quadtree decomposition (Encoding) and Decoding of RGB Image
by Dr. Murtaza Khan
Quadtree decomposition (Encoding) and Decoding of RGB Image of size M-by-N-by-3.
|
| [S,keys]=delsparsekeybyxANDy(S,i,j,keys,x,y)
|
% % Do following
% % 1. set to 0 (zero) those spatial locations from sparse matrix that
% % exceeds BOTH given x and y values
% % 2. delete the correspoding row from given key matrix
% % INPUT
% % S: input sparse matrix
% % i: i(k) kth row of non-zero element in S
% % j: j(k) kth column of non-zero element in S
% % key: M-by-N array M=length(i) then key(k,:) entry in keys
% % corresponds to kth row of non-zeros entries of S
% % x: x-coordinate
% % y: y-coordinate
% % OUTPUT
% % S: modified output sparse matrix
% % keys: modified keys matrix
function [S,keys]=delsparsekeybyxANDy(S,i,j,keys,x,y)
c=0;
for k=1:length(i)
if(i(k)>x && j(k)>y)
S(i(k),j(k))=0; %(k,k)th entry is also zero, would not be save in Sparse
else
c=c+1;
keysN(c,:)=keys(k,:);
end
end
keys=keysN;
|
|
Contact us at files@mathworks.com