• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Korekce snímků / Picture correction

Sedlo, Petr January 2016 (has links)
This work is focussed on different unwanted effects that damage a digitally acquired image. An image acquired using a digital camera can suffer from a series of defects. First, the noise is concerned. It occures due to discretisation. Next, there are the defects including vignetting, radial image distortion, chromatic aberration. In my thesis I also worked on backlight image compensation and panorama creation from an image sequence. For backlight images we need to increase the brightness in the dark parts of the image, so that the details became more visible. At panorama creation we are careful about brightness evenness in partial images, which is usually not conserved and consequently we try to find a suitable boundary-line to connect images and smooth it. The fundamental part of my work was writing the algorithms that are able to compensate these defects at least partly. For this aim I took use of the Matlab environment.
2

Vyhledání význačných bodů v rastrovém obraze / Searching for Points of Interest in Raster Image

Kaněčka, Petr Unknown Date (has links)
This document deals with an image points of interest detection possibilities, especially corner detectors. Many applications which are interested in computer vision needs these points as their necessary step in the image processing. It describes the reasons why it is so useful to find these points and shows some basic methods to find them. There are compared features of these methods at the end.

Page generated in 0.0604 seconds