10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

382 CHAPTER 5. EUCLIDEAN DISTANCE MATRIX<br />

5.4.3.3 Inner-product form, discussion<br />

We deduce that knowledge of interpoint distance is equivalent to knowledge<br />

of distance and angle from the perspective of one point, x 1 in our chosen<br />

case. The total amount of information N(N −1)/2 in Θ T Θ is unchanged 5.21<br />

with respect to EDM D .<br />

5.5 Invariance<br />

When D is an EDM, there exist an infinite number of corresponding N-point<br />

lists X (68) in Euclidean space. All those lists are related by isometric<br />

transformation: rotation, reflection, and translation (offset or shift).<br />

5.5.1 Translation<br />

Any translation common among all the points x l in a list will be cancelled in<br />

the formation of each d ij . Proof follows directly from (794). Knowing that<br />

translation α in advance, we may remove it from the list constituting the<br />

columns of X by subtracting α1 T . Then it stands to reason by list-form<br />

definition (798) of an EDM, for any translation α∈ R n<br />

D(X − α1 T ) = D(X) (876)<br />

In words, interpoint distances are unaffected by offset; EDM D is translation<br />

invariant. When α = x 1 in particular,<br />

[x 2 −x 1 x 3 −x 1 · · · x N −x 1 ] = X √ 2V N ∈ R n×N−1 (865)<br />

and so<br />

(<br />

D(X −x 1 1 T ) = D(X −Xe 1 1 T ) = D X<br />

[0 √ ])<br />

2V N<br />

= D(X) (877)<br />

5.21 The reason for amount O(N 2 ) information is because of the relative measurements.<br />

Use of a fixed reference in measurement of angles and distances would reduce required<br />

information but is antithetical. In the particular case n = 2, for example, ordering all<br />

points x l (in a length-N list) by increasing angle of vector x l − x 1 with respect to<br />

x 2 − x 1 , θ i1j becomes equivalent to j−1 ∑<br />

θ k,1,k+1 ≤ 2π and the amount of information is<br />

reduced to 2N −3; rather, O(N).<br />

k=i

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!