Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/249478
Title: Studies and applications of semi open sets in abstract cellular complex
Researcher: Vijaya N
Guide(s): Sai Sundara Krishnan G
Keywords: Abstract Cellular Complex
Mathematics
Physical Sciences,Mathematics,Mathematics Applied
Semi Open Sets
Topology
University: Anna University
Completed Date: 2017
Abstract: Topology is one of the most important fields in Mathematics which studies the properties of spaces that are invariant under continuous deformation The topological notions like open closed frontier connectedness boundary etc are closely related to the field of Image Analysis To apply all these topological notions in the field of Image Analysis Rosenfeld introduced the notion of Digital Topology and he represented a digital image as a neighborhood graph whose nodes are pixels and whose edges are linking adjacent pixels to each other Though this representation is very much useful for the study of images it contains two paradoxes namely connectivity and boundary paradoxes To overcome these difficulties Kovalevsky initiated a new concept namely Abstract Cellular Complex and established that every Abstract Cellular Complex is isomorphic to Finite Topological Spaces with T0 Separation Axiom This motivates us to study various topological notions on Abstract Cellular Complex Levine introduced the concepts of semi open set and semi continuity in Topological spaces and studied some of their properties Mashhour et al introduced the notion of pre open sets and pre continuous functions in Topological spaces This thesis is mainly focuses on the concept of semi open sub complexes in Abstract cellular complex and investigates some of their basic properties through semi frontier semi interior and semi closure Further the concept of semi neighborhoods local semi neighborhood semi continuous and semi homeomorphism are introduced Kovalevsky s Chain code algorithm to trace the boundary of an object in an image is compared with Moore s Neighborhood algorithm Moreover the boundary tracing algorithm using semi subcomplex is proposed and the proposed algorithm is compared with Kovalevsky s chain code algorithm newline
Pagination: xxi, 148p.
URI: http://hdl.handle.net/10603/249478
Appears in Departments:Faculty of Science and Humanities

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File75.58 kBAdobe PDFView/Open
02_certificates.pdf816.99 kBAdobe PDFView/Open
03_abstract.pdf127.09 kBAdobe PDFView/Open
04_acknowledgement.pdf71.54 kBAdobe PDFView/Open
05_contents.pdf165.56 kBAdobe PDFView/Open
06_list_of_symbols and abbreviations.pdf100.37 kBAdobe PDFView/Open
07_chapter1.pdf500.46 kBAdobe PDFView/Open
08_chapter2.pdf666.59 kBAdobe PDFView/Open
09_chapter3.pdf716.53 kBAdobe PDFView/Open
10_chapter4.pdf1.13 MBAdobe PDFView/Open
11_chapter5.pdf983.32 kBAdobe PDFView/Open
12_chapter6.pdf891.27 kBAdobe PDFView/Open
13_conclusion.pdf105.5 kBAdobe PDFView/Open
14_references.pdf291.12 kBAdobe PDFView/Open
15_list_of_publications.pdf172.95 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: