Patrick de smet microsoft

Watersheds and Normalized Cuts as basic tools for Perceptual Grouping more. We propose a new way to use the normalized cut graph par- titioning algorithm for image segmentation. We show that it is possible to We show that it is possible to apply the normalized cut algorithm, origi- nally applied to pixels, to micro segments. This severely re- duces the. Image segmentation using watersheds and normalized cuts more. The normalized cut algorithm is a graph partitioning algorithm that has previously been used successfully for image segmentation.

It is originally applied to pixels by considering each pixel in the image as a node in the graph. In this In this paper we investigate the feasibility of applying the normalized cut algorithm to micro segments by considering each micro segment as a. Computer vision techniques for semi-automatic reconstruction of ripped-up documents more.

This paper investigates the use of computer vision techniques to aid in the semi-automatic reconstruction of torn or ripped-up documents. First, we discuss a procedure for obtaining a digital database of a given set of paper fragments First, we discuss a procedure for obtaining a digital database of a given set of paper fragments using a flatbed image scanner, a brightly coloured scanner background, and a region growing algorithm.

The contour of each segmented piece of paper. Semiautomatic reconstruction of strip-shredded documents more. Until recently, the forensic or investigative reconstruction of shredded documents has always been dismissed as an important but unsolvable problem. Manual reassembly of the physical remnants can always be considered, but for large In this paper we propose and discuss several. Toward automated forensic fracture matching of snap-off blade knives more.

An interesting problem that has concerned forensic scientist for many years, is their need for accurate, reliable and objective methods for performing fracture matching examinations. The aim of these fracture matching methods is to The aim of these fracture matching methods is to determine if two broken object halves can be matched together, e. This paper introduces an improved block matching algorithm for the estimation of the parallax field between the left and the right image of a stereo pair.

When the block size is small, e. Most of the small blocks do not expose enough structure to be reliably matched. Therefore, in this paper. Nonlinear anisotropic diffusion filtering of three-dimensional image data from two-photon microscopy more. Optimized recursive subband synthesis windowing for implementing efficient MPEG audio decoders more. We explain the design of the proposed algorithm We explain the design of the proposed algorithm and briefly discuss how it can be combined with other novel and existing optimization strategies.

The impact of these optimizations on the number of multiplications and additions is shown, and the influence of the algorithm on the amount of memory required by the adapted decoder is also discussed. We show that the proposed algorithm offers very interesting possibilities for implementing efficient VLSI designs.

Implementation and analysis of an optimized rainfalling watershed algorithm. In this paper we discuss a new implementation of a floating point based In this paper we discuss a new implementation of a floating point based rainfalling watershed algorithm. Publisher: link. High Speed. Constructing the topological solution of jigsaw puzzles more.

In this paper we present a novel approach to the jigsaw puzzle solving problem. The main components are a shape based local contour matching followed by a global solving procedure that constructs the topological solution of the jigsaw The main components are a shape based local contour matching followed by a global solving procedure that constructs the topological solution of the jigsaw puzzle.

The shape based local contour matching is discussed briefly, but the main focus of the paper is the construction of the. ICIP ' Topology , Image Classification , and Image Reconstruction. Experimental evaluation of the impact of seating depth variations on observed marks on primers more.

Although the examination of bullet and primer striae patterns is still a very important task in forensic ballistics, a fundamental explanation or theoretical model for reasoning about the ir reproducibility of the observed marks is still Although the examination of bullet and primer striae patterns is still a very important task in forensic ballistics, a fundamental explanation or theoretical model for reasoning about the ir reproducibility of the observed marks is still non-existing.

More specifically, it is still unclear which ammunition production or firing condition parameters may play an important role in the striae and marks formation process. From a practical point of view this situation is unfortunate because a proper knowledge of these parameters and conditions could help underpin and explain certain differences found in actual casework investigations. In this paper, we discuss the results of an experiment aimed at evaluating the impact of primer seating depth variations on observed primer striae and other marks.

