New Distance Transforms for Gray Level Image Compression

This thesis deals with distance transforms which are a fundamental issue in image processing and computer vision. In this thesis, two new distance transforms for gray level images are presented. As a new application for distance transforms, they are applied to gray level image compression. The new distance transforms are both new extensions of the well known distance transform algorithm developed by Rosenfeld, Pfaltz and Lay. With some modification their algorithm which calculates a distance transform on binary images with a chosen kernel has been made to calculate a chessboard like distance transform with integer numbers (DTOCS) and a real value distance transform (EDTOCS) on gray level images. Both distance transforms, the DTOCS and EDTOCS, require only two passes over the graylevel image and are extremely simple to implement. Only two image buffers are needed: The original gray level image and the binary image which defines the region(s) of calculation. No other image buffers are needed even if more than one iteration round is performed. For large neighborhoods and complicated images the two pass distance algorithm has to be applied to the image more than once, typically 3 10 times. Different types of kernels can be adopted. It is important to notice that no other existing transform calculates the same kind of distance map as the DTOCS. All the other gray weighted distance function, GRAYMAT etc. algorithms find the minimum path joining two points by the smallest sum of gray levels or weighting the distance values directly by the gray levels in some manner. The DTOCS does not weight them that way. The DTOCS gives a weighted version of the chessboard distance map. The weights are not constant, but gray value differences of the original image. The difference between the DTOCS map and other distance transforms for gray level images is shown. The difference between the DTOCS and EDTOCS is that the EDTOCS calculates these gray level differences in a different way. It propagates local Euclidean distances inside a kernel. Analytical derivations of some results concerning the DTOCS and the EDTOCS are presented. Commonly distance transforms are used for feature extraction in pattern recognition and learning. Their use in image compression is very rare. This thesis introduces a new application area for distance transforms. Three new image compression algorithms based on the DTOCS and one based on the EDTOCS are presented. Control points, i.e. points that are considered fundamental for the reconstruction of the image, are selected from the gray level image using the DTOCS and the EDTOCS. The first group of methods select the maximas of the distance image to new control points and the second group of methods compare the DTOCS distance to binary image chessboard distance. The effect of applying threshold masks of different sizes along the threshold boundaries is studied. The time complexity of the compression algorithms is analyzed both analytically and experimentally. It is shown that the time complexity of the algorithms is independent of the number of control points, i.e. the compression ratio. Also a new morphological image decompression scheme is presented, the 8 kernels' method. Several decompressed images are presented. The best results are obtained using the Delaunay triangulation. The obtained image quality equals that of the DCT images with a 4 x 4

Matkustajainformaatiojärjestelmän toteuttaminen junaan

Matkustajainformaatio junassa koostuu vaunujen ulkopuolisilla kylkinäytöillä esitettävistä junan lähtö-, väli- ja määräasematiedoista yhdessä junan ja vaunujen myyntinumeroiden kanssa sekä vaunujen sisäpuolella automaattisista kuulutuksista ja matkustamon näytöillä esitettävästä staattisesta ja vaihtuvasta informaatiosta. Työssä toteutetaan matkustajainformaatiojärjestelmä käytettäväksi matkustajunissa. Järjestelmään syötetään ennen matkan alkua junan tiedot, jonka jälkeen se toimii automaattisesti ilman tarvetta junahenkilökunnan toimenpiteille. Poikkeustilanteissa junahenkilökunta voi estää järjestelmän toiminnan tai valita esiohjelmointuja erikoiskuulutuksia. Toteuttamismenetelmäksi valittiin C-ohjelmointikieli Linux-käyttöjärjestelmällä varustetulla sulautetulla rautatiekäyttöön suunnitellulla laitealustalla.

Color ad spectral image assessment using novel quality and fidelity techniques

