Share Email Print

Proceedings Paper

Fused Fibonacci-like (p,q) sequences with compression and barcoding applications
Author(s): Sarkis Agaian; Jose Garcia; Salahodeen Abdul-Kafi; John T. Gill III
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A double-base number system (DBNS) has recently been introduced and investigated [1] [2] [3]. This system has been shown to have some interesting and potentially far-reaching applications in digital filtering, encryption, digital electronics, and image enhancement. In this paper we present a new concept of generating parametric number representations by fusing systems such as DBNS using multiplication and addition operations. We introduce Fibonacci like (p,q)-sequences and determine their efficiency in representing data. We develop an algorithm to test the sparsity of fused number representation systems and explore the dual relationship between sparsity and memory. We also consider the applications of these representations in data compression and barcoding. Simulation results are presented to demonstrate the performance of the new class of systems. A comparison with commonly used doublebase number systems is also presented.

Paper Details

Date Published: 15 February 2012
PDF: 12 pages
Proc. SPIE 8304, Multimedia on Mobile Devices 2012; and Multimedia Content Access: Algorithms and Systems VI, 83040E (15 February 2012); doi: 10.1117/12.905353
Show Author Affiliations
Sarkis Agaian, Stanford Univ. (United States)
Jose Garcia, Stanford Univ. (United States)
Salahodeen Abdul-Kafi, Stanford Univ. (United States)
John T. Gill III, Stanford Univ. (United States)

Published in SPIE Proceedings Vol. 8304:
Multimedia on Mobile Devices 2012; and Multimedia Content Access: Algorithms and Systems VI
Cees G. M. Snoek; Reiner Creutzburg; Nicu Sebe; David Akopian; Lyndon Kennedy, Editor(s)

© SPIE. Terms of Use
Back to Top