We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
feat[0] =candidate_pixel_locations(max_id,0)/max_radio_radius_; is divided by max_radio_radius_.
When the random forest is training, the candidated position is calculated with the array candidate_pixel_locations. double project_x1 = rotation(0,0) * candidate_pixel_locations(j,0) + rotation(0,1) * candidate_pixel_locations(j,1);----(1)
But when calculating the binary features, the stored feature (which is divided by max_radio_radius_) is used. double x1 = rand_forest[iter].nodes_[currnode].feat[0]; ... double project_x1 = rotation(0,0) * x1 + rotation(0,1) * y1;----(2)
which meas that the above code (1) and (2) is not using the same candidate_pixel_locations.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
feat[0] =candidate_pixel_locations(max_id,0)/max_radio_radius_; is divided by max_radio_radius_.
When the random forest is training, the candidated position is calculated with the array candidate_pixel_locations.
double project_x1 = rotation(0,0) * candidate_pixel_locations(j,0) + rotation(0,1) * candidate_pixel_locations(j,1);----(1)
But when calculating the binary features, the stored feature (which is divided by max_radio_radius_) is used.
double x1 = rand_forest[iter].nodes_[currnode].feat[0];
...
double project_x1 = rotation(0,0) * x1 + rotation(0,1) * y1;----(2)
which meas that the above code (1) and (2) is not using the same candidate_pixel_locations.
The text was updated successfully, but these errors were encountered: