391 |
Effective Quantification of the Paper Surface 3D StructureFidjestøl, Svein January 2005 (has links)
<p>This thesis covers the topic of image processing in relation to the segmentation and analysis of pores protruding the surface in the three dimensional surface structure of paper. The successful analysis of pores is related to a greater goal of relating such an analysis to the perceived quality of the surface of a paper sample. The first part of the thesis gives an introduction to the context of image processing in relation to paper research. Also, an overview of the image processing framework used for image processing plugin development, ImageJ, is provided, together with the current status of ImageJ plugins for surface characterization. The second part of the thesis gives an overview of an envisioned future paper quality assessment system. The quality assesment system described consists of six phases, three of which are treated in this thesis. These are the Image Processing phase, the Modeling phase, and the Measurement phase. The Image Processing phase is further divided into three subphases. These are the Error Correction subphase, the Pore Extraction subphase, and the Segmentation phase. Together with the description of the phases of the system, techniques are presented that are relevant to the phase currently being described. The third part of the thesis covers the development of new plugins for surface characterization within the ImageJ framework. Examples are given and evaluated to show the usage and results of each plugin, and each plugin is related to a specific part of the quality assesment system. Also, a tutorial covering use of several plugins in sequence is presented. The parts of the system receiving the most attention in relation to plugin development are segmentation and modeling.</p>
|
392 |
Location-aware service for the UbiCollab platformJensen, Børge Setså January 2005 (has links)
<p>Location-aware services have become more important during the last decade due to the increasing mobility and connectivity of users and resources. Location-awareness is an important aspect of making an application context-aware. In supporting collaboration in a ubiquitous computing environment taking advantage of location information is an important feature. The UbiCollab Platform is a platform that supports collaboration in a ubiquitous environment. This thesis presents an extension of the UbiCollab platform to make it location-aware. The work shows how the location service can be developed to handle storing and querying of location information.</p>
|
393 |
Reconstruction of hepatic vessels from CT scansEidheim, Ole Christian January 2005 (has links)
<p>Deriving liver vessel structure from CT scans manually is time consuming and error prone. An automatic procedure that could help the radiologist in her analysis is therefore needed. We present two algorithms to preprocess and segment the hepatic vessels. The first algorithm processes each CT slice individually, while the second algorithm applies processing on the whole CT scan at once. Matched filtering and anisotropic diffusion is used to emphasise the blood vessels, and entropy based thresholding and segmentation by local mean and variance are used to coarsely position the vessels. Node positions and sizes are derived from the skeleton and the distance transform of the segmentation results, respectively. From the skeleton and node data, interconnections are added forming a vessel graph. At the end, a search is executed to find the most likely vessel graph based on anatomical knowledge. Results have been inspected visually by medical staff and are promising with respect to clinical use in the future.</p>
|
394 |
Segmentation of Kidneys from MR-ImagesRee, Eirik January 2005 (has links)
<p>Det har blitt utviklet en metode for semi-automatisk segmentering av nyrer fra 2D og 3D MR-bilder. Algoritmen foregår som en kombinasjon av en watershed segmentering og en modellbasert segmentering. For å løse problemet med at aktive konturer krever en svært god initialisering, brukes resultatet av watershed segmenteringen til å lage initielle konturer. Resultatet har blitt en god og fleksibel algoritme som gir gode resultater og lett kan brukes også på andre segmenteringsoppgaver.</p>
|
395 |
NanoRiscRand, Peder January 2005 (has links)
<p>This report gives a short introduction of the Norwegian wireless electronics company Chipcon AS, and goes on to account for the state of the art of small IP processor cores. It then describes the NanoRisc, a powerful processor developed in this project to replace hardware logic modules in future Chipcon designs. The architecture and a VHDL implementation of the NanoRisc is described and discussed, as well as an assembler and instruction set simulator developed for the NanoRisc. The results of this development work are promising; synthesis shows that the NanoRisc is capable of powerful 16-bit data moving and processing at 50 MHz in an 18nm process while requiring less than 4500 gates. The report concludes that the NanoRisc, and none of the existing IP cores studied, satisfies the requirements for hardware logic replacement in Chipcon transceivers.</p>
|
396 |
Empirical study of software evolutionHagli, Andreas Tørå January 2005 (has links)
<p>Software development is rapidly changing and software systems are increasing in size and expected lifetime. To cope with this, several new languages and development processes have emerged, as has stronger focus on design and software architecture and development with consideration for evolution and future change in requirements. There is a clear need for improvements, research shows that the portion of development cost used for maintenance is increasing and can be as high as 50 %. We also see many software systems that grow into uncontrollable complexity where large parts of the system cannot be touched because of risks for unforeseeable consequence. Therefore a clearer understanding of the evolution of software is needed in order to prevent decay of the systems structure. This thesis approaches the field of software evolution through an empirical study on the open source project Portage from the Gentoo Linux project. Data is gathered, ratified and analysed to study the evolutionary trends of the system. These findings are seen in the context of Lehman's laws on the inevitability of growth and increasement of complexity through the lifetime of software systems. A set of research question and hypotheses are formulated and tested. Also, experience from using open source software for data mining is presented.</p>
|
397 |
A graphical diagram editor plugin for EclipseUlvestad, Kay Are January 2005 (has links)
<p>This document serves the dual purpose of being the first version of the documentation for the Eclipse UIML DiaMODL and UIML Diagram plugins, as well as being the written part of my master thesis. The documentation part is the main body of the document. It covers the background of the project, and describes each of the plugins in detail, in terms of structure and behaviour. In addition, the documentation features a relatively detailed practical guide on how the UIML Diagram plugin can be extended with other language specific plugins. As this is part of my master thesis, there is also a short summary of my personal experiences working on the project.</p>
|
398 |
Code Coverage and Software ReliabilityFugelseth, Lars, Lereng, Stian Frydenlund January 2005 (has links)
<p>With an ever-growing competition among software vendors in supplying customers with tailored, high-quality systems, an emphasis is put on creating products that are well-tested and reliable. During the last decade and a half numerous articles have been published that deal with code coverage and its effect, whether existent or not, on reliability. The last few years have also witnessed an increasing number of software tools for automating the data collection and presentation of code coverage information for applications being tested. In this report we aim at presenting available and frequently used measures of code coverage, the practical applications and typical misconceptions of code coverage and its role in software development nowadays. Then we take a look at the notion of reliability in computer systems and which elements that constitute a software reliability model. With the basics of code coverage and reliability estimation in place, we try to assess the status of the relationship between code coverage and reliability, highlight the arguments for and against its existence and briefly survey a few proposed models for connecting code coverage to reliability. Finally, we examine an open-source tool for automated code coverage analysis, focusing on its implementation of the coverage measures it supports, before assessing the feasibility of integrating a proposed approach for reliability estimation into this software utility.</p>
|
399 |
A software tool for risk-based testingJørgensen, Lars Kristoffer Ulstein January 2005 (has links)
<p>There are several approaches to risk-based testing. They have in common that risk is the focus when the tester chooses what to test. In this thesis we will combine some of these approaches and present our method for risk-based testing. The method analyses the risk for each part of the system and use a hazard analysis to indicate what can go wrong. The test efficiency and risk determine the tests priority. We have shown how a software tool can support our method and implemented a proof of concept. The implementation is presented and been tried out by an experienced tester.</p>
|
400 |
On the feasability of automatic segmentation with active contour models in image databases for shape extractionSmestad, Ole Marius January 2005 (has links)
<p>In this thesis the image segmentation system EDISON, was tested against an automatic version snake, which is an algorithm active contour models. The algorithms were tested against each to see if an automatic snake algorithm could be feasible for use in an image database for shape extraction. The conducted tests showed that EDISON yielded the best results, and that snake should be given further work before being considered.</p>
|
Page generated in 0.0356 seconds