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
|
/* @(#) Function which calculates the coefficients between corresponding
* @(#) points from reference and secondary images (probably from the scanner),
* @(#) previously calculated using the functions im_calcon() and im_chpair()
* @(#) It is assummed that a selection of the best(?) possible points has
* @(#) been already carried out and that those nopoints points are in arrays
* @(#) x1, y1 and x2, y2
* @(#) No IMAGES are involved in this function and the calculated parameters
* @(#) are returned in scale angle deltax and deltay of the TIE_POINTS struct.
* @(#)
* @(#) int im_clinear( points )
* @(#) TIE_POINTS *points;
* @(#)
* @(#) Returns 0 on sucess and -1 on error.
*
* Copyright: 1990, N. Dessipris.
*
* Author: Nicos Dessipris
* Written on: 20/12/1990
* Modified on : 18/04/1991
* 24/1/97 JC
* - tiny mem leak fixed
*/
/*
This file is part of VIPS.
VIPS is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
/*
These files are distributed with VIPS - http://www.vips.ecs.soton.ac.uk
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif /*HAVE_CONFIG_H*/
#include <vips/intl.h>
#include <stdio.h>
#include <math.h>
#include <vips/vips.h>
#include <vips/internal.h>
#include "pmosaicing.h"
int
im__clinear( TIE_POINTS *points )
{
double **mat; /* matrix mar[4][4] */
double *g; /* vector g[1][4] */
double value;
double sx1=0.0, sx1x1=0.0, sy1=0.0, sy1y1=0.0, sx1y1 = 0.0;
double sx2x1=0.0, sx2y1=0.0, sx2=0.0, sy2=0.0, sy2y1=0.0, sy2x1=0.0;
int i, j;
int elms;
double scale, angle, xdelta, ydelta;
int *xref, *yref, *xsec, *ysec;
double *dx, *dy, *dev;
xref = &points->x_reference[0];
yref = &points->y_reference[0];
xsec = &points->x_secondary[0];
ysec = &points->y_secondary[0];
dx = &points->dx[0];
dy = &points->dy[0];
dev = &points->deviation[0];
elms = points->nopoints;
if( !(mat = im_dmat_alloc( 0, 3, 0, 3 )) )
return( -1 );
if( !(g = im_dvector( 0, 3 )) ) {
im_free_dmat( mat, 0, 3, 0, 3 );
return( -1 );
}
for( i = 0; i < points->nopoints; i++ ) {
sx1 += xref[i];
sx1x1 += xref[i] * xref[i];
sy1 += yref[i];
sy1y1 += yref[i] * yref[i];
sx1y1 += xref[i] * yref[i];
sx2x1 += xsec[i] * xref[i];
sx2y1 += xsec[i] * yref[i];
sy2y1 += ysec[i] * yref[i];
sy2x1 += ysec[i] * xref[i];
sx2 += xsec[i];
sy2 += ysec[i];
}
mat[0][0] = sx1x1 + sy1y1;
mat[0][1] = 0;
mat[0][2] = sx1;
mat[0][3] = sy1;
mat[1][0] = 0;
mat[1][1] = sx1x1 + sy1y1;
mat[1][2] = -sy1;
mat[1][3] = sx1;
mat[2][0] = sx1;
mat[2][1] = -sy1;
mat[2][2] = (double)elms;
mat[2][3] = 0.0;
mat[3][0] = sy1;
mat[3][1] = sx1;
mat[3][2] = 0.0;
mat[3][3] = (double)elms;
g[0] = sx2x1 + sy2y1;
g[1] = -sx2y1 + sy2x1;
g[2] = sx2;
g[3] = sy2;
if( im_invmat( mat, 4 ) ) {
im_free_dmat( mat, 0, 3, 0, 3 );
im_free_dvector( g, 0, 3 );
im_error( "im_clinear", "%s", _( "im_invmat failed" ) );
return( -1 );
}
scale = 0.0; angle = 0.0;
xdelta = 0.0; ydelta = 0.0;
for( j = 0; j < 4; j++ ) {
scale += mat[0][j] * g[j];
angle += mat[1][j] * g[j];
xdelta += mat[2][j] * g[j];
ydelta += mat[3][j] * g[j];
}
/* find the deviation of each point for the estimated variables
* if it greater than 1 then the solution is not good enough
* but this is handled by the main program
*/
for( i = 0; i < points->nopoints; i++ ) {
dx[i] = xsec[i] -
((scale * xref[i]) - (angle * yref[i]) + xdelta);
dy[i] = ysec[i] -
((angle * xref[i]) + (scale * yref[i]) + ydelta);
value = sqrt( dx[i]*dx[i] + dy[i]*dy[i] );
dev[i] = value;
}
points->l_scale = scale;
points->l_angle = angle;
points->l_deltax = xdelta;
points->l_deltay = ydelta;
im_free_dmat( mat, 0, 3, 0, 3 );
im_free_dvector( g, 0, 3 );
return( 0 );
}
|
