• 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 11,375
Next 10 →

An Introduction to the Kalman Filter

by Greg Welch, Gary Bishop - UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL , 1995
"... In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area o ..."
Abstract - Cited by 1146 (13 self) - Add to MetaCart
estimations of past, present, and even future states, and it can do so even when the precise nature of the modeled system is unknown. The purpose of this paper is to provide a practical introduction to the discrete Kalman filter. This introduction includes a description and some discussion of the basic

Learning to detect natural image boundaries using local brightness, color, and texture cues

by David R. Martin, Charless C. Fowlkes, Jitendra Malik - PAMI , 2004
"... The goal of this work is to accurately detect and localize boundaries in natural scenes using local image measurements. We formulate features that respond to characteristic changes in brightness, color, and texture associated with natural boundaries. In order to combine the information from these fe ..."
Abstract - Cited by 625 (18 self) - Add to MetaCart
The goal of this work is to accurately detect and localize boundaries in natural scenes using local image measurements. We formulate features that respond to characteristic changes in brightness, color, and texture associated with natural boundaries. In order to combine the information from

Verbal behavior

by B. F Skinner , 1957
"... Evolutionary theory has always been plagued by scantiness of evidence. We see the products of evolution but not much of the process. Most of the story happened long ago, and little remains of the early stages. Especially few traces of behavior remain; only recently were there artefacts that could en ..."
Abstract - Cited by 841 (5 self) - Add to MetaCart
endure. Verbal behavior left no artifacts until the appearence of writing, and that was a very late stage. We shall probably never know precisely what happened, but we ougth to be able to say what might have happended – that is what kind of variations and what kind of contingencies of selection could

Unsupervised Learning by Probabilistic Latent Semantic Analysis

by Thomas Hofmann - Machine Learning , 2001
"... Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of co-occurren ..."
Abstract - Cited by 618 (4 self) - Add to MetaCart
-occurrence tables, the proposed technique uses a generative latent class model to perform a probabilistic mixture decomposition. This results in a more principled approach with a solid foundation in statistical inference. More precisely, we propose to make use of a temperature controlled version of the Expectation

A computational approach to edge detection

by John Canny - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract - Cited by 4675 (0 self) - Add to MetaCart
This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal

The Contourlet Transform: An Efficient Directional Multiresolution Image Representation

by Minh N. Do, Martin Vetterli - IEEE TRANSACTIONS ON IMAGE PROCESSING
"... The limitations of commonly used separable extensions of one-dimensional transforms, such as the Fourier and wavelet transforms, in capturing the geometry of image edges are well known. In this paper, we pursue a “true” two-dimensional transform that can capture the intrinsic geometrical structure t ..."
Abstract - Cited by 513 (20 self) - Add to MetaCart
that is key in visual information. The main challenge in exploring geometry in images comes from the discrete nature of the data. Thus, unlike other approaches, such as curvelets, that first develop a transform in the continuous domain and then discretize for sampled data, our approach starts with a discrete

Monopolistic competition and optimum product diversity. The American Economic Review,

by Avinash K Dixit , Joseph E Stiglitz , Harold Hotelling , Nicholas Stern , Kelvin Lancaster , Stiglitz , 1977
"... The basic issue concerning production in welfare economics is whether a market solution will yield the socially optimum kinds and quantities of commodities. It is well known that problems can arise for three broad reasons: distributive justice; external effects; and scale economies. This paper is c ..."
Abstract - Cited by 1911 (5 self) - Add to MetaCart
violate the marginal condition.2 Thus we expect a market solution to be suboptimal. However, a much more precise structure must be put on the problem if we are to understand the nature of the bias involved. It is useful to think of the question as one of quantity versus diversity. With scale economies

The Foundation of a Generic Theorem Prover

by Lawrence C. Paulson - Journal of Automated Reasoning , 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or `logical framework') in which the object-logics are formalized. Isabell ..."
Abstract - Cited by 471 (48 self) - Add to MetaCart
. Isabelle is now based on higher-order logic --- a precise and well-understood foundation. Examples illustrate use of this meta-logic to formalize logics and proofs. Axioms for first-order logic are shown sound and complete. Backwards proof is formalized by meta-reasoning about object-level entailment

The DLV System for Knowledge Representation and Reasoning

by Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello - ACM Transactions on Computational Logic , 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract - Cited by 456 (102 self) - Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely

Automatic Image Annotation and Retrieval using Cross-Media Relevance Models

by J. Jeon, V. Lavrenko, R. Manmatha , 2003
"... Libraries have traditionally used manual image annotation for indexing and then later retrieving their image collections. However, manual image annotation is an expensive and labor intensive procedure and hence there has been great interest in coming up with automatic ways to retrieve images based o ..."
Abstract - Cited by 431 (14 self) - Add to MetaCart
with annotations, we show that probabilistic models allow us to predict the probability of generating a word given the blobs in an image. This may be used to automatically annotate and retrieve images given a word as a query. We show that relevance models. allow us to derive these probabilities in a natural way
Next 10 →
Results 1 - 10 of 11,375
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