• čeština
    • English
    • русский
  • English 
    • čeština
    • English
    • русский
  • Login
View Item 
  •   Repository Home
  • Časopisy
  • Mathematics for Applications
  • 2016/2
  • View Item
  •   Repository Home
  • Časopisy
  • Mathematics for Applications
  • 2016/2
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On Farey table and its compression for space optimization with guaranteed error bounds

Thumbnail
View/Open
ma_5_2_paria_et_al_final.pdf (2.337Mb)
Date
2016
Author
Paria, B.
Pratihar, S.
Bhowmick, P.
Altmetrics
10.13164/ma.2016.09
Metadata
Show full item record
Abstract
Farey sequences, introduced by such renowned mathematicians as John Farey, Charles Haros, and Augustin-L. Cauchy over 200 years ago, are quite well- known by today in theory of fractions, but its computational perspectives are pos- sibly not yet explored up to its merit. In this paper, we present some novel theoret- ical results and e cient algorithms for representation of a Farey sequence through a Farey table. The ranks of the fractions in a Farey sequence are stored in the Farey table to provide an e cient solution to the rank problem, thereby aiding in and speeding up any application frequently requiring fraction ranks for computational speed-up. As the size of the Farey sequence grows quadratically with its order, the Farey table becomes inadvertently large, which calls for its (lossy) compression up to a permissible error. We have, therefore, proposed two compression schemes to obtain a compressed Farey table (CFT). The necessary analysis has been done in detail to derive the error bound in a CFT. As the nal step towards space opti- mization, we have also shown how a CFT can be stored in a 1-dimensional array. Experimental results have been furnished to demonstrate the characteristics and e ciency of a Farey table and its compressed form.
Keywords
Farey sequence, Farey table, fraction rank, fraction error, rank problem, digital ge- ometry, digital image processing
Persistent identifier
http://hdl.handle.net/11012/63785
Document type
Peer reviewed
Document version
Final PDF
Source
Mathematics for Applications. 2016 vol. 5, č. 2, s. 123-145. ISSN 1805-3629
http://ma.fme.vutbr.cz/archiv/5_2/ma_5_2_paria_et_al_final.pdf
DOI
10.13164/ma.2016.09
Collections
  • 2016/2 [6]
Citace PRO

Portal of libraries | Central library on Facebook
DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback | Theme by @mire NV
 

 

Browse

All of repositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics

Portal of libraries | Central library on Facebook
DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback | Theme by @mire NV