Results 1 
7 of
7
Information Theory and Statistics
, 1968
"... Entropy and relative entropy are proposed as features extracted from symbol sequences. Firstly, a proper Iterated Function System is driven by the sequence, producing a fractaMike representation (CSR) with a low computational cost. Then, two entropic measures are applied to the CSR histogram of th ..."
Abstract

Cited by 1488 (0 self)
 Add to MetaCart
Entropy and relative entropy are proposed as features extracted from symbol sequences. Firstly, a proper Iterated Function System is driven by the sequence, producing a fractaMike representation (CSR) with a low computational cost. Then, two entropic measures are applied to the CSR histogram of the CSR and theoretically justified. Examples are included.
Condensing Computable Scenes Using Visual Complexity And Film Syntax Analysis
 PROCEEDINGS OF ICME 2001
, 2001
"... In this paper, we present a novel algorithm to condense computable scenes. A computable scene is a chunk of data that exhibits consistencies with respect to chromaticity, lighting and sound. We attempt to condense such scenes in two ways. First, we define visual complexity of a shot to be its Kolmog ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
In this paper, we present a novel algorithm to condense computable scenes. A computable scene is a chunk of data that exhibits consistencies with respect to chromaticity, lighting and sound. We attempt to condense such scenes in two ways. First, we define visual complexity of a shot to be its Kolmogorov complexity. Then, we conduct experiments that help us map the complexity of a shot into the minimum time required for its comprehension. Second, we analyze the grammar of the film language, since it makes the shot sequence meaningful. These grammatical rules are used to condense scenes, in parallel to the shot level condensation. We've implemented a system that generates a skim given a time budget. Our user studies show good results on skims with compression rates between 6080%.
Learning simple relations: Theory and applications
 In Second SIAM Data Mining Conference
, 2002
"... Abstract – In addition to classic clustering algorithms, many different approaches to clustering are emerging for objects of special nature. In this article we deal with the grouping of rows and columns of a matrix with nonnegative entries. Two rows (or columns) are considered similar if correspond ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
(Show Context)
Abstract – In addition to classic clustering algorithms, many different approaches to clustering are emerging for objects of special nature. In this article we deal with the grouping of rows and columns of a matrix with nonnegative entries. Two rows (or columns) are considered similar if corresponding crossdistributions are close. This grouping is a dual clustering of two sets of elements, row and column indices. The introduced approach is based on the minimization of reduction of mutual information contained in a matrix that represents the relationship between two sets of elements. Our clustering approach contains many parallels with KMeans clustering due to certain common algebraic properties. The obtained results have many applications, including grouping of Web visit data.
Digital Watermarking Facing Attacks by Amplitude Scaling and Additive White Noise
, 2002
"... Digital watermarking is a technology which potentially can be used to enforce the copyrights and integrity of digital multimedia data. In this paper, a communications perspective on digital watermarking is used to compute upper performance limits on blind digital watermarking for simple AWGN attacks ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Digital watermarking is a technology which potentially can be used to enforce the copyrights and integrity of digital multimedia data. In this paper, a communications perspective on digital watermarking is used to compute upper performance limits on blind digital watermarking for simple AWGN attacks and attacks by amplitude scaling and additive white noise. We show that the latter case can be translated into effective AWGN attacks, which enables a straight forward capacity analysis based on the previously obtained watermark capacities for AWGN attacks. We analyze the watermark capacity for different theoretical and practical blind watermarking schemes. This analysis shows that the practical STSCS watermarking achieves at least 40 % of the capacity of an ideal blind watermarking scheme.
MultiModal Medical Image Registration: From Information Theory To Optimization Objective
 Proceedings of DSP 2002
, 2002
"... A relatively large class of information theoretical measures, including e.g. mutual information or normalized entropy, has been used in mukimodal medical image registration. Even though the mathematical foundations of the different measures were very similar, the final expressions turned out to be ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
A relatively large class of information theoretical measures, including e.g. mutual information or normalized entropy, has been used in mukimodal medical image registration. Even though the mathematical foundations of the different measures were very similar, the final expressions turned out to be surprisingly different. Thereibre one of the nain aims of this paper is to enlight the relationship of different objective functions by introducing a mathematical framework from which several known optimization objectives can be deduced.
Acodemy of Sciences of the Czech Republic
"... s ynchronizatiOn on various levels of organization of brain tissue, from pairs of individual neurons to much larger scales (within one area of the brain or between different parts of the brain) is one of the most important topics in neurophysiology. Some level of synchrony is usually necessary in or ..."
Abstract
 Add to MetaCart
(Show Context)
s ynchronizatiOn on various levels of organization of brain tissue, from pairs of individual neurons to much larger scales (within one area of the brain or between different parts of the brain) is one of the most important topics in neurophysiology. Some level of synchrony is usually necessary in order to attain normal neural activity, while too much synchrony may be a pathological phenomenon such as epilepsy. Detection of synchrony, or transient changes leading to a high level of synchronization, and identification of causal relations between driving (synchronizing) and response (synchronized) components is a great challenge, since it can help in anticipating epileptic seizures and in localization of epileptogenic foci. Standard linear statistical methods have brought only a little success in this area. Recently, there has been considerable interest in the study of cooperative behavior of coupled chaotic systems [1]. Methods developed in the field of nonlinear dynamics and chaos have been successfully applied in studies of cardiorespiratory synchronization [2, 3] and synchronization of neural signals [47]. The problem of quantitative description of synchronization phenoma, however, is still far from being solved, and some claims of successful detection of causal relationships are based on contradictory assumptions [4, 5]. Also, measures of synchronization, based on infmitezimal properties and performing well on artificial systems, can fail when applied to noisy experimental data. In this article we introduce nonlinear, statistical, coarsegrained measures based on information theorv that could orovide an indication of synchronization as well as of causal relationships if present in scrutinized SySteffiS. The introduced approach is applied in case studies of EEG recordings of epileptic patients. Two levels of synchronization leading to seizures are detected and "directions of information flow " (driveresponse relationships) are identified. CoarseGrained Information Rates Consider discrete random variables X and Y with sets of values 3 and Y, respectively, and probability distribution functions (PDFs) p(x), p(y) and joint PDF p(x,y). The entropy H(X) of a single variable, say X, is defmed as
ThC4.pdf On the Channel Capacity of Multilevel Modulation Schemes with Coherent Detection
, 2009
"... Abstract: We describe a method to determine the channel capacity of an arbitrary multilevel modulation scheme by modeling the fiberoptic channel as a dynamical nonlinear intersymbol interference (lSI) channel with memory. We also propose a multilevel lowdensity paritycheck (LDPC)coded turboequa ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: We describe a method to determine the channel capacity of an arbitrary multilevel modulation scheme by modeling the fiberoptic channel as a dynamical nonlinear intersymbol interference (lSI) channel with memory. We also propose a multilevel lowdensity paritycheck (LDPC)coded turboequalization scheme that is able closely to approach the channel capacity. ©2009 Optical Society ofAmerica OCIS codes: 060.0060 Fiber optics and optical communications; (190.4370) Nonlinear optics, fibers; (060.1660) Coherent communications; (999.9999) BahlCockeJelinekRaviv (BCJR) algorithm; (999.9999) Channel capacity 1.