| | |
| | | |
| | | |
| | | *(l.cost) += pow((1-iou), 2); |
| | | if(0){ |
| | | l.delta[j+0] = (state.truth[j+0] - l.output[j+0]); |
| | | l.delta[j+1] = (state.truth[j+1] - l.output[j+1]); |
| | | l.delta[j+2] = (state.truth[j+2] - l.output[j+2]); |
| | | l.delta[j+3] = (state.truth[j+3] - l.output[j+3]); |
| | | }else{ |
| | | l.delta[j+0] = 4 * (state.truth[j+0] - l.output[j+0]) / 7; |
| | | l.delta[j+1] = 4 * (state.truth[j+1] - l.output[j+1]) / 7; |
| | | l.delta[j+0] = 4 * (state.truth[j+0] - l.output[j+0]); |
| | | l.delta[j+1] = 4 * (state.truth[j+1] - l.output[j+1]); |
| | | l.delta[j+2] = 4 * (state.truth[j+2] - l.output[j+2]); |
| | | l.delta[j+3] = 4 * (state.truth[j+3] - l.output[j+3]); |
| | | } |
| | | if(0){ |
| | | if(1){ |
| | | for (j = offset; j < offset+classes; ++j) { |
| | | if(state.truth[j]) state.truth[j] = iou; |
| | | l.delta[j] = state.truth[j] - l.output[j]; |