#### Filter Results:

- Full text PDF available (37)

#### Publication Year

1977

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lucas J. van Vliet, Ian T. Young, Piet W. Verbeek
- ICPR
- 1998

We propose a new strategy to design recursive implementations of the Gaussian filter and Gaussian regularized derivative filters. Each recursive filter consists of a cascade of two stable Nth-order subsystems (causal and anti-causal). The computational complexity is 2N multiplications per pixel per dimension independent of the size (σ) of the Gaussian… (More)

This paper describes a technique for characterization and segmentation of anisotropic patterns that exhibit a single local orientation. Using Gaussian derivatives we construct a gradient-square tensor at a selected scale. Smoothing of this tensor allows us to combine information in a local neighborhood without canceling vectors pointing in opposite… (More)

- Ben J. H. Verwer, Piet W. Verbeek, Simon T. Dekker
- IEEE Trans. Pattern Anal. Mach. Intell.
- 1989

In artificial intelligence, a number of search algorithms is available for finding shortest paths in graphs. The uniform cost algorithm is a special case of one of those algorithms, the A*-algorithm. In the uniform cost algorithm, nodes are expanded in order of increasing cost. We have developed an efficient version of this algorithm for inManuscript… (More)

- Bernd Rieger, Frederik J. Timmermans, Lucas J. van Vliet, Piet W. Verbeek
- IEEE Transactions on Pattern Analysis and Machine…
- 2004

In this paper, we present a novel method to estimate curvature of iso gray-level surfaces in gray-value images. Our method succeeds where standard isophote curvature estimation methods fail. There is neither a segmentation of the surface needed nor a parametric model assumed. Our estimator works on the orientation field of the surface. This orientation… (More)

- Piet W. Verbeek
- 1988

A systematic framework is given that accommodates existing max-min filter methods and suggests new ones. Putting the upper and lower envelopes UPP = MIN(MAX) and LOW = MAX(MIN) in the roles that MAX, MIN or original play in existing filters we can distinguish edges in ramp edges and texture (or noise) edges; all methods presented come in three versions: for… (More)

- Piet W. Verbeek, Lucas J. van Vliet
- IEEE Trans. Pattern Anal. Mach. Intell.
- 1994

- Ian T. Young, Piet W. Verbeek, B. H. Mayall
- Cytometry
- 1986

In this paper we develop four measures to describe the distribution of nuclear chromatin. These measures attempt to describe in an objective and meaningful way the heterogeneity, granularity, condensation, and margination of chromatin in cell nuclei. Starting with a high-resolution digitized image of a cell where the nuclear pixels have been identified, the… (More)

- Steven Lobregt, Piet W. Verbeek, Frans C. A. Groen
- IEEE Transactions on Pattern Analysis and Machine…
- 1980

An algorithm is proposed for skeletonization of 3-D images. The criterion to preserve connectivity is given in two versions: global and local. The latter allows local decisions in the erosion process. A table of the decisions for all possible configurations is given in this paper. The algorithm using this table can be directly implemented both on general… (More)

- Peter Bakker, Lucas J. van Vliet, Piet W. Verbeek
- CVPR
- 1999

In this paper we describe a new strategy for combining orientation adaptive filtering and edge preserving filtering. The filter adapts to the local orientation and avoids filtering across borders. The local orientation for steering the filter will be estimated in a fixed sized window which never contains two orientation fields. This can be achieved using… (More)

We measure the sharpness of natural (complex) images using Gaussian models. We first locate lines and edges in the image. We apply Gaussian derivatives at different scales to the lines and edges. This yields a response function, to which we can fit the response function of model lines and edges. We can thus estimate the width and amplitude of the line or… (More)