CFP last date
20 January 2025
Reseach Article

A Localized Region based Active Contour Method for Image Segmentation using Dynamic Threshold

by Gajendra Kumar Sharma, Shashi Sharma
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 166 - Number 10
Year of Publication: 2017
Authors: Gajendra Kumar Sharma, Shashi Sharma
10.5120/ijca2017914133

Gajendra Kumar Sharma, Shashi Sharma . A Localized Region based Active Contour Method for Image Segmentation using Dynamic Threshold. International Journal of Computer Applications. 166, 10 ( May 2017), 31-35. DOI=10.5120/ijca2017914133

@article{ 10.5120/ijca2017914133,
author = { Gajendra Kumar Sharma, Shashi Sharma },
title = { A Localized Region based Active Contour Method for Image Segmentation using Dynamic Threshold },
journal = { International Journal of Computer Applications },
issue_date = { May 2017 },
volume = { 166 },
number = { 10 },
month = { May },
year = { 2017 },
issn = { 0975-8887 },
pages = { 31-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume166/number10/27707-2017914133/ },
doi = { 10.5120/ijca2017914133 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:13:21.396111+05:30
%A Gajendra Kumar Sharma
%A Shashi Sharma
%T A Localized Region based Active Contour Method for Image Segmentation using Dynamic Threshold
%J International Journal of Computer Applications
%@ 0975-8887
%V 166
%N 10
%P 31-35
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Image segmentation is a fundamental image preparing approach this is utilized to research what is the component of the image graph. Image segmentation is utilized to part an image into various "huge" segments. The paper basically offers with surface segmentation while actualities pixel end up noticeably given mixed and blended error diminished so it could be one of the issues to manage likewise. It will be fundamentally constructed absolutely in light of segmentation of substance basically construct generally in light of the edge and we will show it in implementation how results alterations as consistent with a substitute in threshold values. Everything about pixels in a round is commensurable with the record to a couple of appropriate or registered resources, quiet with shading, intensity or surface Graph lessen calculations are effectively connected to a broad scope of issues in innovative and farsighted and images. Here we utilized this dynamic threshold procedure to improve the image segmentation inconvenience. What's more, we were given achievement results in apportioning an in the image. In this paper, we utilize the standardized reduce method technique to do the segmentation of a image graph. In this method; we utilize a computational system in view of the threshold esteem changes progressively and eigenvectors to get an improved sectioned image. We have completed this strategy to portion the static images. The experiment on probe images demonstrate that: our proposed approach can decrease the quantity of iterations, which prompts a huge diminishment in the computational cost while accomplishing comparative levels of accuracy. The approach additionally functions admirably when connected to image segmentation.

References
  1. L. Lazos, R. Poovendran, and J. A. Ritcey, Analytic evaluation of target detection in eterogeneous wireless sensor networks,” ACM Trans. Sensor Networks, vol. 5, no. 2, pp. 1–38, March 2013.
  2. J. Jeong, Y. Gu, T. He, and D. Du, “VISA: Virtual Scanning Algorithm for Dynamic Protection of Road Networks,” in Proc. of 28th IEEE Conference on Computer Communications (INFOCOM 09), Rio de Janeiro, Brazil, April 2009.Fröhlich, B. and Plate, J. 2000. The cubic mouse: a new device for three-dimensional input. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
  3. G. Lu, N. Sadagopan, B. Krishnamachari, and A. Goel, “Delay Efficient Sleep Scheduling in Wireless Sensor Networks,” in INFOCOM. IEEE, 2005.
  4. Q. Cao, T. Abdelzaher, T. He, and J. Stankovic, “Towards Optimal Sleep Scheduling in Sensor Networks for Rare Event Detection ,” in IPSN. ACM/IEEE, 2005.
  5. D. Tian and N. Georganas, “A Node Scheduling Scheme for Energy Conservation in Large Wireless Sensor Networks,” Wireless Communications and Mobile Computing Journal, May 2011.
  6. C. Gui and P. Mohapatra, “Power Conservation and Quality of Surveillance in Target Tracking Sensor Networks,” in MOBICOM. Philadelphia, PA, USA: ACM, Sep. 2004.
  7. M. Mar ´oti, B. Kusy, G. Simon, and ´AkosL´edeczi, “The Flooding Time Synchronization Protocol,” in SENSYS. Baltimore, Maryland, USA: ACM, Nov. 2004.
  8. L. Lazos, R. Poovendran, and J. A. Ritcey, Analytic evaluation of target detection in eterogeneous wireless sensor networks,” ACM Trans. Sensor Networks, vol. 5, no. 2, pp. 1–38, March 2013.
  9. J. Hwang, T. He, and Y. Kim, “Exploring In-Situ Sensing Irregularity in Wireless Sensor Networks,” in SENSYS. ACM, Nov. 2014, pp. 289–303.
  10. Y. Gu and T. He, “Data Forwarding in Extremely Low Duty-Cycle Sensor Networks with Unreliable Communication Links,” in SENSYS. Sydney, Australia: ACM, Nov. 2007, pp. 321–334.
  11. J.Shi and J.Malik, “Normalized cuts and image segmentation “IEEE Trans. pattern Anal. Mach. Intell. Vol. 22, no.8, pp. 888-905,Aug 2000
  12. W.Tao,H. Jin, and Y. Zhang,”Color image segmentation based on mean shift and normalizedcuts,”IEEE Trans.Syst.,Man, Cybern. B, Cybern., vol.37,no.5, pp. 1382–1389, Oct.2007.
  13. W.Tao, H.Jin, and Y. Zhang ”Image Thresholding using Graph cut ”IEEE Trans.pattern And Vol 38,No5,pp.1181-1195,Sep2008
  14. http://en.wikipedia.org/wiki/Graph-cut
  15. http: // en. Wikipedia .org / wiki / Graph _ cuts _ in _ computer _ vision
  16. Comaniciu, D. and Meer, P. 1997. Robust analysis of feature spaces: Color image segmentation. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp.750–755.
Index Terms

Computer Science
Information Sciences

Keywords

Image segmentation Edge-Based Segmentation Clustering method gradient