반도체디스플레이기술학회지 (Journal of the Semiconductor & Display Technology)

한국반도체디스플레이기술학회 (The Korean Society Of Semiconductor & Display Technology)
권호 표지

A study on N-dimensional quad-tree decomposition

  • Yi, Cheon-Hee (Dept of Electronic Engineering, Chong-ju University) ;
  • Yi, Jae-Young (Dept of Electronic Engineering, Chong-ju University)
  • 발행 : 2009.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We have examined the problem of the number of quad-tree blocks that an n-dimensional rectangle will be decomposed into on the average. the contribution of this paper are both practical and theoretical. In this paper, we develops the overlapping multi-scale models and the region quad-tree models which is useful in computer graphics animation, image processing, pattern recognition and also for modeling three dimensional objects. These models, which represent something of a conceptual departure from other models developed for multi-scale framework were developed with the specific interest of producing smooth estimates.

키워드

참고문헌

  1. R. Daley, Atmosphic data analysis, Cambridge universitypress, Newyork, 1991.
  2. H. Samet, The Design and analysis of spatial datastructures. Addison-Wesley, 1990.
  3. H. Samet, The Quad-tree and related hierachical datastructures, ACM Computing Surveys 16, 2, 1984.
  4. C.A. Shaffer and H.Samet, optimal quad-tree construction algorithm and image processing 37, p402-419, March 1987. https://doi.org/10.1016/0734-189X(87)90045-4
  5. Curtis P. Kulovson and Michael Stonebraker. Segmentindexes : Dynamic indexing techniques for multidimensionalinterval data. Proc. ACM SIGMOD,p.138-147, May 1991.
  6. Manish Arya, William Cody, christos Faloutsos, JoelRechardson, and Arthur Toga. Qbism : Extending adbms to support 3d medical images, Tenth Int. Conf.On Data Engineering, p.314-325, Feb. 1994.
  7. F. P. Preparata and M. I. Shamos, ComputationalGeometry. New york : Springer-verlag, 1985.
  8. S. K. Nandy, I. V. Ramakrishna, “Dual quad-tree representationfor VLSI design,” 23rd design AutomationConference, p. 633-666, 1986.
  9. M. Bern and D. Eppstein. Mesh generation and optimaltriangulation. In Euclidean Geometry and the computer,eds. D. Z. Du and F. Hwang, World Scientic, 1992.
  10. L. P. chew. Guaranted-quality triangular meshes. Tech.Rep. TR-89-983, Cornell university, 1989.
  11. J. Ruppert. A new and simple algorithm for quality2-dimensional mesh generation 4th Symp. DiscreteAlgorithms p.83-92, 1993.
  12. E. A. Melissaratos and D.L Souvaine : Coping withinconsistencies : A new approach to produce qualitytriangulations of polygonal domains with holes. 8thSymp. Comput. Geom. p.202-211, 1992.
  13. F.T, Leigthon, M. Lepley, G.L. Miller, “Layouts for theshuffle-exchange graph based on the complex plane diagram.”SIAM J. A.C. G. DISC. Math. Vol.5, No.2, 1984.
  14. William R. Crum, Oscar Camara, and Derek L. G.Hill, “Generalized overlap measures for evaluationand validation in medical image analysis,” IEEE Trans, on Medical Imaging, Vol. 25, No. 11, 2006.
  15. M. Luettgen , A. S. willsky, “Likelihood calculationfor a class of Multi-scale stochastic models, withapplication to texture discrimination.”, IEEE Trans. Image processing(4)#2, p.194-207, 1995.