Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電信工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/47954
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor丁建均
dc.contributor.authorYu-Hsiang Wangen
dc.contributor.author王昱翔zh_TW
dc.date.accessioned2021-06-15T06:43:28Z-
dc.date.available2014-07-25
dc.date.copyright2011-07-25
dc.date.issued2011
dc.date.submitted2011-07-05
dc.identifier.citationA. Digital Image Processing
[1] R. C. Gonzalez and R. E. Woods, Digital Image Processing, 3rd ed., Prentice Hall, New Jersey, 2008.
[2] W. K. Pratt, Digital Image Processing, 3th ed., John Wiley & Sons, Inc., Los Altos, California, 2007.
[3] S. Theodoridis and K. Koutroumbas, Pattern Recognition, 4th ed., Academic Press, New York, 2009.
B. Region-Based Segmentation Method
[4] R. Adams, and L. Bischof, “Seeded region growing,” IEEE Trans. Pattern Anal. Machine Intell., vol. 16, no. 6, pp. 641-647, June, 1994.
[5] A. Mehnert and P. Jackway, “An improved seeded region growing algorithm,” Pattern Recognit. Lett., vol. 18, pp. 1065-1071, 1997.
[6] J. Fan , G. Zeng , M. Body and M. S. Hacid “Seeded region growing: An ex-tensive and comparative study,” PRL, vol. 26, pp. 1139-1156, 2005.
[7] Z. Lin, J. Jin and H. Talbot, “Unseeded region growing for 3D image segmenta-tion,” ACM International Conference Proceeding Series, vol. 9, pp. 31-37, 2000.
[8] W. Cui, Z. Guan, and Z. Zhang, “An improved region growing algorithm,” ICCSSE, vol. 6, pp. 93-96, Dec.2008.
[9] F. Y. Shih, S. Cheng, “Automatic seeded region growing for color image segmen-tation”, Image and Vision Computing, vol. 23, issue 10, pp.877-886, Sep. 2005.
[10] H. P. Moravec, “Obstacle avoidance and navigation in the real world by a seeing robot rover”, Technical Report CMU-RI-TR-80-03, Carnegie-Mellon University, Robotics Institute, 1980.
[11] D. Li and Y. Du, Artificial Intelligence with Uncertainty, 1st ed, Chapman and Hall /CRC, Sep. 2007.
[12] S. L. Horowitz and T. Pavlidis, “Picture segmentation by a tree traversal algo-rithm,” JACM, vol. 23, pp. 368-388, April, 1976.
[13] Y. Deng, and B.S. Manjunath, “Unsupervised segmentation of color-texture re-gions in images and video,” IEEE Trans. Pattern Anal. Machine Intell., vol. 23, no. 8, pp. 800-810, Aug. 2001.
[14] Y. Deng, C. Kenney, M.S. Moore, and B.S. Manjunath, “Peer group filtering and perceptual color image quantization,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 4, pp. 21-24, Jul. 1999.
[15] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: John Wiley&Sons, 1970.
[16] J. J. Ding, C. J. Kuo, and W. C. Hong, “An efficient image segmentation tech-nique by fast scanning and adaptive merging,” CVGIP, Aug. 2009.
C. Data Clustering
[17] A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM Com-puting Surveys, vol. 31, issue 3, pp. 264-323, Sep. 1999.
[18] R. Xu, and D. Wunsch, “Survey of clustering algorithms,” IEEE Trans. Neural Networks, vol. 16, issue 3, pp. 645-678, 2005.
[19] W. B. Frakes and R. Baeza-Yates, Information Retrieval: Data Structures and Al-gorithms, Prentice Hall, Upper Saddle River, NJ, 13–27.
[20] G. Nagy, “State of the art in pattern recognition,” Proc. IEEE, vol. 56, issue 5, pp. 836–863, May 1968.
[21] A.K. Jain and R.C. Dubes, Algorithms for Clustering Data, Prentice Hall, 1988.
[22] J. MacQueen, Some methods for classification and analysis of multivariate ob-servations, In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 281–297.
[23] M. R. Anderberg, Cluster Analysis for Applications, Academic Press, Inc., New York.
[24] S. Ray and R. H. Turi., “Determination of number of clusters in k-means clustering and application in colour image segmentation,” Presented at 4th Inter-national Conference on Advances in Pattern Recognition and Digital Tech-niques(ICAPRDT’99), Dec 1999.
[25] E. Diday, “The dynamic cluster method in non-hierarchical clustering,” J. Comput. Inf. Sci., vol. 2, pp. 61-88, 1973.
[26] M.J. Symons, “Clustering criteria and multivariate normal mixtures,” Biometrics, vol. 37, no. 1, pp. 35-43, Mar. 1981.
[27] G. H. Ball, and D. J. Hall, ISODATA, A Novel Method of Data Analysis and Pat-tern Classification, Menlo Park, CA: Stanford Res. Inst. 1965.
[28] D. Comaniciu and P. Meer, “Mean shift: a robust approach toward feature space Analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603-619, May 2002.
[29] Y. Cheng, “Mean shift, mode seeking, and clustering,” IEEE Trans. Pattern Anal-ysis and Machine Intelligence, vol. 17, no. 8, pp. 790-799, Aug. 1995.
[30] D. Comaniciu and P. Meer, “Mean shift analysis and applications,” Proc. Seventh Int'l Conf. Computer Vision, pp. 1197-1203, Sept. 1999.
D. Edge-Based Segmentation Method
[31] S. C. Pei and J. J. Ding, “The generalized radial Hilbert transform and its applica-tions to 2-D edge detection (any direction or specified directions),” ICASSP, vol. 3, pp. 357-360, Apr. 2003.
[32] L. Vincent, P. Soille, “Watersheds in digital spaces: an efficient algorithm based on immersion simulations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, issue 6, pp. 583-598, Jun. 1991.
[33] A. Bleau and L. Joshua Leon, “Watershed-based segmentation and region merg-ing,” Comput. Vis. Image Understanding, vol. 77, no. 3, pp. 317–370, 2000.
[34] Y. Zhao, J. Liu, H. Li, G. Li, “Improved watershed algorithm for dowels image segmentation,” WCICA, pp. 7644-7648, Jun. 2008.
[35] A Rosenfeld, J L Pfaltz, “Sequential operations in digital picture processing,” Journal of the ACM, vol. 13, no. 4, pp. 471-494, 1966.
E. Review of Segmentation Application
[36] D. L. Pham, C. Xu, J. L. Prince, “Current methods in medical image segmenta-tion,” Annu. Rev. Biomed. Eng., vol. 2, pp. 315-337, 2000.
[37] M. Chitsaz and W. C. Seng, “A multi-agent system approach for medical image segmentation,” ICFCC, pp. 408-411, 2009.
[38] J. Liu, Z. Wang, and R. Zhang, “Liver cancer CT image segmentation methods based on watershed algorithm,” CiSE, pp. 1-4, Dec. 2009.
[39] N. Sun, S. Xu, M. Cao, and Jing Li, “Segmenting and counting of wall-pasted cells based on Gabor filter,” Proceedings of the 2005 IEEE Engineering in Medi-cine and Biology 27th Annual Conference, Shanghai, China, September 1-4, 2005.
[40] M. K. Beyer, C. C. Janvin, J. P. Larsen, and D. Aarsland, “An MRI study of pa-tients with Parkinson’s disease with mild cognitive impairment and dementia using voxel based morphometry,” J. Neurol. Neurosurg. Psychiatry, vol. 78, no. 3, pp. 254–259, Mar. 2007.
[41] M. Grossman, C.McMillan, P.Moore, L. Ding, G. Glosser, M.Work, and J. Gee, “What’s in a name: Voxel-based morphometry analysis of MRI and naming diffi-culty in Alzheimer’s disease, frontotemporal dementia and corticobasal degenera-tion,” Brain, vol. 127, no. 3, pp. 628–649, 2004.
[42] P. E. Grant, “StructuralMR imaging,” Epilepsia, vol. 45, no. s4, pp. 4–16, 2004.
[43] J. J. Wisco, G. Kuperberg, D. Manoach, B. T. Quinn, E. Busa, B. Fischl, S. Heck-ers, and A. G. Sorensen, “Abnormal cortical folding patterns within Broca’s area in schizophrenia: Evidence from structural MRI,” Schizophrenia Res., vol. 94, no. 1–3, pp. 317–327, Aug. 2007.
[44] D. H. Miller, “Biomarkers and surrogate outcomes in neurodegenerative disease: Lessons from multiple sclerosis,” NeuroRx, vol. 1, pp. 284–294, 2004.
[45] A. Traboulsee, G. Zhao, and D. K. B. Li, “Neuroimaging in multiple sclerosis,” Neurol. Clin., vol. 23, pp. 131-148, 2005.
[46] http://mouldy.bic.mni.mcgill.ca/brainweb/
[47] T. Cour and J. Shi, “Recognizing objects by piecing together the Segmentation Puzzle,” CVPR, pp.1-8, Jun. 2007.
[48] K. L. Chung, W. J. Yang, and W. M. Yan, “Efficient edge-preserving algorithm for color contrast enhancement with application to color image segmentation,” Jour-nal of Visual Communication and Image Representation, vol. 19, issue 5, pp. 299-310, Jul. 2008.
[49] L. Lucchese, S.K. Mitra, J. Mukherjee, “A new algorithm based on saturation and desaturation in the xy chromaticity diagram for enhancement and re-rendition of color images,” Proc. Int. Conf. Image Processing, pp. 1077–1080, Sept. 2001.
[50] S. Ojeda, R. Vallejos, and O. Bustos, “A new image segmentation algorithm with applications to image inpainting,” Computational Statistics & Data Analysis, vol. 54, issue 9, pp. 2082-2093, Sept. 2010.
[51] C. Ballester, V. Caselles, J. Verdera, M. Bertalmio, and G. Sapiro “A variational model for filling-in gray level and color images,” ICCV, vol. 1, pp. 10-16, 2001.
F. Application: Muscle Injury Determination
[52] S. F. T. Tang, K. H. Hsu, A. M. K. Wong, C. C. Hsu, and C. H. Chang, “Longitu-dinal followup study of ultrasonography in congenital muscular torticollis,” Clin. Orthop. Relat. Res., vol. 403, pp. 179-185, Oct. 2002.
[53] S. Pillen, R. R. Scholten, M. J. Zwarts, and A. Verrips, “Quantitative skeletal muscle ultrasonography in children with suspected neuromuscular disease,” Mus-cle & Nerve, vol. 27, issue 6, pp. 699-705, June 2003.
[54] S. Pillen, R. O. Tak, M. J. Zwarts, M. M. Y Lammens, K. N. Verrijp, I. M. P. Arts, J. A. van der Laak, P. M. Hoogerbrugge, B.G. M. van Engelen, and A. Verrips, “Skeletal muscle ultrasound: correlation between fibrous tissue and echo intensi-ty,” Ultrasound Med. Biol., vol. 35, issue 3, pp. 443-446, Mar. 2009.
[55] J. Menetrey, C. Kasemkijwattana, F. H. Fu, M. S. Moreland, and J. Huard, “Su-turing versus immobilization of a muscle laceration: A morphological and func-tional study in a mouse model,” Am. J. Sports. Med., vol. 27, no. 2, pp. 222-229, Mar. 1999.
G. Application: Cell Counting
[56] J. G. Daugman, “Complete discrete 2D Gabor transforms by neural networks for image analysis and compression, ” IEEE Trans. Acoustics, speech, and Signal Processing, vol.36, no.7, pp.1169-1179, 1988.
[57] W. C. Hong, “Improvement techniques for fast segmentation and compression for boundary information,” M.S. thesis, National Taiwan University, ROC, 2010.
[58] P. Soille, Morphological Image Analysis: Principles and Applications, 2nd ed, Springer-Verlag, 2002, pp. 208-209.
H. Application: Image Compression
[59] ISO/IEC 10918-1 and ITU-T Recommendation T. 81. Information technology- digital compression and coding of continuous-tone still images: Requirements and guidelines, 1994.
[60] G. K. Wallace, “The JPEG still picture compression standard,” Comm. ACM, vol. 34, issue 4, pp. 30-44, April 1991.
[61] S. Roman, Coding and information Theory, New York: Springer-Verlag, 1992.
[62] J. R. Rice, “Experiments on Gram-Schmidt orthogonalization”, Math. Comp., vol. 20, pp. 325-328, Apr. 1966.
[63] P. Y. Lin, “Coefficient scanning and segmentation techniques for shape adaptive image compression,” M.S. thesis, National Taiwan University, ROC, 2010.
[64] T. Sikora and B. Makai, “Shape-adaptive DCT for generic coding of video,” IEEE Trans. Circuits Syst. Video Technol., vol. 5, pp. 59-62, Feb. 1995.
[65] T. Sikora, “Low complexity shape-adaptive DCT for coding of arbitrarily shaped image segments,” Signal Process: Image Commun., vol. 7, pp. 381-395, 1995.
[66] T. Sikora, S. Bauer, and B. Makai, “Efficiency of shape-adaptive 2-D transforms for coding of arbitrarily shaped image segments,” IEEE Trans. on Circuits and systems for Video Technology, vol. 5, no. 1, pp. 59-62, Feb 1995.
[67] M. Bi, S. H. Ong, and Y. H. Ang, “Comment on ‘Shape-adaptive DCT for generic coding of video’,” IEEE Trans. on Circuits and systems for Video Technology, vol. 6, no. 3, pp. 237-242, Jun 1998.
[68] N. Ahmed, T. Natarajan, and K.R. Rao, “Discrete cosine transform,” IEEE Trans. Comput., vol. C-23, pp. 90-93, Jan 1974.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/47954-
dc.description.abstract在過去的幾十年,影像切割已經成為一個從影像處理到影像分析的重要步驟,其主要的目的是要將影像分割成多個種類或區域,其每個種類或區域各自對於一些測量都有相同的性質。而切割的結果對於許多的影像處理加工十分有用,且可以廣泛地應用在各種的研究領域,例如: 醫學影像分析、影像壓縮、物體偵測與匹配、視訊處理等。
隨著醫學影像的大小以及數量逐漸增加,使用電腦自動化地促進影像的處理與分析變得必須。尤其是對於描繪解剖學上的組織結構以及其他感興趣的區域,影像切割演算法在眾多的生物醫學影像應用中扮演著重要的角色,像是量化組織的容積、診斷、解剖學上的組織結構研究、電腦整合手術。
在這篇論文中,我們提出一個運用影像切割的受傷肌肉判斷演算法,此演算法可以直接地從一張超音波肌肉影像中找出健康與不健康的肌肉纖維,並求得一個受傷的分數。根據受傷分數我們可以判斷該肌肉的健康狀況以及估計傳統上藉由染色劑所決定的纖維化程度。模擬結果顯示受傷分數與纖維化有高度的相關性。
除此之外,我們在這篇論文中提出另外一個運用影像切割的生物醫學演算法(稱為細胞計數),其中我們應用形態學以及優角(大於180度的角)運算來找出細胞壁並分離每個細胞。實驗證明我們的演算法改善了在之前方法所存在的準確度與耗時的問題。
近幾年,形狀自適應影像編碼(Shape adaptive image coding)在許多視覺編碼的應用中已變成主流。形狀自適應編碼的優點在於它可以達到一個更高的壓縮率,這是因為切割出來的影像區域其顏色值有高度的相關性。然而,現存的形狀自適應影像壓縮技術有下列幾個缺點: 高複雜度與低效率的影像編碼。
有鑑於上述壓縮的困境,我們提出一個基於三角形和梯形的二維正交離散餘弦轉換(Two dimensional orthogonal DCT expansion in triangular and trapezoid regions)的壓縮技術。此壓縮技術的概念是根據任何的影像分割區塊可以被視為一個任意形狀的多邊形,而多邊形可以由多個三角形和梯形區域組成。因此,在本篇論文中我們提出了一個三角形和梯形切割演算法。實驗結果顯示由我們的演算法所找出的梯形和三角形可以幾乎匹配影像分割區塊。除此之外,我們的影像壓縮技術相較於JPEG以及其他形狀自適應影像壓縮技術有更好的壓縮效果。
zh_TW
dc.description.abstractDuring the past few decades, image segmentation has been an important step from image processing to image analysis. The main purpose is to make a division of an image such that each category or region is homogeneous with respect to some measurements. The segmentation results can be useful for subsequent image processing treatment and widely applied to various researched fields, e.g. medical image analysis, image com-pression, object detection and matching, and video processing etc.
With the increasing size and number of medical images, automatically facilitating the image processing and analyzing by computer has become necessary. In particular, as a task of delineating anatomical structures and other regions of interest, image segmen-tation algorithms play a crucial role in numerous biomedical image applications such as the quantification of tissue volumes, diagnosis, study of anatomical structure, and com-puter-integrated surgery.
In this thesis, we propose an algorithm of muscle injury determination by image segmentation, which can directly find healthy and unhealthy muscle fibers from an ul-trasound image of muscle, and then derive the injury score. According to the injury score, the healthiness of the muscle can be judged and the degree of fibrosis, which is determined by the conventional method using coloring agent can be also estimated. The simulation results show that the injury score has high correlation with the fibrosis.
Besides, another biomedical algorithm (called cell counting) by image segmentation is proposed in this thesis. We apply morphology and the reflex angle operation to find out cell walls and separate each cell. Experiments show that our algorithm improves the existing problems of precision and time-consuming in previous methods.
In recent years, shape adaptive image coding has become a mainstream in many visual coding applications. The advantage of shape adaptive coding is that it can achieve a higher compression ratio because a segmented image region has high correlation of color values. However, the existing shape adaptive image compression techniques have the following drawbacks: high complexity and inefficient image coding.
Bearing in mind the above obstacle of compression, our image compression scheme based on the two dimensional orthogonal DCT expansion in triangular and trapezoid regions is proposed. The concept of the compression scheme is according to that any image segment can be viewed as an arbitrary polygon and a polygon can be composed by several triangular and trapezoid regions. Thus, the triangular and trapezoid segmentation algorithm is proposed in this thesis. The experimental results show that the trapezoids and triangles derived by our algorithm can nearly match an image segment. Furthermore, our image compression scheme achieves better performance than JPEG and other shape adaptive image compression standards.
en
dc.description.provenanceMade available in DSpace on 2021-06-15T06:43:28Z (GMT). No. of bitstreams: 1
ntu-100-R98942059-1.pdf: 4600045 bytes, checksum: 86d79191033f77459722580ec2fed3af (MD5)
Previous issue date: 2011
en
dc.description.tableofcontents口試委員會審定書 #
誌謝 i
中文摘要 iii
ABSTRACT v
CONTENTS vii
LIST OF FIGURES xi
LIST OF TABLES xix
Chapter 1 Introduction 1
1.1 Motivation 1
1.2 Primary Achievement of this Thesis 2
1.3 Organization 3
Chapter 2 Review of Region-Based Segmentation Methods 5
2.1 Seeded Region Growing 5
2.2 Unseed Region Growing 7
2.3 Improved Region Growing Algorithm 9
2.3.1 Seed Selection Method 10
2.3.2 Cloud Model Theory 13
2.3.3 Procedure and Simulation Result of Improved Region Growing Algorithm 17
2.4 Region Splitting and Merging 19
2.5 Unsupervised Segmentation of Color-Texture Regions in Images and Videos 20
2.5.1 Criterion for Image Segmentation 21
2.5.2 Algorithm of JSEG 25
2.5.3 Simulation Results and Discussion 28
2.6 Fast Scanning Algorithm 29
Chapter 3 Review of Data clustering 35
3.1 Hierarchical Clustering 35
3.1.1 Hierarchical Agglomerative Algorithm 35
3.1.2 Hierarchical Divisive Algorithm 37
3.2 Partitional Clustering 38
3.2.1 Squared Error Algorithm 39
3.2.2 K-means Clustering Algorithm 39
3.2.3 Improvement of K-means 42
3.3 Mean Shift 42
Chapter 4 Review of Edge-Based Segmentation Methods 49
4.1 Watershed Segmentation Algorithm 49
4.2 Markers 52
4.3 Improved Watershed Algorithm for Dowels Image Segmentation 54
4.3.1 Opening-Closing Filtering 54
4.3.2 Distance Transformation 56
4.3.3 Procedure of the Improved Watershed Algorithm and Discussion 57
Chapter 5 Review of Segmentation Applications 59
5.1 Medical Image Analysis 59
5.1.1 Liver Cancer CT Image Segmentation 60
5.1.2 Segmentation in Brain MRI 62
5.2 Object Recognition 68
5.3 Image Inspection 69
5.3.1 Image Segmentation for Justifying the Edge Preservation Effect 69
5.3.2 Reconstruction of the Additive Outliers 70
Chapter 6 Segmentation Application: Muscle Injury Determination 73
6.1 Framework for the Muscle Injury Determination 74
6.2 Method of Finding the Healthy Muscle Fiber 75
6.3 Method of Finding the Unhealthy Muscle Fiber 81
6.4 Injury Score 82
6.5 Simulation Results 83
6.6 Summary 93
Chapter 7 Segmentation Application: Cell Counting 95
7.1 Segmentation Based on Gabor Filter 96
7.2 Reflex Angle 98
7.3 Proposed Cell Counting Method 102
7.4 Simulation Results 105
7.5 Summary 107
Chapter 8 Segmentation Application: Image Compression 109
8.1 Framework for the Image Compression Scheme 109
8.2 Review of Contrast Measurement 111
8.3 Review of Shape-Adaptive Discrete Cosine Transform (SA-DCT) 114
8.4 Orthogonal DCT Basis in the Trapezoid Region 116
8.5 Proposed Triangular and Trapezoid Segmentation Algorithm 119
8.6 Other Image Compression and Simulation Results 123
8.6.1 Other Image Compression Scheme 124
8.6.2 Simulation Results 125
8.7 Summary 134
Chapter 9 Conclusions and Future Work 135
9.1 Conclusions 135
9.2 Future Work 136
REFERENCE 139
dc.language.isoen
dc.subject細胞計數zh_TW
dc.subject影像壓縮zh_TW
dc.subject纖維化zh_TW
dc.subject肌肉損傷zh_TW
dc.subject生物醫學影像處理zh_TW
dc.subject影像切割zh_TW
dc.subject形狀自適應影像編碼zh_TW
dc.subjectJPEGzh_TW
dc.subjectJPEGen
dc.subjectshape adaptive image codingen
dc.subjectimage segmentationen
dc.subjectimage compressionen
dc.subjectcell countingen
dc.subjectfibrosisen
dc.subjectmuscle injuryen
dc.subjectbiomedical image processingen
dc.title影像分割技術在壓縮和醫學影像處理上的應用zh_TW
dc.titleApplications of Image Segmentation Techniques for Compression and Medical Image Processingen
dc.typeThesis
dc.date.schoolyear99-2
dc.description.degree碩士
dc.contributor.oralexamcommittee郭景明,曾易聰,許文良
dc.subject.keyword影像切割,生物醫學影像處理,肌肉損傷,纖維化,細胞計數,影像壓縮,JPEG,形狀自適應影像編碼,zh_TW
dc.subject.keywordimage segmentation,biomedical image processing,muscle injury,fibrosis,cell counting,image compression,JPEG,shape adaptive image coding,en
dc.relation.page145
dc.rights.note有償授權
dc.date.accepted2011-07-05
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電信工程學研究所zh_TW
顯示於系所單位:電信工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-100-1.pdf
  未授權公開取用
4.49 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved