Correlation filters (CFs) are well established and useful tools for a variety of tasks in signal processing and pattern recognition, including automatic target recognition and tracking, biometrics, landmark detection, and human action recognition. Traditionally, CFs have been designed and implemented efficiently in the frequency domain using the discrete Fourier transform (DFT). However, the element-wise multiplication of two DFTs in the frequency domain corresponds to a circular correlation, which results in aliasing (i.e., distortion) in the correlation output. Prior CF research has largely ignored these aliasing effects by making the assumption that linear correlation is approximated by circular correlation. In this work, we investigate in detail the topic of aliasing in CFs. First, we illustrate that the current formulation of CFs in the frequency domain is inherently flawed, as it unintentionally assumes circular correlation during the design phase. This means that existing CFs are not truly optimal. We introduce zero-aliasing correlation filters (ZACFs) which fix this formulation issue by ensuring that each CF formulation problem corresponds to a linear correlation rather than a circular correlation. By adopting the ZACF design modifications, we show that the recognition and localization performance of conventional CF designs can be significantly improved. We demonstrate these benefits using a variety of data sets and present solutions to the computational challenges associated with computing ZACFs. After a CF is designed, it is used for object recognition by correlating it with a test signal. We investigate the use of the well-known overlap-add (OLA) and overlap-save (OLS) algorithms to improve the computation and memory requirements of this correlation operation for high dimensional applications (e.g., video). Through this process, we highlight important tradeoffs between these two algorithms that have previously been undocumented. To improve the computation and memory requirements of OLA and OLS, we introduce a new block filtering scheme, denoted partial-aliasing OLA (PAOLA) that intentionally introduces aliasing into the output correlation. This aliasing causes conventional CFs to perform poorly. To remedy this, we introduce partial-aliasing correlation filters (PACFs), which are specifically designed to minimize this aliasing. We demonstrate through numerical results that PACFs outperform conventional CFs in the presence of aliasing.

Background. Aliasing is a problem that every 3D game has because of the resolutions that monitors are using right now is not high enough. Aliasing is when you look at an object in a 3D world and see that it has jagged edges where it should be smooth. This can be reduced by a technique called anti-aliasing. Objectives. The object of this study is to compare three different techniques, Fast approximate anti-aliasing (FXAA), Subpixel Morphological Anti Aliasing (SMAA) and Temporal anti-aliasing (TAA) in motion to see which is a good default for games. Methods. An experiment was run where 20 people participated and tested a real-time prototype which had a camera moving through a scene multiple times with different anti-aliasing techniques. Results. The results showed that TAA was consistently performing best in the tests of blurry picture quality, aliasing and flickering. Both SMAA and FXAA were only comparable to TAA in the blur area of the test and falling behind all the other parts. Conclusions. TAA is a great anti-aliasing technique to use for avoiding aliasing and flickering while in motion. Blur was thought to be a problem but as the test shows most people did not feel that blur was a problem for any of the techniques that were used.

Skuggor i 3D-miljöer är ett mycket efterforskat område, och detta arbete koncentrerar sig på shadow map-algoritmen. Det finns ett problem med denna algoritm, för då en shadow map projiceras på en yta som är större än sig själv så bildas stora trappstegseffekter, vilket kallas aliasing. Problemet som har undersökts är hur olika shadow map-algoritmer i en miljö med långa skuggor beter sig, där ett minimerat antal artefakter så som brus och aliasing är synligt. För detta undersöktes Percentage-Closer Filtering (PCF), som är en variant av shadow map, med olika samplingstekniker – och även en vidarebyggnad med Percentage-Closer Soft Shadow (PCSS) implementerades. Mätningar av realism och brusmängd genomfördes med en användarstudie. Prestandan mättes i klockcykler. Resultatet visade att PCF med samplingstekniken Edge Tap Smoothing kan vara den algoritm som lämpar sig bäst i situationer med långa skuggor i en 3D-miljö; detta för att den interpolerar mellan de projicerade texlarna.

