DOI:10.20894/IJDMTA.
Periodicity: Bi Annual.
Impact Factor:
SJIF:4.893 & GIF:0.787
Submission:Any Time
Publisher: IIR Groups
Language: English
Review Process:
Double Blinded

News and Updates

Author can submit their paper through online submission. Click here

Paper Submission -> Blind Peer Review Process -> Acceptance -> Publication.

On an average time is 3 to 5 days from submission to first decision of manuscripts.

Double blind review and Plagiarism report ensure the originality

IJDMTA provides online manuscript tracking system.

Every issue of Journal of IJDMTA is available online from volume 1 issue 1 to the latest published issue with month and year.

Paper Submission:
Any Time
Review process:
One to Two week
Journal Publication:
June / December

IJDMTA special issue invites the papers from the NATIONAL CONFERENCE, INTERNATIONAL CONFERENCE, SEMINAR conducted by colleges, university, etc. The Group of paper will accept with some concession and will publish in IJDMTA website. For complete procedure, contact us at admin@iirgroups.org
Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 1 Issue 2 Date of Publication:   December 2012

Selection of Feature Regions Set for Digital Image Using Optimization Algorithm

Alpana A. Borse,Snehal M. Kamlapur

Page(s):   50-56 ISSN:   2278-2397
DOI:   10.20894/IJDMTA.102.001.002.007 Publisher:   Integrated Intelligent Research (IIR)

A feature based �Selection of feature region set for digital image using Optimization Algorithm� is proposed here. The work is based on simulated attacking and optimization solving procedure. Image transformation techniques are used to extract local features. Simulated attacking procedure is performed to evaluate the robustness of every candidate feature region. According to the evaluation results, a track-with-pruning procedure I adopted to search a minimal primary feature set which may resists the most predefined attacks. In order to enhance its resistance capability against undefined attacks, primary feature set is then extended by adding some auxiliary feature regions in it. This work is formulated as a multidimensional knapsack problem and solved by optimization algorithms such as Genetic Algorithm, Particle Swarm Optimization and Simulated Annealing.