| 摘要(英) |
Nowadays, the common way of data searching and internet searching is to enter the keywords. Since the words and numbers are memorized by standard form, it is easy to match and search quickly. However, it is not effective to find a geometric object by entering the keywords in the existing search engines. With the development of Computer Aided Design/Manufacture and graphic engine in recent years, the data of geometric models has been growing rapidly, resulting in unsatisfying speed of coding and classing by Group Technology when searching. The available technique of models matching and searching is necessary to be developed in engineering and multimedia managing.
The purpose of the research is to discuss how to use the Heuristic Geometric Reasoning method by analyzing the characteristics of models and projective contour. Establish feasible corresponding relation between 3D model and entering shape, and develop iterative calculation of Viewing Angle to solve the searching problem.
The main idea of Heuristic Geometric Reasoning method is to determine the projective contour-characteristics by considering the concave and convex of the points and edges. In this research, four stages are implemented to reach the goal. First of all, analysis of connective quality between points and edges of the entering contour is completed, following by the STL file of geometric models being read and analyzed. Third, initial projection is obtained form geometric characteristics. Finally, to adjust proportion between 2D figure and 3D model, presume the z-coordinate, and calculate precision-coordination by ICP algorithm, are included in the forth stage. |
| 參考文獻 |
1. Dengsheng Zhang and Guojun Lu, “Review of shape representation and description techniques”, Pattern Recognition, Vol.37, pp.1-19, 2003.
2. Patrick Min, Joyce Chen and Thomas Funkhouser, “A 2D sketch interface for a 3D model search engine”, ACM SIGGRAPH 2002 conference abstracts and applications, Sketches and applications, pp.138-138,2002
3. K Park. and D.J. Cannon, “Recognition and localization of a 3D polyhedral object using a neural network”, Proceedings of the IEEE International Conference on Robotics and Automation, Vol.4, pp.3613-3618, April 1996.
4. G.N. Bebis and G.M. Papadourakis, “Object recognition using invariant object boundary representations and neural network models”, Pattern Recognition, Vol.25, No.1, pp.25-44,1992.
5. Paul J. Besl and Neil D. Mckay, “A method for registration of 3-D shapes”, IEEE Transactions Pattern Analysis and Machine Intelligence, Vol.14, No2, February 1992.
6. Shaoyi Du, Nanning Zheng, Shihui Ying and Jishang Wei, “ICP with Bounded Scale for Registration Of M-D Point Sets”, Multimedia and Expo, pp.1291-1294, July 2007.
7. J. Kennedy and R.C. Eberhart, “Particle swarm optimization”, Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ. pp. 1942-1948, 1995.
8. R.C. Eberhart and J. Kennedy “A new optimizer using particle swarm theory,” Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan. pp. 39-43, 1995.
9. C. Andrew and Jr. Staugaard, Robotics and AI：An introduction to applied machine intelligence, Prentice-Hall International Editions, United States of America, 1987.
10. K.S. Arun, T.S. Huang and S.D. Bostein, “Least square fitting of two 3-D point sets”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 9(5):698-700, 1987
11. B.K.P. Horn, “Closed-form solution of absolute orientation using unit quaternion”, Journal of the Optical Society of America A, 4(4):629-642, April 1987.
12. M.W. Walker, L. Shao and R.A. Volz, “Estimating 3-D location parameters using dual number quaternions”, CVGIP Image Understanding, 54:358-367, November 1991.
13. Wikipedia：http://en.wikipedia.org/wiki/Quaternion |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit