Computer Vision,Imaging and Computer Graphics

Expanding the Local Binary Pattern to Multispectral Images Using Total Orderings (Computer Vision,Imaging and Computer Graphics) Part 1

Abstract. Texture is an important feature for image analysis, segmentation or classification. Since more and more image segmentation problems involve multi-and even hyperspectral data, it becomes necessary to define multispectral texture features. We propose here a natural extension of the classical Local Binary Pattern (LBP) operator to the case of multispectral images. The Loc al […]

Expanding the Local Binary Pattern to Multispectral Images Using Total Orderings (Computer Vision,Imaging and Computer Graphics) Part 2

Results We apply the LMBP operator to the problem of multispectral MR image segmentation problem. MRI has become a very useful medical diagnostic tool for several years, and development around MR imaging in general, and MR brain imaging in particular has recieved a lot of attention from both a methodological and an applicative point of […]

A Deformable Model for Bringing Particles in Focus (Computer Vision,Imaging and Computer Graphics) Part 1

Abstract. We provide a deformable model for particle analysis. We investigate particle images from a backlit microscope system where particles suffer from out-of-focus blur. The blur is a result of particles being in front or behind the focus plane, and the out-of-focus gives a bias towards overestimating the particle size. This can be handled by […]

A Deformable Model for Bringing Particles in Focus (Computer Vision,Imaging and Computer Graphics) Part 2

Experiments In this section we will experimentally show the performance of our particle model. We want to investigate the precision and accuracy of our model. By precision we mean how good our model is in predicting the true size, shape and particle depth. The accuracy refers to variation in the model predictions. The experiments are […]

Automatic Wood Log Segmentation Using Graph Cuts (Computer Vision,Imaging and Computer Graphics) Part 1

Abstract. Segmenting foreground from background automatically is an active field of research. The graph cut approach is one of the promising methods to solve this problem. This approach requires that the weights of the graph are chosen optimally in order to obtain a good segmentation. We address this challenge focusing on the automatic segmentation of […]

Automatic Wood Log Segmentation Using Graph Cuts (Computer Vision,Imaging and Computer Graphics) Part 2

Results We tested our approach on images taken by employees from forestry. Due to the image acquisition with a mobile phone, our tested input images are jpeg compressed with maximal resolution of 2048 x 1536 pixels. In our application we implemented the weight computation in four different ways as described before. All methods determine the […]

Image Block Error Recovery Using Adaptive Patch_Based Inpainting (Computer Vision,Imaging and Computer Graphics) Part 1

Abstract. In this paper, we propose an adaptive patch-based inpainting algorithm for image block error recovery in block-based coding image transmission. The recovery approach is based on prior information – patch similarity within the image. In order to keep local continuity, we recover the lost pixels by copying pixel values from the source based on […]

Image Block Error Recovery Using Adaptive Patch_Based Inpainting (Computer Vision,Imaging and Computer Graphics) Part 2

Combination Strategy In single-directional inpainting, the error of restored pixels will increase along the recovery direction because of unconfident recovered pixel results [11]. Different recovery orders may introduce different error propagation patterns. The error from one recovery order can be compensated by results from the other order. Therefore, we can reconstruct the image through merging […]

On Euclidean Metric Approximation via Graph Cuts (Computer Vision,Imaging and Computer Graphics) Part 1

Abstract. The graph cut framework presents a popular energy minimization tool. In order to be able to minimize contour length dependent energy terms an appropriate metric approximation has to be embedded into the graph such that the cost of every cut approximates the length of a corresponding contour under a given metric. Formulas giving a […]

On Euclidean Metric Approximation via Graph Cuts (Computer Vision,Imaging and Computer Graphics) Part 2

Experimental Results Approximation Error To benchmark the approximations we chose to measure the multiplicative metrication error they give under particular angular orientations in 2D. Graphs of the error are available in Fig. 4. The figure contains 12 graphs where each row corresponds to a particular 2D neighbourhood and each column to a particular anisotropy ratio. […]

← Previous Entries

Next Entries →