Skip to content
项目
群组
代码片段
帮助
当前项目
正在载入...
登录 / 注册
切换导航面板
P
pytensor
项目
项目
详情
活动
周期分析
仓库
仓库
文件
提交
分支
标签
贡献者
图表
比较
统计图
议题
0
议题
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
CI / CD
CI / CD
流水线
作业
日程
统计图
Wiki
Wiki
代码片段
代码片段
成员
成员
折叠边栏
关闭边栏
活动
图像
聊天
创建新问题
作业
提交
问题看板
Open sidebar
testgroup
pytensor
Commits
f423ac63
提交
f423ac63
authored
11月 17, 2014
作者:
carriepl
浏览文件
操作
浏览文件
下载
差异文件
Merge pull request #2197 from dmitriy-serdyuk/doc_fix
Documentation for sliding windows
上级
f83eb40d
76062c33
显示空白字符变更
内嵌
并排
正在显示
11 个修改的文件
包含
605 行增加
和
499 行删除
+605
-499
basic.txt
doc/library/tensor/basic.txt
+1
-0
index.txt
doc/library/tensor/nnet/index.txt
+1
-0
neighbours.txt
doc/library/tensor/nnet/neighbours.txt
+19
-0
neighbours.py
theano/sandbox/cuda/neighbours.py
+1
-1
opt.py
theano/sandbox/cuda/opt.py
+2
-2
test_neighbours.py
theano/sandbox/cuda/tests/test_neighbours.py
+2
-2
neighbours.py
theano/sandbox/gpuarray/neighbours.py
+1
-1
test_neighbours.py
theano/sandbox/gpuarray/tests/test_neighbours.py
+2
-2
neighbours.py
theano/sandbox/neighbours.py
+5
-490
neighbours.py
theano/tensor/nnet/neighbours.py
+570
-0
test_neighbours.py
theano/tensor/nnet/tests/test_neighbours.py
+1
-1
没有找到文件。
doc/library/tensor/basic.txt
浏览文件 @
f423ac63
...
@@ -1000,6 +1000,7 @@ Reductions
...
@@ -1000,6 +1000,7 @@ Reductions
:Returns: A new array holding the result.
:Returns: A new array holding the result.
.. _indexing:
Indexing
Indexing
========
========
...
...
doc/library/tensor/nnet/index.txt
浏览文件 @
f423ac63
...
@@ -18,3 +18,4 @@ and ops which are particular to neural networks and deep learning.
...
@@ -18,3 +18,4 @@ and ops which are particular to neural networks and deep learning.
conv
conv
nnet
nnet
neighbours
doc/library/tensor/nnet/neighbours.txt
0 → 100644
浏览文件 @
f423ac63
.. _libdoc_tensor_nnet_neighbours:
=======================================================================
:mod:`neighbours` -- Ops for working with images in convolutional nets
=======================================================================
.. module:: sandbox.neighbours
:platform: Unix, Windows
:synopsis: Ops for working with images in conv nets
.. moduleauthor:: LISA
- Functions
.. autofunction:: theano.tensor.nnet.neighbours.images2neibs
.. autofunction:: theano.tensor.nnet.neighbours.neibs2images
- See also: :ref:`indexing`, :ref:`lib_scan`
theano/sandbox/cuda/neighbours.py
浏览文件 @
f423ac63
...
@@ -3,7 +3,7 @@ from theano import Op, Apply, tensor
...
@@ -3,7 +3,7 @@ from theano import Op, Apply, tensor
from
theano.gof
import
local_optimizer
from
theano.gof
import
local_optimizer
from
theano.sandbox.cuda
import
cuda_available
,
GpuOp
from
theano.sandbox.cuda
import
cuda_available
,
GpuOp
from
theano.
sandbox
.neighbours
import
Images2Neibs
from
theano.
tensor.nnet
.neighbours
import
Images2Neibs
if
cuda_available
:
if
cuda_available
:
from
theano.sandbox.cuda
import
CudaNdarrayType
from
theano.sandbox.cuda
import
CudaNdarrayType
...
...
theano/sandbox/cuda/opt.py
浏览文件 @
f423ac63
...
@@ -95,13 +95,13 @@ register_opt(name='gpu_constant_folding')(
...
@@ -95,13 +95,13 @@ register_opt(name='gpu_constant_folding')(
# moved to the GPU. This list is used by an optimization.
# moved to the GPU. This list is used by an optimization.
# Hopefully, we can keep this list up to date.
# Hopefully, we can keep this list up to date.
import
theano.tensor.signal.downsample
import
theano.tensor.signal.downsample
import
theano.
sandbox
.neighbours
import
theano.
tensor.nnet
.neighbours
cpu_ops_moved_to_gpu
=
[
cpu_ops_moved_to_gpu
=
[
tensor
.
blas
.
Dot22
,
tensor
.
blas
.
Dot22Scalar
,
tensor
.
blas
.
Gemm
,
tensor
.
blas
.
Dot22
,
tensor
.
blas
.
Dot22Scalar
,
tensor
.
blas
.
Gemm
,
tensor
.
blas
.
Gemv
,
tensor
.
blas
.
Ger
,
tensor
.
nnet
.
conv
.
ConvOp
,
tensor
.
blas
.
Gemv
,
tensor
.
blas
.
Ger
,
tensor
.
nnet
.
conv
.
ConvOp
,
tensor
.
signal
.
downsample
.
DownsampleFactorMax
,
tensor
.
signal
.
downsample
.
DownsampleFactorMax
,
tensor
.
signal
.
downsample
.
DownsampleFactorMaxGrad
,
tensor
.
signal
.
downsample
.
DownsampleFactorMaxGrad
,
theano
.
sandbox
.
neighbours
.
Images2Neibs
,
theano
.
tensor
.
nnet
.
neighbours
.
Images2Neibs
,
tensor
.
nnet
.
CrossentropySoftmaxArgmax1HotWithBias
,
tensor
.
nnet
.
CrossentropySoftmaxArgmax1HotWithBias
,
tensor
.
nnet
.
CrossentropySoftmax1HotWithBiasDx
,
tensor
.
nnet
.
CrossentropySoftmax1HotWithBiasDx
,
tensor
.
nnet
.
Softmax
,
tensor
.
nnet
.
SoftmaxWithBias
,
tensor
.
nnet
.
Softmax
,
tensor
.
nnet
.
SoftmaxWithBias
,
...
...
theano/sandbox/cuda/tests/test_neighbours.py
浏览文件 @
f423ac63
...
@@ -5,7 +5,7 @@ import theano.sandbox.cuda as cuda_ndarray
...
@@ -5,7 +5,7 @@ import theano.sandbox.cuda as cuda_ndarray
if
cuda_ndarray
.
cuda_available
==
False
:
if
cuda_ndarray
.
cuda_available
==
False
:
raise
SkipTest
(
'Optional package cuda disabled'
)
raise
SkipTest
(
'Optional package cuda disabled'
)
import
theano.
sandbox
.test_neighbours
import
theano.
tensor.nnet.tests
.test_neighbours
from
theano.sandbox.cuda.neighbours
import
GpuImages2Neibs
from
theano.sandbox.cuda.neighbours
import
GpuImages2Neibs
if
theano
.
config
.
mode
==
'FAST_COMPILE'
:
if
theano
.
config
.
mode
==
'FAST_COMPILE'
:
...
@@ -14,7 +14,7 @@ else:
...
@@ -14,7 +14,7 @@ else:
mode_with_gpu
=
theano
.
compile
.
mode
.
get_default_mode
()
.
including
(
'gpu'
)
mode_with_gpu
=
theano
.
compile
.
mode
.
get_default_mode
()
.
including
(
'gpu'
)
class
T_GpuImages2Neibs
(
theano
.
sandbox
.
test_neighbours
.
T_Images2Neibs
):
class
T_GpuImages2Neibs
(
theano
.
tensor
.
nnet
.
tests
.
test_neighbours
.
T_Images2Neibs
):
mode
=
mode_with_gpu
mode
=
mode_with_gpu
op
=
GpuImages2Neibs
op
=
GpuImages2Neibs
dtypes
=
[
'float32'
]
dtypes
=
[
'float32'
]
...
...
theano/sandbox/gpuarray/neighbours.py
浏览文件 @
f423ac63
...
@@ -2,7 +2,7 @@ import numpy
...
@@ -2,7 +2,7 @@ import numpy
from
theano
import
Op
,
Apply
,
config
from
theano
import
Op
,
Apply
,
config
from
theano.gof
import
local_optimizer
from
theano.gof
import
local_optimizer
from
theano.
sandbox
.neighbours
import
Images2Neibs
from
theano.
tensor.nnet
.neighbours
import
Images2Neibs
import
theano.tensor
as
T
import
theano.tensor
as
T
try
:
try
:
...
...
theano/sandbox/gpuarray/tests/test_neighbours.py
浏览文件 @
f423ac63
...
@@ -4,11 +4,11 @@ import unittest
...
@@ -4,11 +4,11 @@ import unittest
from
theano.sandbox.gpuarray.tests.test_basic_ops
import
(
mode_with_gpu
,
from
theano.sandbox.gpuarray.tests.test_basic_ops
import
(
mode_with_gpu
,
mode_without_gpu
)
mode_without_gpu
)
import
theano.
sandbox
.test_neighbours
import
theano.
tensor.nnet.tests
.test_neighbours
from
theano.sandbox.gpuarray.neighbours
import
GpuImages2Neibs
from
theano.sandbox.gpuarray.neighbours
import
GpuImages2Neibs
class
T_GpuImages2Neibs
(
theano
.
sandbox
.
test_neighbours
.
T_Images2Neibs
):
class
T_GpuImages2Neibs
(
theano
.
tensor
.
nnet
.
tests
.
test_neighbours
.
T_Images2Neibs
):
mode
=
mode_with_gpu
mode
=
mode_with_gpu
op
=
GpuImages2Neibs
op
=
GpuImages2Neibs
dtypes
=
[
'int64'
,
'float32'
,
'float64'
]
dtypes
=
[
'int64'
,
'float32'
,
'float64'
]
...
...
theano/sandbox/neighbours.py
浏览文件 @
f423ac63
"""
"""
TODO: implement Images2Neibs.infer_shape() methods
Neighbours was moved into theano.tensor.nnet.neighbours.
This file was created for compatibility.
"""
"""
import
theano
from
theano.tensor.nnet.neighbours
import
(
images2neibs
,
neibs2images
,
from
theano
import
Op
,
Apply
Images2Neibs
)
import
theano.tensor
as
T
\ No newline at end of file
from
theano.gradient
import
grad_not_implemented
from
theano.gradient
import
grad_undefined
import
numpy
class
Images2Neibs
(
Op
):
def
__init__
(
self
,
mode
=
'valid'
):
"""
:type mode: str
:param mode: Possible values:
'valid': Requires an input that is a multiple of the
pooling factor (in each direction)
'ignore_borders': Same as valid, but will ignore the borders
if the shape(s) of the input
is not a multiple of the pooling factor(s)
'wrap_centered' : ?? TODO comment
:return:
Reshapes the input as a 2D tensor where each row is an
pooling example
"""
if
mode
not
in
[
'valid'
,
'wrap_centered'
,
'ignore_borders'
]:
raise
NotImplementedError
(
"Only the mode valid, ignore_borders"
" and wrap_centered have been"
" implemented for the op Images2Neibs"
)
self
.
mode
=
mode
def
__eq__
(
self
,
other
):
return
type
(
self
)
==
type
(
other
)
and
self
.
mode
==
other
.
mode
def
__hash__
(
self
):
return
hash
(
type
(
self
))
^
hash
(
self
.
mode
)
def
__str__
(
self
):
return
self
.
__class__
.
__name__
+
"{
%
s}"
%
self
.
mode
def
__setstate__
(
self
,
d
):
self
.
__dict__
.
update
(
d
)
if
not
hasattr
(
self
,
"mode"
):
self
.
mode
=
'valid'
def
make_node
(
self
,
ten4
,
neib_shape
,
neib_step
=
None
):
"""
:param ten4: a list of lists of images
ten4 is of shape (list 1 dim, list 2 dim,
row, col)
:param neib_shape: (r,c) where r is the height of the neighborhood
in rows and c is the width of the neighborhood
in columns
:param neib_step: (dr,dc) where dr is the number of rows to
skip between patch and dc is the number of
columns. When None, this is the same as
neib_shape(patch are disjoint)
output:
a 2D matrix, written using the following pattern
idx = 0
for i in xrange(list 1 dim)
for j in xrange(list 2 dim)
for k in <image column coordinates>
for l in <image row coordinates>
output[idx,:]
= flattened version of ten4[i,j,l:l+r,k:k+c]
idx += 1
(note: the op isn't necessarily implemented internally with these
for loops, they're just the easiest way to describe the output
pattern)
"""
ten4
=
T
.
as_tensor_variable
(
ten4
)
neib_shape
=
T
.
as_tensor_variable
(
neib_shape
)
if
neib_step
is
None
:
neib_step
=
neib_shape
else
:
neib_step
=
T
.
as_tensor_variable
(
neib_step
)
assert
ten4
.
ndim
==
4
assert
neib_shape
.
ndim
==
1
assert
neib_step
.
ndim
==
1
return
Apply
(
self
,
[
ten4
,
neib_shape
,
neib_step
],
[
T
.
matrix
(
dtype
=
ten4
.
type
.
dtype
)])
def
grad
(
self
,
inp
,
grads
):
x
,
neib_shape
,
neib_step
=
inp
gz
,
=
grads
if
self
.
mode
in
[
'valid'
,
'ignore_borders'
]:
if
(
neib_shape
is
neib_step
or
neib_shape
==
neib_step
or
# Theano Constant == do not compare the data
# the equals function do that.
(
hasattr
(
neib_shape
,
"equals"
)
and
neib_shape
.
equals
(
neib_step
))):
return
[
neibs2images
(
gz
,
neib_shape
,
x
.
shape
,
mode
=
self
.
mode
),
grad_undefined
(
self
,
1
,
neib_shape
),
grad_undefined
(
self
,
2
,
neib_step
)]
return
[
grad_not_implemented
(
self
,
0
,
x
),
grad_undefined
(
self
,
1
,
neib_shape
),
grad_undefined
(
self
,
2
,
neib_step
)]
def
c_code_cache_version
(
self
):
return
(
5
,)
def
perform
(
self
,
node
,
inp
,
out_
):
ten4
,
neib_shape
,
neib_step
=
inp
z
,
=
out_
# GpuImages2Neibs should not run this perform in DebugMode
if
type
(
self
)
!=
Images2Neibs
:
raise
theano
.
gof
.
utils
.
MethodNotDefined
()
def
CEIL_INTDIV
(
a
,
b
):
if
a
%
b
:
return
(
a
//
b
)
+
1
else
:
return
a
//
b
grid_c
=
-
1
# number of patch in height
grid_d
=
-
1
# number of patch in width
assert
ten4
.
ndim
==
4
assert
neib_shape
.
ndim
==
1
assert
neib_shape
.
shape
[
0
]
==
2
assert
neib_step
.
ndim
==
1
assert
neib_step
.
shape
[
0
]
==
2
c
,
d
=
neib_shape
step_x
,
step_y
=
neib_step
mode
=
self
.
mode
if
mode
==
"wrap_centered"
:
if
(
c
%
2
!=
1
)
or
(
d
%
2
!=
1
):
raise
TypeError
(
"Images2Neibs:"
" in mode wrap_centered need patch with odd shapes"
)
if
(
ten4
.
shape
[
2
]
<
c
)
or
(
ten4
.
shape
[
3
]
<
d
):
raise
TypeError
(
"Images2Neibs: in wrap_centered mode, don't support"
" image shapes smaller then the patch shapes:"
" neib_shape=(
%
d,
%
d), ten4[2:]=[
%
d,
%
d]"
%
(
c
,
d
,
ten4
.
shape
[
2
],
ten4
.
shape
[
3
]))
grid_c
=
CEIL_INTDIV
(
ten4
.
shape
[
2
],
step_x
)
grid_d
=
CEIL_INTDIV
(
ten4
.
shape
[
3
],
step_y
)
elif
mode
==
"valid"
:
if
(
ten4
.
shape
[
2
]
<
c
)
or
(((
ten4
.
shape
[
2
]
-
c
)
%
step_x
)
!=
0
):
raise
TypeError
(
"neib_shape[0]=
%
d, neib_step[0]=
%
d and"
" ten4.shape[2]=
%
d not consistent"
%
(
c
,
step_x
,
ten4
.
shape
[
2
]))
if
(
ten4
.
shape
[
3
]
<
d
)
or
(((
ten4
.
shape
[
3
]
-
d
)
%
step_y
)
!=
0
):
raise
TypeError
(
"neib_shape[1]=
%
d, neib_step[1]=
%
d and"
" ten4.shape[3]=
%
d not consistent"
%
(
d
,
step_y
,
ten4
.
shape
[
3
]))
# number of patch in height
grid_c
=
1
+
((
ten4
.
shape
[
2
]
-
c
)
//
step_x
)
# number of patch in width
grid_d
=
1
+
((
ten4
.
shape
[
3
]
-
d
)
//
step_y
)
elif
mode
==
"ignore_borders"
:
# number of patch in height
grid_c
=
1
+
((
ten4
.
shape
[
2
]
-
c
)
//
step_x
)
# number of patch in width
grid_d
=
1
+
((
ten4
.
shape
[
3
]
-
d
)
//
step_y
)
else
:
raise
TypeError
(
"Images2Neibs: unknow mode '
%
s'"
%
mode
)
z_dim0
=
grid_c
*
grid_d
*
ten4
.
shape
[
1
]
*
ten4
.
shape
[
0
]
z_dim1
=
c
*
d
z
[
0
]
=
numpy
.
empty
((
z_dim0
,
z_dim1
),
dtype
=
node
.
outputs
[
0
]
.
dtype
)
nb_batch
=
ten4
.
shape
[
0
]
nb_stack
=
ten4
.
shape
[
1
]
height
=
ten4
.
shape
[
2
]
width
=
ten4
.
shape
[
3
]
wrap_centered_idx_shift_x
=
c
//
2
wrap_centered_idx_shift_y
=
d
//
2
for
n
in
range
(
nb_batch
):
for
s
in
range
(
nb_stack
):
# loop over the number of patch in height
for
a
in
range
(
grid_c
):
# loop over the number of patch in width
for
b
in
range
(
grid_d
):
z_row
=
b
+
grid_d
*
(
a
+
grid_c
*
(
s
+
nb_stack
*
n
))
for
i
in
range
(
c
):
ten4_2
=
i
+
a
*
step_x
if
mode
==
"wrap_centered"
:
ten4_2
-=
wrap_centered_idx_shift_x
if
ten4_2
<
0
:
ten4_2
+=
height
elif
ten4_2
>=
height
:
ten4_2
-=
height
for
j
in
range
(
d
):
ten4_3
=
j
+
b
*
step_y
if
mode
==
"wrap_centered"
:
ten4_3
-=
wrap_centered_idx_shift_y
if
ten4_3
<
0
:
ten4_3
+=
width
elif
ten4_3
>=
width
:
ten4_3
-=
width
z_col
=
j
+
d
*
i
z
[
0
][
z_row
,
z_col
]
=
ten4
[
n
,
s
,
ten4_2
,
ten4_3
]
def
c_code
(
self
,
node
,
name
,
inp
,
out
,
sub
):
ten4
,
neib_shape
,
neib_step
=
inp
z
,
=
out
fail
=
sub
[
'fail'
]
mode
=
self
.
mode
return
"""
#ifndef CEIL_INTDIV
#define CEIL_INTDIV(a, b) ((a/b) + ((a
%%
b) ? 1: 0))
#endif
int grid_c = -1; //number of patch in height
int grid_d = -1; //number of patch in width
{
if (PyArray_NDIM(
%(ten4)
s) != 4)
{
PyErr_Format(PyExc_TypeError, "ten4 wrong rank");
%(fail)
s;
}
if (PyArray_NDIM(
%(neib_shape)
s) != 1)
{
PyErr_Format(PyExc_TypeError, "neib_shape wrong rank");
%(fail)
s;
}
if ( (PyArray_DIMS(
%(neib_shape)
s))[0] != 2)
{
PyErr_Format(PyExc_TypeError, "neib_shape wrong shape ; has to"
" contain 2 elements");
%(fail)
s;
}
if (PyArray_NDIM(
%(neib_step)
s) != 1)
{
PyErr_Format(PyExc_TypeError, "neib_step wrong rank");
%(fail)
s;
}
if ( (PyArray_DIMS(
%(neib_step)
s))[0] != 2)
{
PyErr_Format(PyExc_TypeError,
"neib_step wrong step ; has to contain 2 elements");
%(fail)
s;
}
// (c,d) = neib_shape
const npy_intp c = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 0);
const npy_intp d = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 1);
// (step_x,step_y) = neib_step
const npy_intp step_x = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 0);
const npy_intp step_y = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 1);
if ( "
%(mode)
s" == "wrap_centered") {
if (c
%%2
!=1 || d
%%2
!=1){
PyErr_Format(PyExc_TypeError,
"Images2Neibs: in mode wrap_centered"
" need patch with odd shapes");
%(fail)
s;
}
if ( (PyArray_DIMS(
%(ten4)
s))[2] < c ||
(PyArray_DIMS(
%(ten4)
s))[3] < d)
{
PyErr_Format(PyExc_TypeError,
"Images2Neibs: in wrap_centered mode, don't support image"
" shapes smaller then the patch shapes:"
" neib_shape=(
%%
ld,
%%
ld), ten4[2:]=[
%%
ld,
%%
ld]",
(long int)c, (long int)d,
(long int)(PyArray_DIMS(
%(ten4)
s)[2]),
(long int)(PyArray_DIMS(
%(ten4)
s)[3]));
%(fail)
s;
}
grid_c = CEIL_INTDIV(((PyArray_DIMS(
%(ten4)
s))[2]),step_x);
grid_d = CEIL_INTDIV(((PyArray_DIMS(
%(ten4)
s))[3]),step_y);
}else if ( "
%(mode)
s" == "valid") {
if ( ((PyArray_DIMS(
%(ten4)
s))[2] < c) ||
( (((PyArray_DIMS(
%(ten4)
s))[2]-c)
%%
step_x)!=0))
{
PyErr_Format(PyExc_TypeError,
"neib_shape[0]=
%%
ld, neib_step[0]=
%%
ld and"
" ten4.shape[2]=
%%
ld not consistent",
(long int)c, (long int)step_x,
(long int)(PyArray_DIMS(
%(ten4)
s)[2]));
%(fail)
s;
}
if ( ((PyArray_DIMS(
%(ten4)
s))[3] < d) ||
( (((PyArray_DIMS(
%(ten4)
s))[3]-d)
%%
step_y)!=0))
{
PyErr_Format(PyExc_TypeError,
"neib_shape[1]=
%%
ld, neib_step[1]=
%%
ld and"
" ten4.shape[3]=
%%
ld not consistent",
(long int)d, (long int)step_y,
(long int)(PyArray_DIMS(
%(ten4)
s)[3]));
%(fail)
s;
}
//number of patch in height
grid_c = 1+(((PyArray_DIMS(
%(ten4)
s))[2]-c)/step_x);
//number of patch in width
grid_d = 1+(((PyArray_DIMS(
%(ten4)
s))[3]-d)/step_y);
}else if ( "
%(mode)
s" == "ignore_borders") {
//number of patch in height
grid_c = 1+(((PyArray_DIMS(
%(ten4)
s))[2]-c)/step_x);
//number of patch in width
grid_d = 1+(((PyArray_DIMS(
%(ten4)
s))[3]-d)/step_y);
}else{
PyErr_Format(PyExc_TypeError,
"Images2Neibs: unknow mode '
%(mode)
s'");
%(fail)
s;
}
// new dimensions for z
const npy_intp z_dim1 = c * d;
const npy_intp z_dim0 = grid_c
* grid_d
* (PyArray_DIMS(
%(ten4)
s))[1]
* (PyArray_DIMS(
%(ten4)
s))[0];
if ((NULL ==
%(z)
s)
|| ((PyArray_DIMS(
%(z)
s))[0] != z_dim0 )
|| ((PyArray_DIMS(
%(z)
s))[1] != z_dim1 )
)
{
Py_XDECREF(
%(z)
s);
npy_intp dims[2];
dims[0] = z_dim0;
dims[1] = z_dim1;
%(z)
s = (PyArrayObject*) PyArray_EMPTY(2,
dims,
PyArray_TYPE((PyArrayObject*) py_
%(ten4)
s),
0);
if (!
%(z)
s)
{
PyErr_SetString(PyExc_MemoryError, "failed to alloc z output");
%(fail)
s;
}
}
}
{ // NESTED SCOPE
const int nb_batch = (PyArray_DIMS(
%(ten4)
s))[0];
const int nb_stack = (PyArray_DIMS(
%(ten4)
s))[1];
const int height = (PyArray_DIMS(
%(ten4)
s))[2];
const int width = (PyArray_DIMS(
%(ten4)
s))[3];
// (c,d) = neib_shape
const npy_intp c = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 0);
const npy_intp d = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 1);
// (step_x,step_y) = neib_step
const npy_intp step_x = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 0);
const npy_intp step_y = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 1);
const int wrap_centered_idx_shift_x = c/2;
const int wrap_centered_idx_shift_y = d/2;
// Oh this is messed up...
for (int n = 0; n < nb_batch; n++) // loop over batches
for (int s = 0; s < nb_stack; s++) // loop over stacks
for (int a = 0; a < grid_c; a++) // loop over the number of patch in height
for (int b = 0; b < grid_d; b++) // loop over the number of patch in width
{
int z_row = b + grid_d*(a + grid_c*(s + nb_stack*n));
for (int i = 0; i < c; i++) // loop over c
{
int ten4_2 = i + a * step_x;
if ( "
%(mode)
s" == "wrap_centered" ){
ten4_2 -= wrap_centered_idx_shift_x;
if ( ten4_2 < 0 ) ten4_2 += height;
else if (ten4_2 >= height) ten4_2 -= height;
}
for (int j = 0; j < d; j++) // loop over d
{
int ten4_3 = j + b * step_y;
if ( "
%(mode)
s" == "wrap_centered" ){
ten4_3 -= wrap_centered_idx_shift_y;
if ( ten4_3 < 0 ) ten4_3 += width;
else if (ten4_3 >= width) ten4_3 -= width;
}
int z_col = j + d * i;
dtype_
%(z)
s* curr_z = (dtype_
%(z)
s*) PyArray_GETPTR2(
%(z)
s, z_row, z_col);
*curr_z = *( (dtype_
%(ten4)
s*) PyArray_GETPTR4(
%(ten4)
s, n, s, ten4_2, ten4_3));
//printf("
\\
n(
%%
i,
%%
i,
%%
i,
%%
i) --> (
%%
i,
%%
i)",
// n, s, ten4_2, ten4_3, z_row, z_col);
//printf("
%%
f ", *curr_z);
}
}
}
} // END NESTED SCOPE
"""
%
locals
()
def
images2neibs
(
ten4
,
neib_shape
,
neib_step
=
None
,
mode
=
'valid'
):
"""
:param ten4: a list of lists of images
ten4 is of shape (list 1 dim, list 2 dim,
row, col)
:type ten4: A 4d tensor-like.
:param neib_shape: (r,c) where r is the height of the neighborhood
in rows and c is the width of the neighborhood
in columns
:type neib_shape: A 1d tensor-like of 2 values.
:param neib_step: (dr,dc) where dr is the number of rows to
skip between patch and dc is the number of
columns. When None, this is the same as
neib_shape(patch are disjoint)
:type neib_step: A 1d tensor-like of 2 values.
:param mode:
Possible values:
``valid``
Requires an input that is a multiple of the
pooling factor (in each direction)
``ignore_borders``
Same as valid, but will ignore the borders
if the shape(s) of the input
is not a multiple of the pooling factor(s)
``wrap_centered``
?? TODO comment
:type mode: str
:return:
Reshapes the input as a 2D tensor where each row is an
pooling example. Pseudo-code of the output:
.. code-block:: python
idx = 0
for i in xrange(list 1 dim)
for j in xrange(list 2 dim)
for k in <image column coordinates>
for l in <image row coordinates>
output[idx,:]
= flattened version of ten4[i,j,l:l+r,k:k+c]
idx += 1
(note: the op isn't necessarily implemented internally with these
for loops, they're just the easiest way to describe the output
pattern)
"""
return
Images2Neibs
(
mode
)(
ten4
,
neib_shape
,
neib_step
)
def
neibs2images
(
neibs
,
neib_shape
,
original_shape
,
mode
=
'valid'
):
"""
Inverse of images2neib.
:param neibs: matrix like the one obtained by images2neib
:param neib_shape: neib_shape that was used in images2neib
:param original_shape: original shape of the 4d tensor given to images2neib
:return: Return a 4d tensor of shape `original_shape`.
"""
neibs
=
T
.
as_tensor_variable
(
neibs
)
neib_shape
=
T
.
as_tensor_variable
(
neib_shape
)
original_shape
=
T
.
as_tensor_variable
(
original_shape
)
new_neib_shape
=
T
.
stack
(
original_shape
[
-
1
]
//
neib_shape
[
1
],
neib_shape
[
1
])
output_2d
=
images2neibs
(
neibs
.
dimshuffle
(
'x'
,
'x'
,
0
,
1
),
new_neib_shape
,
mode
=
mode
)
if
mode
==
'ignore_borders'
:
valid_shape
=
list
(
original_shape
)
valid_shape
[
2
]
=
(
valid_shape
[
2
]
//
neib_shape
[
0
])
*
neib_shape
[
0
]
valid_shape
[
3
]
=
(
valid_shape
[
3
]
//
neib_shape
[
1
])
*
neib_shape
[
1
]
output_4d
=
output_2d
.
reshape
(
valid_shape
)
#padding the borders with zeros
for
d
in
[
2
,
3
]:
pad_shape
=
list
(
output_4d
.
shape
)
pad_shape
[
d
]
=
original_shape
[
d
]
-
valid_shape
[
d
]
output_4d
=
T
.
concatenate
([
output_4d
,
T
.
zeros
(
pad_shape
)],
axis
=
d
)
elif
mode
==
'valid'
:
# TODO: we do not implement all mode with this code.
# Add a check for the good cases.
output_4d
=
output_2d
.
reshape
(
original_shape
)
else
:
raise
NotImplementedError
(
"neibs2images do not support mode=
%
s"
%
mode
)
return
output_4d
theano/tensor/nnet/neighbours.py
0 → 100644
浏览文件 @
f423ac63
"""
TODO: implement Images2Neibs.infer_shape() methods
"""
import
theano
from
theano
import
Op
,
Apply
import
theano.tensor
as
T
from
theano.gradient
import
grad_not_implemented
from
theano.gradient
import
grad_undefined
import
numpy
class
Images2Neibs
(
Op
):
def
__init__
(
self
,
mode
=
'valid'
):
"""
:type mode: str
:param mode: Possible values:
'valid': Requires an input that is a multiple of the
pooling factor (in each direction)
'ignore_borders': Same as valid, but will ignore the borders
if the shape(s) of the input
is not a multiple of the pooling factor(s)
'wrap_centered' : ?? TODO comment
:return:
Reshapes the input as a 2D tensor where each row is an
pooling example
"""
if
mode
not
in
[
'valid'
,
'wrap_centered'
,
'ignore_borders'
]:
raise
NotImplementedError
(
"Only the mode valid, ignore_borders"
" and wrap_centered have been"
" implemented for the op Images2Neibs"
)
self
.
mode
=
mode
def
__eq__
(
self
,
other
):
return
type
(
self
)
==
type
(
other
)
and
self
.
mode
==
other
.
mode
def
__hash__
(
self
):
return
hash
(
type
(
self
))
^
hash
(
self
.
mode
)
def
__str__
(
self
):
return
self
.
__class__
.
__name__
+
"{
%
s}"
%
self
.
mode
def
__setstate__
(
self
,
d
):
self
.
__dict__
.
update
(
d
)
if
not
hasattr
(
self
,
"mode"
):
self
.
mode
=
'valid'
def
make_node
(
self
,
ten4
,
neib_shape
,
neib_step
=
None
):
"""
:param ten4: a list of lists of images
ten4 is of shape (list 1 dim, list 2 dim,
row, col)
:param neib_shape: (r,c) where r is the height of the neighborhood
in rows and c is the width of the neighborhood
in columns
:param neib_step: (dr,dc) where dr is the number of rows to
skip between patch and dc is the number of
columns. When None, this is the same as
neib_shape(patch are disjoint)
output:
a 2D matrix, written using the following pattern
idx = 0
for i in xrange(list 1 dim)
for j in xrange(list 2 dim)
for k in <image column coordinates>
for l in <image row coordinates>
output[idx,:]
= flattened version of ten4[i,j,l:l+r,k:k+c]
idx += 1
(note: the op isn't necessarily implemented internally with these
for loops, they're just the easiest way to describe the output
pattern)
"""
ten4
=
T
.
as_tensor_variable
(
ten4
)
neib_shape
=
T
.
as_tensor_variable
(
neib_shape
)
if
neib_step
is
None
:
neib_step
=
neib_shape
else
:
neib_step
=
T
.
as_tensor_variable
(
neib_step
)
assert
ten4
.
ndim
==
4
assert
neib_shape
.
ndim
==
1
assert
neib_step
.
ndim
==
1
return
Apply
(
self
,
[
ten4
,
neib_shape
,
neib_step
],
[
T
.
matrix
(
dtype
=
ten4
.
type
.
dtype
)])
def
grad
(
self
,
inp
,
grads
):
x
,
neib_shape
,
neib_step
=
inp
gz
,
=
grads
if
self
.
mode
in
[
'valid'
,
'ignore_borders'
]:
if
(
neib_shape
is
neib_step
or
neib_shape
==
neib_step
or
# Theano Constant == do not compare the data
# the equals function do that.
(
hasattr
(
neib_shape
,
"equals"
)
and
neib_shape
.
equals
(
neib_step
))):
return
[
neibs2images
(
gz
,
neib_shape
,
x
.
shape
,
mode
=
self
.
mode
),
grad_undefined
(
self
,
1
,
neib_shape
),
grad_undefined
(
self
,
2
,
neib_step
)]
return
[
grad_not_implemented
(
self
,
0
,
x
),
grad_undefined
(
self
,
1
,
neib_shape
),
grad_undefined
(
self
,
2
,
neib_step
)]
def
c_code_cache_version
(
self
):
return
(
5
,)
def
perform
(
self
,
node
,
inp
,
out_
):
ten4
,
neib_shape
,
neib_step
=
inp
z
,
=
out_
# GpuImages2Neibs should not run this perform in DebugMode
if
type
(
self
)
!=
Images2Neibs
:
raise
theano
.
gof
.
utils
.
MethodNotDefined
()
def
CEIL_INTDIV
(
a
,
b
):
if
a
%
b
:
return
(
a
//
b
)
+
1
else
:
return
a
//
b
grid_c
=
-
1
# number of patch in height
grid_d
=
-
1
# number of patch in width
assert
ten4
.
ndim
==
4
assert
neib_shape
.
ndim
==
1
assert
neib_shape
.
shape
[
0
]
==
2
assert
neib_step
.
ndim
==
1
assert
neib_step
.
shape
[
0
]
==
2
c
,
d
=
neib_shape
step_x
,
step_y
=
neib_step
mode
=
self
.
mode
if
mode
==
"wrap_centered"
:
if
(
c
%
2
!=
1
)
or
(
d
%
2
!=
1
):
raise
TypeError
(
"Images2Neibs:"
" in mode wrap_centered need patch with odd shapes"
)
if
(
ten4
.
shape
[
2
]
<
c
)
or
(
ten4
.
shape
[
3
]
<
d
):
raise
TypeError
(
"Images2Neibs: in wrap_centered mode, don't support"
" image shapes smaller then the patch shapes:"
" neib_shape=(
%
d,
%
d), ten4[2:]=[
%
d,
%
d]"
%
(
c
,
d
,
ten4
.
shape
[
2
],
ten4
.
shape
[
3
]))
grid_c
=
CEIL_INTDIV
(
ten4
.
shape
[
2
],
step_x
)
grid_d
=
CEIL_INTDIV
(
ten4
.
shape
[
3
],
step_y
)
elif
mode
==
"valid"
:
if
(
ten4
.
shape
[
2
]
<
c
)
or
(((
ten4
.
shape
[
2
]
-
c
)
%
step_x
)
!=
0
):
raise
TypeError
(
"neib_shape[0]=
%
d, neib_step[0]=
%
d and"
" ten4.shape[2]=
%
d not consistent"
%
(
c
,
step_x
,
ten4
.
shape
[
2
]))
if
(
ten4
.
shape
[
3
]
<
d
)
or
(((
ten4
.
shape
[
3
]
-
d
)
%
step_y
)
!=
0
):
raise
TypeError
(
"neib_shape[1]=
%
d, neib_step[1]=
%
d and"
" ten4.shape[3]=
%
d not consistent"
%
(
d
,
step_y
,
ten4
.
shape
[
3
]))
# number of patch in height
grid_c
=
1
+
((
ten4
.
shape
[
2
]
-
c
)
//
step_x
)
# number of patch in width
grid_d
=
1
+
((
ten4
.
shape
[
3
]
-
d
)
//
step_y
)
elif
mode
==
"ignore_borders"
:
# number of patch in height
grid_c
=
1
+
((
ten4
.
shape
[
2
]
-
c
)
//
step_x
)
# number of patch in width
grid_d
=
1
+
((
ten4
.
shape
[
3
]
-
d
)
//
step_y
)
else
:
raise
TypeError
(
"Images2Neibs: unknow mode '
%
s'"
%
mode
)
z_dim0
=
grid_c
*
grid_d
*
ten4
.
shape
[
1
]
*
ten4
.
shape
[
0
]
z_dim1
=
c
*
d
z
[
0
]
=
numpy
.
empty
((
z_dim0
,
z_dim1
),
dtype
=
node
.
outputs
[
0
]
.
dtype
)
nb_batch
=
ten4
.
shape
[
0
]
nb_stack
=
ten4
.
shape
[
1
]
height
=
ten4
.
shape
[
2
]
width
=
ten4
.
shape
[
3
]
wrap_centered_idx_shift_x
=
c
//
2
wrap_centered_idx_shift_y
=
d
//
2
for
n
in
range
(
nb_batch
):
for
s
in
range
(
nb_stack
):
# loop over the number of patch in height
for
a
in
range
(
grid_c
):
# loop over the number of patch in width
for
b
in
range
(
grid_d
):
z_row
=
b
+
grid_d
*
(
a
+
grid_c
*
(
s
+
nb_stack
*
n
))
for
i
in
range
(
c
):
ten4_2
=
i
+
a
*
step_x
if
mode
==
"wrap_centered"
:
ten4_2
-=
wrap_centered_idx_shift_x
if
ten4_2
<
0
:
ten4_2
+=
height
elif
ten4_2
>=
height
:
ten4_2
-=
height
for
j
in
range
(
d
):
ten4_3
=
j
+
b
*
step_y
if
mode
==
"wrap_centered"
:
ten4_3
-=
wrap_centered_idx_shift_y
if
ten4_3
<
0
:
ten4_3
+=
width
elif
ten4_3
>=
width
:
ten4_3
-=
width
z_col
=
j
+
d
*
i
z
[
0
][
z_row
,
z_col
]
=
ten4
[
n
,
s
,
ten4_2
,
ten4_3
]
def
c_code
(
self
,
node
,
name
,
inp
,
out
,
sub
):
ten4
,
neib_shape
,
neib_step
=
inp
z
,
=
out
fail
=
sub
[
'fail'
]
mode
=
self
.
mode
return
"""
#ifndef CEIL_INTDIV
#define CEIL_INTDIV(a, b) ((a/b) + ((a
%%
b) ? 1: 0))
#endif
int grid_c = -1; //number of patch in height
int grid_d = -1; //number of patch in width
{
if (PyArray_NDIM(
%(ten4)
s) != 4)
{
PyErr_Format(PyExc_TypeError, "ten4 wrong rank");
%(fail)
s;
}
if (PyArray_NDIM(
%(neib_shape)
s) != 1)
{
PyErr_Format(PyExc_TypeError, "neib_shape wrong rank");
%(fail)
s;
}
if ( (PyArray_DIMS(
%(neib_shape)
s))[0] != 2)
{
PyErr_Format(PyExc_TypeError, "neib_shape wrong shape ; has to"
" contain 2 elements");
%(fail)
s;
}
if (PyArray_NDIM(
%(neib_step)
s) != 1)
{
PyErr_Format(PyExc_TypeError, "neib_step wrong rank");
%(fail)
s;
}
if ( (PyArray_DIMS(
%(neib_step)
s))[0] != 2)
{
PyErr_Format(PyExc_TypeError,
"neib_step wrong step ; has to contain 2 elements");
%(fail)
s;
}
// (c,d) = neib_shape
const npy_intp c = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 0);
const npy_intp d = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 1);
// (step_x,step_y) = neib_step
const npy_intp step_x = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 0);
const npy_intp step_y = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 1);
if ( "
%(mode)
s" == "wrap_centered") {
if (c
%%2
!=1 || d
%%2
!=1){
PyErr_Format(PyExc_TypeError,
"Images2Neibs: in mode wrap_centered"
" need patch with odd shapes");
%(fail)
s;
}
if ( (PyArray_DIMS(
%(ten4)
s))[2] < c ||
(PyArray_DIMS(
%(ten4)
s))[3] < d)
{
PyErr_Format(PyExc_TypeError,
"Images2Neibs: in wrap_centered mode, don't support image"
" shapes smaller then the patch shapes:"
" neib_shape=(
%%
ld,
%%
ld), ten4[2:]=[
%%
ld,
%%
ld]",
(long int)c, (long int)d,
(long int)(PyArray_DIMS(
%(ten4)
s)[2]),
(long int)(PyArray_DIMS(
%(ten4)
s)[3]));
%(fail)
s;
}
grid_c = CEIL_INTDIV(((PyArray_DIMS(
%(ten4)
s))[2]),step_x);
grid_d = CEIL_INTDIV(((PyArray_DIMS(
%(ten4)
s))[3]),step_y);
}else if ( "
%(mode)
s" == "valid") {
if ( ((PyArray_DIMS(
%(ten4)
s))[2] < c) ||
( (((PyArray_DIMS(
%(ten4)
s))[2]-c)
%%
step_x)!=0))
{
PyErr_Format(PyExc_TypeError,
"neib_shape[0]=
%%
ld, neib_step[0]=
%%
ld and"
" ten4.shape[2]=
%%
ld not consistent",
(long int)c, (long int)step_x,
(long int)(PyArray_DIMS(
%(ten4)
s)[2]));
%(fail)
s;
}
if ( ((PyArray_DIMS(
%(ten4)
s))[3] < d) ||
( (((PyArray_DIMS(
%(ten4)
s))[3]-d)
%%
step_y)!=0))
{
PyErr_Format(PyExc_TypeError,
"neib_shape[1]=
%%
ld, neib_step[1]=
%%
ld and"
" ten4.shape[3]=
%%
ld not consistent",
(long int)d, (long int)step_y,
(long int)(PyArray_DIMS(
%(ten4)
s)[3]));
%(fail)
s;
}
//number of patch in height
grid_c = 1+(((PyArray_DIMS(
%(ten4)
s))[2]-c)/step_x);
//number of patch in width
grid_d = 1+(((PyArray_DIMS(
%(ten4)
s))[3]-d)/step_y);
}else if ( "
%(mode)
s" == "ignore_borders") {
//number of patch in height
grid_c = 1+(((PyArray_DIMS(
%(ten4)
s))[2]-c)/step_x);
//number of patch in width
grid_d = 1+(((PyArray_DIMS(
%(ten4)
s))[3]-d)/step_y);
}else{
PyErr_Format(PyExc_TypeError,
"Images2Neibs: unknow mode '
%(mode)
s'");
%(fail)
s;
}
// new dimensions for z
const npy_intp z_dim1 = c * d;
const npy_intp z_dim0 = grid_c
* grid_d
* (PyArray_DIMS(
%(ten4)
s))[1]
* (PyArray_DIMS(
%(ten4)
s))[0];
if ((NULL ==
%(z)
s)
|| ((PyArray_DIMS(
%(z)
s))[0] != z_dim0 )
|| ((PyArray_DIMS(
%(z)
s))[1] != z_dim1 )
)
{
Py_XDECREF(
%(z)
s);
npy_intp dims[2];
dims[0] = z_dim0;
dims[1] = z_dim1;
%(z)
s = (PyArrayObject*) PyArray_EMPTY(2,
dims,
PyArray_TYPE((PyArrayObject*) py_
%(ten4)
s),
0);
if (!
%(z)
s)
{
PyErr_SetString(PyExc_MemoryError, "failed to alloc z output");
%(fail)
s;
}
}
}
{ // NESTED SCOPE
const int nb_batch = (PyArray_DIMS(
%(ten4)
s))[0];
const int nb_stack = (PyArray_DIMS(
%(ten4)
s))[1];
const int height = (PyArray_DIMS(
%(ten4)
s))[2];
const int width = (PyArray_DIMS(
%(ten4)
s))[3];
// (c,d) = neib_shape
const npy_intp c = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 0);
const npy_intp d = (npy_intp) *(dtype_
%(neib_shape)
s*) PyArray_GETPTR1(
%(neib_shape)
s, 1);
// (step_x,step_y) = neib_step
const npy_intp step_x = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 0);
const npy_intp step_y = (npy_intp) *(dtype_
%(neib_step)
s*) PyArray_GETPTR1(
%(neib_step)
s, 1);
const int wrap_centered_idx_shift_x = c/2;
const int wrap_centered_idx_shift_y = d/2;
// Oh this is messed up...
for (int n = 0; n < nb_batch; n++) // loop over batches
for (int s = 0; s < nb_stack; s++) // loop over stacks
for (int a = 0; a < grid_c; a++) // loop over the number of patch in height
for (int b = 0; b < grid_d; b++) // loop over the number of patch in width
{
int z_row = b + grid_d*(a + grid_c*(s + nb_stack*n));
for (int i = 0; i < c; i++) // loop over c
{
int ten4_2 = i + a * step_x;
if ( "
%(mode)
s" == "wrap_centered" ){
ten4_2 -= wrap_centered_idx_shift_x;
if ( ten4_2 < 0 ) ten4_2 += height;
else if (ten4_2 >= height) ten4_2 -= height;
}
for (int j = 0; j < d; j++) // loop over d
{
int ten4_3 = j + b * step_y;
if ( "
%(mode)
s" == "wrap_centered" ){
ten4_3 -= wrap_centered_idx_shift_y;
if ( ten4_3 < 0 ) ten4_3 += width;
else if (ten4_3 >= width) ten4_3 -= width;
}
int z_col = j + d * i;
dtype_
%(z)
s* curr_z = (dtype_
%(z)
s*) PyArray_GETPTR2(
%(z)
s, z_row, z_col);
*curr_z = *( (dtype_
%(ten4)
s*) PyArray_GETPTR4(
%(ten4)
s, n, s, ten4_2, ten4_3));
//printf("
\\
n(
%%
i,
%%
i,
%%
i,
%%
i) --> (
%%
i,
%%
i)",
// n, s, ten4_2, ten4_3, z_row, z_col);
//printf("
%%
f ", *curr_z);
}
}
}
} // END NESTED SCOPE
"""
%
locals
()
def
images2neibs
(
ten4
,
neib_shape
,
neib_step
=
None
,
mode
=
'valid'
):
"""
Function :func:`images2neibs <theano.sandbox.neighbours.images2neibs>`
allows to apply a sliding window operation to a tensor containing
images
or other two-dimensional objects.
The sliding window operation loops
over points in input data and stores a rectangular neighbourhood of
each point.
It is possible to assign a step of selecting patches (parameter
`neib_step`).
:param ten4: A 4-dimensional tensor which represents
a list of lists of images.a list of lists of images.
It should have shape (list 1 dim, list 2 dim,
row, col). The first two dimensions can be
useful to store different channels and batches.
:type ten4: A 4d tensor-like.
:param neib_shape: A tuple containing two
values: height and width of the neighbourhood.
It should have shape (r,c) where r is the height of the
neighborhood in rows and c is the width of the neighborhood
in columns
:type neib_shape: A 1d tensor-like of 2 values.
:param neib_step: (dr,dc) where dr is the number of rows to
skip between patch and dc is the number of
columns. The parameter should be a tuple of two elements:
number
of rows and number of columns to skip each iteration.
Basically, when the step is 1, the neighbourhood of every
first element is taken and every possible rectangular
subset is returned. By default it is equal to
`neib_shape` in other words, the
patches are disjoint. When the step is greater than
`neib_shape`, some elements are omitted. When None, this
is the same as
neib_shape(patch are disjoint)
.. note:: Currently the step size should be chosen in the way that the
corresponding dimension :math:`i` (width or height) is equal to
:math:`n * step
\
_size_i + neib
\
_shape_i` for some :math:`n`
:type neib_step: A 1d tensor-like of 2 values.
:param mode:
Possible values:
``valid``
Requires an input that is a multiple of the
pooling factor (in each direction)
``ignore_borders``
Same as valid, but will ignore the borders
if the shape(s) of the input
is not a multiple of the pooling factor(s)
``wrap_centered``
?? TODO comment
:type mode: str
:return:
Reshapes the input as a 2D tensor where each row is an
pooling example. Pseudo-code of the output:
.. code-block:: python
idx = 0
for i in xrange(list 1 dim):
for j in xrange(list 2 dim):
for k in <image column coordinates>:
for l in <image row coordinates>:
output[idx,:]
= flattened version of ten4[i,j,l:l+r,k:k+c]
idx += 1
.. note:: The operation isn't necessarily implemented internally with
these for loops, they're just the easiest way to describe the
output pattern.
Example:
.. code-block:: python
# Defining variables
images = T.tensor4('images')
neibs = images2neibs(images, neib_shape=(5, 5))
# Constructing theano function
window_function = theano.function([images], neibs)
# Input tensor (one image 10x10)
im_val = np.arange(100.).reshape((1, 1, 10, 10))
# Function application
neibs_val = window_function(im_val)
.. note:: The underlying code will construct a 2D tensor of disjoint
patches 5x5. The output has shape 4x25.
"""
return
Images2Neibs
(
mode
)(
ten4
,
neib_shape
,
neib_step
)
def
neibs2images
(
neibs
,
neib_shape
,
original_shape
,
mode
=
'valid'
):
"""
Function :func:`neibs2images <theano.sandbox.neighbours.neibs2images>`
performs the inverse operation of
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>`. It inputs
the output of :func:`images2neibs <theano.sandbox.neigbours.neibs2images>`
and reconstructs its input.
:param neibs: matrix like the one obtained by
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>`
:param neib_shape: `neib_shape` that was used in
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>`
:param original_shape: original shape of the 4d tensor given to
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>`
:return: Reconstructs the input of
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>`,
a 4d tensor of shape `original_shape`.
.. note:: Currently, the function doesn't support tensors created with
`neib_step` different from default value. This means that it may be
impossible to compute the gradient of a variable gained by
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>` w.r.t.
its inputs in this case, because it uses
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>` for
gradient computation.
Example, which uses a tensor gained in example for
:func:`images2neibs <theano.sandbox.neigbours.neibs2images>`:
.. code-block:: python
im_new = neibs2images(neibs, (5, 5), im_val.shape)
# Theano function definition
inv_window = theano.function([neibs], im_new)
# Function application
im_new_val = inv_window(neibs_val)
.. note:: The code will output the initial image array.
"""
neibs
=
T
.
as_tensor_variable
(
neibs
)
neib_shape
=
T
.
as_tensor_variable
(
neib_shape
)
original_shape
=
T
.
as_tensor_variable
(
original_shape
)
new_neib_shape
=
T
.
stack
(
original_shape
[
-
1
]
//
neib_shape
[
1
],
neib_shape
[
1
])
output_2d
=
images2neibs
(
neibs
.
dimshuffle
(
'x'
,
'x'
,
0
,
1
),
new_neib_shape
,
mode
=
mode
)
if
mode
==
'ignore_borders'
:
valid_shape
=
list
(
original_shape
)
valid_shape
[
2
]
=
(
valid_shape
[
2
]
//
neib_shape
[
0
])
*
neib_shape
[
0
]
valid_shape
[
3
]
=
(
valid_shape
[
3
]
//
neib_shape
[
1
])
*
neib_shape
[
1
]
output_4d
=
output_2d
.
reshape
(
valid_shape
)
#padding the borders with zeros
for
d
in
[
2
,
3
]:
pad_shape
=
list
(
output_4d
.
shape
)
pad_shape
[
d
]
=
original_shape
[
d
]
-
valid_shape
[
d
]
output_4d
=
T
.
concatenate
([
output_4d
,
T
.
zeros
(
pad_shape
)],
axis
=
d
)
elif
mode
==
'valid'
:
# TODO: we do not implement all mode with this code.
# Add a check for the good cases.
output_4d
=
output_2d
.
reshape
(
original_shape
)
else
:
raise
NotImplementedError
(
"neibs2images do not support mode=
%
s"
%
mode
)
return
output_4d
theano/
sandbox
/test_neighbours.py
→
theano/
tensor/nnet/tests
/test_neighbours.py
浏览文件 @
f423ac63
...
@@ -6,7 +6,7 @@ import theano
...
@@ -6,7 +6,7 @@ import theano
from
theano
import
shared
,
function
from
theano
import
shared
,
function
from
theano.gof.python25
import
any
from
theano.gof.python25
import
any
import
theano.tensor
as
T
import
theano.tensor
as
T
from
neighbours
import
images2neibs
,
neibs2images
,
Images2Neibs
from
theano.tensor.nnet.
neighbours
import
images2neibs
,
neibs2images
,
Images2Neibs
from
theano.tests
import
unittest_tools
from
theano.tests
import
unittest_tools
...
...
编写
预览
Markdown
格式
0%
重试
或
添加新文件
添加附件
取消
您添加了
0
人
到此讨论。请谨慎行事。
请先完成此评论的编辑!
取消
请
注册
或者
登录
后发表评论