First, three sets of cartridge cases with different seating depth intervals were selected. Second, each of these sets were fired consecutively using a selected pistol. Finally, the cartridge cases were examined using both traditional optical microscopes and three-dimensional 3D profilometer techniques. The results reported in this paper show that in our experiments no important impact of the initial primer seating depth on the observed primer striae patterns could be found, but that the firing pin impression does seem to change if the initial seating depth is larger than a certain threshold.

Line extraction with the use of an automatic gradient threshold technique and the Hough transform more. In this paper we present our region merging algorithm that is built with special attention on speed but still includes all the necessary functionality to use a wide range of both region based and border based dissimilarity In this paper we present our region merging algorithm that is built with special attention on speed but still includes all the necessary functionality to use a wide range of both region based and border based dissimilarity criteria.

The algorithm includes a novel method to dynam Data Structure and Region Merging. Image segmentation using thick-fluid watersheds more.

Traditional watershed and marker-based image segmentation algorithms are very sensitive to noise. The main reason for this is that these segmentation algorithms are locally dependent on some type of edge indicator input image that is The main reason for this is that these segmentation algorithms are locally dependent on some type of edge indicator input image that is traditionally computed on a pixel-by-pixel basis.

Additionally, as a result of raw watershed segmentation, the original image can be seriously oversegmented, and it may be. Image segmentation , Watershed Segmentation , and Region Merging. Watershed segmentation and region merging more. ABSTRACT The aim of this paper is to present a methodology to generate a partition of an image and a hierarchical region merging scheme to improve the meaningfulness of the segmentation, by reducing excessive object fragmentation.

The segmentation method is based on the watershed transform applied to the image gradient magnitude. Prior to the actual segmentation, the image is smoothed to decrease the amount of detail detected by the watershed transform. To further improve the segmentation result, we use an iterative region merging process that uses a graph to represent the image partitions.

In this process the most similar pair of adjacent regions is sequentially merged according to a predefined similarity metric. We investigate the use of a combined region merging criterion that takes into account both the intensity similarity and the contrast at the boundary of two adjacent regions.

Results obtained illustrate the good combined performance of this segmentation and merging methods and the usefulness of the combined similarity function. Activity driven nonlinear diffusion for color image watershed segmentation more.

Nonlinear diffusion processes and watershed algorithms have been well studied for gray-scale image segmentation. In this paper we extend the use of these techniques to color or multichannel images.

First, we formulate a general definition First, we formulate a general definition for a nonlinear diffusion process using the concept of an activity image that can be calculated for several image components. Then, we explain how the. Do not zero-pute more. More specifically, we will discuss the problem of eliminating costly computation cycles being wasted at processing useless zero-valued data.

At first, this may all sound somewhat obvious or trivial. Indeed, this can be true in many cases, but experience gathered in various teaching related projects during several academic years has also lead us to believe the opposite. Moreover, a survey of the existing literature quickly reveals that the approach discussed below has not been investigated and documented properly. Although we will only illustrate our optimization approach by discussing the MPEG-audio layer II decoding process in detail, we hope the reader will be able to apply, extend, and implement the basic principles presented here within many other applications.

Image interpolation using constrained adaptive contrast enhancement techniques more. Abstract In this paper we present a method for interpolating images that also preserves sharp edge information. We concentrate on tackling blurred edges by mapping level curves of the image. Level curves or isophotes are spatial curves Level curves or isophotes are spatial curves with constant intensity. Activity driven nonlinear diffusion for color image watershed segmentation.

Nonlinear diffusion Activity driven non-linear diffusion for color image segmentation more. Category: Documents 1 download. Tags: pollux awards fine art exhibitions belgiumselected photography white spider awards nudes categorythe wpga albemarle gallery belgiumthe wpga annual portfolio categorythe. He is now a full-time fine art photographer, managing his "creative flow" from start to finish, from inspiration and idea to finished prints and exhibitions, being helped by the loving support of his muse.

Smet Product Applications. Online communicatie - Steven De Smet. Opmaak van contracten in grensoverschrijdende zaken Aandachtspunten en valkuilen Arvid M. Bente De Smet. Jurgen de smet yves hanoulle real options. Beatijs de Boozere en Chris De Smet.