3D Surface Modeling From Point Clouds

The goal of this thesis is to implement software for creating 3D models from point clouds. Point clouds are acquired with stereo cameras, monocular systems or laser scanners. The created 3D models are triangular models or NURBS (Non-Uniform Rational B-Splines) models. Triangular models are constructed from selected areas from the point clouds and resulted triangular models are translated into a set of quads. The quads are further translated into an estimated grid structure and used for NURBS surface approximation. Finally, we have a set of NURBS surfaces which represent the whole model. The problem wasn’t so easy to solve. The selected triangular surface reconstruction algorithm did not deal well with noise in point clouds. To handle this problem, a clustering method is introduced for simplificating the model and removing noise. As we had better results with the smaller point clouds produced by clustering, we used points in clusters to better estimate the grids for NURBS models. The overall results were good when the point cloud did not have much noise. The point clouds with small amount of error had good results as the triangular model was solid. NURBS surface reconstruction performed well on solid models.

Некоторые наблюдения по поводу построения компьютерного морфологического анализатора марийского языка. [Problems in writing a two-level model of Mari morphology]

The article describes some concrete problems that were encountered when writing a two-level model of Mari morphology. Mari is an agglutinative Finno-Ugric language spoken in Russia by about 600 000 people. The work was begun in the 1980s on the basis of K. Koskenniemi’s Two-Level Morphology (1983), but in the latest stage R. Beesley’s and L. Karttunen’s Finite State Morphology (2003) was used. Many of the problems described in the article concern the inexplicitness of the rules in Mari grammars and the lack of information about the exact distribution of some suffixes, e.g. enclitics. The Mari grammars usually give complete paradigms for a few unproblematic verb stems, whereas the difficult or unclear forms of certain verbs are only superficially discussed. Another example of phenomena that are poorly described in grammars is the way suffixes with an initial sibilant combine to stems ending in a sibilant. The help of informants and searches from electronic corpora were used to overcome such difficulties in the development of the two-level model of Mari. The variation of the order of plural markers, case suffixes and possessive suffixes is a typical feature of Mari. The morphotactic rules constructed for Mari declensional forms tend to be recursive and their productivity must be limited by some technical device, such as filters. In the present model, certain plural markers were treated like nouns. The positional and functional versatility of the possessive suffixes can be regarded as the most challenging phenomenon in attempts to formalize the Mari morphology. Cyrillic orthography, which was used in the model, also caused problems. For instance, a Cyrillic letter may represent a sequence of two sounds, the first being part of the word stem while the other belongs to a suffix. In some cases, letters for voiced consonants are also generalized to represent voiceless consonants. Such orthographical conventions distance a morphological model based on orthography from the actual (morpho)phonological processes in the language.

Simulations of 3D Stripixel Detectors

Large Hadron Collider (LHC) is the main particle accelerator at CERN. LHC is created with main goal to search elementary particles and help science investigate our universe. Radiation in LHC is caused by charged particles circular acceleration, therefore detectors tracing particles in existed severe conditions during the experiments must be radiation tolerant. Moreover, further upgrade of luminosity (up to 1035 cm-2s-1) requires development of particle detector’s structure. This work is dedicated to show the new type 3D stripixel detector with serious structural improvement. The new type of radiation-hard detector has a three-dimensional (3D) array of the p+ and n+ electrodes that penetrate into the detector bulk. The electrons and holes are then collected at oppositely biased electrodes. Proposed 3D stripixel detector demonstrates that full depletion voltage is lower that that for planar detectors. Low depletion voltage is one of the main advantages because only depleted part of the device is active are. Because of small spacing between electrodes, charge collection distances are smaller which results in high speed of the detector’s response. In this work is also briefly discussed dual-column type detectors, meaning consisting both n+ and p+ type columnar electrodes in its structure, and was declared that dual-column detectors show better electric filed distribution then single sided radiation detectors. The dead space or in other words low electric field region in significantly suppressed. Simulations were carried out by using Atlas device simulation software. As a simulation results in this work are represented the electric field distribution under different bias voltages.

Kehittyneiden hitsausprosessien soveltuvuus alumiinin ja hiiliterästen hitsaukseen

Diplomityössä tutkitaan hitsausprosessien kehitystä. Työn kirjallisen osan alku kuvaa hitsauksen nykypäivää ja tulevaisuutta sekä millainen on hitsaava Suomi. Kehittyneiden hitsausprosessien tarkastelu on jaettu hiiliterästen ja alumiinien hitsausprosesseihin. Hiiliteräksien hitsauksen osalta työssä esitellään kitkahitsaus pyörivällä työkalulla, muunnettu lyhytkaarihitsaus, laserhitsaus, laser-hybridihitsaus ja kapearailohitsaus. Alumiinien hitsauksen osalta työssä esitellään laserhitsaus, muunnettu lyhytkaarihitsaus, kitkahitsaus pyörivällä työkalulla ja vaihtovirta MIG hitsaus. Diplomityön käytännönosuudessa todennettiin hitsausprosessien kehitys. Ensimmäisissä hitsauskokeissa hitsattiin merialumiinia eri kaarityypeillä. Vertailua tehdään pulssihitsauksen, lankapulssihitsauksen sekä CMT-kaarihitsauksen välillä. Koehitsaukset osoittavat CMT-hitsauksen tuottavan MIG-pulssihitsausta pienemmät hitsausmuodonmuutokset. CMT-hitsauksessa alumiinin oksidikerros aiheuttaa MIGpulssihitsausta vähemmän ongelmia, sillä kaari syttyy varmemmin suurillakin hitsausnopeuksilla, eikä hitsiin synny huokosia. Hitsausnopeudella 40 cm/min lankapulssihitsauksella ja MIG-pulssihitsauksella päittäisliitoksena hitsattujen vesileikattujen alumiinikappaleiden hitseihin ei syntynyt huokosia. Kokeen perusteella voidaan todeta, ettei oksidikerroksella ollut vaikutusta hitsin onnistumiseen. Hitsauskokeiden toinen osio tutkii hiilimangaaniteräksisen T-palkin kuitulaserhitsausta. Viiden kilowatin laserteholla hitsattiin onnistuneesti viisi metriä pitkiä T-palkkeja hitsausnopeudella 2 m/min. Takymetrimittauksella ja Tritop 3D-koordinaattimittauksella todennettiin laserhitsatun T-palkin hitsausmuodonmuutosten olevan huomattavasti Twin-jauhekaarihitsauksella hitsattua T-palkkia pienemmät.

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.

