FasTC/Base/src/Image.cpp

217 lines
6.5 KiB
C++
Raw Normal View History

2012-11-15 17:51:55 +01:00
/* FasTC
* Copyright (c) 2012 University of North Carolina at Chapel Hill. All rights reserved.
*
* Permission to use, copy, modify, and distribute this software and its documentation for educational,
* research, and non-profit purposes, without fee, and without a written agreement is hereby granted,
* provided that the above copyright notice, this paragraph, and the following four paragraphs appear
* in all copies.
*
* Permission to incorporate this software into commercial products may be obtained by contacting the
* authors or the Office of Technology Development at the University of North Carolina at Chapel Hill <otd@unc.edu>.
*
* This software program and documentation are copyrighted by the University of North Carolina at Chapel Hill.
* The software program and documentation are supplied "as is," without any accompanying services from the
* University of North Carolina at Chapel Hill or the authors. The University of North Carolina at Chapel Hill
* and the authors do not warrant that the operation of the program will be uninterrupted or error-free. The
* end-user understands that the program was developed for research purposes and is advised not to rely
* exclusively on the program for any reason.
*
* IN NO EVENT SHALL THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR THE AUTHORS BE LIABLE TO ANY PARTY FOR
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, ARISING OUT OF THE
* USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL OR THE
* AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* THE UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL AND THE AUTHORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND ANY
* STATUTORY WARRANTY OF NON-INFRINGEMENT. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY
* OF NORTH CAROLINA AT CHAPEL HILL AND THE AUTHORS HAVE NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,
* ENHANCEMENTS, OR MODIFICATIONS.
*
* Please send all BUG REPORTS to <pavel@cs.unc.edu>.
*
* The authors may be contacted via:
*
* Pavel Krajcevski
* Dept of Computer Science
* 201 S Columbia St
* Frederick P. Brooks, Jr. Computer Science Bldg
* Chapel Hill, NC 27599-3175
* USA
*
* <http://gamma.cs.unc.edu/FasTC/>
*/
#include "Image.h"
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cmath>
template <typename T>
static inline T sad( const T &a, const T &b ) {
return (a > b)? a - b : b - a;
}
2013-02-07 23:01:38 +01:00
Image::Image(const Image &other)
: m_Width(other.m_Width)
, m_Height(other.m_Height)
, m_bBlockStreamOrder(other.GetBlockStreamOrder())
, m_Data(new uint8[m_Width * m_Height * 4])
2013-02-07 23:01:38 +01:00
{
if(m_Data) {
memcpy(m_Data, other.m_Data, m_Width * m_Height * 4);
} else {
2013-02-07 23:01:38 +01:00
fprintf(stderr, "Out of memory!\n");
}
}
Image::Image(uint32 width, uint32 height, const uint32 *pixels, bool bBlockStreamOrder)
: m_Width(width)
, m_Height(height)
, m_bBlockStreamOrder(bBlockStreamOrder)
{
if(pixels) {
m_Data = new uint8[4 * m_Width * m_Height];
memcpy(m_Data, pixels, m_Width * m_Height * sizeof(uint32));
} else {
m_Data = NULL;
}
}
Image::~Image() {
if(m_Data) {
delete [] m_Data;
m_Data = 0;
}
}
2013-02-07 23:01:38 +01:00
Image &Image::operator=(const Image &other) {
m_Width = other.m_Width;
m_Height = other.m_Height;
m_bBlockStreamOrder = other.GetBlockStreamOrder();
2013-02-07 23:01:38 +01:00
if(m_Data) {
delete [] m_Data;
2013-02-07 23:01:38 +01:00
}
if(other.m_Data) {
m_Data = new uint8[m_Width * m_Height * 4];
if(m_Data)
memcpy(m_Data, other.m_Data, m_Width * m_Height * 4);
2013-02-07 23:01:38 +01:00
else
fprintf(stderr, "Out of memory!\n");
}
else {
m_Data = other.m_Data;
2013-02-07 23:01:38 +01:00
}
return *this;
}
double Image::ComputePSNR(Image *other) {
if(!other)
return -1.0;
if(other->GetWidth() != GetWidth() ||
other->GetHeight() != GetHeight()) {
return -1.0;
}
// Compute raw 8-bit RGBA data...
other->ComputeRGBA();
ComputeRGBA();
const uint8 *ourData =
reinterpret_cast<const uint8 *>(GetRGBA());
const uint8 *otherData =
reinterpret_cast<const uint8 *>(other->GetRGBA());
2013-09-27 02:18:26 +02:00
// const double w[3] = { 0.2126, 0.7152, 0.0722 };
const double w[3] = { 1.0, 1.0, 1.0 };
2013-09-27 02:18:26 +02:00
double mse = 0.0;
const uint32 imageSz = GetWidth() * GetHeight() * 4;
2012-11-07 23:10:26 +01:00
for(uint32 i = 0; i < imageSz; i+=4) {
const unsigned char *pixelDataRaw = ourData + i;
const unsigned char *pixelDataUncomp = otherData + i;
2013-09-27 02:18:26 +02:00
float r[4], u[4];
for(uint32 c = 0; c < 4; c++) {
if(c == 3) {
r[c] = pixelDataRaw[c] / 255.0;
u[c] = pixelDataUncomp[c] / 255.0;
} else {
r[c] = static_cast<double>(pixelDataRaw[c]) * w[c];
u[c] = static_cast<double>(pixelDataUncomp[c]) * w[c];
}
}
for(uint32 c = 0; c < 3; c++) {
double diff = (r[3] * r[c] - u[3] * u[c]);
mse += diff * diff;
}
}
2013-09-27 02:18:26 +02:00
mse /= GetWidth() * GetHeight();
2013-09-27 02:18:26 +02:00
const double C = 255.0 * 255.0;
double maxi = (w[0]*w[0] + w[1]*w[1] + w[2]*w[2]) * C;
return 10 * log10(maxi/mse);
}
void Image::ConvertToBlockStreamOrder() {
if(m_bBlockStreamOrder || !m_Data)
return;
uint32 *newPixelData = new uint32[GetWidth() * GetHeight() * 4];
for(uint32 j = 0; j < GetHeight(); j+=4) {
for(uint32 i = 0; i < GetWidth(); i+=4) {
uint32 blockX = i / 4;
uint32 blockY = j / 4;
uint32 blockIdx = blockY * (GetWidth() / 4) + blockX;
uint32 offset = blockIdx * 4 * 4;
for(uint32 t = 0; t < 16; t++) {
uint32 x = i + t % 4;
uint32 y = j + t / 4;
newPixelData[offset + t] =
reinterpret_cast<uint32 *>(m_Data)[y*GetWidth() + x];
}
}
}
delete m_Data;
m_Data = reinterpret_cast<uint8 *>(newPixelData);
m_bBlockStreamOrder = true;
}
void Image::ConvertFromBlockStreamOrder() {
if(!m_bBlockStreamOrder || !m_Data)
return;
uint32 *newPixelData = new uint32[GetWidth() * GetHeight() * 4];
for(uint32 j = 0; j < GetHeight(); j+=4) {
for(uint32 i = 0; i < GetWidth(); i+=4) {
uint32 blockX = i / 4;
uint32 blockY = j / 4;
uint32 blockIdx = blockY * (GetWidth() / 4) + blockX;
uint32 offset = blockIdx * 4 * 4;
for(uint32 t = 0; t < 16; t++) {
uint32 x = i + t % 4;
uint32 y = j + t / 4;
newPixelData[y*GetWidth() + x] =
reinterpret_cast<uint32 *>(m_Data)[offset + t];
}
}
}
delete m_Data;
m_Data = reinterpret_cast<uint8 *>(newPixelData);
m_bBlockStreamOrder = false;
}