Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,974
methods to determine appropriate scales for
"... Spatial dependence of predictions from image segmentation: a ..."
Feature detection with automatic scale selection
- International Journal of Computer Vision
, 1998
"... The fact that objects in the world appear in different ways depending on the scale of observation has important implications if one aims at describing them. It shows that the notion of scale is of utmost importance when processing unknown measurement data by automatic methods. In their seminal works ..."
Abstract
-
Cited by 723 (34 self)
- Add to MetaCart
works, Witkin (1983) and Koenderink (1984) proposed to approach this problem by representing image structures at different scales in a so-called scale-space representation. Traditional scale-space theory building on this work, however, does not address the problem of how to select local appropriate
Local Appropriate Scale in Morphological Scale-Space
- In Fourth European Conference on Computer Vision, volume I
, 1996
"... . This paper discusses the problem of selecting appropriate scales for region detection prior to feature localization. We argue that an approach in morphological opening-closing scale-space is better than one in Gaussian scale-space. The proposed operator is based on a new shape decomposition method ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
. This paper discusses the problem of selecting appropriate scales for region detection prior to feature localization. We argue that an approach in morphological opening-closing scale-space is better than one in Gaussian scale-space. The proposed operator is based on a new shape decomposition
Morphological Appropriate Scale Measurements for Region Segmentation
"... This paper presents a novel approach to selecting appropriate scales in morphological opening-closing scale-space. It is based on a morphological band-pass filter that decomposes an image into structures of different size and different curvature polarity ("light and dark blobs"). Appropri ..."
Abstract
- Add to MetaCart
This paper presents a novel approach to selecting appropriate scales in morphological opening-closing scale-space. It is based on a morphological band-pass filter that decomposes an image into structures of different size and different curvature polarity ("light and dark blobs
A Practical Guide to Wavelet Analysis
, 1998
"... A practical step-by-step guide to wavelet analysis is given, with examples taken from time series of the El Nio-- Southern Oscillation (ENSO). The guide includes a comparison to the windowed Fourier transform, the choice of an appropriate wavelet basis function, edge effects due to finite-length t ..."
Abstract
-
Cited by 869 (3 self)
- Add to MetaCart
A practical step-by-step guide to wavelet analysis is given, with examples taken from time series of the El Nio-- Southern Oscillation (ENSO). The guide includes a comparison to the windowed Fourier transform, the choice of an appropriate wavelet basis function, edge effects due to finite
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
, 1996
"... Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning pr ..."
Abstract
-
Cited by 579 (33 self)
- Add to MetaCart
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning
The Laplacian Pyramid as a Compact Image Code
, 1983
"... We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations a ..."
Abstract
-
Cited by 1388 (12 self)
- Add to MetaCart
is achieved by quantizing the difference image. These steps are then repeated to compress the low-pass image. Iteration of the process at appropriately expanded scales generates a pyramid data structure. The encoding process is equivalent to sampling the image with Laplacian operators of many scales. Thus
Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks
- In EuroSys
, 2007
"... Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad applica-tion combines computational “vertices ” with communica-tion “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract
-
Cited by 762 (27 self)
- Add to MetaCart
of available computers, communicating as appropriate through files, TCP pipes, and shared-memory FIFOs. The vertices provided by the application developer are quite simple and are usually written as sequential programs with no thread creation or locking. Concurrency arises from Dryad scheduling vertices to run
Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors
- ACM Transactions on Computer Systems
, 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract
-
Cited by 573 (32 self)
- Add to MetaCart
markedly more pronounced as applications scale. We argue that this problem is not fundamental, and that one can in fact construct busy-wait synchronization algorithms that induce no memory or interconnect contention. The key to these algorithms is for every processor to spin on separate locally
Implicit Fairing of Irregular Meshes using Diffusion and Curvature Flow
, 1999
"... In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high-fidelit ..."
Abstract
-
Cited by 542 (23 self)
- Add to MetaCart
-fidelity computer graphics objects using imperfectly-measured data from the real world. Our approach contains three novel features: an implicit integration method to achieve efficiency, stability, and large time-steps; a scale-dependent Laplacian operator to improve the diffusion process; and finally, a robust
Results 1 - 10
of
10,974
