Introduction of very high bit rates for NFC and RFID

Many desirable properties make fractals a powerful mathematic model applied in several image processing and pattern recognition tasks: image coding, segmentation, feature extraction, and indexing, just to cite some of them. Unfortunately, they are based on a strong asymmetric scheme, consequently suffering from very high coding times. On the other side, linear transforms are quite time balanced, allowing them to be usefully exploited in realtime applications, but they do not provide comparable performances with respect to the image quality for high bit rates. In this paper, we investigate different levels of embedding orthogonal linear transforms in the fractal coding scheme. Experimental results show a clear improved quality for compression ratios up to 15 : 1.

Download Full-text

Very High Resolution Analysis of the Dynamics of a Coronal Plasmoid

International Astronomical Union Colloquium ◽

10.1017/s0252921100026117 ◽

1994 ◽

Vol 144 ◽

pp. 593-596

Author(s):

O. Bouchard ◽

S. Koutchmy ◽

L. November ◽

J.-C. Vial ◽

J. B. Zirker

Keyword(s):

High Resolution ◽

Solar Eclipse ◽

Total Solar Eclipse ◽

Field Of View ◽

Small Field ◽

High Resolution Analysis ◽

Ccd Observations ◽

Resolution Analysis ◽

Very High ◽

Small Field Of View

AbstractWe present the results of the analysis of a movie taken over a small field of view in the intermediate corona at a spatial resolution of 0.5“, a temporal resolution of 1 s and a spectral passband of 7 nm. These CCD observations were made at the prime focus of the 3.6 m aperture CFHT telescope during the 1991 total solar eclipse.

Download Full-text

Monte Carlo Algorithms for Moments of Transition Arrays

International Astronomical Union Colloquium ◽

10.1017/s0252921100107468 ◽

1988 ◽

Vol 102 ◽

pp. 79-81

Author(s):

A. Goldberg ◽

S.D. Bloom

Keyword(s):

Monte Carlo ◽

State Vector ◽

Basis Vector ◽

Collective State ◽

Dispersion Characteristics ◽

Dipole Strength ◽

The Third ◽

Monte Carlo Algorithms ◽

Third Moment ◽

Very High

AbstractClosed expressions for the first, second, and (in some cases) the third moment of atomic transition arrays now exist. Recently a method has been developed for getting to very high moments (up to the 12th and beyond) in cases where a “collective” state-vector (i.e. a state-vector containing the entire electric dipole strength) can be created from each eigenstate in the parent configuration. Both of these approaches give exact results. Herein we describe astatistical(or Monte Carlo) approach which requires onlyonerepresentative state-vector |RV> for the entire parent manifold to get estimates of transition moments of high order. The representation is achieved through the random amplitudes associated with each basis vector making up |RV>. This also gives rise to the dispersion characterizing the method, which has been applied to a system (in the M shell) with≈250,000 lines where we have calculated up to the 5th moment. It turns out that the dispersion in the moments decreases with the size of the manifold, making its application to very big systems statistically advantageous. A discussion of the method and these dispersion characteristics will be presented.

Download Full-text