119959033
Breast mass segmentation based on information theory
In this study, an information-based algorithm, called c-shells based deterministic annealing (CSDA), is proposed for breast mass segmentation on digital mammograms. CSDA recasts the fuzzy clustering concept into the probability framework and offers two improved features over existing clustering algorithms. First, it is a global minimization algorithm through mass constrained deterministic annealing rather than a local minimization method in the original fuzzy c-shells (FCS) approach. Second, the prototype in this algorithm is shell, which is more effective in segmentation with compact or hollow spherical shells compared to the standard deterministic annealing (DA) algorithm. Experimental results show that the information based CSDA clustering algorithm is a promising image segmentation technique for digital mammographic mass detection.
7983053
Auto-Calibration of a Compound-Type Omnidirectional Camera
We propose a method for auto-calibrating a compound-type omnidirectional camera (system). This camera produces spherical panoramic image through stitching some individual images captured by several modular cameras, each of which covers a different field of view of the full viewing sphere. By auto-calibration we mean that our algorithm works online in a self-calibration manner: it receives as input image point correspondences only, and outputs all the camera parameters. The calibration task consists of lens-distortion-removal, intrinsic-calibration, and relative-orientation. The focus of the paper is an algorithm for automatically removing lens distortion. By exploiting planar projective invariants, our algorithm is capable of estimating centre-of-distortion and distortion parameters efficiently without using any nonlinear iteration.
16763535
Handling Significant Scale Difference for Object Retrieval in a Supermarket
We propose an object retrieval application which can retrieve user specified objects from a big supermarket. Significant and unpredictable scale difference between the query and the database image is the major obstacle encountered. The widely used local invariant features show their deficiency in such an occasion. To improve the situation, we first design a new weighting scheme which can assess the repeatability of local features against scale variance. Also, another method which deals with scale difference through retrieving a query under multiple scales is also developed. Our methods have been tested on a real image database collected from a local supermarket and outperform the existing local invariant feature based image retrieval approaches. A new spatial check method is also briefly discussed.
2447873
Multilabel SVM active learning for image classification
Image classification is an important task in computer vision. However, how to assign suitable labels to images is a subjective matter, especially when some images can be categorized into multiple classes simultaneously. Multilabel image classification focuses on the problem that each image can have one or multiple labels. It is known that manually labelling images is time-consuming and expensive. In order to reduce the human effort of labelling images, especially multilabel images, we proposed a multilabel SVM active learning method. We also proposed two selection strategies: Max Loss strategy and Mean Max Loss strategy. Experimental results on both artificial data and real-world images demonstrated the advantage of proposed method.
17672081
A Sub-Vector Weighting Scheme for Image Retrieval with Relevance Feedback
In image retrieval with relevance feedback, feature components are weighted to reflect the high-level concepts, and a user's subjective perception, embodied in the images labelled by the user in the feedback. However, the number of labelled images is often small and the covariance matrix needed for weighting will be singular. For this reason, the commonly used methods discard the mutual correlation among the feature components completely and use a diagonal covariance matrix. In this paper, a sub-vector weighting scheme is proposed. This scheme partitions a multi-dimensional visual feature vector into multiple low-dimensional sub-vectors. The singularity of the covariance matrix for each sub-vector can be avoided due to the lower dimensionality of the sub-vectors. Thus, the mutual correlation in each sub-vector can be retained for weighting and an optimally weighted similarity metric can be applied on each sub-vector. The similarity scores obtained from different sub-vectors are combined, as the final scor...
34620301
Video Local Pattern based Image Matching for Visual Mapping
Image matching plays an important role in visual mapping, a critical task of vision based mobile robot navigation. Based on the observation that the visual content in these video sequences generally changes in a slow and continuous mode, a concept of "video local pattern" is proposed to model each video frame, which is defined as a set of frames that are visually-similar and temporally-adjacent to that frame. Instead of manually labelling, a tracking based method is developed to automatically detect the local pattern for each frame. A model is then estimated from a local pattern, and the matching of images is performed by comparing these models. Experimental results demonstrated its improvement over that comparing individual frames
12587822
Clustering Research Based on Density Gradient
Cluster analysis, intending to help users understand the natural grouping or structure in a data set, has received a lot of attention in the last few years. Aimed to solve difficult problems in clustering with irregularly distributed data set, a new clustering algorithm based on density gradient is provided. With analysis of density of each point and its neighbors, the algorithm searches points with the maximum density and takes them as centers of original clusters. Then it combines some little clusters into larger clusters according to the distribution of boundary points between neighbor clusters. Experimental results show that the new algorithm has better performance than DBSCAN.
46712099
Side Information Inserted Pilot Tone Transmission for PAPR Reduction in OFDM
In order to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals over fading channels, the selected mapping (SLM) scheme and channel estimation technique can be used. Because of the side information of SLM, however, the data rate decreases in the conventional transmission method. In this letter, to overcome this impairment, we propose a technique which transmits side information by using pilot tones. Numerical analysis and computer simulations show that this method can maintain the PAPR reduction ability of SLM while improving error performance.
6828357
Study on Traffic Information Fusion Algorithm Based on Support Vector Machines
Support vector machine (SVM) is a new sort of machine learning method based on structure risk minimization (SRM) principle, which has high generalization capability. Many problems with small samples, nonlinearity or high dimension in pattern recognition could be solved by the method. In this paper, the traffic data on freeway were taken as research objects and an information fusion algorithm based on SVM about freeway incident detection was proposed. A SVM was trained and tested using the data obtained from the simulation under the condition of incident and non-incident. Compared with the multi-layer feed forward neural network (MLF) algorithm trained with the same data, the simulation results showed that the SVM offers a lower misclassification rate, higher correct detection rate and lower false alarm, and it can improve the detection performance
16065929
Adaptive reduced-rank LCMV beamforming algorithms based on joint iterative optimization of filters: Design and analysis
This paper presents reduced-rank linearly constrained minimum variance (LCMV) beamforming algorithms based on joint iterative optimization of filters. The proposed reduced-rank scheme is based on a constrained joint iterative optimization of filters according to the minimum variance criterion. The proposed optimization procedure adjusts the parameters of a projection matrix and an adaptive reduced-rank filter that operates at the output of the bank of filters. We describe LCMV expressions for the design of the projection matrix and the reduced-rank filter. We then describe stochastic gradient and develop recursive least-squares adaptive algorithms for their efficient implementation along with automatic rank selection techniques. An analysis of the stability and the convergence properties of the proposed algorithms is presented and semi-analytical expressions are derived for predicting their mean squared error (MSE) performance. Simulations for a beamforming application show that the proposed scheme and algorithms outperform in convergence and tracking the existing full-rank and reduced-rank algorithms while requiring comparable complexity.
12523556
Design Patterns of Scalable Cluster System Software
The design pattern of cluster system software has an important influence on scalability of massive cluster system. The paper presents design patterns of scalable cluster system software, including scalable software topologies and optimized communication modes. These design patterns have been widely applied in Dawning series of supercomputers and some results of performance evaluation show their good scalability