The ongoing development of the digital media has brought a new set of challenges with it. As images containing more than three wavelength bands, often called spectral images, are becoming a more integral part of everyday life, problems in the quality of the RGB reproduction from the spectral images have turned into an important area of research. The notion of image quality is often thought to comprise two distinctive areas – image quality itself and image fidelity, both dealing with similar questions, image quality being the degree of excellence of the image, and image fidelity the measure of the match of the image under study to the original. In this thesis, both image fidelity and image quality are considered, with an emphasis on the influence of color and spectral image features on both. There are very few works dedicated to the quality and fidelity of spectral images. Several novel image fidelity measures were developed in this study, which include kernel similarity measures and 3D-SSIM (structural similarity index). The kernel measures incorporate the polynomial, Gaussian radial basis function (RBF) and sigmoid kernels. The 3D-SSIM is an extension of a traditional gray-scale SSIM measure developed to incorporate spectral data. The novel image quality model presented in this study is based on the assumption that the statistical parameters of the spectra of an image influence the overall appearance. The spectral image quality model comprises three parameters of quality: colorfulness, vividness and naturalness. The quality prediction is done by modeling the preference function expressed in JNDs (just noticeable difference). Both image fidelity measures and the image quality model have proven to be effective in the respective experiments.

Kunnianosoitus varpuselle

Kirjallisuusarvostelu

Kertomuksia tanssien ja tutkijoiden historiasta

Kirjallisuusarvostelu

A Communication Middleware Quality Enhancement with Qt Framework

In this thesis, a Peer-to-Peer communication middleware for mobile environment is developed using the Qt framework and the Qt Mobility extension. The Peer-to-Peer middleware – called as PeerHood – is for service sharing in network neighborhood. In addition, the PeerHood enables service connectivity and device monitoring functionalities. The concept of the PeerHood is already available in native C++ implementation on Linux platform using services from the platform. In this work, the PeerHood concept is remade to be based on use of the Qt framework. The objective of the new solution is to increase PeerHood quality with using functionalities from the Qt framework and the Qt Mobility extension. Furthermore, by using the Qt framework, the PeerHood middleware can be implemented to be portable cross-platform middleware. The quality of the new PeerHood implementation is evaluated with defined quality factors and compared with the existing PeerHood. Reliability, CPU usage, memory usage and static code analysis metrics are used in evaluation. The new PeerHood is shown to be more reliable and flexible that the existing one.

Some defects in two-dimensional spin-1/2 Heisenberg antiferromagnets: a numerical study of magnetic effects

En del av de intressantaste fenomenen inom dagens materialfysik uppstår ur ett intrikat samspel mellan myriader av elektroner. Högtemperatursupraledare är det mest berömda exemplet. Varken klassiska teorier eller modeller där elektronerna är oberoende av varandra kan förklara de häpnadsväckande effekterna i de starkt korrelerade elektronsystemen. I vissa kopparoxider, till exempel La2CuO4, är det känt att valenselektronerna till följd av en stark ömsesidig växelverkan lokaliseras en och en till kopparatomerna i föreningens CuO2 plan. Laddningarnas inneboende magnetiska moment—spinnet—får då en avgörande roll för materialets elektriska och magnetiska egenskaper, vilka i exemplets fall kan beskrivas med Heisenbergmodellen som är den grundläggande teoretiska modellen för mikroskopisk magnetism. Men exakt varför föreningarna kan bli supraledande då de dopas med överskottsladdningar är än så länge en obesvarad fråga. Min avhandling undersöker orenheters inverkan på Heisenbergmodellens magnetiska egenskaper—ett problem av både experimentell och teoretisk relevans. En etablerad numerisk metod har använts—en kvantmekanisk Monte Carlo teknik—för att utföra omfattande datorsimuleringar av den matematiska modellen på två dedikerade Linux datorkluster. Arbetet hör till området beräkningsfysik. De teoretiska modellerna för starkt korrelerade elektronsystem, däribland Heisenbergmodellen, är ytterst invecklade matematiskt sett och de kan inte lösas exakt. Analytiska utredningar bygger för det mesta på antaganden och förenklingar vars inverkningar på slutresultatet är ofta oklara. I det avseende kan numeriska studier vara exakta, det vill säga de kan behandla modellerna som de är. Oftast behövs bägge tillvägagångssätten. Den röda tråden i arbetet har varit att numeriskt testa vissa högaktuella analytiska förutsägelser rörande effekterna av orenheter i Heisenbergmodellen. En del av dem har vi på basen av mycket noggranna data kunnat bekräfta. Men våra resultat har också påvisat felaktigheter i de analytiska prognoserna som sedermera delvis reviderats. En del av avhandlingens numeriska upptäckter har i sin tur stimulerat till helt nya teoretiska studier.

