peak finding for canny

18
Peak finding for Canny Also called Non- maximaSuppression

Upload: fancy

Post on 09-Jan-2016

39 views

Category:

Documents


0 download

DESCRIPTION

Peak finding for Canny. Also called Non- maximaSuppression. Actual code for Peaks. for( i = MR;i

TRANSCRIPT

Page 1: Peak finding for Canny

Peak finding for Canny

Also called Non-maximaSuppression

Page 2: Peak finding for Canny
Page 3: Peak finding for Canny
Page 4: Peak finding for Canny
Page 5: Peak finding for Canny
Page 6: Peak finding for Canny
Page 7: Peak finding for Canny
Page 8: Peak finding for Canny
Page 9: Peak finding for Canny
Page 10: Peak finding for Canny
Page 11: Peak finding for Canny
Page 12: Peak finding for Canny
Page 13: Peak finding for Canny
Page 14: Peak finding for Canny
Page 15: Peak finding for Canny
Page 16: Peak finding for Canny
Page 17: Peak finding for Canny

Actual code for Peaks• for(i=MR;i<256-MR;i++){• for(j=MR;j<256-MR;j++){•

• if((xconv[i][j]) == 0.0) {• xconv[i][j] = .00001;• }• slope = yconv[i][j]/xconv[i][j];• if( (slope <= .4142)&&(slope > -.4142)){• if((mag[i][j] > mag[i][j-1])&&(mag[i][j] > mag[i][j+1])){• cand[i][j] = 255;• }• }• else if( (slope <= 2.4142)&&(slope > .4142)){• if((mag[i][j] > mag[i-1][j-1])&&(mag[i][j] > mag[i+1][j+1])){• cand[i][j] = 255;• }• }• else if( (slope <= -.4142)&&(slope > -2.4142)){• if((mag[i][j] > mag[i+1][j-1])&&(mag[i][j] > mag[i-1][j+1])){• cand[i][j] = 255;• }• }else{• if((mag[i][j] > mag[i-1][j])&&(mag[i][j] > mag[i+1][j])){• cand[i][j] = 255;• }• }• }• }

Page 18: Peak finding for Canny

Hysteresis (Double) Threshold• while(more){• more = 0;• for(i=0;i<256;i++){• for(j=0;j<256;j++){• if(cand[i][j] == 255){• if(mag[i][j] > HI){• final[i][j] = 255;• more = 1;• cand[i][j] = 0;• }• else if(mag[i][j] < LO){• final[i][j] = 0;• cand[i][j] = 0;• }• else if( (mag[i][j] > LO)&&(mag[i][j] < HI) ){• for(p=-1;p<2;p++){• for(q=-1;q<2;q++){• if(final[i+p][j+q] == 255){• final[i][j] = 255;• cand[i][j] = 0;• more = 1;• }• }• }• }/*end-last-else-if*/• }/*end-first-if*/• }• }/*end-first-for*/• }/*end-while*/•