Matrix optimization problems with orthogonal constraints appear in a variety of application fields including signal and image processing. Several researchers have developed algorithms for orthogonal optimization probl...
详细信息
Matrix optimization problems with orthogonal constraints appear in a variety of application fields including signal and image processing. Several researchers have developed algorithms for orthogonal optimization problems using the Cayley transform that parameterizes the group of orthogonal matrices by the space of skew-symmetric matrices. However those algorithms sometimes have experienced extremely slow progress in their convergence. This paper shows that the slow progress is related to the singular points of the Cayley transform and introduces a simple trick called "pivoting" to circumvent the slow progress.
Digital image processing is an interdisciplinary course, which needs students have a strong background in mathematics. To help them change from passive learning to active learning, teaching reform and innovation of th...
详细信息
Digital image processing is an interdisciplinary course, which needs students have a strong background in mathematics. To help them change from passive learning to active learning, teaching reform and innovation of the course "Digital Image processing Experiments" is discussed in this paper. The combined platform of experiments includes TI DSP experimental box and three different kinds of programming languages. The six experimental projects cover the basic theories of digital image processing. The result can offer a significant reference for the teaching innovations in the other related specialties.
In multi-carrier-frequency Multiple-Input Multiple-Output (MIMO) radar, the separated echoes of a target with high speed locate in neither the same range bin nor the same Doppler bin. As a result, the parameters (incl...
详细信息
In multi-carrier-frequency Multiple-Input Multiple-Output (MIMO) radar, the separated echoes of a target with high speed locate in neither the same range bin nor the same Doppler bin. As a result, the parameters (including range, azimuth and elevation) of the target can't be estimated using the traditional supper-resolution algorithms. A method based on cascaded Keystone transformation is presented to estimate the parameters of the targets moving at a high speed. Keystone transformation is used to correct range migration in the fast-time dimension, and then the Doppler migration is corrected in the slow-time dimension. Finally the Multiple signal Classification (MUSIC) algorithm is applied on the corrected data to obtain the range, azimuth and elevation of targets. The simulation results indicate the feasibility and validity of the methods presented.
Increasingly, multimedia collections are associated with networked communities consisting of interconnected groups of users who create, annotate, browse, search, share, view, critique and remix collection content. Inf...
详细信息
ISBN:
(纸本)9781605588155
Increasingly, multimedia collections are associated with networked communities consisting of interconnected groups of users who create, annotate, browse, search, share, view, critique and remix collection content. Information arises within networked communities via connections among users and in the course of interactions between users and content. Community-derived information can be exploited to improve user access to multimedia. This paper provides a survey of techniques that make use of a combination of three information sources: community-contributed information (e.g., tags and ratings), network structure and techniques for multimedia content analysis. This triple synergy offers a wide range of opportunities for improving access to multimedia in networked communities. We focus our survey on three areas important for multimedia access: annotation, distribution and retrieval. The picture that emerges is promising: information derived from the social community is remarkably effective in improving access to multimedia content, and participation in networked communities has a high payoff. Copyright 2010 ACM.
Support Vector Machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the s...
详细信息
This is the introduction paper to a special session held on ESANN conference 2011. It reviews and highlights recent developments and new direction in information related learning, which is a fastly developing research...
详细信息
ISBN:
(纸本)9782874190445
This is the introduction paper to a special session held on ESANN conference 2011. It reviews and highlights recent developments and new direction in information related learning, which is a fastly developing research area. These algorithms are based on the fundamental principles of information theory and relate them implicitly or explicitly to learning algoithms and strategies.
A bit-plane-based image contour information extracting method for histogram equalized image was proposed in this paper. Firstly, the influence of histogram equalization on bit planes was analyzed and the stability of ...
详细信息
A bit-plane-based image contour information extracting method for histogram equalized image was proposed in this paper. Firstly, the influence of histogram equalization on bit planes was analyzed and the stability of Gray-code-based bit planes was proved. Furthermore, by calculating information entropy, the set of bit planes concluding the main contour information of images was determined. Finally, the procedure and algorithm for extracting effective contour information was described. The experimental results show that the proposed method can provide effective information for rough classification of images.
In many areas of pattern recognition and machine learning, subspace selection is an essential step. Fisher's linear discriminant analysis (LDA) is one of the most well-known linear subspace selection methods. Howe...
详细信息
In many areas of pattern recognition and machine learning, subspace selection is an essential step. Fisher's linear discriminant analysis (LDA) is one of the most well-known linear subspace selection methods. However, LDA suffers from the class separation problem. The projection to a subspace tends to merge close class pairs. A recent result, named maximizing the geometric mean of Kullback-Leibler (KL) divergences of class pairs (MGMD), can significantly reduce the class separation problem. Furthermore, maximizing the harmonic mean of Kullback-Leibler (KL) divergences of class pairs (MHMD) emphasizes smaller divergences more than MGMD, and deals with the class separation problem more effectively. However, in many applications, lab.led data are very limited while unlab.led data can be easily obtained. The estimation of divergences of class pairs is unstable using inadequate lab.led data. To take advantage of unlab.led data for subspace selection, semi-supervised MHMD (SSMHMD) is proposed using graph Laplacian as normalization. Quasi-Newton method is adopted to solve the optimization problem. Experiments on synthetic data and real image data show the validity of SSMHMD.
Detection of shot transitions servers as the preliminary step to video indexing and retrieval. Locally linear embedding (LLE) algorithm fails when it is applied to video with multi-shot. In this paper, we present a ...
详细信息
ISBN:
(纸本)9781424450015
Detection of shot transitions servers as the preliminary step to video indexing and retrieval. Locally linear embedding (LLE) algorithm fails when it is applied to video with multi-shot. In this paper, we present a novel framework of shot transitions detection. The method involves two processes: First we extract the manifold feature of shot transition using LLE through addition of virtual frames on an enriched set, and then they are classified by *** show that the recognition rate of shot transition is reached over 90%.
The primary objective of cooperation in Cognitive Radio (CR) networks is to increase the efficiency and improve the network performance. However, CR users may act destructively and decrease both their own and others...
详细信息
The primary objective of cooperation in Cognitive Radio (CR) networks is to increase the efficiency and improve the network performance. However, CR users may act destructively and decrease both their own and others'' performances. This can be due to Byzantine adversaries or unintentional erroneous conduct in cooperation. This work presents an autonomous cooperation solution for each CR user, i.e., each CR user decides with whom to cooperate. The objective of the proposed solution is to increase the spectrum access in cooperative CR networks. To realize this, a Reinforcement Learning (RL) algorithm is utilized to determine the suitability of the availab.e cooperators and select the appropriate set of cooperators. In addition, the proposed so-lution determines the most appropriate number of cooperators to achieve the highest efficiency for spectrum access. Accordingly, the control communication overhead is reduced. The simulation results demonstrate the learning capabilities of the proposed to achieve reliable behavior under highly unreliable conditions.
暂无评论