Status Report on Image Information Systems and Image Data Base Technology

1989 ◽  
Author(s):  
M. J. Fiebig
Keyword(s):  
Information Systems ◽  
Data Base ◽  
Image Data ◽  
Status Report ◽  
Image Information

Data structures and accessing in data-base systems, I: Evolution of information systems

1973 ◽  
Vol 12 (1) ◽  
pp. 30-44 ◽  
Author(s):  
M. E. Senko ◽  
E. B. Altman ◽  
M. M. Astrahan ◽  
P. L. Fehder
Keyword(s):  
Information Systems ◽  
Data Base ◽  
Data Structures

A Multi-Party Secure Encryption-Sharing Hybrid Scheme for Image Data Base on Compressed Sensing

2022 ◽  
pp. 103391
Author(s):  
Bin Wu ◽  
Dong Xie ◽  
Fulong Chen ◽  
Xueli Wang ◽  
Yangyang Zeng
Keyword(s):  
Compressed Sensing ◽  
Data Base ◽  
Image Data ◽  
Hybrid Scheme

scholarly journals Application of the Variety-Generator Approach to Searches of Personal Names in Bibliographic Data Bases--Part 2. Optimization of Key-Sets, and Evaluation of Their Retrieval Efficiency

1974 ◽  
Vol 7 (3) ◽  
pp. 201
Author(s):  
Dirk W. Fokker ◽  
Michael F. Lynch
Keyword(s):  
Information Systems ◽  
Data Base ◽  
Variable Length ◽  
Data Bases ◽  
Personal Names ◽  
Fixed Length ◽  
Bibliographic Data ◽  
Retrieval Efficiency ◽  
Types Of Information ◽  
High Degree

<p class="p1">Keys consisting of variable-length chamcter strings from the front and rear of surnames, derived by analysis of author names in a particular data base, am used to provide approximate representations of author names. When combined in appropriate ratios, and used together with keys for each of the first two initials of personal names, they provide a high degree of discrimination in search.</p> <p class="p1">Methods for optimization of key-sets are described, and the performance of key-sets varying in size between <span class="s1">150 </span>and <span class="s1">300 </span>is determined at file sizes of up to <span class="s1">50,000 </span>name entries. The effects of varying the proportions of the queries present in the file are also examined. The results obtained with fixed-length keys are compared with those for variable-length keys, showing the latter to be greatly superior.</p> <p class="p1">Implications of the work for a variety of types of information systems are discussed.</p>

Study on Nearly Lossless Compression with Progressive Decoding

2014 ◽  
Vol 926-930 ◽  
pp. 1751-1754
Author(s):  
Hong Mei Song ◽  
Hai Wei Mu ◽  
Dong Yan Zhao
Keyword(s):  
Compression Ratio ◽  
Image Data ◽  
Lossless Compression ◽  
Image Transmission ◽  
Standard Test ◽  
Compression Algorithm ◽  
Progressive Transmission ◽  
Image Information ◽  
Dct Transform ◽  
Progressive Image Transmission

A progressive transmission and decoding nearly lossless compression algorithm is proposed. The image data are grouped according to different frequencies based on DCT transform, then it uses the JPEG-LS core algorithmtexture prediction and Golomb coding on each group of data, in order to achieve progressive image transmission and decoding. Experimentation on the standard test images with this algorithm and comparing with JPEG-LS shows that the compression ratio of this algorithm is very similar to the compression ratio of JPEG-LS, and this algorithm loses a little image information but it has the ability of the progressive transmission and decoding.

Sign in / Sign up

Export Citation Format

Share Document