idamnjanovic@70
|
1 %IM2COLSTEP Rearrange matrix blocks into columns.
|
idamnjanovic@70
|
2 % B = IM2COLSTEP(A,[N1 N2]) converts each sliding N1-by-N2 block of the
|
idamnjanovic@70
|
3 % 2-D matrix A into a column of B, with no zero padding. B has N1*N2 rows
|
idamnjanovic@70
|
4 % and will contain as many columns as there are N1-by-N2 neighborhoods in
|
idamnjanovic@70
|
5 % A. Each column of B contains a neighborhood of A reshaped as NHOOD(:),
|
idamnjanovic@70
|
6 % where NHOOD is a matrix containing an N1-by-N2 neighborhood of A.
|
idamnjanovic@70
|
7 %
|
idamnjanovic@70
|
8 % B = IM2COLSTEP(A,[N1 N2],[S1 S2]) extracts neighborhoods of A with a
|
idamnjanovic@70
|
9 % step size of (S1,S2) between them. The first extracted neighborhood is
|
idamnjanovic@70
|
10 % A(1:N1,1:N2), and the rest are of the form A((1:N1)+i*S1,(1:N2)+j*S2).
|
idamnjanovic@70
|
11 % Note that to ensure coverage of all A by neighborhoods,
|
idamnjanovic@70
|
12 % (size(A,i)-Ni)/Si must be whole for i=1,2. The default function behavior
|
idamnjanovic@70
|
13 % corresponds to [S1 S2] = [1 1]. Setting S1>=N1 and S2>=N2 results in no
|
idamnjanovic@70
|
14 % overlap between the neighborhoods.
|
idamnjanovic@70
|
15 %
|
idamnjanovic@70
|
16 % B = IM2COLSTEP(A,[N1 N2 N3],[S1 S2 S3]) operates on a 3-D matrix A. The
|
idamnjanovic@70
|
17 % step size [S1 S2 S3] may be ommitted, and defaults to [1 1 1].
|
idamnjanovic@70
|
18 %
|
idamnjanovic@70
|
19 % Note: the call IM2COLSTEP(A,[N1 N2]) produces the same output as
|
idamnjanovic@70
|
20 % Matlab's IM2COL(A,[N1 N2],'sliding'). However, it is significantly
|
idamnjanovic@70
|
21 % faster.
|
idamnjanovic@70
|
22 %
|
idamnjanovic@70
|
23 % See also COL2IMSTEP, IM2COL, COUNTCOVER.
|
idamnjanovic@70
|
24
|
idamnjanovic@70
|
25
|
idamnjanovic@70
|
26 % Ron Rubinstein
|
idamnjanovic@70
|
27 % Computer Science Department
|
idamnjanovic@70
|
28 % Technion, Haifa 32000 Israel
|
idamnjanovic@70
|
29 % ronrubin@cs
|
idamnjanovic@70
|
30 %
|
idamnjanovic@70
|
31 % August 2009
|