Skip to main content
SpringerLink
Log in

Research of Encodation Schemes Selecting Optimization for Character 2D Barcode

  • Conference paper
  • First Online:
Proceedings of the 2nd International Conference on Green Communications and Networks 2012 (GCN 2012): Volume 1

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 223))

Abstract

Character 2D barcode is a new type of 2D barcode which is designed based on the theory of traditional 2D barcode. Unlike the traditional 2D barcode image, character 2D barcode represents information encoded with a limited character matrix. In character 2D barcode, there are several encodation schemes like in the traditional 2D barcode. But in the encoding process, these encodation schemes can be selected through different strategy in order to get better compression ratio. In this paper, encodation scheme selecting optimization based on dynamic programming algorithm is proposed. An iterative process model is built up and the decision-making model is given. Then the iterative flow and algorithm steps are provided. Finally, a case of encoded information is analyzed. The experiments show that the algorithm in this paper is overall better than the traditional method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. International Organization for Standardization ISO/IEC 16022–2000 (2004) Information technology international symbology specification—data matrix. Switz Joint Tech Comm ISO/IEC JTC 1:67–87

    Google Scholar 

  2. Liu YA, Stoller SD (2003) Dynamic programming via static incrementalization. High Order Symb Comput 1:37–62

    Article  Google Scholar 

  3. Kossmann D, Stocker K (2000) Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans Database Syst 1:43–82

    Article  Google Scholar 

  4. Abo-Sinna MA (2004) Multiple objective fuzzy dynamic programming problems a surbey and some applications. Appl Math Comput 1:861–888

    Article  MathSciNet  Google Scholar 

  5. Zhang P (2011) New algorithm for multidimensional continuing dynamic programming. Control Decis 1:1219–1223

    Google Scholar 

  6. van Rooij JMM, Bodlaender HL, Rossmanith P (2009) Dynamic programming on tree decompositions using generalised fast subset convolution. Lect Notes Comput Sci 1:566–577

    Article  Google Scholar 

  7. Dorn F (2006) Dynamic programming and fast matrix multiplication. In: Azar Y Erlebach T (eds) ESA 2006 LNCS, vol 4168. Springer, Heidelberg, pp 280–291

    Google Scholar 

  8. Dorn F, Fomin FV, Thilikos DM (2008) Catalan structures and dynamic programming in h-minor-free graphs. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms SODA 2008, vol 1, pp 631–640

    Google Scholar 

  9. Bodlaender HL, Koster AMCA (2008) Combinatorial optimization on graphs of bounded treewidth. Comput J 51(3):255–269

    Article  MathSciNet  Google Scholar 

  10. Zhang P (2012) New algorithm for the continuing dynamic programming. Oper Res Trans 16(1):97–105

    MATH  Google Scholar 

Download references

Acknowledgments

This work is supported by the science and technology department of Zhejiang Province (Project No. 2010C31088) and the science and technology innovation foundation for students of Zhejiang Province (Project No. 2011R403015).

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Zhejiang University of Technology, 288, Liuhe Road, Hangzhou, China

    Fan Jiang & Zhi Liu

  2. College of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou, China

    Xiaofei Feng

Authors
  1. Fan Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhi Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofei Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fan Jiang .

Editor information

Editors and Affiliations

  1. , Department of Electronic Engineering, Shanghai Jiao Tong University, Dongchuan Road 800, Shanghai, 200240, China, People's Republic

    Yuhang Yang

  2. , Electrical & Electronic Engineering, Nanyang Technological University, Nanyang Avenue, Singapore, 639798, Singapore

    Maode Ma

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, F., Liu, Z., Feng, X. (2013). Research of Encodation Schemes Selecting Optimization for Character 2D Barcode. In: Yang, Y., Ma, M. (eds) Proceedings of the 2nd International Conference on Green Communications and Networks 2012 (GCN 2012): Volume 1. Lecture Notes in Electrical Engineering, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35419-9_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35419-9_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35418-2

  • Online ISBN: 978-3-642-35419-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation