Image Segmentation Using Stake-Denotes Algorithm

Abstract

In this paper, we present stake k-mean fragmentation and regions tracking model, which aims at combining color, texture, pattern, and motion features. in the first the stake algorithm segmented the objects which are tracking and realized them ;second the global motion of the video sequence is estimated and compensated with presenting algorithms. The spatio-temporal map is updated and compensated using stake fragmentation model to keep consistency in video objects tracking. The Stake algorithm considers the stakes’ placement which should be located as far as possible from each other to withstand against the pressure distribution of a roof, as identical to the number of centroidsamongst the data distribution. This algorithm is able to optimize the K-means clustering for icon fragmentation in aspects of precision and computation time. It designates the initial cancroids’ positions by calculating the accumulated distance metric between each data point and all previous cancroids, and then selects data points which have the maximum distance as new initial cancroids. This project presents a new approach for icon fragmentation by applying Stake-Kmeans algorithm. This fragmentation process includes a new mechanism for clustering the elements of highresolution icons in order to improve precision and reduce computation time. The system applies K-means clustering to the icon fragmentation after optimized by Stake Algorithm. This algorithm distributes all initial centroids according to the maximum accumulated distance metric.

Authors and Affiliations

Manohar Bammidi, V. Jeevan Kumar

Keywords

Related Articles

Comparing Tesseract results with and without Character localization for Smartphone application

Tesseract is considered the most accurate free OCR engine in existence. Android operating system based Smartphones application where images taken from camera of mobile device or browsed from gallery are preprocessed....

Responsive Transmitting For Mobile Adhoc Network Routing Topology

Cooperative communication as became most important research topic for the people in wireless network. Most of the works focuses on the data link layer and physical layer where as ignorance of other layer and network...

New Approaches of Ranking Queries in Uncertain Databases

New applications such as sensor data monitoring and mobile device tracking, rise up the issue of uncertain data management. Compared to “certain” data, the data in the uncertain database are not exact points, which, i...

Automated Sentiment Analysis System Using Machine Learning Algorithms

Sentiment analysis can be very useful for business if employed correctly. In this article, I will attempt to demystify the process, provide context, and offer some concrete examples of how businesses can utilize it....

Essentiality of Localized On-demand Link State (LOLS) Routing in IP Network

Network failure is the complete or partial failure of network component or components. The techniques like Failure Carrying Packet (FCP), Tunneling, Packet Re-cycling (PR), Multiple Routing Configuration (MRC) etc ha...

Download PDF file
  • EP ID EP27628
  • DOI -
  • Views 306
  • Downloads 4

How To Cite

Manohar Bammidi, V. Jeevan Kumar (2013). Image Segmentation Using Stake-Denotes Algorithm. International Journal of Research in Computer and Communication Technology, 2(8), -. https://europub.co.uk/articles/-A-27628