Rank: 419053 based on 0 downloads (last 30 days) and 0 file submitted
photo

Kazim Hanbay

E-mail
Company/University
bingol university

Personal Profile:

Lecturer

Professional Interests:
image processing,optimization

 

Watch this Author's files

 

Comments and Ratings by Kazim
Updated File Comments Rating
11 Mar 2012 Bidirectional Branch and Bound Solvers for Worst Case Loss Minimization Two branch and bound solvers using worst case loss criterion to select controlled variables. Author: Yi Cao

I want to selecet optimal features from 20 statistics.GLCM(gry level co-occurence matrix) contains the second -order statistical information. of neighboring pixels of an image.Features are generally selected by search procedures.Especially,branch and bound techniques have been fully exploited to extract the feature from mamogram images.I have attempt to optimize the feature og GLSM by fast branch and bound technique to extrcat most relevant features fot my classification work.How do I use your program(Bidirectional Branch and Bound (B3) for Average Loss Criterion).How do I select the 6 optimal feature from 20 features using your program.

Contact us