void test_linear_structure()
{
trace.beginBlock("creating dec problem with neumann border condition");
//! [neumann-creation]
typedef DiscreteExteriorCalculus<1, 2, EigenLinearAlgebraBackend> Calculus;
typedef std::list<Calculus::SCell> SCells;
SCells cells;
// fill cells container
{
const Calculus::KSpace kspace;
for (int kk=20; kk>0; kk--) cells.push_back( kspace.sCell(Point(0,kk), kk%2 != 0 ? Calculus::KSpace::NEG : Calculus::KSpace::POS) );
for (int kk=0; kk<10; kk++) cells.push_back( kspace.sCell(Point(kk,0)) );
for (int kk=0; kk<10; kk++) cells.push_back( kspace.sCell(Point(10,kk)) );
cells.push_back( kspace.sCell(Point(10,10)) );
cells.push_back( kspace.sCell(Point(9,10), Calculus::KSpace::NEG) );
for (int kk=10; kk<20; kk++) cells.push_back( kspace.sCell(Point(8,kk)) );
for (int kk=8; kk<12; kk++) cells.push_back( kspace.sCell(Point(kk,20)) );
for (int kk=20; kk>0; kk--) cells.push_back( kspace.sCell(Point(12,kk), kk%2 != 0 ? Calculus::KSpace::NEG : Calculus::KSpace::POS) );
cells.push_back( kspace.sCell(Point(12,0)) );
}
// fill calculus
const Domain domain(Point(-1,-1), Point(10,10));
// create DEC structure
Calculus calculus;
calculus.initKSpace<Domain>(domain);
for (SCells::const_iterator ci=cells.begin(), ce=cells.end(); ci!=ce; ci++) calculus.insertSCell( *ci );
calculus.updateIndexes();
//! [neumann-creation]
trace.info() << calculus << endl;
//! [input-dirac]
Calculus::PrimalForm0 dirac = Calculus::PrimalForm0::dirac(calculus, calculus.myKSpace.uCell(Point(10,4)));
//! [input-dirac]
{
Board2D board;
board << domain;
board << calculus;
board << dirac;
board.saveSVG("linear_structure_neumann_dirac.svg");
}
trace.endBlock();
{
trace.beginBlock("solving problem with neumann border condition using sparse qr solver");
//! [neumann-laplace-definition]
const Calculus::PrimalIdentity0 laplace = calculus.laplace<PRIMAL>();
//! [neumann-laplace-definition]
trace.info() << "laplace = " << laplace << endl;
const Calculus::PrimalIdentity0 reorder = calculus.reorder<0, PRIMAL>(cells.begin(), cells.end());
const Calculus::PrimalIdentity0 laplace_ordered = reorder * laplace * reorder.transpose();
trace.info() << Eigen::MatrixXd(laplace_ordered.myContainer) << endl;
//! [neumann-solve]
typedef EigenLinearAlgebraBackend::SolverSparseQR LinearAlgebraSolver;
typedef DiscreteExteriorCalculusSolver<Calculus, LinearAlgebraSolver, 0, PRIMAL, 0, PRIMAL> Solver;
Solver solver;
solver.compute(laplace);
Calculus::PrimalForm0 solved_solution = solver.solve(dirac);
//! [neumann-solve]
solved_solution.myContainer.array() -= solved_solution.myContainer(38);
solved_solution.myContainer.array() /= solved_solution.myContainer.maxCoeff();
const Calculus::PrimalForm0 solved_solution_ordered = reorder * solved_solution;
Calculus::PrimalForm0 analytic_solution(calculus);
{
const Calculus::Index dirac_position = 17;
const Calculus::Index length = analytic_solution.length();
for (Calculus::Index kk=0; kk<length; kk++)
{
Calculus::Scalar alpha = 1. * (kk)/dirac_position * (kk+1.)/(dirac_position+1.);
if (kk>dirac_position)
{
alpha = 1. * (length-kk)/dirac_position * (length-kk-1.)/(dirac_position+1);
alpha -= 1. * (length-dirac_position)/dirac_position * (length-dirac_position-1.)/(dirac_position+1);
alpha += 1;
}
analytic_solution.myContainer(kk) = alpha;
}
}
trace.info() << solver.isValid() << " " << solver.myLinearAlgebraSolver.info() << endl;
{
std::ofstream handle("linear_structure_neumann.dat");
for (Calculus::Index kk=0; kk<analytic_solution.length(); kk++)
handle << solved_solution_ordered.myContainer(kk) << " " << analytic_solution.myContainer(kk) << endl;
}
FATAL_ERROR( (solved_solution_ordered-analytic_solution).myContainer.array().abs().maxCoeff() < 1e-5 );
{
Board2D board;
board << domain;
board << calculus;
board << solved_solution;
board.saveSVG("linear_structure_neumann_solution.svg");
}
{
Calculus::PrimalForm1 solved_solution_gradient = calculus.derivative<0, PRIMAL>() * solved_solution;
Board2D board;
board << domain;
board << calculus;
board << solved_solution_gradient;
board << CustomStyle("VectorField", new VectorFieldStyle2D(1));
board << calculus.sharp(solved_solution_gradient);
board.saveSVG("linear_structure_neumann_solution_gradient.svg");
}
trace.endBlock();
}
trace.beginBlock("creating dec problem with dirichlet border condition");
//! [dirichlet-creation]
calculus.insertSCell( calculus.myKSpace.sCell(Point(13,0)) );
calculus.insertSCell( calculus.myKSpace.sCell(Point(1,20), Calculus::KSpace::NEG) );
calculus.updateIndexes();
//! [dirichlet-creation]
{
Board2D board;
board << domain;
board << calculus;
board << dirac;
board.saveSVG("linear_structure_dirichlet_dirac.svg");
}
trace.endBlock();
{
trace.beginBlock("solving problem with dirichlet border condition using sparse qr solver");
//! [dirichlet-laplace-definition]
const Calculus::PrimalIdentity0 laplace = calculus.laplace<PRIMAL>();
//! [dirichlet-laplace-definition]
trace.info() << "laplace = " << laplace << endl;
const Calculus::PrimalIdentity0 reorder = calculus.reorder<0, PRIMAL>(cells.begin(), cells.end());
const Calculus::PrimalIdentity0 laplace_ordered = reorder * laplace * reorder.transpose();
trace.info() << Eigen::MatrixXd(laplace_ordered.myContainer) << endl;
//! [dirichlet-solve]
typedef EigenLinearAlgebraBackend::SolverSparseQR LinearAlgebraSolver;
typedef DiscreteExteriorCalculusSolver<Calculus, LinearAlgebraSolver, 0, PRIMAL, 0, PRIMAL> Solver;
Solver solver;
solver.compute(laplace);
Calculus::PrimalForm0 solved_solution = solver.solve(dirac);
//! [dirichlet-solve]
solved_solution.myContainer.array() /= solved_solution.myContainer.maxCoeff();
const Calculus::PrimalForm0 solved_solution_ordered = reorder * solved_solution;
Calculus::PrimalForm0 analytic_solution(calculus);
{
const Calculus::Index dirac_position = 17;
const Calculus::Index length = analytic_solution.length();
for (Calculus::Index kk=0; kk<length; kk++)
{
Calculus::Scalar alpha = (kk+1.)/(dirac_position+1.);
if (kk>dirac_position)
{
alpha = 1. - (kk-dirac_position)/(1.*length-dirac_position);
}
analytic_solution.myContainer(kk) = alpha;
}
}
trace.info() << solver.isValid() << " " << solver.myLinearAlgebraSolver.info() << endl;
{
std::ofstream handle("linear_structure_dirichlet.dat");
for (Calculus::Index kk=0; kk<analytic_solution.length(); kk++)
handle << solved_solution_ordered.myContainer(kk) << " " << analytic_solution.myContainer(kk) << endl;
}
FATAL_ERROR( (solved_solution_ordered-analytic_solution).myContainer.array().abs().maxCoeff() < 1e-5 );
{
Board2D board;
board << domain;
board << calculus;
board << solved_solution;
board.saveSVG("linear_structure_dirichlet_solution.svg");
}
{
Calculus::PrimalForm1 solved_solution_gradient = calculus.derivative<0, PRIMAL>() * solved_solution;
Board2D board;
board << domain;
board << calculus;
board << solved_solution_gradient;
board << calculus.sharp(solved_solution_gradient);
board.saveSVG("linear_structure_dirichlet_solution_gradient.svg");
}
trace.endBlock();
}
}
int main( int argc, char* argv[] )
{
using namespace Z2i;
typedef ImageSelector<Domain, unsigned char>::Type Image;
// parse command line ----------------------------------------------
namespace po = boost::program_options;
po::options_description general_opt("Allowed options are: ");
general_opt.add_options()
("help,h", "display this message")
("input,i", po::value<string>(), "the input image filename." )
("output,o", po::value<string>()->default_value( "AT" ), "the output image basename." )
("lambda,l", po::value<double>(), "the parameter lambda." )
("lambda-1,1", po::value<double>()->default_value( 0.3125 ), "the initial parameter lambda (l1)." ) // 0.3125
("lambda-2,2", po::value<double>()->default_value( 0.00005 ), "the final parameter lambda (l2)." )
("lambda-ratio,q", po::value<double>()->default_value( sqrt(2) ), "the division ratio for lambda from l1 to l2." )
("alpha,a", po::value<double>()->default_value( 1.0 ), "the parameter alpha." )
("epsilon,e", po::value<double>()->default_value( 4.0/64.0 ), "the parameter epsilon." )
//("gridstep,g", po::value<double>()->default_value( 1.0 ), "the parameter h, i.e. the gridstep." )
("nbiter,n", po::value<int>()->default_value( 10 ), "the maximum number of iterations." )
("sigma,s", po::value<double>()->default_value( 2.0 ), "the parameter of the first convolution." )
("rho,r", po::value<double>()->default_value( 3.0 ), "the parameter of the second convolution." )
("image-size,t", po::value<double>()->default_value( 64.0 ), "the size of the image." )
;
bool parseOK=true;
po::variables_map vm;
try {
po::store(po::parse_command_line(argc, argv, general_opt), vm);
} catch ( const exception& ex ) {
parseOK = false;
cerr << "Error checking program options: "<< ex.what()<< endl;
}
po::notify(vm);
if ( ! parseOK || vm.count("help") || !vm.count("input") )
{
cerr << "Usage: " << argv[0] << " -i toto.pgm\n"
<< "Computes the Ambrosio-Tortorelli reconstruction/segmentation of an input image."
<< endl << endl
<< " / "
<< endl
<< " | a.(u-g)^2 + v^2 |grad u|^2 + le.|grad v|^2 + (l/4e).(1-v)^2 "
<< endl
<< " / "
<< endl << endl
<< general_opt << "\n";
return 1;
}
string f1 = vm[ "input" ].as<string>();
string f2 = vm[ "output" ].as<string>();
double l1 = vm[ "lambda-1" ].as<double>();
double l2 = vm[ "lambda-2" ].as<double>();
double lr = vm[ "lambda-ratio" ].as<double>();
if ( vm.count( "lambda" ) ) l1 = l2 = vm[ "lambda" ].as<double>();
if ( l2 > l1 ) l2 = l1;
if ( lr <= 1.0 ) lr = sqrt(2);
double a = vm[ "alpha" ].as<double>();
double e = vm[ "epsilon" ].as<double>();
double t = vm[ "image-size" ].as<double>();
//double h = vm[ "gridstep" ].as<double>();
double h = 1.0 / t;
e = 4.0*h;
int n = vm[ "nbiter" ].as<int>();
int s = vm[ "sigma" ].as<double>();
int r = vm[ "rho" ].as<double>();
trace.beginBlock("Reading image");
Image image = GenericReader<Image>::import( f1 );
trace.endBlock();
// MODIF : ouverture du fichier pour les resultats ***********************************************************************
const string file = f2 + ".txt";
ofstream f(file.c_str());
f << "# l \t" << " a \t" << " e \t" << "a(u-g)^2 \t" << "v^2|grad u|^2 \t" << " le|grad v|^2 \t" << " l(1-v)^2/4e \t" << " l.per \t" << "AT tot"<< endl;
// ***********************************************************************************************************************
trace.beginBlock("Creating calculus");
typedef DiscreteExteriorCalculus<2,2, EigenLinearAlgebraBackend> Calculus;
Domain domain = image.domain();
Point p0 = domain.lowerBound(); p0 *= 2;
Point p1 = domain.upperBound(); p1 *= 2;
Domain kdomain( p0, p1 );
Image dbl_image( kdomain );
Calculus calculus;
const KSpace& K = calculus.myKSpace;
// Les pixels sont des 0-cellules du primal.
for ( Domain::ConstIterator it = kdomain.begin(), itE = kdomain.end(); it != itE; ++it )
calculus.insertSCell( K.sCell( *it ) ); // ajoute toutes les cellules de Khalimsky.
calculus.updateIndexes();
trace.info() << calculus << endl;
Calculus::PrimalForm0 g( calculus );
for ( Calculus::Index index = 0; index < g.myContainer.rows(); index++)
{
const Calculus::SCell& cell = g.getSCell( index );
g.myContainer( index ) = ((double) image( K.sCoords( cell ) )) /
255.0;
}
// {
// Board2D board;
// board << calculus;
// board << CustomStyle( "KForm", new KFormStyle2D( 0.0, 1.0 ) )
// << g;
// string str_calculus = f2 + "-calculus.eps";
// board.saveEPS( str_calculus.c_str() );
// }
trace.endBlock();
trace.beginBlock("building AT functionnals");
trace.info() << "primal_D0" << endl;
const Calculus::PrimalDerivative0 primal_D0 = calculus.derivative<0,PRIMAL>();
trace.info() << "primal_h0" << endl;
const Calculus::PrimalHodge0 primal_h0 = calculus.hodge<0,PRIMAL>();
trace.info() << "primal_h1" << endl;
const Calculus::PrimalHodge1 primal_h1 = calculus.hodge<1,PRIMAL>();
trace.info() << "dual_D1" << endl;
const Calculus::DualDerivative1 dual_D1 = calculus.derivative<1,DUAL>();
trace.info() << "dual_h2" << endl;
const Calculus::DualHodge2 dual_h2 = calculus.hodge<2,DUAL>();
trace.info() << "primal_D1" << endl;
const Calculus::PrimalDerivative1 primal_D1 = calculus.derivative<1,PRIMAL>();
trace.info() << "primal_h2" << endl;
const Calculus::PrimalHodge2 primal_h2 = calculus.hodge<2,PRIMAL>();
trace.info() << "dual_D0" << endl;
const Calculus::DualDerivative0 dual_D0 = calculus.derivative<0,DUAL>();
trace.info() << "dual_h1" << endl;
const Calculus::DualHodge1 dual_h1 = calculus.hodge<1,DUAL>();
trace.info() << "ag" << endl;
const Calculus::PrimalForm0 ag = a * g;
trace.info() << "u" << endl;
Calculus::PrimalForm0 u = ag;
// trace.info() << "A^t*diag(v)^2*A = " << Av2A << endl;
trace.info() << "v" << endl;
Calculus::PrimalForm1 v( calculus );
for ( Calculus::Index index = 0; index < v.myContainer.rows(); index++)
v.myContainer( index ) = 1.0;
trace.endBlock();
// SparseLU is so much faster than SparseQR
// SimplicialLLT is much faster than SparsLU
// typedef EigenLinearAlgebraBackend::SolverSparseQR LinearAlgebraSolver;
// typedef EigenLinearAlgebraBackend::SolverSparseLU LinearAlgebraSolver;
typedef EigenLinearAlgebraBackend::SolverSimplicialLLT LinearAlgebraSolver;
typedef DiscreteExteriorCalculusSolver<Calculus, LinearAlgebraSolver, 0, PRIMAL, 0, PRIMAL> SolverU;
SolverU solver_u;
typedef DiscreteExteriorCalculusSolver<Calculus, LinearAlgebraSolver, 1, PRIMAL, 1, PRIMAL> SolverV;
SolverV solver_v;
SolverV solver_tBB;
const Calculus::PrimalIdentity1 tBB = -1.0 * ( primal_D0 * dual_h2 * dual_D1 * primal_h1 + dual_h1 * dual_D0 * primal_h2 * primal_D1 );
solver_tBB.compute( tBB );
while ( l1 >= l2 )
{
trace.info() << "************ lambda = " << l1 << " **************" << endl;
double l = l1;
trace.info() << "B'B'" << endl;
const Calculus::PrimalIdentity1 lBB = l * tBB;
// const Calculus::PrimalIdentity1 lBB = - l * ( primal_D0 * dual_h2 * dual_D1 * primal_h1 + dual_h1 * dual_D0 * primal_h2 * primal_D1 );
Calculus::PrimalForm1 l_4( calculus );
for ( Calculus::Index index = 0; index < l_4.myContainer.rows(); index++)
l_4.myContainer( index ) = l/4.0;
//Calculus::PrimalIdentity1 BB = eps * lBB + (l/(4*eps)) * calculus.identity<1, PRIMAL>();
//trace.info() << "le*B'^t*B' + l/(4e)Id" << BB << endl;
Calculus::PrimalIdentity1 BB = 0.0 * lBB;
double coef_eps = 2.0;
double eps = coef_eps*e;
for( int k = 0 ; k < 5 ; ++k )
{
if (eps/coef_eps < h*h)
break;
else
{
eps /= coef_eps;
BB = (h * eps) * lBB + (h*l/(4.0*eps)) * calculus.identity<1, PRIMAL>();
int i = 0;
for ( ; i < n; ++i )
{
trace.info() << "------ Iteration " << k << ":" << i << "/" << n << " ------" << endl;
trace.beginBlock("Solving for u");
trace.info() << "Building matrix Av2A" << endl;
Calculus::PrimalIdentity1 Mv2 = calculus.identity<1, PRIMAL>();
for ( Calculus::Index index = 0; index < v.myContainer.rows(); index++)
Mv2.myContainer.coeffRef( index, index ) = v.myContainer[ index ] * v.myContainer[ index ];
const Calculus::PrimalIdentity0 Av2A = ( - 1.0 * h ) * dual_h2 * dual_D1 * primal_h1 * Mv2 * primal_D0
+ ( a * h*h ) * calculus.identity<0, PRIMAL>();
trace.info() << "Prefactoring matrix Av2A" << endl;
solver_u.compute( Av2A );
trace.info() << "Solving Av2A u = ag" << endl;
u = solver_u.solve( (h*h) * ag );
trace.info() << ( solver_u.isValid() ? "OK" : "ERROR" ) << " " << solver_u.myLinearAlgebraSolver.info() << endl;
trace.endBlock();
trace.beginBlock("Solving for v");
trace.info() << "Building matrix BB+Mw2" << endl;
const Calculus::PrimalForm1 former_v = v;
const Calculus::PrimalForm1 w = primal_D0 * u;
Calculus::PrimalIdentity1 Mw2 = calculus.identity<1, PRIMAL>();
for ( Calculus::Index index = 0; index < v.myContainer.rows(); index++)
Mw2.myContainer.coeffRef( index, index ) = h * w.myContainer[ index ] * w.myContainer[ index ];
trace.info() << "Prefactoring matrix BB+Mw2" << endl;
solver_v.compute( BB + Mw2 );
trace.info() << "Solving (BB+Mw2)v = l_4e" << endl;
v = solver_v.solve( ( h * (1.0/eps) ) * l_4 );
trace.info() << ( solver_v.isValid() ? "OK" : "ERROR" ) << " " << solver_v.myLinearAlgebraSolver.info() << endl;
trace.endBlock();
double n_infty = 0.0;
for ( Calculus::Index index = 0; index < v.myContainer.rows(); index++)
n_infty = max( n_infty, abs( v.myContainer( index ) - former_v.myContainer( index ) ) );
trace.info() << "Variation |v^k+1 - v^k|_oo = " << n_infty << endl;
if ( n_infty < 1e-4 ) break;
}
//BB = eps * lBB + (l/(4*eps)) * calculus.identity<1, PRIMAL>();
}
}
// *** MODIF : affichage des energies ***********************************************************************************
typedef Calculus::SparseMatrix SparseMatrix;
typedef Eigen::Matrix<double,Dynamic,Dynamic> Matrix;
trace.beginBlock("Computing energies");
// a(u-g)^2
trace.info() << "- a(u-g)^2 " << std::endl;
double UmG2 = 0.0;
for ( Calculus::Index index = 0; index < u.myContainer.rows(); index++)
UmG2 += a * (u.myContainer( index ) - g.myContainer( index )) * (u.myContainer( index ) - g.myContainer( index ));
// v^2|grad u|^2
trace.info() << "- v^2|grad u|^2" << std::endl;
double V2gradU2 = 0.0;
SolverU solver_Av2A;
trace.info() << " - Id" << std::endl;
Calculus::PrimalIdentity1 Mv2 = calculus.identity<1, PRIMAL>();
trace.info() << " - M := Diag(v^2)" << std::endl;
for ( Calculus::Index index = 0; index < v.myContainer.rows(); index++)
Mv2.myContainer.coeffRef( index, index ) = v.myContainer[ index ] * v.myContainer[ index ];
trace.info() << " - * D_1 * M * D_0" << std::endl;
const Calculus::PrimalIdentity0 Av2A = - 1.0 * dual_h2 * dual_D1 * primal_h1 * Mv2 * primal_D0;
trace.info() << " - N := compute (* D_1 * M * D_0)" << std::endl;
solver_Av2A.compute( Av2A );
// JOL: 1000 * plus rapide !
trace.info() << " - u^t N u" << std::endl;
Calculus::PrimalForm0 u_prime = Av2A * u;
for ( Calculus::Index index = 0; index < u.myContainer.rows(); index++)
V2gradU2 += u.myContainer( index ) * u_prime.myContainer( index );
// for ( Calculus::Index index_i = 0; index_i < u.myContainer.rows(); index_i++)
// for ( Calculus::Index index_j = 0; index_j < u.myContainer.rows(); index_j++)
// V2gradU2 += u.myContainer( index_i ) * Av2A.myContainer.coeff( index_i,index_j ) * u.myContainer( index_j ) ;
// le|grad v|^2
trace.info() << "- le|grad v|^2" << std::endl;
Calculus::PrimalForm1 v_prime = tBB * v;
double gradV2 = 0.0;
for ( Calculus::Index index = 0; index < v.myContainer.rows(); index++)
gradV2 += l * eps * v.myContainer( index ) * v_prime.myContainer( index );
// for ( Calculus::Index index_i = 0; index_i < v.myContainer.rows(); index_i++)
// for ( Calculus::Index index_j = 0; index_j < v.myContainer.rows(); index_j++)
// gradV2 += l * eps * v.myContainer( index_i ) * tBB.myContainer.coeff( index_i,index_j ) * v.myContainer( index_j );
// l(1-v)^2/4e
trace.info() << "- l(1-v)^2/4e" << std::endl;
double Vm12 = 0.0;
for ( Calculus::Index index_i = 0; index_i < v.myContainer.rows(); index_i++)
Vm12 += (l/(4*eps)) * (1 - 2*v.myContainer( index_i ) + v.myContainer( index_i )*v.myContainer( index_i ));
// l.per
trace.info() << "- l.per" << std::endl;
double Lper = h*gradV2 + h*Vm12;
// double per = 0.0;
// for ( Calculus::Index index_i = 0; index_i < v.myContainer.rows(); index_i++)
// {
// per += (1/(4*e)) * (1 - 2*v.myContainer( index_i ) + v.myContainer( index_i )*v.myContainer( index_i ));
// for ( Calculus::Index index_j = 0; index_j < v.myContainer.rows(); index_j++)
// per += e * v.myContainer( index_i ) * tBB.myContainer( index_i,index_j ) * v.myContainer( index_j );
// }
// AT tot
double ATtot = h*h*UmG2 + h*V2gradU2 + h*gradV2 + h*Vm12;
//f << "l " << " a " << " e " << " a(u-g)^2 " << " v^2|grad u|^2 " << " le|grad v|^2 " << " l(1-v)^2/4e " << " l.per " << " AT tot"<< endl;
f << tronc(l,8) << "\t" << a << "\t" << tronc(eps,4) << "\t" << tronc(UmG2,5) << "\t" << tronc(V2gradU2,5) << "\t" << tronc(gradV2,5) << "\t" << tronc(Vm12,5) << "\t" << tronc(Lper,5) << "\t" << tronc(ATtot,5) << endl;
trace.endBlock();
// ***********************************************************************************************************************
// int int_l = (int) floor(l);
// int dec_l = (int) (floor((l-floor(l))*10000));
// std::ostringstream ss;
// ss << (double) tronc(l,7);
// string s = ss.str();
// const int pos = s.find(".");
// string tronc_l = s.substr(0,pos) + "_" + s.substr(pos+1);
{
// Board2D board;
// board << calculus;
// board << CustomStyle( "KForm", new KFormStyle2D( 0.0, 1.0 ) ) << u;
// ostringstream oss;
// oss << f2 << "-u-" << i << ".eps";
// string str_u = oss.str(); //f2 + "-u-" + .eps";
// board.saveEPS( str_u.c_str() );
Image image2 = image;
PrimalForm0ToImage( calculus, u, image2 );
ostringstream oss2;
// oss2 << f2 << "-l" << int_l << "_" << dec_l << "-u.pgm";
// oss2 << f2 << "-l" << tronc_l << "-u.pgm";
oss2 << boost::format("%s-l%.7f-u.pgm") %f2 %l;
string str_image_u = oss2.str();
// boost::regex re("\\.");
// str_image_u = boost::regex_replace(str_image_u, re , "_");
// const int pos = str_image_u.find(".");
// str_image_u = str_image_u.substr(0,pos) + "_" + str_image_u.substr(pos+1);
image2 >> str_image_u.c_str();
}
{
// Board2D board;
// board << calculus;
// board << CustomStyle( "KForm", new KFormStyle2D( 0.0, 1.0 ) )
// << v;
// ostringstream oss;
// oss << f2 << "-v-" << i << ".eps";
// string str_v = oss.str();
// board.saveEPS( str_v.c_str() );
PrimalForm1ToImage( calculus, v, dbl_image );
ostringstream oss3;
//oss3 << f2 << "-l" << tronc_l << "-v.pgm";
oss3 << boost::format("%s-l%.7f-v.pgm") %f2 %l;
string str_image_v = oss3.str();
dbl_image >> str_image_v.c_str();
}
l1 /= lr;
} // while ( l1 >= l2 )
// typedef SelfAdjointEigenSolver<MatrixXd> EigenSolverMatrix;
// const EigenSolverMatrix eigen_solver(laplace.myContainer);
// const VectorXd eigen_values = eigen_solver.eigenvalues();
// const MatrixXd eigen_vectors = eigen_solver.eigenvectors();
// for (int kk=0; kk<laplace.myContainer.rows(); kk++)
// {
// Calculus::Scalar eigen_value = eigen_values(kk, 0);
// const VectorXd eigen_vector = eigen_vectors.col(kk);
// const Calculus::DualForm0 eigen_form = Calculus::DualForm0(calculus, eigen_vector);
// std::stringstream ss;
// ss << "chladni_eigen_" << kk << ".svg";
// const std::string filename = ss.str();
// ss << "chladni_eigen_vector_" << kk << ".svg";
// trace.info() << kk << " " << eigen_value << " " << sqrt(eigen_value) << " " << eigen_vector.minCoeff() << " " << eigen_vector.maxCoeff() << " " << standard_deviation(eigen_vector) << endl;
// Board2D board;
// board << domain;
// board << calculus;
// board << CustomStyle("KForm", new KFormStyle2D(eigen_vectors.minCoeff(),eigen_vectors.maxCoeff()));
// board << eigen_form;
// board.saveSVG(filename.c_str());
// }
f.close();
return 0;
}