COMPGROUPS.NET | Search | Post Question | Groups | Stream | About | Register

### Vector comparison

• Email
• Follow

```Hey folks! I am new to IDL and will work with it on both optical and
radar imagery. I want to extract features like lines, regions,
polygons etc. and compare them on a symbolic level i.e. in vector
space. For example, I want to compare the lengths of two lines, the
enclosed angle and possible junctions. Do you guys know any library
who enables comapring features on a symbolic (no pixel level!) level?

Cheers
Jan
```
 0
Reply janwegner (1) 7/1/2008 8:12:40 AM

See related articles to this posting

0 Replies
55 Views

Similar Articles

12/11/2013 9:23:12 AM
[PageSpeed]

Similar Artilces:

Speeding up Vector Comparison
Dear Group, I have a compiled function that compares two vectors by computing the mean of the absolute value of the difference between the two vectors -- subject to the constraint that if both sub-elements of the vector are less then a threshold value, they do not contribute to the difference (see example below). The function gets executed about 100million times over the course of a simulation. I've optimized it as much as I can, but it is still a bottleneck (~7 hrs). Can anyone see an obvious way to rewrite my function (below) so that it runs faster? Example (the ac...

After sorting a vector, how to get max in this vector?
Dear all, After sorting a vector, how to get max in this vector? I got a strange result of my test code. ------------------------------------------------- #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { vector<int> vec; vec.push_back(5); vec.push_back(-5); vec.push_back(10); sort(vec.begin(),vec.end()); for (int i=0;i<vec.size();++i) { cout << vec[i] << '\t'; } cout << endl; cout << "Max=" << *vec.end() << endl; cout << "Min=" << vec[...

vectorization
Hello everyone, I've a question on vectorization. I think it' easy but I don"t remember let x=[1 2 3] and A =[1 2 3 4 5 6] I'ld like to find how I can compute the matrix B = [1 2 3 4 5 6; 2 4 6 8 10 12; 3 6 9 12 15 18] I'm looking for a vectorized solution ! Each row of A is multiply by each element of x. Thanks for your help Luc "dal.luc" <dal.luc@gmail.com> wrote in message news:1118fd43-9f23-4528-bfe1-96e73ea4b50c@m11g2000vbs.googlegroups.com... > Hello everyone, > > I've a question on vectorization. > I think...

For a particular application of mine, I need to create a considerably huge vector, initialized with the default constructor of a given class. For eg the code fragment might look like - vector<MyClass> vt ; vt.reserve(1024); // some huge number for (int i = 0 ; i < 1024 ; i++ ) vt.push_back (MyClass() ); Instead of doing it like this, is there any other API, that would be look like - vector<MyClass> CreateVector<MyClass>(1024) ? This would return a vector<MyClass> of 1024 elements all initialized with the default constructor and initialized *quickly* compar...

Vectors
Hi All, I'm a math senior high school teacher, and I wish to understand how using mathematica 7 to find "h" and the intersection point between the plane 6x-2y+z=11 which contains the line x-1 = (y+1)/2 = (z-3)/h. Also how to plot/show it visually in 3D graph. Many thank's. Harry. On 1/14/2012 2:01 AM, Harry Har wrote: > Hi All, > > I'm a math senior high school teacher, and I wish to understand how > using mathematica 7 to find "h" and the intersection point between the > plane 6x-2y+z=11 which contains the line x-1 = (y+1)/2 ...

