go-resize/resize.go

168 lines
5.0 KiB
Go
Raw Normal View History

2012-08-02 21:59:40 +02:00
/*
Copyright (c) 2012, Jan Schlicht <jan.schlicht@gmail.com>
Permission to use, copy, modify, and/or distribute this software for any purpose
with or without fee is hereby granted, provided that the above copyright notice
and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
THIS SOFTWARE.
*/
// Package resize implements various image resizing methods.
//
// The package works with the Image interface described in the image package.
// Various interpolation methods are provided and multiple processors may be
// utilized in the computations.
//
// Example:
// imgResized := resize.Resize(1000, 0, imgOld, resize.MitchellNetravali)
2012-08-02 21:59:40 +02:00
package resize
import (
"image"
"image/color"
"runtime"
)
2012-09-15 20:24:14 +02:00
// Filter can interpolate at points (x,y)
type Filter interface {
Interpolate(u float32, y int) color.RGBA64
2012-08-02 21:59:40 +02:00
}
2012-09-15 20:24:14 +02:00
// InterpolationFunction return a Filter implementation
// that operates on an image. Two factors
// allow to scale the filter kernels in x- and y-direction
// to prevent moire patterns.
type InterpolationFunction func(image.Image, float32) Filter
2012-08-02 21:59:40 +02:00
// Resize an image to new width and height using the interpolation function interp.
2012-08-02 21:59:40 +02:00
// A new image with the given dimensions will be returned.
// If one of the parameters width or height is set to 0, its size will be calculated so that
2012-08-02 21:59:40 +02:00
// the aspect ratio is that of the originating image.
2012-08-03 18:22:12 +02:00
// The resizing algorithm uses channels for parallel computation.
func Resize(width, height uint, img image.Image, interp InterpolationFunction) image.Image {
oldBounds := img.Bounds()
oldWidth := float32(oldBounds.Dx())
oldHeight := float32(oldBounds.Dy())
scaleX, scaleY := calcFactors(width, height, oldWidth, oldHeight)
2012-08-02 21:59:40 +02:00
2013-11-18 20:19:56 +01:00
tempImg := image.NewRGBA64(image.Rect(0, 0, oldBounds.Dy(), int(0.7+oldWidth/scaleX)))
b := tempImg.Bounds()
adjust := 0.5 * ((oldWidth-1.0)/scaleX - float32(b.Dy()-1))
2012-09-14 23:12:05 +02:00
n := numJobs(b.Dy())
c := make(chan int, n)
for i := 0; i < n; i++ {
2012-08-02 21:59:40 +02:00
go func(b image.Rectangle, c chan int) {
filter := interp(img, float32(clampFactor(scaleX)))
var u float32
var color color.RGBA64
for y := b.Min.X; y < b.Max.X; y++ {
for x := b.Min.Y; x < b.Max.Y; x++ {
2013-11-18 20:19:56 +01:00
u = scaleX*(float32(x)+adjust) + float32(oldBounds.Min.X)
color = filter.Interpolate(u, y)
2013-11-18 20:19:56 +01:00
i := tempImg.PixOffset(y, x)
tempImg.Pix[i+0] = uint8(color.R >> 8)
tempImg.Pix[i+1] = uint8(color.R)
tempImg.Pix[i+2] = uint8(color.G >> 8)
tempImg.Pix[i+3] = uint8(color.G)
tempImg.Pix[i+4] = uint8(color.B >> 8)
tempImg.Pix[i+5] = uint8(color.B)
tempImg.Pix[i+6] = uint8(color.A >> 8)
tempImg.Pix[i+7] = uint8(color.A)
2012-08-02 21:59:40 +02:00
}
}
c <- 1
}(image.Rect(b.Min.X, b.Min.Y+i*(b.Dy())/n, b.Max.X, b.Min.Y+(i+1)*(b.Dy())/n), c)
2012-08-02 21:59:40 +02:00
}
for i := 0; i < n; i++ {
2012-08-02 21:59:40 +02:00
<-c
}
resultImg := image.NewRGBA64(image.Rect(0, 0, int(0.7+oldWidth/scaleX), int(0.7+oldHeight/scaleY)))
b = resultImg.Bounds()
2013-11-18 20:19:56 +01:00
adjust = 0.5 * ((oldWidth-1.0)/scaleY - float32(b.Dx()-1))
for i := 0; i < n; i++ {
go func(b image.Rectangle, c chan int) {
2013-11-18 20:19:56 +01:00
filter := interp(tempImg, float32(clampFactor(scaleY)))
var u float32
var color color.RGBA64
for y := b.Min.X; y < b.Max.X; y++ {
for x := b.Min.Y; x < b.Max.Y; x++ {
2013-11-18 20:19:56 +01:00
u = scaleY*(float32(x)+adjust) + float32(oldBounds.Min.Y)
color = filter.Interpolate(u, y)
i := resultImg.PixOffset(y, x)
resultImg.Pix[i+0] = uint8(color.R >> 8)
resultImg.Pix[i+1] = uint8(color.R)
resultImg.Pix[i+2] = uint8(color.G >> 8)
resultImg.Pix[i+3] = uint8(color.G)
resultImg.Pix[i+4] = uint8(color.B >> 8)
resultImg.Pix[i+5] = uint8(color.B)
resultImg.Pix[i+6] = uint8(color.A >> 8)
resultImg.Pix[i+7] = uint8(color.A)
}
}
c <- 1
}(image.Rect(b.Min.X, b.Min.Y+i*(b.Dy())/n, b.Max.X, b.Min.Y+(i+1)*(b.Dy())/n), c)
}
for i := 0; i < n; i++ {
<-c
}
return resultImg
2012-08-02 21:59:40 +02:00
}
2012-09-14 23:12:05 +02:00
2012-09-15 20:24:14 +02:00
// Calculate scaling factors using old and new image dimensions.
func calcFactors(width, height uint, oldWidth, oldHeight float32) (scaleX, scaleY float32) {
if width == 0 {
if height == 0 {
scaleX = 1.0
scaleY = 1.0
} else {
scaleY = oldHeight / float32(height)
scaleX = scaleY
}
} else {
scaleX = oldWidth / float32(width)
if height == 0 {
scaleY = scaleX
} else {
scaleY = oldHeight / float32(height)
}
}
return
}
// Set filter scaling factor to avoid moire patterns.
// This is only useful in case of downscaling (factor>1).
func clampFactor(factor float32) float32 {
if factor < 1 {
factor = 1
}
return factor
}
2012-09-14 23:12:05 +02:00
// Set number of parallel jobs
// but prevent resize from doing too much work
// if #CPUs > width
func numJobs(d int) (n int) {
n = runtime.NumCPU()
if n > d {
n = d
}
return
}