Filters








5,812 Hits in 5.3 sec

Computing Stochastic Completion Fields in Linear-Time Using a Resolution Pyramid

Lance Williams, John Zweck, Tairan Wang, Karvel Thornber
1999 Computer Vision and Image Understanding  
We describe a linear-time algorithm for computing the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane.  ...  Our algorithm is a resolution-pyramid-based method for solving a partial differential equation (PDE) characterizing a distribution of short, smooth completion shapes.  ...  ACKNOWLEDGMENTS The authors thank Achi Brandt for suggesting the use of a multiresolution method. Joachim Weickert also offered helpful comments.  ... 
doi:10.1006/cviu.1999.0800 fatcat:7hes55z2vvby5dnmt345wzvcvi

A Multiresolution Markovian Fusion Model for the Color Visualization of Hyperspectral Images

Max Mignotte
2010 IEEE Transactions on Geoscience and Remote Sensing  
or a nonstationary MRF model defined on a complete graph.  ...  In this paper, we present a nonstationary Markov random field (MRF) fusion model for the color display of hyperspectral images.  ...  Algorithm In order to decrease the computational load of our multiresolution optimization procedure, we only use two levels of resolution in our pyramidal structure (see Fig. 2 ): the full resolution  ... 
doi:10.1109/tgrs.2010.2051553 fatcat:zst6ecbvhre3lnrtvvncn2yqui

A Moving Average Bidirectional Texture Function Model [chapter]

Michal Havlíček, Michal Haindl
2013 Lecture Notes in Computer Science  
A mono-spectral moving average model assumes that a stochastic mono-spectral texture is produced by convolving an uncorrelated 2D random field with a 2D filter which completely characterizes the texture  ...  We present a novel BTF model based on a set of underlying mono-spectral two-dimensional (2D) moving average factors.  ...  Suppose a stochastic mono-spectral texture denoted by Y is the response of an underlying linear system which completely characterizes the texture in response to a 2D uncorrelated random input e r , then  ... 
doi:10.1007/978-3-642-40246-3_42 fatcat:4t7b3fpqm5dijldxlvacbeddyq

Fast texture synthesis using tree-structured vector quantization

Li-Yi Wei, Marc Levoy
2000 Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00  
In this paper, we present an efficient algorithm for realistic texture synthesis. The algorithm is easy to use and requires only a sample texture as input.  ...  Abstract Texture synthesis is important for many applications in computer graphics, vision, and image processing.  ...  The texture thumbnail shown in Figure 1 was acquired from Jeremy De Bonet's webpage. Special thanks to members of the Stanford Graphics Group.  ... 
doi:10.1145/344779.345009 dblp:conf/siggraph/WeiL00 fatcat:wqzlxckvsff7pfbsi33ngzo2fa

Euclidean Group Invariant Computation of Stochastic Completion Fields Using Shiftable-Twistable Functions [chapter]

John W. Zweck, Lance R. Williams
2000 Lecture Notes in Computer Science  
We describe a method for computing the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane, that is, a method for completing  ...  Like computations in primary visual cortex (and unlike all previous models of contour completion in the human visual system), our computation is Euclidean invariant.  ...  Our new algorithm computes stochastic completion fields in a Euclidean invariant manner.  ... 
doi:10.1007/3-540-45053-x_7 fatcat:3lm5css2lnevzkqe2kd7dhg34m

Euclidean Group Invariant Computation of Stochastic Completion Fields Using Shiftable-Twistable Functions

John Zweck, Lance R. Williams
2004 Journal of Mathematical Imaging and Vision  
We describe a method for computing the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane, that is, a method for completing  ...  Like computations in primary visual cortex (and unlike all previous models of contour completion in the human visual system), our computation is Euclidean invariant.  ...  Our new algorithm computes stochastic completion fields in a Euclidean invariant manner.  ... 
doi:10.1023/b:jmiv.0000035179.47895.bc fatcat:preevvhshnd6rdxwkymquljdee

Bayesian estimation of motion vector fields

J. Konrad, E. Dubois
1992 IEEE Transactions on Pattern Analysis and Machine Intelligence  
This paper introduces a stochastic approach to the computation of motion.  ...  Knowledge of Manuscript 2-D motion in a time-varying image can be used to infer 3-D motion, e.g., of a camera with respect to the environment, or to compute structure from motion; however, it can also  ... 
doi:10.1109/34.161350 fatcat:hk3y5wqqkvafzpfn5phblnl33a

A Compound Moving Average Bidirectional Texture Function Model [chapter]

Michal Haindl, Michal Havlíček
2016 Advances in Intelligent Systems and Computing  
The presented compound random field model combines a non-parametric control random field with local multispectral models for single regions and thus allows to avoid demanding iterative methods for both  ...  This paper describes a simple novel compound random field model capable of realistic modelling the most advanced recent representation of visual properties of surface materials -the bidirectional texture  ...  Suppose a stochastic multi-spectral texture denoted by Y is the response of an underlying linear system which completely characterizes the texture in response to a 3D uncorrelated random input E r , then  ... 
doi:10.1007/978-3-319-43982-2_8 fatcat:5ar7i5fc6nenlciyzrrgyngqru

