1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366
|
/****************************************************************************
*
* ViSP, open source Visual Servoing Platform software.
* Copyright (C) 2005 - 2023 by Inria. All rights reserved.
*
* This software 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.
* See the file LICENSE.txt at the root directory of this source
* distribution for additional information about the GNU GPL.
*
* For using ViSP with software that can not be combined with the GNU
* GPL, please contact Inria about acquiring a ViSP Professional
* Edition License.
*
* See https://visp.inria.fr for more information.
*
* This software was developed at:
* Inria Rennes - Bretagne Atlantique
* Campus Universitaire de Beaulieu
* 35042 Rennes Cedex
* France
*
* If you have questions regarding the use of this file, please contact
* Inria at visp@inria.fr
*
* This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* Description:
* Example of Histogram manipulation.
*
*
*****************************************************************************/
/*!
\file histogram.cpp
\brief Histogram manipulation.
*/
#include <visp3/core/vpDebug.h>
#include <visp3/core/vpHistogram.h>
#include <visp3/core/vpImage.h>
#include <visp3/core/vpIoTools.h>
#include <visp3/io/vpImageIo.h>
#include <visp3/io/vpParseArgv.h>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
// List of allowed command line options
#define GETOPTARGS "i:o:h"
/*!
\example histogram.cpp
Read a B&W image on the disk and compute the histogram.
*/
/*!
Print the program options.
\param name : Program name.
\param badparam : Bad parameter name.
\param ipath : Input image path.
\param opath : Output image path.
\param user : Username.
*/
void usage(const char *name, const char *badparam, std::string ipath, std::string opath, std::string user)
{
fprintf(stdout, "\n\
Read an image on the disk, display it using X11, display some\n\
features (line, circle, characters) in overlay and finally write \n\
the image and the overlayed features in an image on the disk.\n\
\n\
SYNOPSIS\n\
%s [-i <input image path>] [-o <output histogram path>]\n\
[-h]\n\
",
name);
fprintf(stdout, "\n\
OPTIONS: Default\n\
-i <input image path> %s\n\
Set image input path.\n\
From this path read \"Klimt/Klimt.pgm\"\n\
image.\n\
Setting the VISP_INPUT_IMAGE_PATH environment\n\
variable produces the same behaviour than using\n\
this option.\n\
\n\
-o <output histogram path> %s\n\
From this directory, creates the \"%s\"\n\
subdirectory depending on the username, where \n\
\"histogram.txt\" is saved.\n\
\n\
-h\n\
Print the help.\n\n",
ipath.c_str(), opath.c_str(), user.c_str());
if (badparam) {
fprintf(stderr, "ERROR: \n");
fprintf(stderr, "\nBad parameter [%s]\n", badparam);
}
}
/*!
Set the program options.
\param argc : Command line number of parameters.
\param argv : Array of command line parameters.
\param ipath : Input image path.
\param opath : Output image path.
\param user : Username.
\return false if the program has to be stopped, true otherwise.
*/
bool getOptions(int argc, const char **argv, std::string &ipath, std::string &opath, const std::string &user)
{
const char *optarg_;
int c;
while ((c = vpParseArgv::parse(argc, argv, GETOPTARGS, &optarg_)) > 1) {
switch (c) {
case 'i':
ipath = optarg_;
break;
case 'o':
opath = optarg_;
break;
case 'h':
usage(argv[0], NULL, ipath, opath, user);
return false;
break;
default:
usage(argv[0], optarg_, ipath, opath, user);
return false;
break;
}
}
if ((c == 1) || (c == -1)) {
// standalone param or error
usage(argv[0], NULL, ipath, opath, user);
std::cerr << "ERROR: " << std::endl;
std::cerr << " Bad argument " << optarg_ << std::endl << std::endl;
return false;
}
return true;
}
int main(int argc, const char **argv)
{
try {
std::string env_ipath;
std::string opt_ipath;
std::string opt_opath;
std::string ipath;
std::string opath;
std::string filename;
std::string username;
// Get the visp-images-data package path or VISP_INPUT_IMAGE_PATH
// environment variable value
env_ipath = vpIoTools::getViSPImagesDataPath();
// Set the default input path
if (!env_ipath.empty())
ipath = env_ipath;
// Set the default output path
#if defined(_WIN32)
opt_opath = "C:/temp";
#else
opt_opath = "/tmp";
#endif
// Get the user login name
vpIoTools::getUserName(username);
// Read the command line options
if (getOptions(argc, argv, opt_ipath, opt_opath, username) == false) {
return EXIT_FAILURE;
}
// Get the option values
if (!opt_ipath.empty())
ipath = opt_ipath;
if (!opt_opath.empty())
opath = opt_opath;
// Append to the output path string, the login name of the user
std::string dirname = vpIoTools::createFilePath(opath, username);
// Test if the output path exist. If no try to create it
if (vpIoTools::checkDirectory(dirname) == false) {
try {
// Create the dirname
vpIoTools::makeDirectory(dirname);
} catch (...) {
usage(argv[0], NULL, ipath, opath, username);
std::cerr << std::endl << "ERROR:" << std::endl;
std::cerr << " Cannot create " << dirname << std::endl;
std::cerr << " Check your -o " << opath << " option " << std::endl;
return EXIT_FAILURE;
}
}
// Compare ipath and env_ipath. If they differ, we take into account
// the input path comming from the command line option
if (opt_ipath.empty()) {
if (ipath != env_ipath) {
std::cout << std::endl << "WARNING: " << std::endl;
std::cout << " Since -i <visp image path=" << ipath << "> "
<< " is different from VISP_IMAGE_PATH=" << env_ipath << std::endl
<< " we skip the environment variable." << std::endl;
}
}
// Test if an input path is set
if (opt_ipath.empty() && env_ipath.empty()) {
usage(argv[0], NULL, ipath, opath, username);
std::cerr << std::endl << "ERROR:" << std::endl;
std::cerr << " Use -i <visp image path> option or set VISP_INPUT_IMAGE_PATH " << std::endl
<< " environment variable to specify the location of the " << std::endl
<< " image path where test images are located." << std::endl
<< std::endl;
return EXIT_FAILURE;
}
// Create a grey level image
vpImage<unsigned char> I;
// Load a grey image from the disk
filename = ipath;
if (opt_ipath.empty())
filename = vpIoTools::createFilePath(ipath, "Klimt/Klimt.pgm");
std::cout << "Read: " << filename << std::endl;
vpImageIo::read(I, filename);
unsigned char distance = 60;
vpHistogram h;
// Computes the histogram from the image
h.calculate(I);
// Save the histogram
filename = dirname + vpIoTools::path("/histogram.txt");
std::cout << "Save the histogram in: " << filename << std::endl;
h.write(filename);
// Smooth the histogram
h.smooth();
// Save the histogram
filename = dirname + vpIoTools::path("/histogram_smoothed.txt");
std::cout << "Save the smoothed histogram in: " << filename << std::endl;
h.write(filename);
std::list<vpHistogramPeak> peaks;
unsigned int nbpeaks = 0;
// get all the histogram peaks
nbpeaks = h.getPeaks(peaks);
vpTRACE("List of peaks");
vpTRACE("Nb peaks: %d", nbpeaks);
if (nbpeaks) {
for (std::list<vpHistogramPeak>::const_iterator it = peaks.begin(); it != peaks.end(); ++it) {
vpHistogramPeak p = *it;
vpTRACE("Peak: gray level: %d value: %d", p.getLevel(), p.getValue());
}
}
// sort all the histogram peaks list to have the highest peak at the
// beginning of the list, the smallest at the end.
nbpeaks = h.sort(peaks);
vpTRACE("Sorted list of peaks");
vpTRACE("Nb peaks: %d", nbpeaks);
if (nbpeaks) {
for (std::list<vpHistogramPeak>::const_iterator it = peaks.begin(); it != peaks.end(); ++it) {
vpHistogramPeak p = *it;
vpTRACE("Peak: gray level: %d value: %d", p.getLevel(), p.getValue());
}
}
// Get the two highest histogram peaks. peak1 is the highest
vpHistogramPeak peak1, peak2;
nbpeaks = h.getPeaks(distance, peak1, peak2);
if (nbpeaks != 2) {
std::cout << "Not a bimodal histogram..." << std::endl;
} else {
vpTRACE("Bimodal histogram: main peak1: %d-%d second peak2: %d-%d", peak1.getLevel(), peak1.getValue(),
peak2.getLevel(), peak2.getValue());
}
// Get the valey between the two highest peaks
vpHistogramValey valey;
if (h.getValey(peak1, peak2, valey) == false) {
vpTRACE("No valey found...");
} else {
vpTRACE("Valey: %d-%d", valey.getLevel(), valey.getValue());
}
vpHistogramValey valeyl, valeyr;
{
// Search the two valeys around peak1
unsigned ret = h.getValey(distance, peak1, valeyl, valeyr);
if (ret == 0x00) {
vpTRACE("No left and right valey for peak %d-%d...", peak1.getLevel(), peak1.getValue());
} else if (ret == 0x10) {
vpTRACE("No right valey for peak %d-%d...", peak1.getLevel(), peak1.getValue());
vpTRACE("Left valey: %d-%d", valeyl.getLevel(), valeyl.getValue());
} else if (ret == 0x01) {
vpTRACE("No left valey for peak %d-%d...", peak1.getLevel(), peak1.getValue());
vpTRACE("Right valey: %d-%d", valeyr.getLevel(), valeyr.getValue());
} else if (ret == 0x11) {
vpTRACE("Left valey: %d-%d", valeyl.getLevel(), valeyl.getValue());
vpTRACE("Right valey: %d-%d", valeyr.getLevel(), valeyr.getValue());
}
}
{
// Search the two valeys around peak2
unsigned ret = h.getValey(distance, peak2, valeyl, valeyr);
if (ret == 0x00) {
vpTRACE("No left and right valey for peak %d-%d...", peak2.getLevel(), peak2.getValue());
} else if (ret == 0x10) {
vpTRACE("No right valey for peak %d-%d...", peak2.getLevel(), peak2.getValue());
vpTRACE("Left valey: %d-%d", valeyl.getLevel(), valeyl.getValue());
} else if (ret == 0x01) {
vpTRACE("No left valey for peak %d-%d...", peak2.getLevel(), peak2.getValue());
vpTRACE("Right valey: %d-%d", valeyr.getLevel(), valeyr.getValue());
} else if (ret == 0x11) {
vpTRACE("Left valey: %d-%d", valeyl.getLevel(), valeyl.getValue());
vpTRACE("Right valey: %d-%d", valeyr.getLevel(), valeyr.getValue());
}
}
////////////////////////////////////////////////////////////
// get the valey between the two highest peaks. Here we don't know
// which of peakl or peakr is the highest.
vpHistogramPeak peakl, peakr;
if (h.getPeaks(distance, peakl, peakr, valey) == false) {
std::cout << "Not a bimodal histogram..." << std::endl;
} else {
vpTRACE("Bimodal histogram: valey %d-%d for peakl: %d-%d peakr: %d-%d", valey.getLevel(), valey.getValue(),
peakl.getLevel(), peakl.getValue(), peakr.getLevel(), peakr.getValue());
}
return EXIT_SUCCESS;
} catch (const vpException &e) {
std::cout << "Catch an exception: " << e << std::endl;
return EXIT_FAILURE;
}
}
|