2006 International Conference on Advanced Computing and Communications最新文献_第6页

A novel Adaptive class of Decision based Non-linear Rank-ordered Filters for the Restoration of Impulse corrupted digital images 一种基于决策的自适应非线性秩序滤波器用于脉冲损坏数字图像的恢复

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289968

J. Varghese

引用次数: 1

Development of Novel Fast Block Based Trace Mean Correspondence Algorithm for Face Tracking 基于快速分块的人脸跟踪均值对应算法的发展

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289896

Y. P. Gowramma, C. N. Ravikumar

{"title":"Development of Novel Fast Block Based Trace Mean Correspondence Algorithm for Face Tracking","authors":"Y. P. Gowramma, C. N. Ravikumar","doi":"10.1109/ADCOM.2006.4289896","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289896","url":null,"abstract":"We propose a novel computationally efficient correspondence algorithm to identify the correspondence of similar features of the reference frame to search frame in the dynamic image sequence analysis for face tracking. The correspondence of the features between the set of images is the central problem in computer vision(CV), image analysis(IA) and pattern recognition(PR). In these areas correspondence of features is the combinatorial explosion problem or NP-hard, because of their exhaustive searching for features in the sequence of image frames. This correspondence has three major steps such as segmentation, feature extraction and matching. In this paper we propose block-based segmentation in which the frame which contains the face to be track can be segmented as window of size 20*20 which covers the face. Here we consider the window trace mean is the feature since this is rotation invariant and it covers all the rows and columns of the window and it reduces the dimensionality and finally for matching we used the minimum absolute difference method which does not involves more computations since no multiplication operation is involved. We restrict the searching space to [-3,+3] pixels horizontally and vertically in the search image. Experimental results show that this novel algorithm could achieve much higher computational reduction as compared with full search (FS), diamond search (DS) (Tham et al., 1998 ), cross diamond search (CDS)(Cheung & Po, 2002) and area based correspondence (Gowramma & Kumar, 2006) algorithm for face tracking image sequence while similar prediction accuracy is maintained and it is especially suitable for video conferencing and slow moving dynamic image sequence.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134366819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Quantification of Finite Word Length Effects in Filter Banks and Wavelet Transform 滤波器组有限字长效应的量化与小波变换

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289910

G. Snehal, Dr. T. Srikanth

引用次数: 0

Automatic modelling of protein 3D structure Nucleoplasmin-like viral coat protein from Cucumber mosaic virus 黄瓜花叶病毒核纤溶蛋白样病毒外壳蛋白的三维结构自动建模

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289965

V. Gomase, J. P. Tandale, S. Patil, K. Kale

引用次数: 7

A New Proposed Method for Image Segmentation Based on Gray Scale Morphological Transformations 一种基于灰度形态变换的图像分割新方法

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289966

C. Nagaraju, V.V. Kumar

引用次数: 1

Fractal image compression performance synthesis through HV partitioning 基于HV分割的分形图像压缩性能综合

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289976

W.S. Rajkumar, M. Kulkarni, M. Dhore, S. Mali

引用次数: 1

Wavelet based texture analysis of Liver tumor from Computed Tomography images for characterization using Linear Vector Quantization Neural Network 基于小波的肝肿瘤图像纹理分析及线性矢量量化神经网络表征

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289897

K. Mala, Dr. V. Sadasivam

引用次数: 28

An Efficient Heuristic Algorithm for QoS-Driven Multicast Tree Generation 一种高效的启发式qos驱动组播树生成算法

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289926

M. R. Kabat, S. K. Mohanty, R. Mall, C. Tripathy

引用次数: 0

Grooming of Survivable Multicast Sessions Against Single Link Failures in Sparse Splitting WDM Mesh Networks 稀疏分割WDM网状网络中针对单链路故障的存活组播会话疏导

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289927

N. Sreenath, B. Palanisamy, S. Nadarajan

{"title":"Grooming of Survivable Multicast Sessions Against Single Link Failures in Sparse Splitting WDM Mesh Networks","authors":"N. Sreenath, B. Palanisamy, S. Nadarajan","doi":"10.1109/ADCOM.2006.4289927","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289927","url":null,"abstract":"Cost effective grooming of several sessions with fractional wavelength bandwidth onto a single wavelength has become prominent in WDM networks. We, in this paper, address the problem of survivable routing and wavelength assignment of multicast sessions with sub-wavelength traffic demands in sparse splitting WDM networks. We assume a sparse splitting node architecture in which only a few nodes in the network are split-capable. A node with splitting capability can forward an incoming message to more than one outgoing link in the optical form. The multicast capability at the non-split nodes can be achieved by converting the optical signal into electronic form and transmitting in optical form onto all the required outgoing links. However, the traffic duplication at the electronic level is more expensive than the optical level in terms of the delay incurred due to the optical-electronic-optical (O/E/O) conversion. Since the multicast traffic grooming problem is computationally intractable, we adopt a heuristic approach called VSGroom which tries to minimize the resources required for electronic copying. We extend the notion of link disjoint, arc disjoint and path disjoint protection methodologies to groomed multicast sessions in order to protect them from single link failures. The performance of the various protection algorithms is studied and compared through extensive simulation experiments.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124217738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Fault-tolerant Video on Demand in RSerPool Architecture RSerPool架构中的视频点播容错

2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289950

A. Maharana, G. Rathna

{"title":"Fault-tolerant Video on Demand in RSerPool Architecture","authors":"A. Maharana, G. Rathna","doi":"10.1109/ADCOM.2006.4289950","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289950","url":null,"abstract":"With the advent of Internet, video over IP is gaining popularity. In such an environment, scalability and fault tolerance will be the key issues. Existing video on demand (VoD) service systems are usually neither scalable nor tolerant to server faults and hence fail to comply to multi-user, failure-prone networks such as the Internet. Current research areas concerning VoD often focus on increasing the throughput and reliability of single server, but rarely addresses the smooth provision of service during server as well as network failures. Reliable Server Pooling (RSerPool), being capable of providing high availability by using multiple redundant servers as single source point, can be a solution to overcome the above failures. During a possible server failure, the continuity of service is retained by another server. In order to achieve transparent failover, efficient state sharing is an important requirement. In this paper, we present an elegant, simple, efficient and scalable approach which has been developed to facilitate the transfer of state by the client itself, using extended cookie mechanism, which ensures that there is no noticeable change in disruption or the video quality.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127791862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9