Sciweavers

Share
ICASSP
2011
IEEE
7 years 8 months ago
Fast damped gauss-newton algorithm for sparse and nonnegative tensor factorization
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
Anh Huy Phan, Petr Tichavský, Andrzej Cicho...
TIP
2010
162views more  TIP 2010»
7 years 11 months ago
Multivariate Image Segmentation Using Semantic Region Growing With Adaptive Edge Penalty
Multivariate image segmentation is a challenging task, influenced by large intraclass variation that reduces class distinguishability as well as increased feature space sparseness ...
A. K. Qin, David A. Clausi
JMLR
2010
162views more  JMLR 2010»
7 years 11 months ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...
INTERSPEECH
2010
7 years 11 months ago
Feature versus model based noise robustness
Over the years, the focus in noise robust speech recognition has shifted from noise robust features to model based techniques such as parallel model combination and uncertainty de...
Kris Demuynck, Xueru Zhang, Dirk Van Compernolle, ...
TMM
2011
169views more  TMM 2011»
7 years 11 months ago
Empowering Visual Categorization With the GPU
—Visual categorization is important to manage large collections of digital images and video, where textual metadata is often incomplete or simply unavailable. The bag-of-words mo...
Koen E. A. van de Sande, Theo Gevers, Cees G. M. S...
SIAMSC
2011
142views more  SIAMSC 2011»
7 years 11 months ago
Efficiency Based Adaptive Local Refinement for First-Order System Least-Squares Formulations
Abstract. In this paper, we propose new adaptive local refinement (ALR) strategies for firstorder system least-squares (FOSLS) finite element in conjunction with algebraic multi...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
ICIP
2009
IEEE
8 years 2 months ago
Efficient reduction of support vectors in kernel-based methods
Kernel-based methods, e.g., support vector machine (SVM), produce high classification performances. However, the computation becomes time-consuming as the number of the vectors su...
Takumi Kobayashi, Nobuyuki Otsu
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
8 years 2 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
AMDO
2010
Springer
8 years 2 months ago
Compatible Particles for Part-Based Tracking
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
Brais Martínez, Marc Vivet, Xavier Binefa
SAC
2008
ACM
8 years 3 months ago
Using the RRT algorithm to optimize classification systems for handwritten digits and letters
Multi-objective genetic algorithms have been often used to optimize classification systems, but little is discussed on their computational cost to solve such problems. This paper ...
Paulo Vinicius Wolski Radtke, Robert Sabourin, Ton...
books