Bilgisayar Mühendisliği Bölümü Tezleri

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/58

Browse

Now showing 1 - 20 of 206

Performance comparison of routing algorithms used in packet switching computer networks
(2015) Yaseen, Nawfal
Bu tez ağ üzerindeki trafik mühendisliğinin daha iyi sağlanabilmesi için kullanılan Çok Protokollü Etiket Anahtarlama (MPLS) mimarisi tabanlı rotalama algoritmalarının incelenmesini ve karşılaştırılmasını içermektedir. Ağlar üzerinde yapılan bu çalışmada sürekli olarak büyüyen internet servislerinin Trafik Mühendislği üzerine etkilerine odaklanılmaktadır. MPLS, ağ üzerinde kullanılan yönlendiricilerin hızını arttıracak ve gerçek zamanlı çoklu ortam verilerinin aktarılacak şekilde ağ servislerini sağlayan modern bir teknik kullanır. Ayrıca, MPLS mimarisi ağ üzerinde bulunan farklı yönlendiricileri tanımlar ve trafik yönetiminin sağlanmasını garanti altına alır. MPLS'in günümüzde en kısa yoldan gönderim yapılacak yulu seçen birçok protokol içinden en iyier inden birisidir. Bir diğer önemli nokta ise, İnternet Servis Sağlayıcılarının (ISP) MPLS yönlendiricileri üzerinde çalıştırılan rotalama algoritmalarını geliştirme gereksinimlerinin olmasıdır. Bu algoritma sade ve yönlendiricilerde uygulanabilecek nitelikte olmalıdır. Gelişmiş rotalama algoritmaları, MPLS ağının rotalama algoritmalarını geliştirme avantajlarını da kullanırlar. MPLS üzerinde araştırılmaya devam edilen ve kuuanılan birçok gelişmiş rotalama algoritması bulunmaktadır. Bunlardan en önemlileri ise, trafik durumuna göre karar vererek bloke olma olasılığını azaltan rotalama teknikleri ile her türlü etiket anahtarlamalı yol (LSP) isteği için çözüm sunan trafik tabanlı algoritmalardır. Bu nedenle bu tezde, bilgisayar ağlarında iyi bilinen bir protokol MATLAB ile benzetim yoluyla çalışılmış ve daha sonra bazı farklı rotalama teknikleri bu protokol üzerinde uygulanmıştır. Son olarak, simulasyon sonuçları incelenmiş ve farklı bakış açılarından analiz edilmiştir. Çalışmanın sonunda, farklı ağ koşulları için; incelenen rotalama algoritmalarından bazıları önerilmiştir. Bu benzetim sonuçları, paket anahtarlamalı bilgisayar ağlarında entegre edilerek kullanılan rotalama algortimalarının avantajlarını göstererek ortaya koymaktadır.
Application layer processing with protocol independent switch architecture
(2021) Tuncel, Yusuf Kürşat
Bu tez, uygulama katmanı verilerini işlemek ve bir uygulama içeriğinin incelenmesini sağlamak için Protokolden Bağımsız Anahtar Mimarisi için bir çözüm araştırır ve bir yöntem önerir. Protokolden Bağımsız Anahtar Mimarisi, ağ anahtarının herhangi bir gömülü ikili kod çalıştırmadığı, bunun yerine amaca özel bir dilde yazılmış yorumlanmış bir kod çalıştırdığı ağ iletişiminde yeni bir yaklaşımdır. Bu yaklaşımın arkasındaki ana motivasyon, telekomünikasyon operatörlerinin herhangi bir ağ ekipmanı türü için bir satıcıya kilitlenmek istememeleri, tek bir ekipman üreticisi tarafından yönetilmeyen bir donanım ekosisteminde kendi ağ kodlarını geliştirmeleridir. Bu yaklaşım aynı zamanda, bir donanım anahtarının tüm bileşenleri yazılımla modellenen bir anahtarda aynı uyumlu kodu çalıştırdığı için bir ekipmanın simülasyon ortamında modellemesini kolaylaştırır. Bu tezdeki yeni teknikler, programlanabilir bir anahtarın ana işlevlerinden yararlanarak, maliyetleri düşürmek ve ağı kapsamlı bir şekilde yönetmek için bir telekomünikasyon operatörü perspektifinden istenen etkiyi yaratarak akışlı veri işlemci yazılımını ağ anahtarı yazılımıyla birleştirmeyi amaçlamaktadır. Deneysel çalışma, herhangi bir optimizasyon yapılmadan önerilen çözümün uygulama tanımlama sistemlerinin performansını 5.5'ten 47 katına çıkardığını göstermektedir.
Defect product estimation using customer reviews, Amazon use case
(2022) Eyerci, Tarkan
Teknoloji her alanı etkilediği gibi ticareti de çok etkiledi. Günümüzde artık, üreticiler, perakendeciler, hizmet sağlayıcılar gibi son kullanıcıya hitap eden tüm işletmeler e-ticaret siteleri ve mobil uygulamaları gibi yöntemlerle internet üzerinden müşterilerine hızlıca ulaşabiliyorlar. Diğer yandan, müşteriler ise artık birçok seçenek arasından seçim yapma şansına sahipler. Kullanıcılar genellikle seçimlerini yaparken daha önce aynı tecrübeyi paylaşmış diğer kullanıcıların yorumlarından faydalanırlar. Bu açıdan kullanıcı yorumları çok değerli bilgiler içerir. Fakat yoğun kullanılan sitelerde bir insanın tek tek inceleyemeyeceği kadar çok yorum birikir. Biz bu çalışmada, ürünlerin belli bir özelliğine, yani kusurlu özelliklerine odaklandık. Kusur bilgisi içeren milyonlarca yorum içinden ilgili yorumları filtre edebilmek için bir yöntem öneriyoruz. Kusur ile ilgili kelimeleri sözlük yardımı ile elle oluşturup bu kelimeler geçen yorumları filtrelemek bir çözüm önerisi olabilir. Fakat bu kelime listesini elle oluşturmak verimli olmayacaktır. Bunun için sadece ilgili ürün gruplarına ait yorumları kullanarak kendi kelime temsil modelimizi eğitip, bu modelle birlikte kelime yakınlıklarını kullanarak daha verimli bir kusur kelimeleri listesi oluşturduk. Kullanıma hazır önceden eğitilmiş bir kelime temsil modelini indirip, bu modelle kendi modelimizi kıyasladık. Genel konularda hazır modelin daha başarılı olurken, özel bir konuda kendi modelimizin kelime listesi oluşturmada daha başarılı olduğunu gördük.
Smart home design with IoT (Home automation)
(2018) Hadi Al-Samarraei, Yasser Samir
Smart home's conception has been growing topic in our modern community. The content of smart automated items, such as home electronic devices, communicate together with users. These devices are quite expensive when compared to non-intelligent devices. In this thesis, a Home Automation system has been studied and developed to automate existing appliances by supporting them with modern smart technology. In this effective way, the cost can be lowered with upgrading the automating system instead of replacing entire the items. A Home Automation System has been implemented and designed to solve several common issues in this thesis. IoT security items have been investigated with the smart house (Home Automation) and clarified to become a basic stage of the Home Automation system. Smart home (Home Automation) application is designed to monitor and secure the home security sensors. An application has been performed to monitor and control the smart home system. The system is based on hardware and software components (such as Arduino Mega 2560) and can be acted as a security guard of the home. The system has been designed to monitor the humidity, temperature, light, gas, fire, burglar alarm in the house and has a passive-infrared sensor to make sure that the family in safe. Sensors have used on windows and doors to monitoring any an unauthorized intruder or in case of forgetting to close it. In addition, the system is also connected with GSM system (Global System for Mobile communication) to send notification SMS message (Short Message Service) to specific destinations in case of detecting something from sensors while "the system activated" mode on. The system (equipment of the home design) also has been controlled by using android application via Bluetooth
Matching composite drawings and mugshot photographs to determine the identity of the person
(2019) Karasolak, Mustafa
In this thesis, a new photo-sketch generation and recognition technique is proposed using residual convolutional neural network architecture. For this, the proposed architecture is trained with face photos and sketches. Sketches are applied to the proposed Region-based Convolutional Neural Networks (RCNN) architecture and, face photos are obtained at network output. Then, the obtained face photographs are compared with the images in the database. It is associated with the highest similarity photograph. Structural Similarity Index (SSIM) is used to measure similarity. It is very useful for law enforcement for image processing applications. 188 images are used for training and testing. Of these, 148 are used for training. 20 are used for validation and 20 are used for testing. Data augmentation is applied to 148 images used for training. As a result of the data augmentation process, 444 face images are obtained and used for network training. As a result of network training, the success of the training curve is 90.55% and the validation success is 91.1%. True face recognition success from generated face images with SSIM is 93.89% for CUHK database and 84.55% AR database.
An interactive learning approach to teach ISO/IEC 12207 software life cycle processes
(2016) Aydan, Ufuk
Yazılım mühendisliği alanında özellikle yazılım projesi geliştirme kapsamında literatür dahilinde birçok iş ve çalışma olmasına karşın ISO/IEC 12207 Yazılım Yaşam Döngüsü Süreçleri temellerini ve etkileşimli öğrenme sürecini kapsayan uygun bir ciddi oyun örneği eksikliği bulunmaktadır. Ciddi oyunlar belirli konularda eğitici ve belirli beceri alanlarında yetkinlik kazanılmasını sağlayan uygulamalar olup oyun ve oyunlaştırma literatüründe önemli bir yere sahiptir. "Floors", bir ciddi oyun olmakta ve etkili bir şekilde öğrenme sürecini etkileşimli ve ilerlemeli bir tasarım ile sunmaktadır. Oyunun sahip olduğu ve kullanıcılara edindirdiği esas avantaj ISO/IEC 12207 yazılım yaşam döngüsü süreçlerinin temel presipleri hakkında aşinalık kazandırmak, aynı zamanda ilerlemeli yapısı sayesinde belirli süreçlerin akışını etkileşimli diyaloglarla 3 boyutlu sanal bir ortamda birleştirmesidir. Tüm bunları amaç kapsamı için adanmış görsel bir ofis ortamında gerçekleştirmesidir Floors özellikle öğrencilerin ISO/IEC 12207'nin belirli süreçlerinin kapsamında temel bir eğitim sunan, yardımcı bir araç olarak kullanılabilir. Oyunun katılımcılar tarafında oynanması itibariyle belirtilen kavramların ve konseptin hakkında ve ayrıca yazılım geliştirme yaşam döngüsünün izlenmesi ve devam ettirilmesi ile ilgili kullanıcılarda belirli bir farkındalığın sağlanması temel amaçlardandır. Araştırma sonuçları katılımcı popülasyonundan elde edilen veriler ile yapılan anket çalışması ile belirli derecede farkın ortaya çıktığı belirlenmiştir. Çalışmanın sonuçları dikkate alındığında Floors ile tecrübe edinen katılımcıların standart hakkında daha olumlu bir bakış açısı edindiği ve temel kavramları kazandığı gözlemlenmiştir.
Adopting rup (rational unified process) on a software development project
(2009) Taş, Tufan
This thesis analyzes the process of applying Rational Unified Process (RUP) successfully on a software development project step by step. Many software development projects today have a tendency to fail on some level. Even though they may not fail entirely, they might be completed with schedule delays, budget overrun or with poor quality that do not meet the requirements of customers because of poor management and lack of necessary documentation of the project. Applying RUP avoids these major problems in a project by developing set of work products which depict the essentials of the system from requirements to detailed design before the system could be implemented. However, software development teams have an overall attitude that RUP becomes less agile and too rigid as the size of projects get smaller. The thesis will also try to prove that this opinion is not true by using tools Rational Method Composer (RMC) and Rational Software Modeler (RSM) to successfully complete the project.
Constructing low diameter topic-based Pub/Sub overlay network with minimum maximum node degree
(2016) Layazalı, Sİna
Publish/subscribe communication systems, where a large number of nodes (publishers and subscribers) are interested in variety of topics, have received more attention in recent years. Constructing an efficient overlay network that connects the nodes interested in several topics is an important issue in these systems. In constructing effective and scalable overlay networks, pub/sub network designers prefer to keep the diameter and maximum degree of the network low. This is in addition to lower running time cost and higher scalability. However, the existing algorithms seem to fail in decreasing maximum node degree and reducing diameter. To address these issues for a given set of nodes with variety of topics, we present a heuristic algorithm known as Constant Diameter Minimum Maximum Degree (CD-MAX) which decreases the maximum node degree and maintains the diameter of the overlay at most at two. The new algorithm improves the maximum node degree, by 64 percent. The CD-MAX algorithm selects the node with the lowest node degree and connects it to its neighbors. For more than two nodes with an equal highest node degree, this algorithm selects the node with the highest density. The CD-MAX algorithm has a refinement version that decreases the maximum node degree even further. The algorithm is validated and analyzed through simulations.
A comparison of NoSQL database systems: A study on MongoDB, apache HBase, and apache Cassandra
(2016) Hammood, Ali Hussein
Due to their many useful features, database management systems have been used widely with relational data for over 20 years. However, such systems are not able to handle massive and complex data efficiently. New systems known as NoSQL database management systems have appeared to deal with massive and complex data that provide fast and high performance. In this thesis, we discussed and tested three kinds of NoSQL database system in order to reveal their capabilities and how they respond in different operations. For this purpose, we set up a novel testing environment for each workload and examine the responses for the three systems. The results of this study show the weaknesses and strengths of each database system used in the study. Due to the different architectures of each database that we tested, we have seen different responses for each with changed workload operations. In our work, we used the Yahoo Cloud Serving Benchmark (YCSB), which is a framework designed by Yahoo to test database performance. According to the results obtained, we can conclude that MongoDB performed very well with low throughput, but not as well with high throughput. Cassandra and HBase performed very well under heavy loads due to their optimized designs. In the read operation, HBase has poor performance as compared to other systems tested.
Decision making via the analysis of school locations in Kirkuk province using gis technology
(2015) Hashim Shaker, Ehab
GIS technology is increasing in importance and now affects many aspects of daily life. In recent decades, GIS technology has entered many service fields, in particular health and education, two of the most popular services in any community. GIS technology is often employed to both regulate these services and to make better decisions. Furthermore, in order to construct a new and modern city in any country, GIS technology is typically used to achieve homogeneity of service distribution for the benefit for all citizens across society. The present thesis thus examines the challenges currently facing the city of Kirkuk in terms of service distribution, especially regarding education services. The results show that schools in the study area suffer from poor distribution, putting pressure on the service providers and adversely affecting the standard of education. Recommendations based on this research include the need to develop a plan aimed at the development of education services which is in line with both planning and exceptional standards. Work should be undertaken to establish new school sites in order to meet the shortfall currently experienced in the study area, taking into account urban development and future population growth. Finally, this thesis identifies those schools which are either directly or indirectly at risk due to their proximity to institutions targeted by terrorist operations.
Moving object detection in industrial line application
(2014) Abdilatef, Muhamad Azhar
In this thesis, a comparison study of moving object detection methods in industrial line application is presented. This comparison includes the consuming times, and the detection accuracy. According to consuming time, the methods are sorted into three groups (A, B, C). Groups A and B are including the methods those consuming a large time, thus they didn’t used for our application, while group C includes the methods with low consuming time. According to the detection accuracy, group C methods are compared one with each other to select the best method. The Misclassification rate (MR) is used to do this comparison. Some applied methods gave good results in detection but with high consuming time, others have problems in detection but with low consuming time. In this thesis a new method is presented using a combination between method 5 (the statistical morphological operation with the minimal bounding box) and method 6 (canny edge detection), this presented method classified as group C method, it did well in detection and consuming low time, thus it is used in the application of our thesis. The application set of our thesis consists of a prototype conveyer belt derived by a servo motor implementedespecially for our work, robot arm type Rios, and a stationary camera mounted on the top of the conveyer built. In our application five random types of objects are used, the location, size (area in pixels), and orientation for the region of interest (the objects) are detected depending on the images captured by the camera. When the object enters camera's scope, a captured image enters an image processing operation to detect the object, remark its features, and use it to make a robot arm go to the correct location to reach the object there, grip the object and move it to another location. Due to the MR results, it is obvious to notice that method 7 (Statistical Morphological Operation with MBR and Edges Detection) is gave the best results in the detection for all the used objects, according to that, method 7 is used in the implementation of the thesis application.
Exploiting temporal query behavior for improving result cache accuracy in web search engines
(Çankaya Üniversitesi, 2015) Wajji, Safaa Jamaah
In Web Search Engines responding to the user queries in a timely fashion is an important requirement. One of the integral techniques to improve the response time of a search engine is caching. By storing different types of information in a fast access memory storage, caching achieves a higher availability and better response times for the search engine. Due to anonymous and global access pattern of the queries, search engines are often considered timeless frameworks. That is, search engine sites constantly respond to queries that are submitted all around the world at an almost constant pace throughout the day. During our studies, we evaluate this phenomenon and come to the conclusion that each of the data centers, which in cooperation form the general infrastructure of a general purpose search engine in fact realizes high levels of query temporality. In this work, we aim to apply and exploit the temporal behavior of the submitted queries to improve the cache accuracy by proposing a new caching architecture. To this end, we improved the state-of-the-art result caching framework Static-Dynamic Cache (SDC) and modified it in order to incorporate query temporality. Our experiments show that the proposed caching framework improves the hit rate of a result cache up to 3%, which is roughly 25% of the possible room for improvement.
Calculation of textual similarity using semantic relatedness function
(2015) Kairaldeen, Ammar Riadh
Finding the similarity between two sentences is an essential task in different fields such as natural language processing (NLP) and information retrieval (IR). Semantic relatedness similarity between two sentences is concerned with measuring how two sentences share the same meaning. Over the last decade, different methods for measuring sentence similarity have been proposed in the literature. Some methods use word semantic relatedness function in sentence similarity calculations. This thesis aims to compare these methods using four data sets selected from different fields, providing a testable of a various range of writing expressions to challenge the selected methods. Results show that the use of corpus-based word semantic similarity function has significantly outperformed that of WordNet-based word semantic similarity function in sentence similarity methods. Moreover, we propose a new sentence similarity measure method by extending an existing method in the literature called Overall similarity. Furthermore, the results show that the proposed method has significantly improved the performance of the Overall method. All the selected methods are tested and compared with other state-of-the-art methods.
Effect of noise on edge detection techniques
(2014) Mahmood, Alaa
The subject of identification edge in images has a wide application in various fields for that it’s considered one of the important topics in a digital image processing. There are many algorithms to detect the edge in images, but the performance of these algorithms depends on the type of image, the environment of the image and the threshold value of the edge algorithm. In this thesis five edge detection algorithms were evaluated by using several types of original images, these images were placed in multi-environments (clean, noisy, and de-noised). According to this evaluation results, the best edge detection algorithm and the best threshold value were found in each environment
Detecting location of hidden messages on digital images using RS steganalysis method
(2013) Çiftçi, Efe
Steganography is a branch of methods that deal with hiding information in cover media. The result of the hiding process should resist detection by any means. To detect the hidden information, several analysis methods have been developed (named as steganalysis methods). Steganalysis of Regular and Singular Groups (RS) is a method which aims to detect hidden information on digital images. This method is helpful for estimating length of the hidden message but it does not find over which section of the image the hidden message is. The aim of this thesis is to locate in which part(s) of the image the message is hidden by utilizing this steganalysis method and quadtree data structure.
Adaptive energy consumption method for wireless sensor networks using optimization algorithms
(2018) Mahmood Al-Karkhı, Elaf Ahmed
The objective of this thesis is to save the nodes energy using optimization approach with Particle Swarm Optimization Algorithm. The network area is divided to several regions for parametric study. In the proposed method, the energy of the efficient routing is enhanced and the system used the Particle Swarm Optimization for eliminate the individual nodes in wireless sensor network. In this thesis the optimization method is used to find the best hop in wireless sensor network which use the Gravitational Search Algorithm. The proposed work compared with Low Energy Adaptive Clustering Hierarchy. In simulation result the total energy for proposed method is got 8 Joules, which the energy for the OEERP is got 10 Joules and for the LEACH the 20 Joules is got. That’s mean proposed method is 20% better than the energy consumption from optimized energy efficient routing protocol and 60% better than the Low Energy Adaptive Clustering Hierarchy method is reduced. In proposed method the packet delivery ratio is high than the optimized energy efficient routing protocol and Low Energy Adaptive Clustering Hierarchy method. As result the packet delivery is 100. This values only the base value and for 4000 bit packet that time 400,000 packet will send to the base station. The packet delivery for optimized energy efficient routing protocol is 60 and for Low Energy Adaptive Clustering Hierarchy this value is 64
Efficient parallel processing approach based on distributed memory systems
(2014) Rashed, Imad
Complex problems need long time to be solved, with low efficiency and performance. So, to overcome these drawbacks, the approach of breaking the problem into independent parts and treating each part individually. When treating with problems that need strong processing, it is necessary to break these problems to independent parts and specify each one to a certain processor in such method that these processors can operate in parallel approach. The system that contains such processors will consist of multiple processing units connected via some interconnection network and the software needed to make the processing units work together. These systems can be Shared, Distributed or Hybrid memory systems. In this thesis, the approach of distributed memory system is depended and based on client/servers principles, the network can contain any number of nodes; one of them is a client and the others are servers. The algorithms used here are capable of calculating the (Started, Consumed, and Terminated) CPU-times, Total execution time and CPU usage of servers and Client hosts. This work addresses an improved approach for problem subdivision and design flexible algorithms to communicate efficiently between client-side and servers-side in the way to overcome the problems of hardware networking components and message passing problems. Matrix Algebra operations depended as case-study. For this case study, there are many general algorithms and other related algorithms (i.e. Network-Connection-Checking, Load-Division, Massages-Sending/Delivering, Timings-Calculating, Results-Checking, and Results-Receiving/Storing). All these algorithms designed and tested completely by this work. The obtained results are checked and monitored by special programming-checking-subroutines through many testing-iterations and proved a high degree of accuracy. All of these algorithms are implemented using Java Language
Parallel association rule mining on semantic and big IoT data
(2018) Alsaeh, Amal Bashir Aboubaker
Birliktelik Kuralı Madenciliği (ARM) önemli bir makine öğrenme tekniğidir çünkü büyük veri kümelerindeki veri ögeleri arasında ilişkileri bulabilir. Farklı birliktelik kuralı algoritmaları, tüm ögelerin "satın alma" gibi benzersiz bir ilişkiye sahip olduğu geleneksel işlem veri kümelerinde birçok araştırmacı tarafından incelenmiştir. Son yıllarda araştırmacılar, geleneksel veriler yerine, anlamsal çizgelerden (RDF veri kümeleri gibi) birliktelik kurallarının çıkarılmasına artan bir ilgi göstermektedirler. Öte yandan, Nesnelerin İnterneti (IoT) alanında ve birçok farklı alanda, semantik veriler günlük olarak büyük miktarlarda artmaktadır. Bu nedenle, akıllı çözümler için IoT verilerini kullanmak üzere ölçeklenebilir çözümlere ihtiyacımız var. Bu tez çalışmasında, hava durumu, trafik ve tıp gibi farklı alanlardan birçok farklı sematik IoT veri kümesinde paralelleştirilmiş FP-büyüme algoritmasının kullanımını inceledik. Sonuçlar, semantik ARM algoritmalarının ölçeklenebilir uygulamasının semantik birliktelik kurallarını çok daha hızlı bulduğunu göstermektedir.
Integrating computer vision with a robot arm system
(2014) Yosif, Zead Mohammed
During last decades, robotic system has been employed in different fields, such as, industrial, civil, military, medical, and many other applications. Vision system is integrated with robot systems to enhance the controlling performance of the robot system. A great deal of features can be computed using the information have been gotten from vision sensors (camera). The extracted information from vision system can be used in the feedback to have the ability to control the robot armtor motion, but the operation of extracting this information from vision system is time consuming. This thesis addressed the problem of following (tracking) and grasping of moving target (object) with limited velocity in real time by employing the technology of Eyein- Hand, whereas a camera attached (mounted) to the robot arm end effector. This done by using a predictor (Kalman filter) that estimates the positions of the target in the future, an algorithm was designed to track an object move in different trajectories, within the camera field of view. The Kalman filter uses the measured position of the target as well as previous state estimates to fix the location of thetarget object at the next time step, in other word, the Kalman filter is applied to keep observing the object till grasp it. The employing of vision system information in the feedback control of the robot systems have been the major research in robotics and Mechatronic systems. The utilizing from this information has been proposed to handle stability and reliability issues in vision-based control system.
Evaluation of terrain rendering algorithms
(2005) İnam, Emin
errain rendering plays an important role in outdoor virtual reality applications, games, Geographic Information System (GIS), military mission planning's and flight simulations, etc. Many of these applications require real-time dynamic interaction from end users and thus are required to rapidly process terrain data to adapt to user input. Typical height fields consist of a large number of polygons, so that even most high performance graphics computers have great difficulties to display even moderately sized height fields at interactive frame rates. The common solution is to reduce the complexity of the scene while maintaining a high image quality. This thesis is an evaluation of three real-time continuous terrain levels of detail algorithms described in the papers ROAMing Terrain: Real-time Optimally Adapting Meshes by Duchaineau, Real-Time Generation of Continuous Levels of Detail for Height Fields by Röttger and Fast Terrain Rendering Using Geometrical MipMapping by Willem H. de Boer. The evaluation and comparison of the algorithms is based on the trade- off of polygon count to terrain accuracy over separate test data sets. The main aim of this thesis is research on terrain rendering algorithms that is generate high quality image in real-time with using height data.

Browse

Browsing Bilgisayar Mühendisliği Bölümü Tezleri by Access Right "info:eu-repo/semantics/openAccess"