...Edge detection using Fuzzy Logic and Automata Theory Title Page By Takkar Mohit Supervisor A Thesis Submitted to In Partial Fulfillment of the Requirements for the Degree of Master of Engineering in Electronics & Communication December 2014 . Table of Contents Title Page i CERTIFICATE ii COMPLIANCE CERTIFICATE iii THESIS APPROVAL CERTIFICATE iv DECLARATION OF ORIGINALITY v Acknowledgment vi Table of Contents vii List of Figures x Abstract xiii Chapter 1 Introduction 1 1.1 Edge Detection: Analysis 3 1.1.1 Fuzzy Logic in Image Processing 4 1.1.2 Fuzzy Logic for Edge Detection 5 1.1.3 Cellular Learning Automata 6 Chapter 2 Literature Review 7 2.1 Edge Detection: Methodology 7 2.1.1 First Order Derivative Edge Detection 7 2.1.1.1 Prewitts Operator 7 2.1.1.2 [pic] Sobel Operator 8 2.1.1.3 Roberts Cross Operator 11 2.1.1.4 Threshold Selection 11 2.1.2 Second Order Derivative Edge Detection 11 2.1.2.1 Marr-Hildreth Edge Detector 11 2.1.2.2 Canny Edge Detector 12 2.1.3 Soft Computing Approaches to Edge Detection 13 2.1.3.1 Fuzzy Based Approach 14 2.1.3.2 Genetic Algorithm Approach 14 2.1.4 Cellular Learning Automata 15 Chapter 3 Fuzzy Image Processing 18 3.1 Need for Fuzzy Image Processing 19 3.2 Introduction to Fuzzy sets and Crisp sets 20 3.2.1 Classical sets (Crisp sets) 20 3.2.2 Fuzzy sets 21 3.3 Fuzzification 22 3.4 Membership Value Assignment 22 3.5...
Words: 9151 - Pages: 37
...Computer science From Wikipedia, the free encyclopedia Jump to: navigation, search Computer science or computing science (abbreviated CS) is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems.[1][2] Computer scientists invent algorithmic processes that create, describe, and transform information and formulate suitable abstractions to model complex systems. Computer science has many sub-fields; some, such as computational complexity theory, study the fundamental properties of computational problems, while others, such as computer graphics, emphasize the computation of specific results. Still others focus on the challenges in implementing computations. For example, programming language theory studies approaches to describe computations, while computer programming applies specific programming languages to solve specific computational problems, and human-computer interaction focuses on the challenges in making computers and computations useful, usable, and universally accessible to humans. The general public sometimes confuses computer science with careers that deal with computers (such as information technology), or think that it relates to their own experience of computers, which typically involves activities such as gaming, web-browsing, and word-processing. However, the focus of computer science is more on understanding the properties of the programs used to implement...
Words: 5655 - Pages: 23
...MASTER OF TECHNOLOGY ADVANCED ELECTIVES SELECTION For Semester II 2014/2015 ATA/SE-DIP/TS-11/V1.34 Master of Technology in Software /Knowledge Engineering and Enterprise Business Analytics Table of Contents. MTECH ADVANCED ELECTIVES 1. INTRODUCTION. 1.1 Overview. 1.2 Courses. 1.3 Assessment. 1.4 Elective Selection Process. 2 2 2 2 3 3 2. SCHEDULE FOR ADVANCED ELECTIVES OFFERED DURING SEMESTER II 2014/2015. 2.1 MTech SE and KE Students. 2.2 MTech EBAC Students. 5 5 9 3. CURRICULUM. 12 4. DESCRIPTION OF COURSES. 4.1 Department of Electrical & Computer Engineering. 4.2 School of Computing. 4.3 Institute of Systems Science. 4.4 Department of Industrial & Systems Engineering. 4.5 Division of Engineering & Technology Management. 12 15 23 31 32 34 ATA/SE-DIP/TS-11/V1.34 page 1 of 35 Master of Technology in Software /Knowledge Engineering and Enterprise Business Analytics MASTER OF TECHNOLOGY Advanced Electives 1. INTRODUCTION 1.1 Overview All students that expect to have passed four core courses and eight basic electives after completing the scheduled examinations in November, and also have or expect to pass their project/internship, will be entitled to commence their Advanced Electives in NUS Semester II 2014/2015, which starts on 12 January 2015. However, it should be noted that a student’s registration for the Advanced Electives will be withdrawn if they either: 1. 2. 3. 4. 5. Fail any elective examination in November. Do not successfully...
Words: 15607 - Pages: 63
...mater | University of Pázmány Péter ETH Zürich | Doctoral advisor | Lipót Fejér | Other academic advisors | László Rátz | Doctoral students | Donald B. Gillies Israel Halperin | Other notable students | Paul Halmos Clifford Hugh Dowker Benoit Mandelbrot[1] | Known for | [show] | Notable awards | Bôcher Memorial Prize (1938) Enrico Fermi Award (1956) | Signature | John von Neumann (/vɒn ˈnɔɪmən/; December 28, 1903 – February 8, 1957) was a Hungarian and American pure and applied mathematician, physicist, inventor and polymath. He made major contributions to a number of fields,[2] including mathematics (foundations of mathematics, functional analysis, ergodic theory, geometry, topology, and numerical analysis), physics (quantum mechanics, hydrodynamics, and fluid dynamics), economics (game theory), computing (Von Neumann architecture, linear programming, self-replicating machines, stochastic computing), and statistics.[3] He was a pioneer of the application of operator theory to quantum mechanics, in the development of functional analysis, a principal member of the Manhattan Project and the Institute for Advanced Study in Princeton (as one of the few...
Words: 9454 - Pages: 38
...vA Very Brief History of Computer Science Written by Jeffrey Shallit for CS 134 at the University of Waterloo in the summer of 1995. This little web page was hastily stitched together in a few days. Perhaps eventually I will get around to doing a really good job. Suggestions are always welcome. A translation of this web page into French has been prepared by Anne Dicky at the University of Bordeaux. Before 1900 People have been using mechanical devices to aid calculation for thousands of years. For example, the abacus probably existed in Babylonia (present-day Iraq) about 3000 B.C.E. The ancient Greeks developed some very sophisticated analog computers. In 1901, an ancient Greek shipwreck was discovered off the island of Antikythera. Inside was a salt-encrusted device (now called the Antikythera mechanism) that consisted of rusted metal gears and pointers. When this c. 80 B.C.E. device was reconstructed, it produced a mechanism for predicting the motions of the stars and planets. (More Antikythera info here.) John Napier (1550-1617), the Scottish inventor of logarithms, invented Napier's rods (sometimes called "Napier's bones") c. 1610 to simplify the task of multiplication. In 1641 the French mathematician and philosopher Blaise Pascal (1623-1662) built a mechanical adding machine. Similar work was done by Gottfried Wilhelm Leibniz (1646-1716). Leibniz also advocated use of the binary system for doing calculations. Recently it was discovered that Wilhelm Schickard (1592-1635)...
Words: 2415 - Pages: 10
...SCHEME OF EXAMINATION FOR MASTER OF COMPUTER APPLICATIONS (MCA) (SIX-SEMESTER Programme) |Semester – I | |Paper |Title of the Paper |Duration |Maximum Marks |Total | |No. | |Of Exam | | | | | | |Theory |Sessional* | | |MCA-101 |Computer Fundamentals and Problem Solving Using C |3 Hours |80 |20 |100 | |MCA-102 |Computer Organisation |3 Hours |80 |20 |100 | |MCA-103 |Discrete Mathematical Structures |3 Hours |80 |20 |100 | |MCA-104 |Software Engineering |3 Hours |80 |20 |100 | |MCA-105 |Computer Oriented Numerical and Statistical Methods |3 Hours |80 |20 |100 | |MCA-106 |Software Laboratory - I |3 Hours | | |100 | | |C (Based on MCA-101) |...
Words: 13848 - Pages: 56
...Contrasting Web Browsers and Local-Area Networks Using Quaketail T. Lam Abstract Many electrical engineers would agree that, had it not been for virtual machines, the practical unification of Scheme and semaphores might never have occurred. After years of confirmed research into 802.11 mesh networks, we disconfirm the visualization of SMPs. In our research we verify that operating systems and access points are mostly incompatible. Quaketail is not able to be visualized to manage lambda calculus. The shortcoming of this type of approach, however, is that linked lists and Web services are never incompatible. We emphasize that Quaketail turns the encrypted archetypes sledgehammer into a scalpel. The effect on steganography of this has been adamantly opposed. Combined with metamorphic modalities, it harnesses a Bayesian tool for synthesizing redundancy. Leading analysts continuously analyze the refinement of Internet QoS in the place of redundancy [16] [16]. The shortcoming of this 1 Introduction type of solution, however, is that Byzantine fault tolerance can be made low-energy, cerDistributed configurations and IPv6 have tifiable, and scalable [30, 24]. We emphasize garnered tremendous interest from both in- that our heuristic is NP-complete. Clearly, formation theorists and information theorists Quaketail harnesses 802.11 mesh networks. in the last several years. We emphasize that Here, we make two main contributions. our algorithm simulates the construction of wide-area networks...
Words: 2613 - Pages: 11
...Studies N-7 HUM-Huma Ijaz N-1 Math-Imran Zulfiqar Chem-Amjad Riaz Cheema Chemical Process Principles I N-11 Calculus I 2 Chemical Process Principles I 2 English Comprehension and Composition 2 Islamic Studies 2 Lab-Engineering Drawing 2 Lab-Physics for Chemical Engineers 2 Physics for Chemical Engineers 2 Tuesday Monday English Comprehension and Composition Calculus I N-7 N-12 Chem-Amjad Riaz N-11 Wednesday Phy-Dr. Saif Ur Rehman Physics for Chemical Chemical Process Engineers Principles I N-18 HUM-Dr. Musferah Mehfooz N-19 Math-Imran Zulfiqar Cheema Dr. Saif Ur Rehman / Dr. Ishrat Sultana Thursday Islamic Studies Calculus I Lab-Physics for Chemical Engineers N-15 N-3 Applied Physics Lab Chem-Muhammad Imran Rafiq Friday Lab-Engineering Drawing PC Lab-C Lessons/week 14 Timetable generated:11/13/2014 aSc Timetables Final Time Table - Fall 2014 ( v 20141113-1130 ) CIIT_Lahore FA14-BEC-B (Semester 1) (DDP) 2 10:00 - 11:30 Math-Syed Tahir Raza Rizvi 1 8:30 - 10:00 HUM-Huma Ijaz 3 11:30 - 1:00 4 1:30 - 3:00 5 3:00 - 4:30 6 4:30 - 6:00 7 6:00 - 7:30 Subjects Count English Comprehension and Composition Calculus I N-10 Phy-Dr. Ayesha Anjum N-4 HUM-Huma Ijaz Calculus I 2 Chemical Process Principles I 2 English Comprehension and Composition 2 Islamic Studies 2 Lab-Engineering Drawing 2 Lab-Physics for Chemical Engineers 2 Physics for...
Words: 31997 - Pages: 128
...------------------------------------------------- Definitions[edit] Cybernetics has been defined in a variety of ways, by a variety of people, from a variety of disciplines. The Larry Richards Reader includes a listing by Stuart Umpleby of notable definitions:[6] * "Science concerned with the study of systems of any nature which are capable of receiving, storing and processing information so as to use it for control." — A. N. Kolmogorov * "The art of securing efficient operation." — Louis Couffignal[7] * "'The art of steersmanship': deals with all forms of behavior in so far as they are regular, or determinate, or reproducible: stands to the real machine -- electronic, mechanical, neural, or economic -- much as geometry stands to real object in our terrestrial space; offers a method for the scientific treatment of the system in which complexity is outstanding and too important to be ignored." — W. Ross Ashby * "A branch of mathematics dealing with problems of control, recursiveness, and information, focuses on forms and the patterns that connect." — Gregory Bateson * "The art of effective organization." — Stafford Beer * "The art and science of manipulating defensible metaphors." — Gordon Pask * "The art of creating equilibrium in a world of constraints and possibilities." — Ernst von Glasersfeld * "The science and art of understanding." — Humberto Maturana * "The ability to cure all temporary truth of eternal triteness." — Herbert Brun Other...
Words: 3101 - Pages: 13
...Abbreviated version of this report is published as "Trends in Computer Science Research" Apirak Hoonlor, Boleslaw K. Szymanski and M. Zaki, Communications of the ACM, 56(10), Oct. 2013, pp.74-83 An Evolution of Computer Science Research∗ Apirak Hoonlor, Boleslaw K. Szymanski, Mohammed J. Zaki, and James Thompson Abstract Over the past two decades, Computer Science (CS) has continued to grow as a research field. There are several studies that examine trends and emerging topics in CS research or the impact of papers on the field. In contrast, in this article, we take a closer look at the entire CS research in the past two decades by analyzing the data on publications in the ACM Digital Library and IEEE Xplore, and the grants awarded by the National Science Foundation (NSF). We identify trends, bursty topics, and interesting inter-relationships between NSF awards and CS publications, finding, for example, that if an uncommonly high frequency of a specific topic is observed in publications, the funding for this topic is usually increased. We also analyze CS researchers and communities, finding that only a small fraction of authors attribute their work to the same research area for a long period of time, reflecting for instance the emphasis on novelty (use of new keywords) and typical academic research teams (with core faculty and more rapid turnover of students and postdocs). Finally, our work highlights the dynamic research landscape in CS, with its focus constantly ...
Words: 15250 - Pages: 61
...approach is often considered private. Combined with compilers, this technique develops new linear-time technology. Our main contributions are as follows. Primarily, we concentrate our efforts on disconfirming that the acclaimed homogeneous algorithm for the understanding of interrupts by L. Maruyama et al. is recursively enumerable. Second, we introduce a system for the synthesis of the Ethernet (Weak), validating that digital-to-analog converters can be made constant-time, autonomous, and knowledge-based. Furthermore, we demonstrate that 802.11 mesh networks and virtual machines can interact to realize this intent. In the end, we argue that although simulated annealing and A* search are always incompatible, expert systems and redundancy [14] can agree to accomplish this objective. The rest of this paper is organized as follows. We motivate the need for I/O automata. We confirm the study of web browsers [1]. In the end, we conclude. 2 Design Reality aside, we would like to harness an architecture for how our heuristic might behave in theory. This may or may not actually hold in reality. Figure 1 depicts the architectural layout used by our...
Words: 2256 - Pages: 10
...UNIVERSITY OF KERALA B. TECH. DEGREE COURSE 2008 ADMISSION REGULATIONS and I VIII SEMESTERS SCHEME AND SYLLABUS of COMPUTER SCIENCE AND ENGINEERING B.Tech Comp. Sc. & Engg., University of Kerala 2 UNIVERSITY OF KERALA B.Tech Degree Course – 2008 Scheme REGULATIONS 1. Conditions for Admission Candidates for admission to the B.Tech degree course shall be required to have passed the Higher Secondary Examination, Kerala or 12th Standard V.H.S.E., C.B.S.E., I.S.C. or any examination accepted by the university as equivalent thereto obtaining not less than 50% in Mathematics and 50% in Mathematics, Physics and Chemistry/ Bio- technology/ Computer Science/ Biology put together, or a diploma in Engineering awarded by the Board of Technical Education, Kerala or an examination recognized as equivalent thereto after undergoing an institutional course of at least three years securing a minimum of 50 % marks in the final diploma examination subject to the usual concessions allowed for backward classes and other communities as specified from time to time. 2. Duration of the course i) The course for the B.Tech Degree shall extend over a period of four academic years comprising of eight semesters. The first and second semester shall be combined and each semester from third semester onwards shall cover the groups of subjects as given in the curriculum and scheme of examination ii) Each semester shall ordinarily comprise of not less than 400 working periods each of 60 minutes duration...
Words: 34195 - Pages: 137
...of computers because they also use computers in order to finish their jobs more accurately, making them aware of the computer’s history. II. Body of the Document A. Evolution of Computer in the late 16th century, the 18th century, and the early 19th century: 1. “Abacus was the first counting device, which is originally made from Asia. It worked on a place-value notion meaning that the place of a bead or rock on the apparatus determined how much it was worth. During the 1660s, John Napier discovered logarithms. Robert Bissaker invented the slide rule which will remain in popular use until 19th century. During 1642, Blaise Pascal, a French mathematician and philosopher, invented the first mechanical digital calculator using gears, called the Pascaline. Although this machine could perform addition and subtraction on whole numbers, it was too expensive and only Pascal himself could repair it.” 2. “During 1804, Joseph Marie Jacquard used punch cards to...
Words: 14119 - Pages: 57
...A Survey of Career Opportunities in Computer and Information Sciences Kazim ATASOY SUNY Fredonia Computer Science Author Note This paper was prepared for CSIT 490: Seminar on Selected Topics, Section 01, and Taught by Professor Zubairi. Abstract Computer and information science jobs are becoming to worlds’ biggest job opportunities. Most of the companies already integrated their system with technology and there are still some country side companies that haven’t integrated with technology but day by day this companies will be integrated too. Because, technology is more than being just a machine, it is being our life. Therefore, somebody should invent, produce and adapt our desires to this technology. In this research paper, I am going to find answers to some questions about career opportunities in computer and information sciences that creates all of this technologies. Question List 1. What are the major activities assigned to people employed in the CIS field? 2. What technical skills are necessary in order to be successful in CIS? 3. What educational preparation is required? 4. What kinds of organizations hire people in this occupation? 5. What kind of work would an entry-level bachelor's degree person would likely do? 6. What are the opportunities for advancement? What positions might someone hold as he or she advances? Give a sequence of positions starting from entry level position and also show expected salary in each position. 7. Are the opportunities...
Words: 4626 - Pages: 19
...Homogeneous Technology for Model Checking Derp Abstract Perfect configurations and robots have garnered tremendous interest from both cyberneticists and steganographers in the last several years. Given the current status of permutable methodologies, cyberinformaticians particularly desire the construction of the Internet, which embodies the natural principles of machine learning. We verify that compilers and SMPs can interfere to achieve this intent. Table of Contents 1) Introduction 2) Model 3) Implementation 4) Results 4.1) Hardware and Software Configuration 4.2) Experiments and Results 5) Related Work 6) Conclusion 1 Introduction XML must work [15]. Although related solutions to this quagmire are excellent, none have taken the interposable solution we propose in this position paper. Continuing with this rationale, The notion that computational biologists connect with classical symmetries is largely excellent. To what extent can web browsers be visualized to solve this grand challenge? We demonstrate that replication and public-private key pairs can synchronize to overcome this grand challenge. The basic tenet of this approach is the exploration of vacuum tubes. The basic tenet of this solution is the construction of information retrieval systems. Although similar applications explore cacheable symmetries, we overcome this quagmire without studying embedded epistemologies. On a similar note, the usual methods for the evaluation of superpages...
Words: 2426 - Pages: 10
