Kooperativer Bibliotheksverbund

Berlin Brandenburg

Language
Preferred search index
Number of Hits per Page
Default Sort Criterion
Default Sort Ordering
Size of Search History
Default Export Format
Default Export Encoding
Facet list arrangement
Maximum number of values per filter
Auto Completion
Feed Format
Maximum Number of Items per Feed
Search in libraries
and
and

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • computing and processing
Type of Medium
Language
Year
  • 1
    Language: English
    In: IEEE Transactions on Knowledge and Data Engineering, 01 November 2016, Vol.28(11), pp.2884-2894
    Description: In this study, we propose a novel vector quantization algorithm for Approximate Nearest Neighbor (ANN) search, based on a joint competitive learning strategy and hence called as competitive quantization (CompQ). CompQ is a hierarchical algorithm, which iteratively minimizes the quantization error by jointly optimizing the codebooks in each layer, using a gradient decent approach. An extensive set of experimental results and comparative evaluations show that CompQ outperforms the-state-of-the-art while retaining a comparable computational complexity.
    Keywords: Vector Quantization ; Encoding ; Optimization ; Hamming Distance ; Electronic Mail ; Nearest Neighbor Searches ; Approximate Nearest Neighbor Search ; Binary Codes ; Large-Scale Retrieval ; Vector Quantization ; Engineering ; Computer Science
    ISSN: 1041-4347
    E-ISSN: 1558-2191
    Source: IEEE Conference Publications
    Source: IEEE Journals & Magazines 
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Language: English
    In: IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), August 2012, Vol.42(4), pp.1169-1186
    Description: Terrain classification over polarimetric synthetic aperture radar (SAR) images has been an active research field where several features and classifiers have been proposed up to date. However, some key questions, e.g., 1) how to select certain features so as to achieve highest discrimination over certain classes?, 2) how to combine them in the most effective way?, 3) which distance metric to apply?, 4) how to find the optimal classifier configuration for the classification problem in hand?, 5) how to scale/adapt the classifier if large number of classes/features are present?, and finally, 6) how to train the classifier efficiently to maximize the classification accuracy?, still remain unanswered. In this paper, we propose a collective network of (evolutionary) binary classifier (CNBC) framework to address all these problems and to achieve high classification performance. The CNBC framework adapts a "Divide and Conquer" type approach by allocating several NBCs to discriminate each class and performs evolutionary search to find the optimal BC in each NBC. In such an (incremental) evolution session, the CNBC body can further dynamically adapt itself with each new incoming class/feature set without a full-scale retraining or reconfiguration. Both visual and numerical performance evaluations of the proposed framework over two benchmark SAR images demonstrate its superiority and a significant performance gap against several major classifiers in this field.
    Keywords: Neurons ; Scattering ; Covariance Matrix ; Training ; Matrix Decomposition ; Indexes ; Measurement ; Evolutionary Classifiers ; Multidimensional Particle Swarm Optimization (MD-Pso) ; Polarimetric Synthetic Aperture Radar (SAR) ; Sciences (General) ; Engineering
    ISSN: 1083-4419
    E-ISSN: 1941-0492
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Language: English
    In: IEEE Transactions on Knowledge and Data Engineering, 01 July 2016, Vol.28(7), pp.1722-1733
    Description: Approximate Nearest Neighbor (ANN) search has become a popular approach for performing fast and efficient retrieval on very large-scale datasets in recent years, as the size and dimension of data grow continuously. In this paper, we propose a novel vector quantization method for ANN search which enables faster and more accurate retrieval on publicly available datasets. We define vector quantization as a multiple affine subspace learning problem and explore the quantization centroids on multiple affine subspaces. We propose an iterative approach to minimize the quantization error in order to create a novel quantization scheme, which outperforms the state-of-the-art algorithms. The computational cost of our method is also comparable to that of the competing methods.
    Keywords: Principal Component Analysis ; Artificial Neural Networks ; Vector Quantization ; Iterative Methods ; Encoding ; Nearest Neighbor Searches ; Approximate Nearest Neighbor Search ; Binary Codes ; Large-Scale Retrieval ; Subspace Clustering ; Vector Quantization ; Engineering ; Computer Science
    ISSN: 1041-4347
    E-ISSN: 1558-2191
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Language: English
    In: IEEE Transactions on Neural Networks and Learning Systems, December 2016, Vol.27(12), pp.2458-2471
    Description: In training radial basis function neural networks (RBFNNs), the locations of Gaussian neurons are commonly determined by clustering. Training inputs can be clustered on a fully unsupervised manner (input clustering), or some supervision can be introduced, for example, by concatenating the input vectors with weighted output vectors (input-output clustering). In this paper, we propose to apply clustering separately for each class (class-specific clustering). The idea has been used in some previous works, but without evaluating the benefits of the approach. We compare the class-specific, input, and input-output clustering approaches in terms of classification performance and computational efficiency when training RBFNNs. To accomplish this objective, we apply three different clustering algorithms and conduct experiments on 25 benchmark data sets. We show that the class-specific approach significantly reduces the overall complexity of the clustering, and our experimental results demonstrate that it can also lead to a significant gain in the classification performance, especially for the networks with a relatively few Gaussian neurons. Among other applied clustering algorithms, we combine, for the first time, a dynamic evolutionary optimization method, multidimensional particle swarm optimization, and the class-specific clustering to optimize the number of cluster centroids and their locations.
    Keywords: Training ; Neurons ; Clustering Algorithms ; Optimization ; Neural Networks ; Heuristic Algorithms ; Particle Swarm Optimization ; Clustering Methods ; Particle Swarm Optimization (Pso) ; Radial Basis Function Networks (Rbfnns) ; Supervised Learning ; Computer Science
    ISSN: 2162-237X
    E-ISSN: 2162-2388
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Language: English
    In: IEEE Transactions on Neural Networks and Learning Systems, 31 May 2019, pp.1-15
    Description: The traditional multilayer perceptron (MLP) using a McCulloch-Pitts neuron model is inherently limited to a set of neuronal activities, i.e., linear weighted sum followed by nonlinear thresholding step. Previously, generalized operational perceptron (GOP) was proposed to extend the conventional perceptron model by defining a diverse set of neuronal activities to imitate a generalized model of biological neurons. Together with GOP, a progressive operational perceptron (POP) algorithm was proposed to optimize a predefined template of multiple homogeneous layers in a layerwise manner. In this paper, we propose an efficient algorithm to learn a compact, fully heterogeneous multilayer network that allows each individual neuron, regardless of the layer, to have distinct characteristics. Based on the complexity of the problem, the proposed algorithm operates in a progressive manner on a neuronal level, searching for a compact topology, not only in terms of depth but also width, i.e., the number of neurons in each layer. The proposed algorithm is shown to outperform other related learning methods in extensive experiments on several classification problems.
    Keywords: Neurons ; Biological Neural Networks ; Network Topology ; Learning Systems ; Topology ; Computational Modeling ; Nonhomogeneous Media ; Architecture Learning ; Feedforward Network ; Generalized Operational Perceptron (GOP) ; Progressive Learning ; Computer Science
    ISSN: 2162-237X
    E-ISSN: 2162-2388
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Language: English
    In: IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society, April 2010, Vol.40(2), pp.298-319
    Description: In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakthrough over complex multimodal optimization problems at high dimensions. The first one, which is the so-called multidimensional (MD) PSO, re-forms the native structure of swarm particles in such a way that they can make interdimensional passes with a dedicated dimensional PSO process. Therefore, in an MD search space, where the optimum dimension is unknown, swarm particles can seek both positional and dimensional optima. This eventually removes the necessity of setting a fixed dimension a priori, which is a common drawback for the family of swarm optimizers. Nevertheless, MD PSO is still susceptible to premature convergences due to lack of divergence. Among many PSO variants in the literature, none yields a robust solution, particularly over multimodal complex problems at high dimensions. To address this problem, we propose the fractional global best formation (FGBF) technique, which basically collects all the best dimensional components and fractionally creates an artificial global best (aGB) particle that has the potential to be a better "guide" than the PSO's native gbest particle. This way, the potential diversity that is present among the dimensions of swarm particles can be efficiently used within the aGB particle. We investigated both individual and mutual applications of the proposed techniques over the following two well-known domains: 1) nonlinear function minimization and 2) data clustering. An extensive set of experiments shows that in both application domains, MD PSO with FGBF exhibits an impressive speed gain and converges to the global optima at the true dimension regardless of the search space dimension, swarm size, and the complexity of the problem.
    Keywords: Particle Swarm Optimization ; Multidimensional Systems ; Organisms ; Genetic Programming ; Particle Tracking ; Robustness ; Stochastic Processes ; Multidimensional Signal Processing ; Computer Simulation ; Fractional Global Best Formation (Fgbf) ; Multidimensional (MD) Search ; Particle Swarm Optimization (Pso) ; Sciences (General) ; Engineering;
    ISSN: 10834419
    E-ISSN: 1941-0492
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Language: English
    In: IEEE Transactions on Neural Systems and Rehabilitation Engineering, March 2016, Vol.24(3), pp.386-398
    Description: In this paper, the performance of the phase space representation in interpreting the underlying dynamics of epileptic seizures is investigated and a novel patient-specific seizure detection approach is proposed based on the dynamics of EEG signals. To accomplish this, the trajectories of seizure and nonseizure segments are reconstructed in a high dimensional space using time-delay embedding method. Afterwards, Principal Component Analysis (PCA) was used in order to reduce the dimension of the reconstructed phase spaces. The geometry of the trajectories in the lower dimensions is then characterized using Poincaré section and seven features were extracted from the obtained intersection sequence. Once the features are formed, they are fed into a two-layer classification scheme, comprising the Linear Discriminant Analysis (LDA) and Naive Bayesian classifiers. The performance of the proposed method is then evaluated over the CHB-MIT benchmark database and the proposed approach achieved 88.27% sensitivity and 93.21% specificity on average with 25% training data. Finally, we perform comparative performance evaluations against the state-of-the-art methods in this domain which demonstrate the superiority of the proposed method.
    Keywords: Electroencephalography ; Feature Extraction ; Trajectory ; Nonlinear Dynamical Systems ; Epilepsy ; Geometry ; Benchmark Testing ; Dynamics ; Electroencephalography (EEG) ; Phase Space ; Poincaré Section ; Seizure Detection ; Two-Layer Classifier Topology ; Occupational Therapy & Rehabilitation
    ISSN: 1534-4320
    E-ISSN: 1558-0210
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Language: English
    In: 2014 5th European Workshop on Visual Information Processing (EUVIP), December 2014, pp.1-6
    Description: Several existing content-based image retrieval and classification systems rely on low-level features which are automatically extracted from images. However, often these features lack the discrimination power needed for accurate description of the image content and hence they may lead to a poor retrieval or classification performance. This article applies an evolutionary feature synthesis method based on multi-dimensional particle swarm optimization on low-level image features to enhance their discrimination ability. The proposed method can be applied on any database and low-level features as long as some ground-truth information is available. Content-based image retrieval experiments show that a significant performance improvement can be achieved.
    Keywords: Vectors ; Feature Extraction ; Synthesizers ; Particle Swarm Optimization ; Training ; Databases ; Transforms ; Content-Based Image Retrieval ; Evolutionary Feature Synthesis ; Multi-Dimensional Particle Swarm Optimization
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Language: English
    In: 2010 20th International Conference on Pattern Recognition, August 2010, pp.4324-4327
    Description: This paper proposes an evolutionary RBF network classifier for polar metric synthetic aperture radar ( SAR) images. The proposed feature extraction process utilizes the full covariance matrix, the gray level co-occurrence matrix (GLCM) based texture features, and the backscattering power (Span) combined with the H/α/A decomposition, which are projected onto a lower dimensional feature space using principal component analysis. An experimental study is performed using the fully polar metric San Francisco Bay data set acquired by the NASA/Jet Propulsion Laboratory Airborne SAR (AIRSAR) at L-band to evaluate the performance of the proposed classifier. Classification results (in terms of confusion matrix, overall accuracy and classification map) compared to the Wish art and a recent NN-based classifiers demonstrate the effectiveness of the proposed algorithm.
    Keywords: Classification Algorithms ; Scattering ; Artificial Neural Networks ; Covariance Matrix ; Radial Basis Function Networks ; Testing ; Accuracy ; Polarimetric Synthetic Aperture Radar ; Radial Basis Function Network ; Particle Swarm Optimization ; Dynamic Clustering ; Engineering ; Computer Science
    ISBN: 9781424475421
    ISBN: 1424475422
    ISSN: 10514651
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Source: IEEE Journals & Magazines 
    Source: IEEE eBooks
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Language: English
    In: 2016 23rd International Conference on Pattern Recognition (ICPR), December 2016, pp.3769-3774
    Description: In this paper, we propose a graph affinity learning method for a recently proposed graph-based salient object detection method, namely Extended Quantum Cuts (EQCut). We exploit the fact that the output of EQCut is differentiable with respect to graph affinities, in order to optimize linear combination coefficients and parameters of several differentiable affinity functions by applying error backpropagation. We show that the learnt linear combination of affinities improves the performance over the baseline method and achieves comparable (or even better) performance when compared to the state-of-the-art salient object segmentation methods.
    Keywords: Object Detection ; Object Segmentation ; Symmetric Matrices ; Image Segmentation ; Quantum Mechanics ; Graph Theory ; Computer Vision ; Graph Affinity Learning ; Salient Object Segmentation ; Spectral Graph Theory
    ISSN: 10514651
    Source: IEEE Conference Publications
    Source: IEEE Xplore
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages