No abstract

No abstract

A number of measures of canonical correlation coefficient are now used in multimedia related fields like object recognition, image segmentation facial expression recognition and pattern recognition in the different literature. Some robust forms of classical canonical correlation coefficient are introduced recently to address the robustness issue of the canonical coefficient in the presence of outliers and departure from normality. Also a few number of kernels are used in canonical analysis to capture nonlinear relationship in data space, which is linear in some higher dimensional feature space. But not much work has been done to investigate their relative performances through i) simulation from the view point of sensitivity, breakdown analysis as well as ii) using real data sets. In this paper an attempt has been made to compare performances of kernel canonical correlation coefficients (Gaussian function, Laplacian function and Polynomial function) with that of robust and classical canonical correlation coefficient measures using simulation with five sample sizes (50, 500, 1000, 1500 and 2000), influence function, breakdown point along with several real data and a multi-modal data sets, focusing on the specific case of segmented images with associated text. We investigate the bias, mean square error(MISE), qualitative robustness index (RI), sensitivity curve of each estimator under a variety of situations and also employ box plots and scatter plots of canonical variates to judge their performances. We have observed that the class of kernel estimators perform better than the class of classical and robust estimators in general and the kernel estimator with Laplacian function has shown the best performance for large sample size and break down is high in case of nonlinear data.

No abstract

No abstract

In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for admission control of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. The proposed routing algorithm is a combination of source and distributed routing. However, in the previous research, we only considered the time delay for the routing. Also, QoS and congestion control parameters were considered just as indicators of QoS satisfication and congestion. In this work, we extend our previous work by proposing and implementing new algorithms based on fuzzy logic and genetic algorithm which use for admission control and routing many QoS parameters. Also, we evaluate by simulations the performance of the network extraction topology algorithm which reduces the search space of the proposed GA-based routing approach. Thus, the GA can find a feasible route very fast.

No abstract

No abstract