Context. In the pursuit to render at good quality, anti-aliasing will be needed to reduce jagged edges. A challenge is presented where the image to be rendered consists of different elements like GUI and background. One anti-aliasing method alone might not be able to handle this due to some anti-aliasing methods not being applicable to certain elements within a rendering. Combining two different anti-aliasing methods on different elements within a rendering can however make parts appear extra blurry in relation to the rest, as some methods are prone to creating unwanted blur at specific occasions. Objectives. This thesis' goal is to present a method for applying anti-aliasing to an image containing different elements, while managing to render it with good quality and keeping a uniform look. Method. An experiment presented in the form of a user study was conducted for finding a suitable method for creating a uniform look. 26 respondents participated in the experiment, where they would rate a number of images by how uniform each were perceived as. Results. The results from a user study did not meet the author's predictions, where it was expected that FXAA would help create a uniform look when applied last as a final post-processing effect. However the respondents of the user study had varied opinions, as the results showed that all three methods presented in the experiment all were perceived to display a uniform look. Conclusions. A conclusion could be drawn that either anti-aliasing can not affect images greatly enough for the result to be perceived as non-uniform, at least for the two anti-aliasing methods which were tested. Or that the material presented in the survey did not manage to present an articulate display for the respondents.

The resolutions of acquired image and volume data are ever increasing. However, the resolutions of commodity display devices remain limited. This leads to an increasing gap between data and display resolutions. To bridge this gap, the standard approach is to employ output-sensitive operations on multi-resolution data representations. Output-sensitive operations facilitate interactive applications since their required computations are proportional only to the size of the data that is visible, i.e., the output, and not the full size of the input. Multi-resolution representations, such as image mipmaps, and volume octrees, are crucial in providing these operations direct access to any subset of the data at any resolution corresponding to the output. Despite its widespread use, this standard approach has some shortcomings in three important application areas, namely non-linear image operations, multi-resolution volume rendering, and large-scale image exploration. This dissertation presents new multi-resolution representations for large-scale images and volumes that address these shortcomings. Standard multi-resolution representations require low-pass pre-filtering for anti- aliasing. However, linear pre-filters do not commute with non-linear operations. This becomes problematic when applying non-linear operations directly to any coarse resolution levels in standard representations. Particularly, this leads to inaccurate output when applying non-linear image operations, e.g., color mapping and detail-aware filters, to multi-resolution images. Similarly, in multi-resolution volume rendering, this leads to inconsistency artifacts which manifest as erroneous differences in rendering outputs across resolution levels. To address these issues, we introduce the sparse pdf maps and sparse pdf volumes representations for large-scale images and volumes, respectively. These representations sparsely encode continuous probability density functions (pdfs) of multi-resolution pixel and voxel footprints in input images and volumes. We show that the continuous pdfs encoded in the sparse pdf map representation enable accurate multi-resolution non-linear image operations on gigapixel images. Similarly, we show that sparse pdf volumes enable more consistent multi-resolution volume rendering compared to standard approaches, on both artificial and real world large-scale volumes. The supplementary videos demonstrate our results. In the standard approach, users heavily rely on panning and zooming interactions to navigate the data within the limits of their display devices. However, panning across the whole spatial domain and zooming across all resolution levels of large-scale images to search for interesting regions is not practical. Assisted exploration techniques allow users to quickly narrow down millions to billions of possible regions to a more manageable number for further inspection. However, existing approaches are not fully user-driven because they typically already prescribe what being of interest means. To address this, we introduce the patch sets representation for large-scale images. Patches inside a patch set are grouped and encoded according to similarity via a permutohedral lattice (p-lattice) in a user-defined feature space. Fast set operations on p-lattices facilitate patch set queries that enable users to describe what is interesting. In addition, we introduce an exploration framework—GigaPatchExplorer—for patch set-based image exploration. We show that patch sets in our framework are useful for a variety of user-driven exploration tasks in gigapixel images and whole collections thereof.

