請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5192完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 丁建均 | |
| dc.contributor.author | Chia-Jung Lin | en |
| dc.contributor.author | 林家蓉 | zh_TW |
| dc.date.accessioned | 2021-05-15T17:53:17Z | - |
| dc.date.available | 2017-08-08 | |
| dc.date.available | 2021-05-15T17:53:17Z | - |
| dc.date.copyright | 2014-08-08 | |
| dc.date.issued | 2014 | |
| dc.date.submitted | 2014-08-04 | |
| dc.identifier.citation | A. Interactive Image Segmentation
[1] D. L. Pham, C. Xu, and J. L. Prince, “Current methods in medical image segmentation 1”, Annual Review of Biomedical Engineering, vol. 2, no. 1, pp. 315-337, 2000. [2] C. Rother, V. Kolmogorov, and A. Blake. “Grabcut: Interactive foreground extraction using iterated graph cuts,” ACM Transactions on Graphics, vol. 23, no. 3, pp. 309–314, 2004. [3] Y. Y. Boykov, and M. P. Jolly, “Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images,” In Proceedings of the IEEE International Conference on Computer Vision, vol.1, pp.105-112, 2001. [4] Y. Boykov and V. Kolmogorov, “An experimental comparison of mincut/max-flow algorithms for energy minimization in vision.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, pp. 1124–1137, 2004. [5] Y. Li, J. Sun, C. K. Tang, and H. Y. Shum. “Lazy snapping,” ACM Transactions on Graphics, vol. 23, no. 3, pp. 303-308, 2004. [6] F. R. Chung, “Spectral Graph Theory,” vol. 92, American Mathematical Soc., 1997. [7] N. Biggs, “Algebraic Graph Theory”, Cambridge University Press, 1974. [8] D. Greig, B. Porteous, and A. Seheult. “Exact maximum a posteriori estimation for binary images,” Journal of the Royal Statistical Society, Series B, pp. 271–279, 1989. [9] A. Blake, C. Rother, M. Brown, P. Perez, and P. Torr, “Interactive Image Segmentation Using an Adaptic GMMRF Model,” In Proceedings of the European Conference on Computer Vision, pp. 428-441, 2004. [10] M. Gleicher, “Image snapping,“ In Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, pp. 183-190, 1995. [11] M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active contour models,” International journal of computer vision, vol. 1, no. 4, pp. 321-331, 1987. [12] H. Lombaert, Y. Sun, L. Grady, and C. Xu, “A Multilevel Banded Graph Cuts Method for Fast Image Segmentation,” In Proceedings of the IEEE International Conference on Computer Vision, vol. 1, pp. 259-265, 2005. [13] E. N. Mortensen and W. A. Barrett, ”Intelligent scissors for image composition,” In Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, pp. 191–198, 1995. [14] J.Wang, M. Agrawala, and M. F. Cohen, “Soft scissors: an interactive tool for realtime high quality matting,” ACM Transactions on Graphics, vol. 26, no. 3, pp. 9:1-9:6, 2007. [15] V. Kolmogorov and Y. Boykov, “What metrics can be approximated y geo-cuts, or global optimization of length/area and flux,” In Proceedings of the IEEE International Conference on Computer Vision, vol. 1, pp. 564–571, 2005. [16] S. Vicente, V. Kolmogorov, and C. Rother, “Graph cut based image segmentation with connectivity priors,” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8, 2008. [17] J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, 2000. [18] V. Kolmogorov, Y. Boykov, and C. Rother, “Applications of parametric maxflow in computer vision,” In Proceedings of the IEEE International Conference on Computer Vision, pp. 1-8, 2007. [19] T. Schoenemann, F. Kahl, and D. Cremers, “Curvature regularity for region-based image segmentation and inpainting: A linear programming relaxation,” In Proceedings of the IEEE International Conference on Computer Vision, pp, 17-23, 2009. [20] A. K. Sinop and L. Grady, “A seeded image segmentation framework unifying graph cuts and random walker which yields a new algorithm,” In Proceedings of the IEEE International Conference on Computer Vision, pp. 1-8, 2007. [21] L. Grady, “Random walks for image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 11, pp. 1768–1783, 2006. [22] X. Bai and G. Sapiro, “A geodesic framework for fast interactive image and video segmentation and matting,” In Proceedings of the IEEE International Conference on Computer Vision, pp. 1–8, 2007. [23] A. Protiere and G. Sapiro, “Interactive image segmentation via adaptive weighted distances,” IEEE Transactions on Image Processing, vol. 16, no. 4, pp. 1046–1057, 2007. [24] L. J. Reese and W. A. Barrett, “Image editing with intelligent paint,” In Proceedings of Eurographics, vol. 21, no. 3, pp. 714–724, 2002. [25] C. Couprie, L. Grady, L. Najman, and H. Talbot, “Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest,” In Proceedings of the IEEE International Conference on Computer Vision, pp. 731-738, 2009. [26] D. Singaraju, L. Grady, and R. Vidal, “P-Brush: Continuous valued MRFs with normed pairwise distributions for image segmentation,” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1303–1310, 2009. [27] D. Mumford, and J. Shah, “Optimal approximations by piecewise smooth functions and associated variational problems.” Communications on pure and applied mathematics, vol. 42, no. 5, pp. 577-685, 1989. [28] S. Geman, and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, 1984. [29] E. N. Mortensen, and W. A. Barrett, “Interactive segmentation with intelligent scissors.” Graphical models and image processing, vol. 60, no. 5, pp. 349-384, 1998. [30] L. D. Cohen, and R. Kimmel, “Global minimum for active contour models: A minimal path approach.” International journal of computer vision, vol. 24, no. 1, pp. 57-78, 1997. [31] L. Grady, “Computing exact discrete minimal surfaces: Extending and solving the shortest path problem in 3D with application to segmentation.” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 69-78, 2006. [32] D. Freedman and T. Zhang, “Interactive graph cut based segmentation with shape priors.” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. 755-762, 2005. [33] N. Vu and B. S. Manjunath, “Shape prior segmentation of multiple objects with graph cuts.” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8, 2008. [34] H. Wang and H. Zhang, “Adaptive shape prior in graph cut segmentation.” In Proceedings of the IEEE Conference on Image Processing, pp. 3029-3032, 2010. [35] A. M. Ali, A. A. Farag and A. S. El-Baz, “Graph cuts framework for kidney segmentation with prior shape constraints.” In Medical Image Computing and Computer-Assisted Intervention, pp. 384-392, 2007. [36] O. Veksler, “Star shape prior for graph-cut image segmentation.” In Proceedings of the IEEE Conference on Computer Vision, pp. 454-467, 2008. [37] L. Vincent and P. Soille, “Watersheds in digital spaces: an efficient algorithm based on immersion simulations,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 583-598, 1991. [38] M. Y. Liu, O. Tuzel, S. Ramalingam, and R. Chellappa, 'Entropy rate superpixel segmentation,' In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2097-2104, 2011. [39] O. Veksler and Y. Boykov, “Superpixels and supervoxels in an energy optimization framework,” In Proceedings of the European Conference on Computer Vision, pp. 211-224, 2010. [40] J. Santner, T. Pock, and H. Bischof, “Interactive multi-label segmentation,” Springer Berlin Heidelberg, pp. 397-410, 2011. [41] O. Duchenne, J. Y. Audibert, R. Keriven, J. Ponce, and F. Segonne, “Segmentation by transduction.” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8, 2008. [42] B. L. Price, B. Morse, and S. Cohen, “Geodesic graph cut for interactive image segmentation.” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3161-3168, 2010. B. Superpixel [43] P. Neubert and P. Protzel, “Superpixel benchmark and comparison,” In Proceedings of Forum Bildverarbeitung, 2012. [44] L. Vincent and P. Soille, “Watersheds in digital spaces: An efficient algorithm based on immersion simulations.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 583–598, 1991. [45] D. Comaniciu and P. Meer, “Mean shift: a robust approach toward feature space analysis.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 5, pp. 603–619, 2002. [46] A. Vedaldi and S. Soatto, “Quick shift and kernel methods for mode seeking,” In Proceedings of the European Conference on Computer Vision, pp. 705-718, 2008. [47] A. Levinshtein, A. Stere, K. Kutulakos, D. Fleet, S. Dickinson, and K. Siddiqi. “Turbopixels: Fast superpixels using geometric flows,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 31, no.12, pp. 2290-2297, 2009. [48] R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Susstrunk, “SLIC superpixels compared to state-of-the-art superpixel methods,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 11, pp. 2274-2282, 2012. [49] J. Shi and J. Malik, “Normalized cuts and image segmentation.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000. [50] T. Cour, F. Benezit, and J. Shi, “Spectral segmentation with multiscale graph decomposition,” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1124-1131, 2005. [51] P. Felzenszwalb and D. Huttenlocher, “Efficient graph-based image segmentation.” International Journal of Computer Vision, vol. 59, no. 2, pp. 167–181, 2004. [52] Y. M. Liu, O. Tuzel, S. Ramalingam, and R. Chellappa, “Entropy rate superpixel segmentation,” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2097-2104, 2011. C. Theorems and Methmetics [53] V. Vineet, and P. J. Narayanan, “CUDA cuts: Fast graph cuts on the GPU,” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2008. [54] P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik, “Contour detection and hierarchical image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 5, pp. 898-916, 2011. [55] R. B. Miller, “Response time in man-computer conversational transactions,” In Proceedings of the fall joint computer conference, ACM, part I, pp. 267-277, 1968. [56] D. J. Field, “Relations between the statistics of natural images and the response properties of cortical cells,” Journal of the Optical Society of America A, vol. 4, no. 12, pp. 2379-2394, 1987. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5192 | - |
| dc.description.abstract | 影像切割一直是計算機視覺中一個重要的研究課題。這是因為電腦很難完全自動地從背景分割出目標，這也導致了互動式影像分割研究的興起 互動式影像分割藉由使用者的引導及修正來切割出理想的結果。然而，雖然稱為“互動”式影像切割，近期的許多研究仍未做到能即時回饋。
在本篇論文中，我們著重於縮短切割系統的反應時間。為了產生即時的結果，我們提出充分利用使用者仍在與系統互動的時間(例如正在標記前景或背景的大概位置)，我們將演算法分為兩部份，其中只有第二部分會造成使用者可能察覺到的系統延遲。我們也提出採用的紋理特徵以降低切割的錯誤率，尤其當前景和背景具有相似的顏色的時候。實驗結果表明，在人眼的反應系統下，我們的演算法和框架可以達到視為“即時”的反應時間，這樣的框架同時也可以被其他演算法拿來應用。 | zh_TW |
| dc.description.abstract | Image segmentation has been a major research topic in computer vision. It is hard to segment the object from the background fully automatically, and solving the problem leads to the researches in interactive image segmentation, which incorporates user intervention to guide the segmentation process and to correct anomalies in the segmentation results. Although called “interactive,” real-time response is not yet reachable by many recent methods.
In this thesis, we focus on shorten the response time of the segmentation system. To produce real-time result, we propose making use of the time when user interacts with the system. We separate our algorithm into two parts, where the response time is only contributed by the later part. We adopt texture feature to enhance the results in images where foreground and background have similar colors. Experimental results show that our implementation achieves short response time that could be perceived as “instant.” The framework can also be applied by other different algorithms to shorten the response time. | en |
| dc.description.provenance | Made available in DSpace on 2021-05-15T17:53:17Z (GMT). No. of bitstreams: 1 ntu-103-R01942054-1.pdf: 5428881 bytes, checksum: f910706da0597495dfb5d2a874df3748 (MD5) Previous issue date: 2014 | en |
| dc.description.tableofcontents | 口試委員會審定書 #
誌謝 i 中文摘要 ii ABSTRACT iii CONTENTS iv LIST OF FIGURES vii LIST OF TABLES x Chapter 1 Introduction 1 1.1 Motivation 1 1.2 Main Contribution 2 1.3 Organization 2 Chapter 2 Interactive Image Segmentation 3 2.1 Image Segmentation 3 2.2 Interactive Segmentation 5 2.3 Prior Works on Interactive Segmentation 6 2.3.1 Graph Cut 6 2.3.2 Random Walker 7 2.3.3 Shortest Path (Geodesic) 7 Chapter 3 Graph Cut Method 9 3.1 Preliminaries 9 3.2 Max-Flow/Min-Cut Theorem 10 3.3 Graph Cut 11 3.4 Graph Cut Segmentation 12 3.4.1 Basic Ideas and Background Information 12 3.4.2 Hard Constraints 16 3.5 Issues in Graph Cut Algorithm 19 3.5.1 The Shrinking Bias 19 3.5.2 Efficiency 21 3.5.3 Vulnerability to Noise 21 3.6 Prior Works 22 3.6.1 Speed-up based graph cut 22 3.6.2 Interactive-based graph cut 23 3.6.3 Shape prior-based graph cut 23 3.7 Lazy Snapping[5] 25 Chapter 4 Overview of Superpixel Methods 29 4.1 Introduction 29 4.2 Gradient-Ascent-Based Algorithms 31 4.3 Graph-Based Algorithms 33 4.4 Remarks 34 4.5 Benchmark and Comparison 35 4.5.1 Benchmark 35 4.5.2 Comparison Results 37 Chapter 5 Proposed Interactive Image Segmentation Method 43 5.1 Observation 43 5.2 User Interface (UI) Design 44 5.3 Framework 45 5.4 Desired Properties of Superpixel Segmentation 46 5.5 Proposed Segmentation Algorithm 48 5.5.1 The Regional Term 48 5.5.2 The Boundary Term 50 5.5.3 Max-Flow/Min-Cut Algorithm 50 5.6 Summary 51 Chapter 6 Experimental Results and Discussion 53 6.1 Grabcut Benchmark 53 6.2 Discussion 65 6.2.1 Processing Time 65 6.2.2 Achievable Segmentation Error 70 6.2.3 Graph Cut Segmentation Issues Revisited 71 6.3 Summary 72 Chapter 7 Conclusion and Future Work 73 7.1 Conclusion 73 7.2 Future Work 74 Appendix A A.1 Simple Linear Iterative Clustering Superpixel (SLIC) 75 REFERENCE 81 | |
| dc.language.iso | zh-TW | |
| dc.title | 運用超像素的即時互動式影像切割 | zh_TW |
| dc.title | Real-Time Interactive Segmentation with Superpixel Pre-Segmentation | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 102-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 簡鳳村,許文良,曾易聰 | |
| dc.subject.keyword | 互動式影像切割,超像素,像切割,即時系統, | zh_TW |
| dc.subject.keyword | Interactive Image Segmentation,Superpixel,Graph Cut,Real-Time System, | en |
| dc.relation.page | 87 | |
| dc.rights.note | 同意授權(全球公開) | |
| dc.date.accepted | 2014-08-04 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
| 顯示於系所單位： | 電信工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-103-1.pdf | 5.3 MB | Adobe PDF | 檢視/開啟 |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。