OSA's Digital Library

Applied Optics

Applied Optics

APPLICATIONS-CENTERED RESEARCH IN OPTICS

  • Editor: Joseph N. Mait
  • Vol. 51, Iss. 18 — Jun. 20, 2012
  • pp: 4120–4128

Automatic calculation of tree diameter from stereoscopic image pairs using digital image processing

Faliu Yi and Inkyu Moon  »View Author Affiliations


Applied Optics, Vol. 51, Issue 18, pp. 4120-4128 (2012)
http://dx.doi.org/10.1364/AO.51.004120


View Full Text Article

Enhanced HTML    Acrobat PDF (1177 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Automatic operations play an important role in societies by saving time and improving efficiency. In this paper, we apply the digital image processing method to the field of lumbering to automatically calculate tree diameters in order to reduce culler work and enable a third party to verify tree diameters. To calculate the cross-sectional diameter of a tree, the image was first segmented by the marker-controlled watershed transform algorithm based on the hue saturation intensity (HSI) color model. Then, the tree diameter was obtained by measuring the area of every isolated region in the segmented image. Finally, the true diameter was calculated by multiplying the diameter computed in the image and the scale, which was derived from the baseline and disparity of correspondence points from stereoscopic image pairs captured by rectified configuration cameras.

© 2012 Optical Society of America

OCIS Codes
(100.2000) Image processing : Digital image processing
(110.6880) Imaging systems : Three-dimensional image acquisition

ToC Category:
Image Processing

History
Original Manuscript: January 23, 2012
Revised Manuscript: April 16, 2012
Manuscript Accepted: May 7, 2012
Published: June 15, 2012

Citation
Faliu Yi and Inkyu Moon, "Automatic calculation of tree diameter from stereoscopic image pairs using digital image processing," Appl. Opt. 51, 4120-4128 (2012)
http://www.opticsinfobase.org/ao/abstract.cfm?URI=ao-51-18-4120


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. C. Naz, H. Majeed, and H. Irshad, “Image segmentation using fuzzy clustering: a survey,” in Proceedings of IEEE Conference on ICET (IEEE, 2010), pp. 181–184.
  2. A. Fabijanska, “A survey of thresholding algorithms on yarn images,” in 2010 Proceedings of VIth Conference on Perspective Technologies and Methods in MEMS Design (MEMSTECH) (IEEE, 2010), pp. 23–28.
  3. R. C. Gonzalez and R. E. Woods, Digital Imaging Processing (Prentice-Hall, 2002).
  4. I. Karoui, R. Fablet, J. Boucher, and J. Augustin, “Variational region-based segmentation using multiple texture statistics,” IEEE Trans. Image Process. 19, 3146–3156 (2010).
  5. M. Danesh Panah and B. Javidi, “Segmentation of 3D holographic images using bivariate jointly distributed region snake,” Opt. Express 14, 5143–5153 (2006). [CrossRef]
  6. O. Germain and P. Refregier, “Optimal snake-based segmentation of a random luminance target on a spatially disjoint background,” Opt. Lett. 21, 1845–1847 (1996). [CrossRef]
  7. C. Chesnaud, V. Page, and P. Refregier, “Improvement in robustness of the statistically independent region snake-based segmentation method of target-shape tracking,” Opt. Lett. 23, 488–490 (1998). [CrossRef]
  8. C. Chesnaud, P. Refregier, and V. Boulet, “Statistical region snake-based segmentation adapted to different physical noise models,” IEEE Trans. Pattern Anal. Machine Intell. 21, 1145–1157 (1999).
  9. C. McElhinney, J. McDonald, A. Castro, Y. Frauel, B. Javidi, and T. Naughton, “Depth-independent segmentation of macroscopic three-dimensional objects encoded in single perspectives of digital holograms,” Opt. Lett. 32, 1229–1231 (2007). [CrossRef]
  10. C. Riddell, P. Brigger, R. Carson, and S. Bacharach, “The watershed algorithm: a method to segment noisy PET transmission images,” IEEE Trans. Nucl. Sci. 46, 713–719 (2002). [CrossRef]
  11. C. Jung and C. Kim, “Segmentation clustered nuclei using H-minima transform-based marker extraction and contour parameterization,” IEEE Trans. Biomed. Eng. 57, 2600–2604 (2010).
  12. X. Yang, H. Li, and X. Zhou, “Nuclei segmentation using marker-controlled watershed, tracking using mean-shift, and Kalman filter in time-lapse microscopy,” IEEE Trans. Circuits Syst. 53, 2405–2414 (2006). [CrossRef]
  13. J. Chen and S. Liu, “A medical image segmentation method based on watershed transform,” The Fifth International Conference on Computer and Information Technology (IEEE, 2005), pp. 634–638.
  14. V. Kolmogorov and R. Zabin, “What energy functions can be minimized via graph cuts?” IEEE Trans. Pattern Anal. Machine Intell. 26, 147–159 (2004). [CrossRef]
  15. X. Guo and B. Guo, “Color image morphology based on distance in the HSI color space,” in ISECS International Colloquium on Computing, Communication, Control, and Management, Vol. 3 (IEEE, 2009), pp. 264–267.
  16. M. Osman, M. Mashor, H. Jaafar, R. Raof, and N. Harun, “Performance comparison between RGB and HSI linear stretching for tuberculosis bacilli detection in Ziehl-Neelsen tissue slide images,” in Proceedings of IEEE International Conference on Signal and Image Processing Applications (ICSIPA) (IEEE, 2010), pp. 357–362.
  17. Z. Cheng and R. Chen, “License plate location method based on modified HSI model of color image,” in International Conference on Electronic Measurement & Instruments, ICEMI ’09 (IEEE, 2009), pp. 4197–4201.
  18. D. G. Lowe, “Distinctive image features from scale-invariant keypoints,” Int. J. Comput. Vis. 60, 91–110 (2004). [CrossRef]
  19. P. Soille, Morphological Image Analysis: Principles and Application (Springer-Verlag, 2003).
  20. M. Sonka, V. Hlavac, and R. Boyle, Image Processing, Analysis, and Machine Vision (Thomson, 2008).
  21. MathWorks, Image Processing Toolbox, “Marker-controlled watershed segmentation,” http://www.mathworks.co.kr/products/image/demos.html?file=/products/demos/shipping/images/ipexwatershed.html .
  22. G. K. Kumar, G. V. R. Prasad, and G. Mamatha, “Automatic object searching system based on real time SIFT algorithm,” in 2010 IEEE International Conference on Communication, Control, and Computing Technologies (ICCCCT) (IEEE, 2010), pp. 617–622.
  23. J. Qiu, Y. Lu, T. Huang, and T. Ikenaga, “An FPGA-based real-time hardware accelerator for orientation calculation part in SIFT,” in Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2009, IIH-MSP ’09 (IEEE, 2009), pp. 1334–1337.
  24. K. Li and S. Zhou, “A fast SIFT feature matching algorithm for image registration,” in 2011 International Conference on Multimedia and Signal Processing (CMSP), Vol. 1 (IEEE, 2011), pp. 89–93.
  25. D. Lowe, “Demo software: SIFT Keypoint Detector,” http://www.cs.ubc.ca/~lowe/keypoints .

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited