/* 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 . * * 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 . * * 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 * * */ #include "Image.h" #include #include #include #include #include template static inline T sad( const T &a, const T &b ) { return (a > b)? a - b : b - a; } 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]) { if(m_Data) { memcpy(m_Data, other.m_Data, m_Width * m_Height * 4); } else { 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; } } Image &Image::operator=(const Image &other) { m_Width = other.m_Width; m_Height = other.m_Height; m_bBlockStreamOrder = other.GetBlockStreamOrder(); if(m_Data) { delete [] m_Data; } 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); else fprintf(stderr, "Out of memory!\n"); } else { m_Data = other.m_Data; } 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(GetRGBA()); const uint8 *otherData = reinterpret_cast(other->GetRGBA()); // const double w[3] = { 0.2126, 0.7152, 0.0722 }; const double w[3] = { 1.0, 1.0, 1.0 }; double mse = 0.0; const uint32 imageSz = GetWidth() * GetHeight() * 4; for(uint32 i = 0; i < imageSz; i+=4) { const unsigned char *pixelDataRaw = ourData + i; const unsigned char *pixelDataUncomp = otherData + i; double 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(pixelDataRaw[c]) * w[c]; u[c] = static_cast(pixelDataUncomp[c]) * w[c]; } } for(uint32 c = 0; c < 3; c++) { double diff = (r[3] * r[c] - u[3] * u[c]); mse += diff * diff; } } mse /= GetWidth() * GetHeight(); 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(m_Data)[y*GetWidth() + x]; } } } delete m_Data; m_Data = reinterpret_cast(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(m_Data)[offset + t]; } } } delete m_Data; m_Data = reinterpret_cast(newPixelData); m_bBlockStreamOrder = false; }