sorting a vector segment of a vector<string>
How does one sort only part of a vector of strings i.e vector<string>. sort ( xx,xx.begin(),xx.end() ) sorts the full xx . I have a application in which i have resized xx to a good size , but i want to sort only the top which contains my strings. -- [ See http://www.gotw.ca/resources/clcm.htm for info about ] [ comp.lang.c++.moderated. First time posters: Do this! ] On Jul 21, 10:16 am, TomCat <uselesso...@gmail.com> wrote: > How does one sort only part of a vector of strings i.e > vector<string>. > sort ( xx,xx.begin(),xx.end() ) sorts the fu...

converting vector<(any-type)> to vector<bool> (and back)
hello, community! i need to convert a vector<(any-integral-type)> to a bool-vector (and back). this is a problem, since you can't assign an "unsigned long" to a vector<bool> (like you can do it with bitset<N>). but i can't use bitsets, because i need _dynamic_ bit arrays. i've searched for the solution on the web, but not found anything that could help me. i'm using the following routine, which is, as expected, very slow: this code is a simplified version, it converts someType to vector<bool>, instead of vector<any-type> to vector<...

Covariant vectors
Hi all, I've been looking for a way to simulate covariant, const, vectors for some time. From another thread, it seems as though vectors are supposed to be allocated contiguously. So I wonder if the technique below is safe and legal in the general case. In particular, I'm not sure if given virtual or multiple inheritance, the pointers would be adjusted properly. // Foo.hpp struct Base { int a; }; void Foo(Base*, size_t); // Foo.cpp #include <iostream> #include "Foo.hpp" void Foo(Base* array, size_t size) { for (size_t i = 0; i < size; ++i) s...

Vectorize procedure
Hi, I'm vectorizing a procedure in order to delete three for loops and increase the speed. I have to calculating the interpolation on a regular grid. newy=interpol(y,x,newx,/spline) in the loop manner for each index of the loop there are three different arrays . in the vectorize manner I have three 3D matrices, But I do not found a way to calculate the interpolation matrix. Any one have suggestions? Thanks Romolo In article <041dea05-b2af-435a-b9e9-7ca360287c69@p35g2000yqh.googlegroups.com>, Romolo Politi <romolo.politi@gmail.com> wrote: > Hi, &g...

Auto vectorization
Hi all: I am currently working on the auto-vectorization phase in the GCC. I have some points to discuss. 1-- How you define the profitability of auto-vectorization phase? Is it just the speed up? If we do not get any speed up over scalar code then there is no need to do auto-parallelization. 2--What are the phases or features in a compiler ( especially in the GCC) that control the quality of auto-vectorization? Thanks JAY. There is a brief description of how vectorizer works in Intel compiler: http://www.springerlink.com/content/fl3l017321p11760/fulltext.pdf According to the paper, alig...

what is the dependence vector
Hi I'm reading the paper "A Data Locality Optimizing Algorithm", by Michael E. Wolf and Monica S. Lam. In section 2, it describes the dependence vector as, >>" a generalization of distance and direction vectors. A dependence vector in an n-nested loop is denoted by a vector d=(d1,d2,...,dn) each component di is a possibly infinite range of integers, represented by [di_min, di_max], where di_min b Z b* {-b}, di_max b Z b* {b} and di_min b \$ di_max <<" Here, a n-nested loop corresponds to a finite convex polyhedron of iteration space Zn (n pow...

Comparisons and Benchmarking
Hey guys If you've been reading other threads i replied to, i probably mentioned I've been working on my own language. And i am not sure whats the best way to compare my language as in benchmarking it against other languages. I mean what kind of algorithm's should one implement to test a language and its features against others. To test for speed, efficiency and memory usage throughout the runtime; I do a Mathematics degree, and so i started working on doing some numerical analysis algorithms like Rhomberg Integration, Taylor Series and Lagrange Interpolation, because...

A vector of strings
I am writing code to put C-style command line arguments (int argc, char *argv[]) into a vector of strings (std::vector<std::string> theArgv). I have a question: Is it better to do a) theArgv.push_back(argv[i]); or b) theArgv.push_back(std::string(argv[i])); or are these identical? -- [ See http://www.gotw.ca/resources/clcm.htm for info about ] [ comp.lang.c++.moderated. First time posters: Do this! ] On 27 Jun., 22:10, ampheta...@gmail.com wrote: > I am writing code to put C-style command line arguments (int argc, > char *argv[]) into a vector of strings (std...

Vectorize the following :
x is a vector of length n. N is a cell array of length n. Each element N{i} of N contains a vector of indices into x. For example : x = [11 12 13]; N = cell(3,1); N{1} = [1 2]; N{2} = [1 3]; N{3} = [1 2 3]; I want to do the following : s = 0; for i = 1:lengt...

Vector Issues
I recently came across something that is driving me nuts. I have two cattesian coordinates, lets say [10. 10.] [5. 5.]. Now i want to find the angle that [ 5. 5. ] is in relationship to [ 10. 10. ] .. In other words, where it lies with respect to the "origin" point of 10,10. (225 deg) Now my calculator gives me back 7.0... @ 45 deg. It is giving the relation from 0,0. How can i get it to give the angle FROM the other point? examples of what i want: [ 10 10 ] [11 10 ] -> [ 1 a0 ] [ 10 10 ] [5 5 ] -> [ 7.01... a225 ] [ -25 -25 ] [ -25 -20 ] -> [ 5 a90 ] I've t...

How do I vectorize this? 20743
N =11; a = zeros((N+1)^3,1); b = a; c = a; n=0; for i = 1:N+1 for j=1:N+1 for k=1:N+1 n = n+1; a(n) = i-1; b(n) = j-1; c(n) = k-1; end end end p = [a b c]/(N+1) It's got to be easy. However, I just don't see it. Thanks, Greg Greg Heath wrote: > N =11; > a = zeros((N+1)^3,1); > b = a; > c = a; > n=0; > for i = 1:N+1 > for j=1:N+1 > for k=1:N+1 > n = n+1; > a(n) = i-1; > b(n) = j-1; > c(n) = k-1; > end > end > end > p = [a b c]/(N+1) > It's got to be easy. However, I just don't see it. > > Thanks, > > Greg Wro...

variance vector
Hi, I am working with an output signal which has 1000 samples per bit. I would like to calculate its variance among the different bits, I mean, the variance between 1000 samples and the next 1000 samples. Do you have any idea about how could I do it? thanks in advance On Dec 6, 5:33=A0am, "Javier Franco Biurrun" <xaviperso...@gmail.com> wrote: > Hi, > > I am working with an output signal which has 1000 samples per bit. I woul= d like to calculate its variance among the different bits, I mean, the vari= ance between 1000 samples and the next 1000 samples. ...

Vector blend
Long ago, I used to use Micrografx Designer, which had this handy little feature where you could place a green box and a red circle, set the number of steps and get a kind of morph from one to the other. I don't see any way to do this in PSP and wondered if anyone had "faked" their way through it? TIA, jma ...

Vector Tools
Anyone know of an up to date tutorial for PSP 9 vector tools? I learnt a lot from the Rons Toons Tutorial which was very good, but the tool set has changed somewhat since PSP 7! Cheers, Col colin.steadman@gmail.com wrote: > Anyone know of an up to date tutorial for PSP 9 vector tools? I > learnt a lot from the Rons Toons Tutorial which was very good, > but the tool set has changed somewhat since PSP 7! Actually, they have not changed much at all, except for rearranging the locations of menu commands and icons and the tool's new name of Pen. The only new functions are the ...

TFT Comparison
Hi, I set out to do a good deed and help my father-in-law buy a screen for his new PC. That was before I realised how many models there are on the market!! I have managed to narrow it down to 2 that are exactly the same price (even when postage is considered) but need help to determine which is the best. In terms of usage, my father-in-law is unlikely to use it for playing demanding games like Doom 3 or GTA (he's a retired vicar!!!). More likely, he will just be working with word, browsing the web and sending emails. The only other thing he may do is dabble in a spot of video editing. O...