3D Stripixel Detectors Simulation

Solid-state silicon detectors have replaced conventional ones in almost all recent high-energy physics experiments. Pixel silicon sensors don't have any alternative in the area near the interaction point because of their high resolution and fast operation speed. However, present detectors hardly withstand high radiation doses. Forthcoming upgrade of the LHC in 2014 requires development of a new generation of pixel detectors which will be able to operate under ten times increased luminosity. A planar fabrication technique has some physical limitations; an improvement of the radiation hardness will reduce sensitivity of a detector. In that case a 3D pixel detector seems to be the most promising device which can overcome these difficulties. The objective of this work was to model a structure of the 3D stripixel detector and to simulate electrical characteristics of the device. Silvaco Atlas software has been used for these purposes. The structures of single and double sided dual column detectors with active edges were described using special command language. Simulations of these detectors have shown that electric field inside an active area has more uniform distribution in comparison to the planar structure. A smaller interelectrode space leads to a stronger field and also decreases the collection time. This makes the new type of detectors more radiation resistant. Other discovered advantages are the lower full depletion voltage and increased charge collection efficiency. So the 3D stripixel detectors have demonstrated improved characteristics and will be a suitable replacement for the planar ones.

Algorithmic Solutions for Combinatorial Problems in Resource Management of Manufacturing Environments

This thesis studies the use of heuristic algorithms in a number of combinatorial problems that occur in various resource constrained environments. Such problems occur, for example, in manufacturing, where a restricted number of resources (tools, machines, feeder slots) are needed to perform some operations. Many of these problems turn out to be computationally intractable, and heuristic algorithms are used to provide efficient, yet sub-optimal solutions. The main goal of the present study is to build upon existing methods to create new heuristics that provide improved solutions for some of these problems. All of these problems occur in practice, and one of the motivations of our study was the request for improvements from industrial sources. We approach three different resource constrained problems. The first is the tool switching and loading problem, and occurs especially in the assembly of printed circuit boards. This problem has to be solved when an efficient, yet small primary storage is used to access resources (tools) from a less efficient (but unlimited) secondary storage area. We study various forms of the problem and provide improved heuristics for its solution. Second, the nozzle assignment problem is concerned with selecting a suitable set of vacuum nozzles for the arms of a robotic assembly machine. It turns out that this is a specialized formulation of the MINMAX resource allocation formulation of the apportionment problem and it can be solved efficiently and optimally. We construct an exact algorithm specialized for the nozzle selection and provide a proof of its optimality. Third, the problem of feeder assignment and component tape construction occurs when electronic components are inserted and certain component types cause tape movement delays that can significantly impact the efficiency of printed circuit board assembly. Here, careful selection of component slots in the feeder improves the tape movement speed. We provide a formal proof that this problem is of the same complexity as the turnpike problem (a well studied geometric optimization problem), and provide a heuristic algorithm for this problem.

Solving Challenging Real-World Scheduling Problems

This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use. The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems. The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.

The knapsack problem approach in solving partial hedging problems of options

En option är ett finansiellt kontrakt som ger dess innehavare en rättighet (men medför ingen skyldighet) att sälja eller köpa någonting (till exempel en aktie) till eller från säljaren av optionen till ett visst pris vid en bestämd tidpunkt i framtiden. Den som säljer optionen binder sig till att gå med på denna framtida transaktion ifall optionsinnehavaren längre fram bestämmer sig för att inlösa optionen. Säljaren av optionen åtar sig alltså en risk av att den framtida transaktion som optionsinnehavaren kan tvinga honom att göra visar sig vara ofördelaktig för honom. Frågan om hur säljaren kan skydda sig mot denna risk leder till intressanta optimeringsproblem, där målet är att hitta en optimal skyddsstrategi under vissa givna villkor. Sådana optimeringsproblem har studerats mycket inom finansiell matematik. Avhandlingen "The knapsack problem approach in solving partial hedging problems of options" inför en ytterligare synpunkt till denna diskussion: I en relativt enkel (ändlig och komplett) marknadsmodell kan nämligen vissa partiella skyddsproblem beskrivas som så kallade kappsäcksproblem. De sistnämnda är välkända inom en gren av matematik som heter operationsanalys. I avhandlingen visas hur skyddsproblem som tidigare lösts på andra sätt kan alternativt lösas med hjälp av metoder som utvecklats för kappsäcksproblem. Förfarandet tillämpas även på helt nya skyddsproblem i samband med så kallade amerikanska optioner.