Some advances in mathematical models for preference relations

Preference relations, and their modeling, have played a crucial role in both social sciences and applied mathematics. A special category of preference relations is represented by cardinal preference relations, which are nothing other than relations which can also take into account the degree of relation. Preference relations play a pivotal role in most of multi criteria decision making methods and in the operational research. This thesis aims at showing some recent advances in their methodology. Actually, there are a number of open issues in this field and the contributions presented in this thesis can be grouped accordingly. The first issue regards the estimation of a weight vector given a preference relation. A new and efficient algorithm for estimating the priority vector of a reciprocal relation, i.e. a special type of preference relation, is going to be presented. The same section contains the proof that twenty methods already proposed in literature lead to unsatisfactory results as they employ a conflicting constraint in their optimization model. The second area of interest concerns consistency evaluation and it is possibly the kernel of the thesis. This thesis contains the proofs that some indices are equivalent and that therefore, some seemingly different formulae, end up leading to the very same result. Moreover, some numerical simulations are presented. The section ends with some consideration of a new method for fairly evaluating consistency. The third matter regards incomplete relations and how to estimate missing comparisons. This section reports a numerical study of the methods already proposed in literature and analyzes their behavior in different situations. The fourth, and last, topic, proposes a way to deal with group decision making by means of connecting preference relations with social network analysis.

Combustion properties of biomass residues rich in phosphorus

Tillgången på traditionella biobränslen är begränsad och därför behöver man ta fram nya, tidigare outnyttjade biobränslen för att möta de uppställda CO2 emissionsmålen av EU och det ständigt ökande energibehovet. Under de senare åren har intresset riktats mot termisk energiutvinning ur olika restfraktioner och avfall. Vid produktion av fordonsbränsle ur biomassa är den fasta restprodukten ofta den största procesströmmen i produktionsanläggningen. En riktig hantering av restprodukterna skulle göra produktionen mera lönsam och mer ekologiskt hållbar. Ett alternativ är att genom förbränning producera elektricitet och/eller värme eftersom dessa restprodukter anses som CO2-neutrala. Målsättningen med den här avhandlingen var att studera förbränningsegenskaperna hos några fasta restprodukter som uppstår vid framställning av förnybara fordonsbränslen. De fyra undersökta materialen är rapskaka, palmkärnskaka, torkad drank och stabiliserat rötslam. I studien används ett stort urval av undersökningsmetoder, från laboratorieskala till fullskalig förbränning, för att identifiera de huvudsakliga utmaningarna förknippade med förbränning av restprodukterna i pannor med fluidiserad bäddteknik. Med hjälp av detaljerad bränslekarakterisering kunde restprodukterna konstateras vara en värdefull källa för värme- och elproduktion. Den kemiska sammansättningen av restprodukterna varierar stort jämfört med mera traditionellt använda biobränslen. En gemensam faktor för alla de studerade restprodukterna är en hög fosforhalt. På grund av de låga fosforkoncentrationerna i de traditionella biobränslena har grundämnet hittills inte ansetts spela någon större roll i askkemin. Experimenten visade nu att fosfor inte mera kan försummas då man studerar kemin i förbränningsprocesser, då allt flera fosforrika bränslen tränger in på energimarknaden.

Theseus.fi, ammattikorkeakoulujen julkaisuarkisto – kaksi vuotta amkien yhteisen julkaisuarkiston koordinointia

Esitys Ajankohtaista julkaisuarkistoista -seminaarissa 14.6.2012

Building object-oriented software with the D-Bus messaging system