Multiscale Fields of Patterns [article]

Pedro F. Felzenszwalb, John G. Oberlin
2014 arXiv   pre-print
We describe a framework for defining high-order image models that can be used in a variety of applications. The approach involves modeling local patterns in a multiscale representation of an image.  ...  This framework leads to expressive priors that depend on a relatively small number of parameters. For inference and learning we use an MCMC method for block sampling with very large blocks.  ...  Related approaches include the stochastic completion field in [22, 21] , spectral methods [11] , the curve indicator random field [3] , and the recent work in [1] .  ... 
arXiv:1406.0924v3 fatcat:qiilumdfevf6fh6o2ntggnha3q

Improved white matter fiber tracking using stochastic labeling

C.R. Tench, P.S. Morgan, L.D. Blumhardt, C. Constantinescu
2002 Magnetic Resonance in Medicine  
Diffusion tensor imaging (DTI) promises a robust means of visualizing in vivo white matter fibers in individual subjects, and of inferring direct connectivity between distant points in the brain.  ...  The use of stochastic labeling may therefore improve the reliability of experiments using white matter fiber tracking. Magn Reson Med 48:677-683, 2002.  ...  FIG. 6 . 6 Trajectories computed within the pyramidal tracts, shown from two viewpoints: (a and b) from the original data, and (c and d) after processing using stochastic labeling.  ... 
doi:10.1002/mrm.10266 pmid:12353285 fatcat:57dgmnpwcfavdcn2jvki66qk4e

Time to Bring Single Neuron Modeling into 3D

Weiliang Chen, Erik De Schutter
2017 Neuroinformatics  
axons in reasonable detail, the underlying equations ignore many 3D aspects by computing the changes in membrane potential in a branched 1D cable.  ...  Wilfrid Rall introduced linear cable theory to analyze the electrical behavior of dendrites 5 and was the first to demonstrate their importance for synaptic integration. 6 Later he proposed a computational  ...  Nevertheless this is not a complete solution: not every problem requires computationally intensive stochastic simulation and at present STEPS does not support network simulation or computation of the LFP  ... 
doi:10.1007/s12021-016-9321-x pmid:28058618 fatcat:puxlalg6jjdzjo4u5neldkum7u

A multiresolution approach for shape shading coupling deterministic and stochastic optimization

A. Crouzil, X. Descombes, J. Durou
2003 IEEE Transactions on Pattern Analysis and Machine Intelligence  
Therefore, we propose a hybrid approach which combines the deterministic and stochastic approaches in a multiresolution framework.  ...  Shape from shading is an ill-posed inverse problem for which there is no completely satisfactory solution in the existing literature.  ...  If the low pass filter used is the Gaussian filter, the pyramid is called a Gaussian pyramid. In the case of SFS, the relation between the data (the image) and the unknown (the shape) is not linear.  ... 
doi:10.1109/tpami.2003.1240116 fatcat:zrdhtmwwpbg6pfsevzhsevxuee

Stochastic Uncertainty Models for the Luminance Consistency Assumption

T. Corpetti, E. Memin
2012 IEEE Transactions on Image Processing  
In this paper, a stochastic formulation of the brightness consistency used in many computer vision problems involving dynamic scenes (motion estimation or point tracking for instance) is proposed.  ...  However when dealing with images, the available informations only hold at discrete time and on a discrete grid.  ...  This better efficiency results in a larger time computation. However as already mentioned, such local estimator can efficiently be implemented using parallel softwares.  ... 
doi:10.1109/tip.2011.2162742 pmid:21791410 fatcat:4gcqyygyrbfw3gkf57b6wxqt5m

Pyramid segmentation algorithms revisited

R. Marfil, L. Molina-Tanco, A. Bandera, J.A. Rodríguez, F. Sandoval
2006 Pattern Recognition  
Segmentation algorithms based on regular and irregular pyramids are described, together with the data structures and decimation procedures which encode and manage the information in the pyramid.  ...  The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks.  ...  Jolion for his aid to implement the colour irregular pyramid and provides us the source code of the algorithm proposed in Ref. [13] . This source code has been easily  ... 
doi:10.1016/j.patcog.2006.02.017 fatcat:f744w7onubh6ppz43r23vz2bkm

Parameterized Animation Compression [chapter]

Ziyad S. Hakura, Jerome E. Lengyel, John M. Snyder
2000 Eurographics  
To best match the graphics hardware rendering to the input ray-traced imagery, we describe a novel method to infer parameterized texture maps for each object by modeling the hardware as a linear system  ...  We introduce adaptive dimension splitting in the Laplacian pyramid and separate diffuse and specular lighting layers to further improve compression.  ...  Peter Shirley's Eon ray tracer was a valuable research tool.  ... 
doi:10.1007/978-3-7091-6303-0_10 fatcat:6sq4u6dhsrewddbrmmzgtmfm4a
« Previous Showing results 1 — 15 out of 5,812 results