메뉴 건너뛰기




Volumn 22, Issue 3, 2012, Pages 289-293

Flotation bubble seed image filling algorithm based on boundary point features

Author keywords

Chain code; Filling; Flotation bubble; Point feature; Scan line

Indexed keywords

BOUNDARY POINTS; CHAIN CODES; DOUBLE-MATCHED; FILLING ALGORITHM; FLOTATION BUBBLES; IMAGE FILLING ALGORITHM; IMAGE OBJECTS; POINT FEATURES; SCAN LINE;

EID: 84861865991     PISSN: 20952686     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijmst.2012.04.001     Document Type: Article
Times cited : (5)

References (15)
  • 1
    • 84861901466 scopus 로고    scopus 로고
    • Texture and bubble size measurements for modeling concentrate grade in flotation froth systems
    • T. Jayson, D. Car, and B. Gianni Texture and bubble size measurements for modeling concentrate grade in flotation froth systems Miner Eng 20 2007 1129 1144
    • (2007) Miner Eng , vol.20 , pp. 1129-1144
    • Jayson, T.1    Car, D.2    Gianni, B.3
  • 2
    • 59549086797 scopus 로고    scopus 로고
    • On the accuracy of fragment size measurement by image analysis in combination with some distribution functions
    • J.A. Sanchidrian, P. Segarral, and F. Ouchterlony On the accuracy of fragment size measurement by image analysis in combination with some distribution functions Rock Mech Rock Eng 42 2009 95 116
    • (2009) Rock Mech Rock Eng , vol.42 , pp. 95-116
    • Sanchidrian, J.A.1    Segarral, P.2    Ouchterlony, F.3
  • 3
    • 79958698081 scopus 로고    scopus 로고
    • Flotation bubble image segmentation based on seed region boundary growing
    • G.Y. Zhang, H. Zhu, and N. Xu Flotation bubble image segmentation based on seed region boundary growing Min Sci Technol 2 2011 239 242
    • (2011) Min Sci Technol , Issue.2 , pp. 239-242
    • Zhang, G.Y.1    Zhu, H.2    Xu, N.3
  • 4
    • 0023812341 scopus 로고
    • Restoration of binary images using contour direction chain codes description
    • Z. Cai Restoration of binary images using contour direction chain codes description Comput Vis Graph Image Process 41 1 1988 101 106
    • (1988) Comput Vis Graph Image Process , vol.41 , Issue.1 , pp. 101-106
    • Cai, Z.1
  • 5
    • 0025449053 scopus 로고
    • A fast algorithm for the restoration of images based on chain codes description and its application
    • L.W. Chang, and L.K. Lu A fast algorithm for the restoration of images based on chain codes description and its application Comput Vis Graph Image Process 50 3 1990 296 307
    • (1990) Comput Vis Graph Image Process , vol.50 , Issue.3 , pp. 296-307
    • Chang, L.W.1    Lu, L.K.2
  • 6
    • 0023823117 scopus 로고
    • Region filling with the use of the discrete green theorem
    • G.Y. Tang Region filling with the use of the discrete green theorem Comput Vis Graph Image Process 42 3 1988 297 305
    • (1988) Comput Vis Graph Image Process , vol.42 , Issue.3 , pp. 297-305
    • Tang, G.Y.1
  • 7
    • 0141824501 scopus 로고    scopus 로고
    • A new contour filling algorithm based on chain codes description
    • M.W. Ren, J.Y. Yang, and H. Sun A new contour filling algorithm based on chain codes description Journal of Image and Graph 6 4 2001 348 352
    • (2001) Journal of Image and Graph , vol.6 , Issue.4 , pp. 348-352
    • Ren, M.W.1    Yang, J.Y.2    Sun, H.3
  • 8
    • 25144510592 scopus 로고    scopus 로고
    • A new and fast contour-filling algorithm
    • M.W. Ren, W.K. Yang, and J.Y. Yang A new and fast contour-filling algorithm Pattern Recogn 38 12 2005 2567 2577
    • (2005) Pattern Recogn , vol.38 , Issue.12 , pp. 2567-2577
    • Ren, M.W.1    Yang, W.K.2    Yang, J.Y.3
  • 9
    • 79960396725 scopus 로고    scopus 로고
    • New regional filling algorithm based on seed
    • Z.F. Zhang, S.F. Ma, and W. Li New regional filling algorithm based on seed Comput Eng Appl 45 6 2009 201 202
    • (2009) Comput Eng Appl , vol.45 , Issue.6 , pp. 201-202
    • Zhang, Z.F.1    Ma, S.F.2    Li, W.3
  • 10
    • 49249109206 scopus 로고    scopus 로고
    • New high-speed scan line algorithm for filling 8-adjacent connection area
    • W.C. Liu, J.J. Liu, Y.W. Zhu, and Xiaochun Chen New high-speed scan line algorithm for filling 8-adjacent connection area Appl Res Comput 6 2006 177 179
    • (2006) Appl Res Comput , Issue.6 , pp. 177-179
    • Liu, W.C.1    Liu, J.J.2    Zhu, Y.W.3    Chen, X.4
  • 11
    • 84861870970 scopus 로고    scopus 로고
    • A region filling algorithm based on crack chain code description
    • Y.G. Chen, G.Q. Gu, and L. Wang A region filling algorithm based on crack chain code description J Image Graph 12 11 2007 2086 2092
    • (2007) J Image Graph , vol.12 , Issue.11 , pp. 2086-2092
    • Chen, Y.G.1    Gu, G.Q.2    Wang, L.3
  • 12
    • 84861889609 scopus 로고    scopus 로고
    • The research of improved scan line polygon fill algorithm
    • S.Q. Yang, and S.K. Li The research of improved scan line polygon fill algorithm Math Theory Appl 19 2 1999 47 49
    • (1999) Math Theory Appl , vol.19 , Issue.2 , pp. 47-49
    • Yang, S.Q.1    Li, S.K.2
  • 13
    • 84861917988 scopus 로고    scopus 로고
    • A new polygon filling algorithm based on pertinence between point and its abutting sides
    • H. Ma, G.D. Lu, and J.R. Tan A new polygon filling algorithm based on pertinence between point and its abutting sides J Image Graph 9 11 2004 1336 1341
    • (2004) J Image Graph , vol.9 , Issue.11 , pp. 1336-1341
    • Ma, H.1    Lu, G.D.2    Tan, J.R.3
  • 14
    • 84976683657 scopus 로고
    • Computer processing of line drawing images
    • H. Freeman Computer processing of line drawing images Comput Surv 6 1974 57 97
    • (1974) Comput Surv , vol.6 , pp. 57-97
    • Freeman, H.1
  • 15
    • 79958022948 scopus 로고    scopus 로고
    • Ore Image thresholding using bi-neighborhood Otsu's approach
    • G.Y. Zhang, G.Z. Liu, H. Zhu, and B. Qiu Ore Image thresholding using bi-neighborhood Otsu's approach J Electron Lett 46 25 2010 1666 1668
    • (2010) J Electron Lett , vol.46 , Issue.25 , pp. 1666-1668
    • Zhang, G.Y.1    Liu, G.Z.2    Zhu, H.3    Qiu, B.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.