Object-oriented programming is a widely adopted paradigm for desktop software development. This paradigm partitions software into separate entities, objects, which consist of data and related procedures used to modify and inspect it. The paradigm has evolved during the last few decades to emphasize decoupling between object implementations, via means such as explicit interface inheritance and event-based implicit invocation. Inter-process communication (IPC) technologies allow applications to interact with each other. This enables making software distributed across multiple processes, resulting in a modular architecture with benefits in resource sharing, robustness, code reuse and security. The support for object-oriented programming concepts varies between IPC systems. This thesis is focused on the D-Bus system, which has recently gained a lot of users, but is still scantily researched. D-Bus has support for asynchronous remote procedure calls with return values and a content-based publish/subscribe event delivery mechanism. In this thesis, several patterns for method invocation in D-Bus and similar systems are compared. The patterns that simulate synchronous local calls are shown to be dangerous. Later, we present a state-caching proxy construct, which avoids the complexity of properly asynchronous calls for object inspection. The proxy and certain supplementary constructs are presented conceptually as generic object-oriented design patterns. The e ect of these patterns on non-functional qualities of software, such as complexity, performance and power consumption, is reasoned about based on the properties of the D-Bus system. The use of the patterns reduces complexity, but maintains the other qualities at a good level. Finally, we present currently existing means of specifying D-Bus object interfaces for the purposes of code and documentation generation. The interface description language used by the Telepathy modular IM/VoIP framework is found to be an useful extension of the basic D-Bus introspection format.

Design and implementation of robot gripper interface

This thesis presents a design for an asynchronous interface to Robotiq adaptive gripper s-model. Designed interface is a communication layer that works on top of modbus layer. The design contains function definitions, finite state machine and exceptions. The design was not fully implemented but enough was so that it can be used. The implementation was done with c++ in linux environment. Additionally to the implementation a simple demo program was made to show the interface is used. Also grippers closing speed and force were measured. There is also a brief introduction into robotics and robot grasping.

Svenska.yle.fi ja avoin data

Esitys Kirjastoverkkopäivillä 25.10.2012 Helsingissä

Toimitusketjuun sitoutuvan pääoman hallinta keskisuuressa metalliteollisuusyrityksessä

Tämän diplomityön tavoitteena on tunnistaa kohdeyrityksen toimitusketjuun sitoutuvan pääoman lähteet ja niihin sitoutunut pääoma, menetelmät pääoman vapauttamiseksi sekä kehityskohteet toimitusketjuun sitoutuneen pääoman hallinnan näkökulmasta. Kes-keisimmät tutkitut pääoman lähteet ovat varastot ja keskeneräinen tuotanto, mutta myös ostovelkoja sekä rahtikustannuksia käsitellään. Varastoitavat nimikkeet jaettiin kahteen pääryhmään, ostettavat ja valmistettavat nimikkeet. Pääryhmät jaettiin edelleen pienem-piin alaryhmiin, nimiketyyppeihin, jotta analyysien tulokset voidaan kohdentaa tarkemmin. Varastoon sidotun pääoman kehityskohteiden tunnistamisessa käytettiin varastoarvoa, keskivarastoa ja kiertonopeutta, sekä näiden kombinaatioita. Tulokset esitettiin sekä pääryhmätasolla, että nimiketyyppitasolla, jotta kehityskohteet olisi helpompi tunnistaa. Keskeneräisen tuotannon osalta tavoitteena oli ensisijaisesti tunnistaa, kuinka suuri osa toimitusketjun pääomasta siihen sitoutuu. Rahtikustannukset tiedetään vuositasolla ja sen kautta on mahdollista arvioida kuukausittain rahteihin keskimäärin sitoutuva pääoma. Ostovelat on käsitelty vain kevyesti, koska se on itse asiassa käyttöpääoman erä. Keskeisimmät löydökset liittyvät kiertonopeuteen ja nimikkeiden ohjaustapaan. Osalla pääomaa varastoon sitovista nimikkeistä kiertonopeus on nolla ja useiden nimikkeiden kohdalla kiertonopeudessa on parannettavaa. Myös osa tilausohjautuvista nimikkeistä sitoo ennakko-odotuksista poiketen pääomaa varastoon. Kaikkiin edellä mainittuihin löy-döksiin tunnistettiin tilanteeseen johtaneet syyt ja määritettiin kehitystoimenpiteet, jotta tilanteet voidaan jatkossa välttää.