Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8792341
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 13, 20262026-06-13T22:57:57+00:00 2026-06-13T22:57:57+00:00

I wrote this code to find optimal warping path of Dynamic time warping ,

  • 0

I wrote this code to find optimal warping path of Dynamic time warping , it returns a struct .

static inline double min (double x, double y,double z )
{
    if(x < y && x < z)
    return x;
    else if(y < x && y < z)
    return y;
    else if(z < x && z < y)
    return z;
}

struct backtracking_result
{
   vector<int> i;
   vector<int> j;
};

backtracking_result backtracking(vector<vector<double> > mGamma)
{
    backtracking_result br;
    cout<<"test"<<mGamma.size()<<endl;
    int i=mGamma.size();
    cout<<"test"<<endl;
    int j=mGamma.at(0).size();
    cout<<"test"<<endl;
    cout<<i<<j<<endl;   
    do
    {
         cout<<"test"<<endl;
         if(i == 1)
            j=j-1;
         else if(j == 1)
            i=i-1;
         else
         {
            if(mGamma[i-1][j] == min(mGamma[i-1][j],mGamma[i][j-1],mGamma[i-1][j-1]))
             i=i-1;
            else if(mGamma[i][j-1] == min(mGamma[i-1][j],mGamma[i][j-1],mGamma[i-1][j-1]))
                 j=j-1;
            else
            {
                i=i-1;
                j=j-1;
            }
         }
    br.i.push_back(i);
    br.j.push_back(j);
  }while((i > 1)&&(j > 1));

  return br;
}

When i call this function , get this error from gdb debugger

Program received signal SIGSEGV, Segmentation fault.
0x000000000041eafb in VectorDTW::backtracking(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > >) ()

Where is the error ?

Stacktrace :

#0  0x000000000041eb17 in VectorDTW::backtracking(std::vector<std::vector<double, std::allocator<double> >, std::allocator<std::vector<double, std::allocator<double> > > >) ()
#1  0x0000000000420195 in VectorDTW::fastdynamic(std::vector<DollarRecognizer::Point2D, std::allocator<DollarRecognizer::Point2D> >&, std::vector<DollarRecognizer::Point2D, std::allocator<DollarRecognizer::Point2D> >&) ()
#2  0x000000000041d18b in main ()

The answers helped me figure out the problem , I added these two lines after calculating i & j at from the matrix ,

i=i-1;
j=j-1;

Now the program doesn’t try to access the last element . Thanks .
But i still cannot understand the reason for down-votes .

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-13T22:57:58+00:00Added an answer on June 13, 2026 at 10:57 pm

    Since j is the size of the internal vector<double>, mGamma[i-1][j] does not exist. You have the typical off-by-one error.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I wrote this code to find the prime numbers less than the given number
I wrote this code to find all possible permutations of some numbers. But i
I try to realize shopping cart, and i wrote this code: if cookies[:shopping_cart] Cart.find(cookies[:shopping_cart][:value])
I wrote this code for zoom in/out . it works but even with one
I wrote this code for zoom in / out and it suppesed to only
I wrote this code to create a custom annotation image - (MKAnnotationView *)mapView:(MKMapView *)mapView
I wrote this code in C# to encrypt a string with a key: private
I wrote this code. The constructor works normally, but in the destructor I get
I wrote this code that compiles on Solaris gcc it works fine too for
I wrote this code in my viewDidLoad function in my iOS project. lettersLeftLabel.text =

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.