iosr-JECE   Volume-10 ~ Issue-2 ~ March-April 2015

Abstract: This paper presents a new approach for image segmentation by applying k-means algorithm. In image segmentation, clustering algorithms are very popular as they are intuitive and are also easy to implement. The K-means clustering algorithm is one of the most widely used algorithm in the literature, and many authors successfully compare their new proposal with the results achieved by the k-Means. This paper proposes a color-based segmentation method that uses K-means clustering technique. The k-means algorithm is an iterative technique used to partition an image into k clusters. The standard K-Means algorithm produces accurate segmentation results only when applied to images defined by homogenous regions with respect to texture and color since no local constraints are applied to impose spatial continuity. At first, the pixels are clustered based on their color and spatial features, where the clustering process is accomplished. Then the clustered blocks are merged to a specific number of regions. This approach thus provides a feasible new solution for image segmentation which may be helpful in image retrieval. The experimental results clarify the effectiveness of our approach to improve the segmentation quality in aspects of precision and computational time. The simulation results demonstrate that the proposed algorithm is promising.

Keywords: K-means Algorithm, Clustering, local minimum, global minimum, Segmentation.

[1] J. A. Hartigan and M. A. Wong, "A K-Means Clustering Algorithm", Journal of the Royal Statistical Society. Series C (Applied Statistics), Vol. 28, No. 1 (1979), pp. 100-108

[2] S. P. Lloyd, "Least squares quantization in PCM", IEEE Trans. Inf.Theory, vol. IT-28, no. 2, pp. 129–136, Mar.1982.

[3] 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.

[4] S.Mary Praveena and Dr.IlaVennila, "Optimization Fusion Approach for Image Segmentation using K-Means Algorithm", International Journal of Computer Applications (0975 – 8887) Volume 2 – No.7, June 2010

[5] M. Brindha and M. Annie Flora, "A Label Field Fusion Using ICM Optimization in Image Segmentation", IJMIE, volume 2, issue 12, ISSN: 2249-0558, December 2012.

[6] Julian Besag, "On the Statistical Analysis of Dirty Pictures",Journal of the Royal Statistical Society, Series B (Methodological), Vol. 48, No. 3. (1986), pp. 259-302.

Abstract: Voice over Internet Protocol (VoIP) has been an interactive subject chosen by most studies. The increase of using Real Time Applications service such as (VoIP) is resulting in the high growth of Telecom and broadband field to meet the request of providing high quality of VoIP at any place, the prime Goal of this paper is to analyze and evaluate of an appropriate voice (CODEC) schemes depending on the Quality of service (QoS) of VoIP in Universal Mobile Telecommunication system (UMTS), network was implemented in OPNET Modeler 14.5. The quality is evaluated based on some QoS parameters such as Jitter , MOS, end-to-end delay and packet loss to investigate the performance of different codecs QoS scheme in UMTS VoIP network. The VoIP codecs used in the measurements of QoS are: G.711, G.723.1, GSM-FR and G.729A. Simulations showed that G.711 and GSM-FR are the best schemes provide best quality of voice. G.723.1 can be selected and use in UMTS depending on conditions. The results analyzed and the performance evaluated will give network Planners an opportunity to select the codec for VoIP performance enhancement which lead to the satisfactions of customers .

1] T. Wallingford, "Switching to VoIP", Publisher: O'Reilly, ISBN: 0-596-00868-6, Pub Date: June 2005

[2] A. Samukic, UMTS Universal Mobile Telecommunications System Development of Standards for the Third Generation, 1998

[3] T. Kwok, "Residential broadband Internet services and applications requirements" Communi- cations Magazine, IEEE Volume 35, Issue 6, June1997 Page(s):76 - 83

[4] S. Jadhav, Z. Haibo and H. Zhiyi, Performance E valuation of Quality of VoIP in WiMAX and UMTS, 12th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2011, pp. 375380.

[5] C. Jianguo and M. Gregory, Performance Evaluation of VoIP Services using Different CODECs over a UMTS Network, Australasian Telecommunication Networks and Applications Conference (ATNAC), 2008, pp. 6771.

[6] Hira Sathu and Mohib A. Shah. Performance Comparison of VoIP Codecs on Multiple Operating Systems using IPv4 and IPv6 International Journal of e-Education, Vol. 2, No. 2, April 2012

Abstract: The Universal Mobile Telecommunication systems are one of the very important cellular phone technologies which are known as the 3G systems. It support the high speed data transfer, speech, web browsing, email, video telephony, multimedia and the audio streaming. The expected growth in real time application requires efficient spectrum usage. In UMTS, users share the same frequency. Thus, one user will cause interference for other users in the system. New users will only be granted access to the network if they do not cause too much interference for already active users. The idea is that it is much better to block the access of a user to the network than having to drop already active users. Such decisions are made by the admission control. In this paper, applying Admission control algorithm are studied in multiples scenarios with three levels of load, low load, medium load and high load compared. The aim is to compare the efficiency of the admission control algorithm to demonstrate the alternative, FTP performance via admission control algorithm and compare its performance against the performance of the default algorithm of the network. The scenarios implemented in the OPNET Modeler 14.5. Based on the obtained result, the throughput -based admission control algorithm performed better than the default admission control algorithm for the given network and configuration ,in the terms of application traffic throughput and application response time.

[1] R. Ramjee, D. Towsley, and R. Nagarajan, "On optimal call admission control in cellular networks," ACMWireless Networks, vol. 3, pp. 29–41, 1997

[2] A. Samukic, UMTS Universal Mobile Telecommunications System Development of Standards for the Third Generation, 1998

[3] M. H. Ahmed, "Call admission control in wireless networks: A comprehensive survey," IEEE Communications Surveys & Tutorials, vol. 7, no. 1, pp. 50–59, Jul. 2005.

[4] P. Frenger, S. Parkvall, and E. Dahlman, "Performance comparison of HARQ with chase combining and incremental redundancy for HSDPA," in Proc. of IEEE VTC Fall '01, Vancouver, Canada, Sep. 2001, pp. 1829–1833.

[5] H. Holma and J. Laakso, "Uplink Admission Control and Soft Capacity withMUD in CDMA," in Proc. of IEEE VTC Fall '99, vol. 1, Amsterdam, The Netherlands, Sep. 1999, pp. 431–435.

[6] Bernhard H. Walke, "Mobile Radio Networks", Second Edition, Wiley, 2002