Skip to content

Commit

Permalink
Merge pull request #22 from JuliaImages/teh/no-widening
Browse files Browse the repository at this point in the history
Detect overflow, but don't widen by default
  • Loading branch information
timholy authored Feb 11, 2017
2 parents 5aeae13 + 17ca2cc commit d2ab807
Show file tree
Hide file tree
Showing 4 changed files with 65 additions and 28 deletions.
67 changes: 42 additions & 25 deletions src/imfilter.jl
Original file line number Diff line number Diff line change
Expand Up @@ -140,7 +140,25 @@ function imfilter!(out::AbstractArray, img::AbstractArray, kernel::ProcessedKern
end

function imfilter!(out::AbstractArray, img::AbstractArray, kernel::ProcessedKernel, border::BorderSpecAny, alg::Alg)
imfilter!(default_resource(alg_defaults(alg, out, kernel)), out, img, kernel, border)
local ret
try
ret = imfilter!(default_resource(alg_defaults(alg, out, kernel)), out, img, kernel, border)
catch err
if isa(err, InexactError)
Tw = Float64
if eltype(img) <: Integer
try
# If a type doesn't support widen, it would be bad
# if our attempt to be helpful triggered a
# completely different error...
Tw = widen(eltype(img))
end
end
warn("Likely overflow or conversion error detected. Consider specifying the output type, e.g., `imfilter($Tw, img, kernel, ...)`")
end
rethrow(err)
end
ret
end

"""
Expand Down Expand Up @@ -494,7 +512,7 @@ function _imfilter_inbounds!(r::AbstractResource, out, A::AbstractArray, kern, b
if isempty(R) || isempty(Rk)
return out
end
p = A[first(R)+first(Rk)] * first(kern)
p = accumfilter(A[first(R)+first(Rk)], first(kern))
z = zero(typeof(p+p))
__imfilter_inbounds!(r, out, A, kern, border, R, z)
end
Expand All @@ -504,7 +522,7 @@ function __imfilter_inbounds!(r, out, A, kern, border, R, z)
for I in safetail(R), i in safehead(R)
tmp = z
@unsafe for J in safetail(Rk), j in safehead(Rk)
tmp += A[i+j,I+J]*kern[j,J]
tmp += safe_for_prod(A[i+j,I+J], tmp)*kern[j,J]
end
@unsafe out[i,I] = tmp
end
Expand All @@ -527,7 +545,7 @@ function __imfilter_inbounds!(r, out, A::OffsetArray, kern::OffsetArray, border,
tmp = z
iA = i-oA
@unsafe for J in safetail(Rk), j in safehead(Rk)
tmp += pA[iA+j,IA+J]*k[j,J]
tmp += safe_for_prod(pA[iA+j,IA+J], tmp)*k[j,J]
end
@unsafe out[i-o,I-O] = tmp
end
Expand All @@ -542,7 +560,7 @@ function _imfilter_inbounds!(r::AbstractResource, out, A::AbstractArray, kern::R
if isempty(R) || isempty(Rk)
return out
end
p = A[first(R)+first(Rk)] * first(k)
p = accumfilter(A[first(R)+first(Rk)], first(k))
z = zero(typeof(p+p))
_imfilter_inbounds!(r, z, out, A, k, Rpre, ind, Rpost)
end
Expand All @@ -560,7 +578,7 @@ function _imfilter_inbounds!(r::AbstractResource, z, out, A::AbstractArray, k::A
for Ipre in Rpre
tmp = z
for j in indsk
@unsafe tmp += A[Ipre,ik+j,Ipost]*k[j]
@unsafe tmp += safe_for_prod(A[Ipre,ik+j,Ipost], tmp)*k[j]
end
@unsafe out[Ipre,i,Ipost] = tmp
end
Expand All @@ -576,7 +594,7 @@ function _imfilter_inbounds!(r::AbstractResource, out, A::OffsetArray, kern::Res
if isempty(R) || isempty(Rk)
return out
end
p = A[first(R)+first(Rk)] * first(k)
p = accumfilter(A[first(R)+first(Rk)], first(k))
z = zero(typeof(p+p))
Opre, o, Opost = KernelFactors.indexsplit(CartesianIndex(A.offsets), kern)
_imfilter_inbounds!(r, z, out, parent(A), k, Rpre, ind, Rpost, Opre, o, Opost)
Expand All @@ -596,7 +614,7 @@ function _imfilter_inbounds!(r::AbstractResource, z, out, A::AbstractArray, k::A
IOpre = Ipre - Opre
tmp = z
for j in indsk
@unsafe tmp += A[IOpre,io+j,IOpost]*k[j]
@unsafe tmp += safe_for_prod(A[IOpre,io+j,IOpost], tmp)*k[j]
end
@unsafe out[Ipre,i,Ipost] = tmp
end
Expand All @@ -614,7 +632,7 @@ end
# for I in iter
# tmp = z
# for J in Rk
# @unsafe tmp += padded[I+J]*kernel[J]
# @unsafe tmp += safe_for_prod(padded[I+J], tmp)*kernel[J]
# end
# out[I] = tmp
# end
Expand All @@ -629,9 +647,9 @@ end
# TT = typeof(p+p)
# for I in iter
# Ipre, i, Ipost = KernelFactors.indexsplit(I, kern)
# tmp = zero(TT)
# tmp = zero(TT) error("probably needs fixing")
# @unsafe for j in indsk
# tmp += padded[Ipre,i+j,Ipost]*k[j]
# tmp += safe_for_prod(padded[Ipre,i+j,Ipost], tmp)*k[j]
# end
# out[I] = tmp
# end
Expand Down Expand Up @@ -830,9 +848,9 @@ _imfilter_inplace_tuple!(r, out, img, ::Tuple{}, Rbegin, inds, Rend, border) = o
# available. rightborder! will handle that point.
for i = ind[k]+1:ind[end-1]
@unsafe for Ibegin in Rbegin
tmp = one(T)*img[Ibegin, i, Iend]
tmp = accumfilter(img[Ibegin, i, Iend], one(T))
for j = 1:k
tmp += kernel.a[j]*out[Ibegin, i-j, Iend]
tmp += kernel.a[j]*safe_for_prod(out[Ibegin, i-j, Iend], tmp)
end
out[Ibegin, i, Iend] = tmp
end
Expand All @@ -845,9 +863,9 @@ _imfilter_inplace_tuple!(r, out, img, ::Tuple{}, Rbegin, inds, Rend, border) = o
# Propagate backwards
for i = ind[end-l]:-1:ind[1]
@unsafe for Ibegin in Rbegin
tmp = one(T)*out[Ibegin, i, Iend]
tmp = accumfilter(out[Ibegin, i, Iend], one(T))
for j = 1:l
tmp += kernel.b[j]*out[Ibegin, i+j, Iend]
tmp += kernel.b[j]*safe_for_prod(out[Ibegin, i+j, Iend], tmp)
end
out[Ibegin, i, Iend] = tmp
end
Expand All @@ -874,9 +892,9 @@ function _leftborder!{T,k,l}(out, img, kernel::TriggsSdika{T,k,l}, Ibegin, indle
n = 0
for i in indleft
n += 1
tmp = one(T)*img[Ibegin, i, Iend]
tmp = accumfilter(img[Ibegin, i, Iend], one(T))
for j = 1:n-1
tmp += kernel.a[j]*out[Ibegin, i-j, Iend]
tmp += kernel.a[j]*safe_for_prod(out[Ibegin, i-j, Iend], tmp)
end
for j = n:k
tmp += kernel.a[j]*uminus
Expand All @@ -896,9 +914,9 @@ end
function _rightborder!{T,k,l}(out, img, kernel::TriggsSdika{T,k,l}, Ibegin, indright, Iend, iplus)
# The final value from forward-filtering was not calculated, so do that here
i = last(indright)
tmp = one(T)*img[Ibegin, i, Iend]
tmp = accumfilter(img[Ibegin, i, Iend], one(T))
for j = 1:k
tmp += kernel.a[j]*out[Ibegin, i-j, Iend]
tmp += kernel.a[j]*safe_for_prod(out[Ibegin, i-j, Iend], tmp)
end
out[Ibegin, i, Iend] = tmp
# Initialize the v values at and beyond the right edge
Expand All @@ -910,12 +928,12 @@ function _rightborder!{T,k,l}(out, img, kernel::TriggsSdika{T,k,l}, Ibegin, indr
n = 1
for i in last(indright)-1:-1:first(indright)
n += 1
tmp = one(T)*out[Ibegin, i, Iend]
tmp = accumfilter(out[Ibegin, i, Iend], one(T))
for j = 1:n-1
tmp += kernel.b[j]*out[Ibegin, i+j, Iend]
tmp += kernel.b[j]*safe_for_prod(out[Ibegin, i+j, Iend], tmp)
end
for j = n:l
tmp += kernel.b[j]*vright[j-n+2]
tmp += kernel.b[j]*safe_for_prod(vright[j-n+2], tmp)
end
out[Ibegin, i, Iend] = tmp
end
Expand Down Expand Up @@ -972,8 +990,6 @@ end
filter_type{S}(img::AbstractArray{S}, kernel) = filter_type(S, kernel)

filter_type{S,T}(::Type{S}, kernel::ArrayLike{T}) = typeof(zero(S)*zero(T) + zero(S)*zero(T))
filter_type{S<:Integer,T<:Integer}(::Type{S}, kernel::ArrayLike{T}) =
typeof(zero(widen(S))*zero(widen(T)) + zero(widen(S))*zero(widen(T)))
filter_type{S<:Union{Normed,FixedColorant}}(::Type{S}, ::Laplacian) = float32(S)
filter_type{S<:Colorant}(::Type{S}, kernel::Laplacian) = S
filter_type{S<:AbstractFloat}(::Type{S}, ::Laplacian) = S
Expand Down Expand Up @@ -1103,9 +1119,10 @@ function kernelconv(k1, k2, kernels...)
fill!(out, zero(eltype(out)))
k1N, k2N = samedims(out, k1), samedims(out, k2)
R1, R2 = CartesianRange(indices(k1N)), CartesianRange(indices(k2N))
ref = accumfilter(zero(eltype(k1)), zero(eltype(k2)))
for I1 in R1
for I2 in R2
out[I1+I2] += k1N[I1]*k2N[I2]
out[I1+I2] += safe_for_prod(k1N[I1], ref)*k2N[I2]
end
end
kernelconv(out, kernels...)
Expand Down
13 changes: 13 additions & 0 deletions src/utils.jl
Original file line number Diff line number Diff line change
Expand Up @@ -53,3 +53,16 @@ _tail(R::CartesianRange) = CartesianRange(CartesianIndex(tail(R.start.I)),
CartesianIndex(tail(R.stop.I)))

to_ranges(R::CartesianRange) = map((b,e)->b:e, R.start.I, R.stop.I)

# ensure that overflow is detected, by ensuring that it doesn't happen
# at intermediate stages of the computation
accumfilter(pixelval, filterval) = pixelval * filterval
typealias SmallInts Union{UInt8,Int8,UInt16,Int16}
accumfilter(pixelval::SmallInts, filterval::SmallInts) = Int(pixelval)*Int(filterval)
# advice: don't use FixedPoint for the kernel
accumfilter(pixelval::N0f8, filterval::N0f8) = Float32(pixelval)*Float32(filterval)
accumfilter(pixelval::Colorant{N0f8}, filterval::N0f8) = float32(c)*Float32(filterval)

# In theory, the following might need to be specialized. For safety, make it a
# standalone function call.
safe_for_prod(x, ref) = oftype(ref, x)
12 changes: 9 additions & 3 deletions test/nd.jl
Original file line number Diff line number Diff line change
Expand Up @@ -36,10 +36,12 @@ using Base.Test
@test imfilter!(r, out, img, (kern,), "replicate") == imgf
@test_throws MethodError imfilter!(r, out, img, (kern,), "replicate", Algorithm.FIR())

# Element-type widening
# Element-type widening (issue #17)
v = fill(0xff, 10)
kern = centered(fill(0xff, 3))
vout = imfilter(v, kern)
info("Two warnings are expected")
@test_throws InexactError imfilter(v, kern)
vout = imfilter(UInt32, v, kern)
@test eltype(vout) == UInt32
@test all(x->x==0x0002fa03, vout)

Expand Down Expand Up @@ -70,7 +72,11 @@ using Base.Test
end

@testset "2d widening" begin
ret = imfilter(fill(typemax(Int16), 10, 10), centered(Int16[1 2 2 2 1])) # issue #17
# issue #17
img = fill(typemax(Int16), 10, 10)
kern = centered(Int16[1 2 2 2 1])
@test_throws InexactError imfilter(img, kern)
ret = imfilter(Int32, img, kern)
@test eltype(ret) == Int32
@test all(x->x==262136, ret)
end
Expand Down
1 change: 1 addition & 0 deletions test/runtests.jl
Original file line number Diff line number Diff line change
Expand Up @@ -14,6 +14,7 @@ include("specialty.jl")
include("gradient.jl")
include("mapwindow.jl")
include("basic.jl")
info("Beginning of tests with deprecation warnings")
include("deprecated.jl")

nothing

0 comments on commit d2ab807

Please sign in to comment.