Abstract
As a practical method,digital-discrete data reconstruction uses both discrete and continuous methods for data interpolation and approximation. Today,a significant development in discrete mathematics is digital technology. Digital methods contain a flavor of graphical presentation and artificial intelligence. It is very interesting to explore the relationship between digital methods and graphical and intelligence methods. In this chapter,we introduce the subdivision method and the moving least squares method. These two methods are popular smooth data fitting methods in computer graphics. The subdivision method is an intuitive method for smooth shape design; the moving least squares method is a mesh-free method for data fitting. Our purpose is to provide a potential link from main stream techniques to digital functions. We also present the extension of digital functions to more general cases in artificial intelligence,especially in partial information searches and image segmentation. This expansion uses lambda-connectedness,which shares the same mathematical foundation as gradually varied functions. We include the algorithms for segmentations and fitting for image objects. This chapter also contains future research topics of the digital-discrete method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Belytschko T,Krongauz Y,Organ D,Fleming M,Krysl P (1996) Meshless methods: an overview and recent developments. Comput Methods Appl Mech Eng 139(1–4):3–47
Brumfiel G (2011) Down the petabyte highway,Nature 469:282–283
Catmull E,Clark J (1978) Recursively generated B-spline surfaces on arbitrary topological meshes. Comput Aided Des 10(6):350–355
Chaikin G (1974) An algorithm for high speed curve generation. Comput Graph Image Process 3:346–349
Chen L (1985) Three-dimensional fuzzy digital topology and its applications(I). Geophys Prospect Pet 24(2):86–89
Chen L (1990) The necessary and sufficient condition and the efficient algorithms for gradually varied fill. Chin Sci Bull 35:870–873 (Its Chinese version was published in 1989.)
Chen L (1990) Gradually varied surfaces and gradually varied functions,in Chinese,1990; in English 2005 CITR-TR 156,University of Auckland
Chen L (1991) The lambda-connected segmentation and the optimal algorithm for split-and-merge segmentation. Chin J Comput 14:321–331
Chen L (1992) Random gradually varied surface fitting. Chin Sci Bull 37(16):1325–1329
Chen L (1994) Gradually varied surface and its optimal uniform approximation. In:IS&TSPIE symposium on electronic imaging,SPIE Proceeding,San Jose,vol 2182,pp 300–307
Chen L (2004) Discrete surfaces and manifolds. Scientific and Practical Computing,Rockville
Chen L (2010) A digital-discrete method for smooth-continuous data reconstruction. Capital Science 2010 of The Washington Academy of Sciences and its Affiliates,27–28 Mar 2010
Chen L (2010) Digital-discrete surface reconstruction: a true universal and nonlinear method.http://arxiv.org/ftp/arxiv/papers/1003/1003.2242.pdf
Chen L,Adjei O (2004) Lambda-connected segmentation and fitting. In: Proceedings of IEEE international conference on systems man and cybernetics,vol 4. IEEE,Hague,pp 3500–3506
Chen L,Berkey FT,Johnson SA (1994) The application of a fuzzy object search technique to geophysical data processing. In: Proceedings ofIS&TSPIE symposium on electronic imaging,SPIE Proceeding,vol. 2180. SPIE,San Jose,pp 300–309
Chen L,Cheng HD,Zhang J (1994) Fuzzy subfiber and its application to seismic lithology classification. Inf Sci 1(2):77–95
Chen L,Cooley DH,Zhang L (1998) An Intelligent data fitting technique for 3D velocity reconstruction. In: Application and science of computational intelligence,proceeding SPIE 3390. SPIE,Orlando,pp 103–112
Chen L,Adjei O,Cooley DH (2000) λ-connectedness: method and application. In: Proceedings of IEEE conference on system,man,and cybernetics 2000. IEEE,Nashville,pp 1157–1562
Chen L,Zhu H,Cui W (2006) Very fast region-connected segmentation for spatial data. In: Proceedings of IEEE international conference on systems,man and cybernetics,Hong Kong,pp 4001–4005
Cleveland WS,William S (1979) Robust locally weighted regression and smoothing scatterplots. J Am Stat Assoc 74(368):829–836
Doo D,Sabin M (1978) Behaviour of recursive division surfaces near extraordinary points. Comput Aided Des 10:356–360
Cormen TH,Leiserson CE,Rivest RL (1993) Introduction to algorithms. MIT,Cambridge
Fisher R,Ken D,Fitzgibbon A,Robertson C,Trucco E (2005) Dictionary of computer vision and image processing,Wiley,Hoboken
Gonzalez RC,Wood R (1993) Digital image processing. Addison-Wesley,Reading
Hearn D,Baker MP (2004) Computer graphics (with OpenGL),3rd edn. Prentice Hall,Upper Saddle River
Lancaster P,Salkauskas K (1981) Surfaces generated by moving least squares methods. Math Comput 87:141–158
Levin D (2003) Mesh-independent surface interpolation. In: Brunnett G,Hamann B,Mueller K,Linsen L (eds) Geometric modeling for scientific visualization. Springer,Berlin/London
Lynch C (2008) Big data: How do your data grow? Nature 455(7209):28–29
Mount DM (2002) Computational geometry,UMD lecture notes CMSC 754.http://www.cs.umd.edu/~mount/754/Lects/754lects.pdf
Pavilidis T (1982) Algorithms for graphics and image processing. Computer Science Press,Rockville
Pawlak Z (1999) Rough sets,rough functions and rough calculus. In: Pal SK,Skowron A (eds) Rough fuzzy hybridization. Springer,New York,pp 99–109
Rosenfeld A (1986) ‘Continuous’ functions on digital pictures. Pattern Recognit Lett 4:177–184
Rosenfeld A,Kak AC (1982) Digital picture processing,2nd edn. Academic,New York
Russell S,Norvig P (2003) Artificial intelligence: a modern approach,2nd edn. Prentice Hall,Englewood Cliffs
Theodoridis S,Koutroumbas K (2003) Pattern recognition,2nd edn. Academic,San Diego
Acknowledgements
Many thanks to Dr. Peter Schroeder at Caltech for the online software on Chaikin’s method and the four point algorithm:http://www.multires.caltech.edu/teaching/demos/java/chaikin.htm.http://www.multires.caltech.edu/teaching/demos/java/4point.htm. Also thanks to Dr. Ken Joy at UC Davis for pointing out Chaikin’s work. Many thanks to Dr. Paul Chew at Cornell University for his software on Delaunay diagrams.http://www.cs.cornell.edu/home/chew/Delaunay.html.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Chen, L.M. (2013). Digital-Discrete Method and Its Relations to Graphics and AI Methods. In: Digital Functions and Data Reconstruction. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5638-4_12
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5638-4_12
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-5637-7
Online ISBN: 978-1-4614-5638-4
eBook Packages: Computer ScienceComputer Science (R0)