Inverse Problem of Lindenmayer Systems on Branching Structures
Lindenmayer systems (L-systems) have been used to generate and describe the geometrical structures for example, branch structures, graph structures, both in biology and medicine. The L-systems consist of a number of iteration n, an initial string ω and a set of production rules P. The production rules are a set of predecessor a and successor χ. They are written as the form a ← χ. The production rules have been defined and analyzed from the real structure by a structure decomposition manually. The rules are compiled and transformed to represent 2D and 3D structure. However, the complicated structures are not easy to decompose and time consuming to get such production rules. In this paper, we propose an algorithm to solve this problem automatically from 2D input images by given initial pixels or voxels. The data acquisition can be retrieved from 2D image scanner, camera, CT-Scanner or MRI. The methods namely Region and Volume Growing Methods are applied to bound the target object. The skeletonization process is an important part in our reconstruction. The L-systems are reconstructed for representing the structure from 2D input image or sliced images of the volume data.
KeywordsInverse Problem Input Image Production Rule Branch Structure Unit Movement
Unable to display preview. Download preview PDF.
- AB94.Adams, R., Bischof L.: Seeded region growing. IEEE Trans. on PAMI, 16(7), 641–647 (1994)Google Scholar
- Ash99.Ash, A., Ellis, B., Hickey, L. J., Johnson, K., Wilf, P., and Wing S. : Manual of Leaf Architecture- morphological description and categorization of dicotyledonous and net-veined monocotyledonous angiosperms by Leaf Architecture Working Group. (1999)Google Scholar
- CJB05a.Chuai-Aree, S., Jäger, W., Bock, H. G., and Siripant, S.: Simulation and Visualization of Plant Growth Using Lindenmayer Systems. In H. G. Bock, E. Kostina, H. X. Phu and R. Rannacher (eds.): Modeling, Simulation and Optimization of Complex Processes, Springer-Verlag, pp. 115–126 (2005)Google Scholar
- CJB05b.Chuai-Aree, S., Jäger, W. Bock, H. G., and Siripant, S.: Reconstruction of Branching Structures Using Region and Volume Growing Method. International Conference in Mathematics and Applications (ICMA-MU 2005) (Bangkok, Thailand) (2005)Google Scholar
- DPS00.Dimitrov, P., Phillips, C., Siddiqi, K.: Robust and Efficient Skeletal Graphs. Conference on Computer Vision and Pattern Recognition (Hilton Head, South Carolina) (2000)Google Scholar
- Mech96.Mech, R., and Prusinkiewicz, P.: Visual models of plants interacting with their environment, Proceeings in Computer Graphics (SIGGRAPH’96), 397–410 (1996)Google Scholar
- Rus95.Russ, J. C.: The Image Processing Handbook. CRC Press, (1995)Google Scholar
- Set99.Sethian, J. A.: Level Set Methods and Fast Marching Methods. Cambridge University Press, (1999)Google Scholar
- Str04.Strzodka, R., and Telea, A.: Generalized Distance Transforms and Skeletons in Graphics Hardware, The Eurographics Association (2004).Google Scholar
- Tou97.Toussaint, G.: Hilditch’s Algorithm for Skeletonization. (1997) http://jeff.cs.mcgill.ca/~godfried/teaching/projects97/azar/skeleton.html
- Wei98.Weickert, J.: Anisotropic Diffusion in Image Processing. B.G. Teubner Stuttgart (1998)Google Scholar