Skip to main content
SpringerLink
Log in

Theoretical Issues of Cluster Pattern Interfaces

  • Conference paper
Combinatorial Image Analysis (IWCIA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5852))

Included in the following conference series:

Abstract

Since the 80s, when the computer mouse was first invented, point-and-click functionality became widely adopted, in particular, for work with images and GUIs. It would be useful to provide such functionality for printed materials, as well. A direct point-and-click functionality should not require tablet-like devices, but should rather use an embedded marking which defines a coordinate system within the image. An original approach and related technology for direct interface, known as Cluster Pattern Interface (CLUSPI), was proposed [12]. It is based on an unobtrusive layer of the image defining a coordinate system, a camera-based pointing device, and decoding software. CLUSPI technology was invented and patented by one of the authors of this paper. Here we present the theoretical (mathematical) foundations of the methods developed. We also describe some theoretical challenges and propose solutions to them.

The work was partly supported by the Cooperative Research Project of the Research Institute of Electronics, RIE, Shizuoka University, Japan.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barneva, R.P., Brimkov, V.E., Kanev, K.: Combining Ubiquitous Direction-Sensitive Digitizing with a Multimedia Electronic Dictionary for Enhanced Understanding. Int. J. on Imaging Systems and Technology 19, 39–49 (2009)

    Article  Google Scholar 

  2. Barneva, R.P., Brimkov, V.E., Kanev, K.: Electronic Multimedia Dictionary with Direct-Access Printed Interface. In: Barneva, R.P., Brimkov, V.E. (eds.) Image Analysis: From Theory to Applications, pp. 39–46. RPS, Singapore (2008)

    Google Scholar 

  3. Brent, R.P.: Evaluation of General Arithmetic Expressions. J. ACM 21, 201–206 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  4. Breslauer, D., Galil, Z.: An Optimal O(loglogn) Time Parallel String Matching Algorithm. SIAM J. Comput. 19, 1051–1058 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cole, R., et al.: Optimally Fast Parallel Algorithms for Preprocessing and Pattern Matching in One and Two Dimensions. In: 34th IEEE Symp. Found. Computer Science, Palo Alto, CA, pp. 248–258 (1993)

    Google Scholar 

  6. Fich, F.: The Complexity of Computation on the Parallel Random Access Machine. In: Reif, J. (ed.) Synthesis of Parallel Algorithms, ch. 21. Morgan-Kaufmann, San Francisco (1993)

    Google Scholar 

  7. Fich, F., Ragde, P., Wigderson, A.: Relations Between CR-models of Parallel Computations. SIAM J. Comput. 17(3), 606–627 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. Goldschlager, L.: A Unified Approach to Models of Synchronous Parallel Machines. J. ACM 29, 1073–1086 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  9. Golomb, S.W.: Shift Register Sequences. Holden-Day, Inc., San Francisco (1967)

    MATH  Google Scholar 

  10. Hagerup, T.: On a Compaction Theorem of Ragde. Inf. Proc. Lett. 43, 335–340 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kanev, K.: Tangible Interfaces for Interactive Multimedia Presentations. Int. Journal of Mobile Information Systems 4(3), 183–193 (2008)

    Google Scholar 

  12. Kanev, K., Kimura, S.: Digital Information Carrier. Patent Registration No 3635374, Japan Patent Office (2005)

    Google Scholar 

  13. Kanev, K., Kimura, S., Orr, T.: A Framework for Collaborative Learning in Dynamic Group Environments. Int. Journal of Distance Education Technologies 7(1), 58–77 (2009)

    Google Scholar 

  14. Kanev, K., Mirenkov, N., Hasegawa, A.: Newsputers: Digitally Enhanced Printouts Supporting Pervasive Multimodal Interactions. In: Proc. First IEEE International Conference on Ubi-media Computing (U-Media 2008), Lanzhou, China, pp. 1–7 (2008)

    Google Scholar 

  15. Kanev, K., Mirenkov, N., Urata, A.: Position Sensing for Parking Simulation and Guidance. The Journal of Three Dimensional Images 21(1), 66–69 (2007)

    Google Scholar 

  16. Kucera, L.: Parallel Computation and Conflicts in Memory Access. Inf. Proc. Lett. 14(2), 93–96 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  17. Nishimura, Y., Kanev, K., Sasamoto, A., Suzuki, T., Inokawa, H.: Toward a Portable Electromagnetic Testing Scanner with Advanced Image Reconstruction Capabilities. In: Proc. Eleventh Int. Conf. on Humans and Computers HC 2008, Nagaoka, Japan, pp. 83–89 (2008)

    Google Scholar 

  18. QR-code Standartization, http://www.denso-wave.com/qrcode/qrstandard-e.html (accessed April 17, 2009)

  19. Ragde, P.: The Parallel Simplicity of Compaction and Chaining. J. Algorithms 14, 371–380 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  20. Vishkin, U.: Deterministic Sampling – a New Technique for Fast Pattern Matching. SIAM J. Comput. 20, 22–40 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  21. Vishkin, U.: Implementation of Simultaneous Memory Access in Models that Forbid it. J. Algorithms 4, 45–50 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  22. Vishkin, U.: Optimal Parallel Pattern Matching in Strings. Inform. and Control 67, 91–113 (1985)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, SUNY Fredonia, NY, 14063, USA

    Reneta P. Barneva

  2. Mathematics Department, SUNY Buffalo State College, Buffalo,NY, 14222, USA

    Valentin E. Brimkov

  3. Research Institute of Electronics, Shizuoka University, Hamamatsu, 432-8011, Japan

    Kamen K. Kanev

Authors
  1. Reneta P. Barneva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Valentin E. Brimkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kamen K. Kanev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Automatic Control, Centro de Investigación y de Estudios Avanzados (CINVESTAV- IPN), Av. I.P.N. 2508, Col. San Pedro Zacatenco, 07000 D.F., Mexico

    Petra Wiederhold

  2. Department of Computer Science, State University of New York at Fredonia, NY 14063, Fredonia,, USA

    Reneta P. Barneva

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barneva, R.P., Brimkov, V.E., Kanev, K.K. (2009). Theoretical Issues of Cluster Pattern Interfaces. In: Wiederhold, P., Barneva, R.P. (eds) Combinatorial Image Analysis. IWCIA 2009. Lecture Notes in Computer Science, vol 5852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10210-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10210-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10208-0

  • Online ISBN: 978-3-642-10210-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation