• 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 2,056
Next 10 →

Directional Entropy Feature for Human Detection

by Long Meng, Liang Li, Shuqi Mei, Weiguo Wu
"... In this paper we propose a novel feature, called directional entropy feature (DEF), to improve the performance of human detection under complicated background in images. DEF describe the regularity of region by computing the entropy value of edge points’ spatial distribution in specific direction, s ..."
Abstract - Add to MetaCart
In this paper we propose a novel feature, called directional entropy feature (DEF), to improve the performance of human detection under complicated background in images. DEF describe the regularity of region by computing the entropy value of edge points’ spatial distribution in specific direction

Discriminative Training and Maximum Entropy Models for Statistical Machine Translation

by Franz Josef Och, Hermann Ney , 2002
"... We present a framework for statistical machine translation of natural languages based on direct maximum entropy models, which contains the widely used source -channel approach as a special case. All knowledge sources are treated as feature functions, which depend on the source language senten ..."
Abstract - Cited by 508 (30 self) - Add to MetaCart
We present a framework for statistical machine translation of natural languages based on direct maximum entropy models, which contains the widely used source -channel approach as a special case. All knowledge sources are treated as feature functions, which depend on the source language

ON DIRECTIONAL ENTROPY OF A Z 2-ACTION

by Hasan Akin , 2005
"... Abstract. Consider the cellular automata (CA) of Z2-action Φ on the space of all doubly infinite sequences with values in a finite set Zr, r ≥ 2 determined by cellular automata TF[−k,k] with an additive automaton rule F(xn−k,...,xn+k) = k∑ aixn+i(modr). It is investigated the concept of i=−k the mea ..."
Abstract - Add to MetaCart
=−k the measure theoretic directional entropy per unit of length in the direction ω0. It is shown that hµ(T u F[−k,k] ) = uhµ(TF[−k,k]), hµ(Φu) = uhµ(Φ) and h⃗v(Φ u) = uh⃗v(Φ) for ⃗v ∈ Z2 where h is the measure-theoretic entropy. 1.

Fast and robust fixed-point algorithms for independent component analysis

by Aapo Hyvärinen - IEEE TRANS. NEURAL NETW , 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract - Cited by 884 (34 self) - Add to MetaCart
information-theoretic approach and the projection pursuit approach. Using maximum entropy approximations of differential entropy, we introduce a family of new contrast (objective) functions for ICA. These contrast functions enable both the estimation of the whole decomposition by minimizing mutual information

Conditional random fields: Probabilistic models for segmenting and labeling sequence data

by John Lafferty , 2001
"... We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hidden Markov models and stochastic grammars for such tasks, including the ability to relax strong independence assumptions ..."
Abstract - Cited by 3485 (85 self) - Add to MetaCart
made in those models. Conditional random fields also avoid a fundamental limitation of maximum entropy Markov models (MEMMs) and other discriminative Markov models based on directed graphical models, which can be biased towards states with few successor states. We present iterative parameter estimation

A Fast Marching Level Set Method for Monotonically Advancing Fronts

by J. A. Sethian - PROC. NAT. ACAD. SCI , 1995
"... We present a fast marching level set method for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation. Level set methods are numerical techniques for computing the position of propagating fronts. They rely on an initial value partial differential eq ..."
Abstract - Cited by 630 (24 self) - Add to MetaCart
equation for a propagating level set function, and use techniques borrowed from hyperbolic conservation laws. Topological changes, corner and cusp development, and accurate determination of geometric properties such as curvature and normal direction are naturally obtained in this setting. In this paper, we

Independent components analysis by direct entropy minimization

by Erik G. Miller, John W. Fisher III , 2003
"... This paper presents a new algorithm for the independent components analysis (ICA) problem based on efficient entropy estimates. Like many previous methods, this algorithm directly minimizes the measure of departure from independence according to the estimated Kullback-Leibler divergence between the ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
This paper presents a new algorithm for the independent components analysis (ICA) problem based on efficient entropy estimates. Like many previous methods, this algorithm directly minimizes the measure of departure from independence according to the estimated Kullback-Leibler divergence between

RANK ONE Z d ACTIONS AND DIRECTIONAL ENTROPY

by E. Arthur Robinson, Ays¸e A. S¸ah In , 809
"... Rank one transformations play a central role in the theory of ergodic measure preserving transformations. Having first been identified as a distinct class by Chacon in [3], their properties have been studied extensively (see for example [1], [7], [11], [6]). Rank one transformations have also served ..."
Abstract - Add to MetaCart
Rank one transformations play a central role in the theory of ergodic measure preserving transformations. Having first been identified as a distinct class by Chacon in [3], their properties have been studied extensively (see for example [1], [7], [11], [6]). Rank one transformations have also served

4 COMPLEXITY AND DIRECTIONAL ENTROPY IN TWO DIMENSIONS

by Ryan Broderick, Van Cyr, Bryna Kra
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Enhanced Spatial Error Concealment with Directional Entropy based Interpolation Switching

by Dimitris Agrafiotis, David R. Bull, Nishan Canagarajah
"... Abstract — This paper describes a spatial error concealment method that uses edge related information for concealing missing macroblocks in a way that not only preserves existing edges but also avoids introducing new strong ones. The method relies on a novel switching algorithm which uses the direct ..."
Abstract - Add to MetaCart
the directional entropy of neighboring edges for choosing between two interpolation methods, a directional along detected edges or a bilinear using the nearest neighboring pixels. Results show that the performance of the proposed method is subjectively and objectively (PSNR wise) better compared to both ‘single
Next 10 →
Results 1 - 10 of 2,056
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