• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,797
Next 10 →

Fast texture synthesis using tree-structured vector quantization

by Li-yi Wei, Marc Levoy , 2000
"... Figure 1: Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given ..."
Abstract - Cited by 561 (12 self) - Add to MetaCart
example. Using our algorithm, textures can be generated within seconds, and the synthesized results are always tileable. Texture synthesis is important for many applications in computer graphics, vision, and image processing. However, it remains difficult to design an algorithm that is both efficient

Similarity of Color Images

by Markus Stricker, Markus Orengo , 1995
"... We describe two new color indexing techniques. The first one is a more robust version of the commonly used color histogram indexing. In the index we store the cumulative color histograms. The L 1 -, L 2 -, or L1 -distance between two cumulative color histograms can be used to define a similarity mea ..."
Abstract - Cited by 495 (2 self) - Add to MetaCart
measure of these two color distributions. We show that while this method produces only slightly better results than color histogram methods, it is more robust with respect to the quantization parameter of the histograms. The second technique is an example of a new approach to color indexing. Instead

Determining Optical Flow

by Berthold K. P. Horn, Brian G. Schunck - ARTIFICIAL INTELLIGENCE , 1981
"... Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent veloc ..."
Abstract - Cited by 2404 (9 self) - Add to MetaCart
Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent

What is a hidden Markov model?

by Sean R. Eddy , 2004
"... Often, problems in biological sequence analysis are just a matter of putting the right label on each residue. In gene identification, we want to label nucleotides as exons, introns, or intergenic sequence. In sequence alignment, we want to associate residues in a query sequence with ho-mologous resi ..."
Abstract - Cited by 1344 (8 self) - Add to MetaCart
splice site consenses, codon bias, exon/intron length preferences, and open reading frame analysis all in one scoring system. How should all those parameters be set? How should different kinds of information be weighted? A second issue is being able to interpret results probabilistically. Finding a best

An affine invariant interest point detector

by Krystian Mikolajczyk, Cordelia Schmid - In Proceedings of the 7th European Conference on Computer Vision , 2002
"... Abstract. This paper presents a novel approach for detecting affine invariant interest points. Our method can deal with significant affine transformations including large scale changes. Such transformations introduce significant changes in the point location as well as in the scale and the shape of ..."
Abstract - Cited by 1467 (55 self) - Add to MetaCart
of the neighbourhood of an interest point. Our approach allows to solve for these problems simultaneously. It is based on three key ideas: 1) The second moment matrix computed in a point can be used to normalize a region in an affine invariant way (skew and stretch). 2) The scale of the local structure is indicated

Common Persistence in Conditional Variances

by Tim Bollerslev, Robert F. Engle - ECONOMETRIC REVIEWS , 1993
"... Since the introduction of the autoregressive conditional heteroskedastic (ARCH) model in Engle (1982), numerous applications of this modeling strategy have already appeared. A common finding in many of these studies with high frequency financial or monetary data concerns the presence of an approxima ..."
Abstract - Cited by 347 (20 self) - Add to MetaCart
of an approximate unit root in the autoregressive polynomial in the univariate time series representation for the conditional second order moments of the process, as in the so-called integrated generalized ARCH (IGARCH) class of models proposed in Engle and Bollerslev (1986). In the IGARCH models shocks

Doing It Now or Later

by Ted O'Donoghue, Matthew Rabin , 1996
"... Though economists assume that intertemporal preferences are time-consistent, evidence suggests that a person 's relative preference for well-being at an earlier moment over a later moment increases as the earlier moment gets closer. We explore the behavioral and welfare implications of such tim ..."
Abstract - Cited by 326 (9 self) - Add to MetaCart
Though economists assume that intertemporal preferences are time-consistent, evidence suggests that a person 's relative preference for well-being at an earlier moment over a later moment increases as the earlier moment gets closer. We explore the behavioral and welfare implications

Deictic Codes for the Embodiment of Cognition

by Dana H. Ballard, Mary M. Hayhoe, Polly K. Pook, Rajesh P. N. Rao, Short Abstract - Behavioral and Brain Sciences , 1995
"... To describe phenomena that occur at different time scales, computational models of the brain must necessarily incorporate different levels of abstraction. We argue that at time scales of approximately one-third of a second, orienting movements of the body play a crucial role in cognition and form a ..."
Abstract - Cited by 321 (19 self) - Add to MetaCart
To describe phenomena that occur at different time scales, computational models of the brain must necessarily incorporate different levels of abstraction. We argue that at time scales of approximately one-third of a second, orienting movements of the body play a crucial role in cognition and form a

Growing Cell Structures - A Self-organizing Network for Unsupervised and Supervised Learning

by Bernd Fritzke - Neural Networks , 1993
"... We present a new self-organizing neural network model having two variants. The first variant performs unsupervised learning and can be used for data visualization, clustering, and vector quantization. The main advantage over existing approaches, e.g., the Kohonen feature map, is the ability of the m ..."
Abstract - Cited by 300 (11 self) - Add to MetaCart
We present a new self-organizing neural network model having two variants. The first variant performs unsupervised learning and can be used for data visualization, clustering, and vector quantization. The main advantage over existing approaches, e.g., the Kohonen feature map, is the ability

Bethe Ansatz for Quantum Strings

by Gleb Arutyunov, Sergey Frolov, Matthias Staudacher , 2004
"... We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed all-loop gauge theory asymptotic Bethe ansatz by add ..."
Abstract - Cited by 281 (16 self) - Add to MetaCart
. Secondly, we explain how to derive the 1/J energy corrections of M-impurity BMN states, provide explicit, general formulae for both distinct and confluent mode numbers, and compare to asymptotic gauge theory. In the special cases M = 2, 3 we reproduce the results of direct quantization of Callan et al
Next 10 →
Results 1 - 10 of 7,797
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University