Aliasing is a potential source of problems in software development and can, for example,lead to data races in concurrent programs. More recent programming languages includealiasing control in order to catch more errors at compile time. However, this does notexist for most widely-used languages.LaCasa introduces aliasing control to Scala. LaCasa is a type system and program-ming model that provides lightweight unique and affine (consumable) object referencesin Scala. The unique references provided by LaCasa enable messages to be passed effi-ciently by reference. They also guarantee a deep-copy semantic which makes it possible tomore easily port a concurrent program from running on a single machine to being dis-tributed and running on a large cluster of machines.One aspect that makes LaCasa inconvenient to use is the fact that code needs to bewritten in an explicit continuation-passing style (CPS), different to how code is usuallywritten, which makes programs harder to write, understand and maintain.This project presents a flow-sensitive version of LaCasa which avoids the use of con-tinuations. Flow-sensitivity is achieved by adding an extra compiler phase that performsa static analysis, enforcing LaCasa’s type-checking rules. The flow-sensitive version wasevaluated by measuring the code complexity compared to the original flow-insensitiveLaCasa. A few case studies were performed, as part of the evaluation, to show how flow-sensitive LaCasa can be used to extend LaCasa into other fields of application.The evaluation showed that a flow-sensitive LaCasa can reduce the complexity of ap-plications using LaCasa. It allows programmers to write code in a more usual way whichmakes LaCasa easier to use. / Aliasing är en potentiell källa till problem inom mjukvaruutveckling och can till exempelleda till data races i samtidiga program. Nyare programmeringsspråk inkluderar aliasing-kontroller för att kunna fånga fel vid kompilering. Sådana kontroller existerar inte för deflesta utbredda språken.LaCasa introducerar aliasing-kontroll till Scala. LaCasa är ett typsystem och program-meringsmodell som tillhandahåller unika och affina (förbrukningsbara) objektreferenser iScala. De unika references som tillhandahålls av LaCasa gör det möjligt att effektivt skic-ka meddelanden via referenser. De garanterar också en djup-kopierings-semantik som gördet möjligt att mer enkelt konvertera ett samtidigt program från att köras på en endamaskin till att distribueras och köras på ett stort maskinkluster.En aspekt som gör LaCasa obekvämt att använda är att kod måste skrivas i en ex-plicit continuation-passing-stil (CPS), olik det vanliga sättet att skriva kod, som gör pro-gram svårare att skriva, förstå och underhålla.Det här projektet presenterar en flödeskänslig version av LaCasa som unviker an-vändningen av continuations. Flödeskänslighet uppnås genom att lägga till en extra kom-pileringsfas som utför en statisk analys som upprätthåller LaCasas typ-regler. Den flö-deskänsliga versionen utvärderades genom att mäta kodkomplexitet jämfört med denursprungliga flödesokänsliga LaCasa. Några fallstudier utfördes, som en del av utvär-deringen, för att visa hur flödekänsliga LaCasa kan användas för att utöka LaCasa tillandra användningsområden.Utvärdering visade att ett flödeskänsligt LaCasa kan reducera komplexiteten hos ap-plikationer som använder LaCasa. Det tillåter programmerare att skriva kod på ett mervanligt sätt som gör LaCasa enklare att använda.

No description available.

In this thesis, we measure the impact of reference semantics on programming and reasoning. We designed a survey to compare how well programmers perform under three different programming paradigms. Two of the paradigms, object-copying and swapping use value semantics, while the third, reference-copying, uses reference semantics. We gave the survey to over 25 people. We recorded number of questions answered correctly in each paradigm and the amount of time it took to answer each question. We looked at the overall results as well as the results within various levels of Java experience. Based on anecdotal evidence from the literature, we expected questions based on value semantics to be easier than questions based on reference semantics. The results did not yield differences that were statistically significant, but they did conform to our general expectations. While further investigation is clearly needed, we believe that this work represents an important first step in the empirical analysis of a topic that has previously only been discussed informally. / Master of Science

Aliasing complicates both formal and informal reasoning and is a particular problem in object-oriented languages, where variables denote references to objects rather than object values. Researchers have proposed various approaches to the aliasing problem in object-oriented languages, but all use reference semantics to reason about programs. This thesis describes the design and implementation of Tako—a Java-like language that facilitates value semantics by incorporating alias-avoidance. The thesis describes a non-trivial application developed in the Tako language and discusses some of the object-oriented programming paradigm shifts involved in translating that application from Java to Tako. It introduces a proof rule for procedure calls that uses value semantics and accounts for both repeated arguments and subtyping. / Master of Science

