~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

Linux Cross Reference
Tina5/tina-libs/tina/math/mathNum_dprog.c

Version: ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  1 /**********
  2  *
  3  * Copyright (c) 2003, Division of Imaging Science and Biomedical Engineering,
  4  * University of Manchester, UK.  All rights reserved.
  5  * 
  6  * Redistribution and use in source and binary forms, with or without modification, 
  7  * are permitted provided that the following conditions are met:
  8  * 
  9  *   . Redistributions of source code must retain the above copyright notice, 
 10  *     this list of conditions and the following disclaimer.
 11  *    
 12  *   . Redistributions in binary form must reproduce the above copyright notice,
 13  *     this list of conditions and the following disclaimer in the documentation 
 14  *     and/or other materials provided with the distribution.
 15  * 
 16  *   . Neither the name of the University of Manchester nor the names of its
 17  *     contributors may be used to endorse or promote products derived from this 
 18  *     software without specific prior written permission.
 19  * 
 20  * 
 21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
 22  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
 23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 
 25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
 26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
 27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 28  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 
 29  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
 30  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
 31  * POSSIBILITY OF SUCH DAMAGE.
 32  *
 33  **********
 34  *
 35  * Program :    TINA
 36  * File    :  $Source: /home/tina/cvs/tina-libs/tina/math/mathNum_dprog.c,v $
 37  * Date    :  $Date: 2005/01/23 19:10:21 $
 38  * Version :  $Revision: 1.6 $
 39  * CVS Id  :  $Id: mathNum_dprog.c,v 1.6 2005/01/23 19:10:21 paul Exp $
 40  *
 41  * Author  :  Legacy TINA
 42  *
 43  * Notes : Dynamic programming
 44  *
 45  *********
 46 */
 47 /** 
 48  *  @file
 49  *  @brief  Dynamic Programming function.       
 50  *
 51  *  
 52  * 
 53 */
 54 
 55 #include "mathNum_dprog.h"
 56 
 57 #if HAVE_CONFIG_H
 58 #include <config.h>
 59 #endif
 60 
 61 #include <tina/sys/sysDef.h>
 62 #include <tina/sys/sysPro.h>
 63 
 64 int            *dprog(int lx, int ly, int ux, int uy, double (*cost1) ( /* ??? */ ), double (*cost2) ( /* ??? */ ))
 65 {
 66         float         **cost = farray_alloc(lx, ly, ux + 1, uy);
 67         int           **match = iarray_alloc(lx, ly, ux, uy), *choice;
 68         int             x, y, z, zmin=0;
 69         double          c = 0.0;
 70         double          cmin;
 71 
 72         for (x = ux - 1; x >= lx; x--)
 73         {
 74                 for (y = ly; y < uy; y++)
 75                 {
 76                         cmin = 1e10;
 77                         for (z = ly; z < uy; z++)
 78                         {
 79                                 c = cost2(x, y, x + 1, z) + cost[x + 1][z];
 80                                 if (cmin > c)
 81                                 {
 82                                         cmin = c;
 83                                         zmin = z;
 84                                 }
 85                         }
 86                         cost[x][y] = (float) (cost1(x, y) + cmin);
 87                         match[x][y] = zmin;
 88                 }
 89         }
 90 
 91         cmin = 1e10;
 92         for (z = ly; z < uy; z++)
 93         {
 94                 //cost[lx][z];  /* BUG what does this do! */
 95                 if (cmin > c)
 96                 {
 97                         cmin = c;
 98                         zmin = z;
 99                 }
100         }
101         farray_free(cost, lx, ly, ux + 1, uy);
102 
103         choice = ivector_alloc(lx, ux);
104         choice[lx] = zmin;
105         for (x = lx; x < ux - 1; x++)
106                 choice[x + 1] = match[x][choice[x]];
107 
108         iarray_free(match, lx, ly, ux, uy);
109         return (choice);
110 }
111 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~ [ freetext search ] ~ [ file search ] ~

This page was automatically generated by the LXR engine.
Visit the LXR main site for more information.