This paper presents a novel line-based affine invariant object location methodology. Our algorithm employs a new line-based transformation space decomposition technique to exploit...
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
—The Multicanonical Monte Carlo (MMC) technique is a new form of adaptive importance sampling (IS). Thanks to its blind adaptation algorithm, it does not require an in-depth syst...
Alberto Bononi, Leslie A. Rusch, Amirhossein Ghazi...
K-Means is a clustering algorithm that is widely applied in many elds, including pattern classi cation and multimedia analysis. Due to real-time requirements and computational-cos...
This paper presents a new algorithm named Kernel Bisecting k-means and Sample Removal (KBK-SR) as a sampling preprocessing for SVM training to improve the scalability. The novel c...