Sciweavers

437 search results - page 65 / 88
» A New Method for Computing Optical Flow
Sort
View
ECCV
2010
Springer
13 years 5 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
BMCBI
2008
132views more  BMCBI 2008»
13 years 8 months ago
Clustering ionic flow blockade toggles with a Mixture of HMMs
Background: Ionic current blockade signal processing, for use in nanopore detection, offers a promising new way to analyze single molecule properties with potential implications f...
Alexander G. Churbanov, Stephen Winters-Hilt
SIGGRAPH
2000
ACM
14 years 9 days ago
A fast relighting engine for interactive cinematic lighting design
We present new techniques for interactive cinematic lighting design of complex scenes that use procedural shaders. Deep-framebuffers are used to store the geometric and optical in...
Reid Gershbein, Pat Hanrahan
VMV
2004
100views Visualization» more  VMV 2004»
13 years 9 months ago
Vector Quantization Based Data Selection for Hand-Eye Calibration
The paper presents a new vector quantization based approach for selecting well-suited data for hand-eye calibration from a given sequence of hand and eye movements. Data selection...
Jochen Schmidt, Florian Vogt, Heinrich Niemann
ARVLSI
1995
IEEE
155views VLSI» more  ARVLSI 1995»
13 years 11 months ago
Low-latency plesiochronous data retiming
A new method of retiming plesiochronous data is described. This method features latency of less than a cell-time and requires only minimal support circuitry. No flow control or ha...
Larry R. Dennison, William J. Dally, Thucydides Xa...