Sciweavers

1541 search results - page 57 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 4 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
ECCV
2008
Springer
14 years 11 months ago
A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
JMIV
2002
100views more  JMIV 2002»
13 years 9 months ago
Analysis of Echoes in Single-Image Random-Dot-Stereograms
Three-dimensional depth information of a surface can be encoded in a two-dimensional image called single-image random-dotstereograms or, more widely known, autostereograms. It is ...
Mark S. K. Lau, C. P. Kwong
ICIP
2001
IEEE
14 years 10 months ago
Disparity map restoration by integration of confidence in Markov random fields models
This paper proposes some Markov Random Field (MRF) models for restoration of stereo disparity maps. The main aspect is the use of confidence maps provided by the Symmetric Multipl...
Andrea Fusiello, Umberto Castellani, Vittorio Muri...
NIPS
2004
13 years 10 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...