List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
Improving Morphology Operation for 2D Hole Filling Algorithm
Full text
 PDF(476.4KB)
Source 
International Journal of Image Processing (IJIP)
Table of Contents
Download Complete Issue    PDF(2.27MB)
Volume:  6    Issue:  1
Pages:  NULL
Publication Date:   February 2012
ISSN (Online): 1985-2304
Pages 
1 - 12
Author(s)  
 
Published Date   
21-02-2012 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Morphology Operation, Dialation Morphology, Object Filling, 2D Object Filling, Object Holes, Noise Removal 
 
 
No record found
 
 
object detection may result with some noises, the correct detecting of such object plays a major role for later recognition steps, the interior noise of the object must be removed, the morphological operations are used successfully for this purpose, these morphological operations are applied for 2D holes filling using dilation operation, in this paper we have enhanced this algorithm to get better and faster version that will reduce the processing time dramatically by using a dynamic marker, we have applied two kind of markers with different structuring elements but same size which is 3x3, the processing time is reduced and our algorithm reduced the processing time of the original algorithm down to one third, the results also enhanced since there are some cases missed by the extant version of morphological operations holes filling algorithm 
 
 
 
1 R. Gonzalez, R. Woods. “Digital Image Processing”,Pearson Prentice Hall, First Impression, 2009, pp.665, 682.
2 Oxford Dictionary.
3 E. Firestone. “An Exploration Of Hole Filling Algorithms”, M.Sc. Thesis, Faculty Of California Polytechnic State University, San Luis Obisp, 2008.
4 Z. Aktouf, G. Bertrand, and L. Perroton. (2002, March). “A Three Dimensional Holes Closing Algorithm”, ELSEVIER Pattern Recognition Letters, Vol. 23 (5), 523–531. Available: 10.1016/S0167-8655(01)00152-0.
5 E. Cohen , L. Tekumalla , and E. Cohen. ”A Hole-Filling Algorithm for Triangular Meshes”, School of Computing, University of Utah, USA, 2004.
6 M. Dellepiane, A. Venturi, and R. Scopigno. (2011). ”Image guided reconstruction of unsampled data: a coherent filling for uncomplete Cultural Heritage models”, Springer Publication, International Journal of Computer Vision, USA, Vol. 94(1). Available: 10.1007/s11263-010-0382-2.
7 M. Hasan, P. Mishra, “Connected Boundary RegionTracing for Object Hole Filling. ”International Conference on Advances in Engineering and Technology (ICAET 2011), Bhubaneswar, India, November 2011, pp.67-72.
8 M. Droogenbroeck, and H. Talbot. (1996, December 30).”Fast Computationof Morphological Operations with Arbitrary Structuring Elements”, Pattern Recognition Letters Journal, USA, Vol. 17(14), 1451-1460. Available: 10.1016/S0167-8655(96)00113-4.
9 X. Wu, M. Wang, and B. Han, “An Automatic Hole-Filling Algorithm for Polygon Meshes”, Computer-Aided Design and Applications, vol. 5( 6):889-899, 2008.
10 C. Chen, K. Cheng, and H. Liao, ”A Sharpness Dependent Approach to 3D Polygon Mesh Hole Filling”, Proceedings of EuroGraphics, 2005, pp. 13-16.
11 A. Kumar, A. Shih, Y. Ito, D. Ross, and B. Soni,”A Hole-filling Algorithm Using Non-uniform Rational B-splines”, Department of Mechanical Engineering, University of Alabama at Birmingham, Birmingham, AL, U.S.A., >2008.
12 K. Oh, S. Yea,and Y. Ho,” Hole-Filling Method Using Depth Based In-Painting For View Synthesis in Free Viewpoint Television (FTV) and 3D Video”, IEEE 27th conference on Picture Coding Symposium, Chicago, IL, 2009, pp. 1-4.
13 A. Brunton, S. Wuhrer, C. Shu, P. Bose, and E. Demaine. (2010) “Filling Holes in Triangular Meshes Using Digital Images by Curve Unfolding”, International Journal of Shape Modeling, Vol. 16(1-2), 151-171. Available: 10.1142/S0218654310001328.
14 M. Wei, J. Wu, and M. Pang. (2010). “An Integrated Approach To Filling Holes In Meshes”, IEEE International Conference on Artificial Intelligence and Computational Intelligence, 2010, Vol.3, 306 – 310. Available: 10.1109/AICI.2010.302.
 
 
 
 
 
 
 
 
Mokhtar M. Hasan : Colleagues
Pramod K. Mishra : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.