Η παρούσα διπλωματική εργασία πραγματεύεται την μελέτη και κατασκευή μιας διάταξης μετρήσεων για φωτοβολταϊκά συστήματα. Η εργασία αυτή εκπονήθηκε στο Εργαστήριο Ηλεκτρομηχανικής Μετατροπής Ενέργειας του Τμήματος Ηλεκτρολόγων Μηχανικών και Τεχνολογίας Υπολογιστών της Πολυτεχνικής Σχολής του Πανεπιστημίου Πατρών. Σκοπός είναι η υλοποίηση ενός εργαλείου με το οποίο ο χρήστης θα μπορεί να έχει την επίβλεψη των μεγεθών της ηλεκτρικής ενέργειας που διακινούνται από το σύστημα του. Για παράδειγμα να γνωρίζει τα ποσά ισχύος που παράγονται, τα επίπεδα της τάσης και του ρεύματος ακόμα και τα ποσά ισχύος με τα οποία μπορεί να τροφοδοτήσει το δίκτυο της ΔΕΗ αν σκοπεύει να χρησιμοποιεί μέρος της παραγόμενης ενέργειας για της ανάγκες του και να πουλά το περίσσευμα. Αρχικά έγινε η μελέτη και κατασκευή μιας πλακέτας για την προσαρμογή του πραγματικού σήματος του ρεύματος και της τάσης. Ο επεξεργαστής ο οποίος χρησιμοποιείται σε τέτοιου είδους εφαρμογές δεν μπορεί να «διαβάσει» σήματα των οποίων το πλάτος ξεπερνά τα 5 V. Οπότε πρέπει εμείς να φέρουμε τα μεγάλα σήματα σε τέτοια κλίμακα ώστε να είναι διαχειρίσιμα. Ακόμα πρέπει να μετατρέψουμε το σήμα ρεύματος σε σήμα τάσης ανάλογης κλίμακας για να είναι διαχειρίσιμο και αυτό από το υπολογιστικό σύστημα. Στη συνέχεια έγινε μελέτη της διαδικασίας της δειγματοληψίας και αφού υπολογίστηκαν και το SNR, η το ελάχιστο σφάλμα δειγματοληψίας σχεδίασα ένα κατωδιαβατό φίλτρο τύπου Butterworth 4ης τάξης για να περιορίσω τα φαινόμενα aliasing που δημιουργούνται λόγω αλλοίωσης. Το επόμενο βήμα, το οποίο ήταν και το πιο δύσκολο και απαιτητικό, ήταν να σχεδιαστεί ο κώδικας με τον οποίο θα γινόταν η δειγματοληψία και ο υπολογισμός των μεγεθών που μας ενδιέφεραν σε πραγματικό χρόνο (real time). Έγινε πολλαπλασιασμός σε γλώσσα μηχανής (assembly) και χρήση μόνο ακεραίων τιμών για να γίνει ο κώδικας όσο γίνεται πιο γρήγορος μιας και σε ένα τέτοιο σύστημα το βασικότερο που μας απασχολεί είναι η ταχύτητα των πράξεων. Ακόμα χρειάστηκε να συντονιστούν με σήματα interrupt διάφορα περιφερειακά του μικροελεγκτή για να δουλέψει σωστά το σύστημα. Τέλος έγινε προσπάθεια διασύνδεσης του υπάρχοντος προγράμματος με Η/Υ μέσω σειριακής για να γίνει απεικόνιση των αποτελεσμάτων μέσω μιας γραφικής διεπαφής (GUI). / This thesis is about a measuring system for a Photo voltaic Array connected to the grid. In the first chapter there is a survey for the importance of sustainable power sources. Next the project is presented. After that there is a chapter about the sensors that are used. The method of sampling and and filtering the signal is described in the next 3 chapters. Last but not least in the last chapter the user interface is presented