/*
* This file is part of the LIRE project: http://lire-project.net
* LIRE is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* LIRE is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with LIRE; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* We kindly ask you to refer the any or one of the following publications in
* any publication mentioning or employing Lire:
*
* Lux Mathias, Savvas A. Chatzichristofis. Lire: Lucene Image Retrieval –
* An Extensible Java CBIR Library. In proceedings of the 16th ACM International
* Conference on Multimedia, pp. 1085-1088, Vancouver, Canada, 2008
* URL: http://doi.acm.org/10.1145/1459359.1459577
*
* Lux Mathias. Content Based Image Retrieval with LIRE. In proceedings of the
* 19th ACM International Conference on Multimedia, pp. 735-738, Scottsdale,
* Arizona, USA, 2011
* URL: http://dl.acm.org/citation.cfm?id=2072432
*
* Mathias Lux, Oge Marques. Visual Information Retrieval using Java and LIRE
* Morgan & Claypool, 2013
* URL: http://www.morganclaypool.com/doi/abs/10.2200/S00468ED1V01Y201301ICR025
*
* Copyright statement:
* ====================
* (c) 2017 by Savvas Chatzichristofis (savvash@gmail.com) & Nektarios Anagnostopoulos (nek.anag@gmail.com)
* http://www.semanticmetadata.net/lire, http://www.lire-project.net
*/
package net.semanticmetadata.lire.imageanalysis.features.global.como;
/**
* Part of the COMO global feature
*
* @author Savvas Chatzichristofis, savvash@gmail.com
* @author Nektarios Anagnostopoulos, nek.anag@gmail.com
*/
public class RGB2HSV {
public int[] ApplyFilter(int red, int green, int blue) {
int[] result = new int[3];
int HSV_H = 0;
int HSV_S;
int HSV_V;
// double MaxHSV = (Math.max(red, Math.max(green, blue)));
// double MaxHSV = (Math.min(red, Math.min(green, blue)));
double MaxHSV = (Math.max(red, (green >= blue) ? green : blue));
double MinHSV = (Math.min(red, (green <= blue) ? green : blue));
HSV_V = (int) (MaxHSV);
HSV_S = 0;
if (MaxHSV != 0) HSV_S = (int) (255 - 255 * (MinHSV / MaxHSV));
if (MaxHSV != MinHSV) {
if (HSV_V == red) {
if (green >= blue) {
HSV_H = (int) (60 * (green - blue) / (MaxHSV - MinHSV));
} else {
HSV_H = (int) (359 + 60 * (green - blue) / (MaxHSV - MinHSV));
}
} else if (HSV_V == green) {
HSV_H = (int) (119 + 60 * (blue - red) / (MaxHSV - MinHSV));
} else if (HSV_V == blue) {
HSV_H = (int) (239 + 60 * (red - green) / (MaxHSV - MinHSV));
}
} else HSV_H = 0;
result[0] = HSV_H;
result[1] = HSV_S;
result[2] = HSV_V;
return result;
}
}