Results 1  10
of
16,740
On FirstOrder Definable Colorings
"... We address the problem of characterizing Hcoloring problems that are firstorder definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of structure. ..."
Abstract
 Add to MetaCart
We address the problem of characterizing Hcoloring problems that are firstorder definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of structure.
Similarity of Color Images
, 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
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
The Semantics of Predicate Logic as a Programming Language
 JOURNAL OF THE ACM
, 1976
"... Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract

Cited by 808 (18 self)
 Add to MetaCart
Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational
Description Logic Programs: Combining Logic Programs with Description Logic
, 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract

Cited by 529 (46 self)
 Add to MetaCart
) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of firstorder logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDFSchema fragment of Description Logic.
Relations between the statistics of natural images and the response properties of cortical cells
 J. Opt. Soc. Am. A
, 1987
"... The relative efficiency of any particular imagecoding scheme should be defined only in relation to the class of images that the code is likely to encounter. To understand the representation of images by the mammalian visual system, it might therefore be useful to consider the statistics of images f ..."
Abstract

Cited by 831 (18 self)
 Add to MetaCart
cells are well suited for coding the information in such images if the goal of the code is to convert higherorder redundancy (e.g., correlation between the intensities of neighboring pixels) into firstorder redundancy (i.e., the response distribution of the coefficients). Such coding produces a
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1194 (81 self)
 Add to MetaCart
Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder
Image Indexing Using Color Correlograms
, 1997
"... We define a new image feature called the color correlogram and use it for image indexing and comparison. This feature distills the spatial correlation of colors, and is both effective and inexpensive for contentbased image retrieval. The correlogramrobustly tolerates large changesin appearance and ..."
Abstract

Cited by 442 (4 self)
 Add to MetaCart
We define a new image feature called the color correlogram and use it for image indexing and comparison. This feature distills the spatial correlation of colors, and is both effective and inexpensive for contentbased image retrieval. The correlogramrobustly tolerates large changesin appearance
Progressive Meshes
"... Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance, transmission bandwidth, and storage capacities. This paper introduces the progressive mesh (PM) representation, a new s ..."
Abstract

Cited by 1315 (11 self)
 Add to MetaCart
. In addition, we present a new mesh simplification procedure for constructing a PM representation from an arbitrary mesh. The goal of this optimization procedure is to preserve not just the geometry of the original mesh, but more importantly its overall appearance as defined by its discrete and scalar
A review of image denoising algorithms, with a new one
 SIMUL
, 2005
"... The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication of the recently proposed methods, most algorithms have not yet attained a desirable level of applicability. All show an outstanding perf ..."
Abstract

Cited by 508 (6 self)
 Add to MetaCart
performance when the image model corresponds to the algorithm assumptions but fail in general and create artifacts or remove image fine structures. The main focus of this paper is, first, to define a general mathematical and experimental methodology to compare and classify classical image denoising algorithms
Cumulated Gainbased Evaluation of IR Techniques
 ACM Transactions on Information Systems
, 2002
"... Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction, i ..."
Abstract

Cited by 694 (3 self)
 Add to MetaCart
Modem large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation to the users. In order to develop IR techniques to this direction
Results 1  10
of
16,740