Automatic Definition of Optimal Default Parameters of Models: Image Matting Application

Date

2015-09-24

Author

Ravve, Elena V.
Volkovich, Zeev
Weber, Gerhard Wilhelm

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

127
views

0
downloads

As a general rule, each user must provide the tool applied with particular values of its input parameters. An inexperienced user may hardly figure out their values and the tool developer must define the default values in order to help her/him. We present an approach to solve the problem with the help of multi-criteria optimization that is new in this formulation. We demonstrate our approach in closer details using an example from the automatic definition of optimal default parameters for real-time merging of visual objects. Our approach is generic and may be also used for any kind of such inverse problems.

Subject Keywords

Computer science, Engineering

URI

https://hdl.handle.net/11511/52151

DOI

https://doi.org/10.1109/synasc.2015.47

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Automatic image annotation by ensemble of visual descriptors Akbaş, Emre; Yarman Vural, Fatoş Tunay; Department of Computer Engineering (2006) Automatic image annotation is the process of automatically producing words to de- scribe the content for a given image. It provides us with a natural means of semantic indexing for content based image retrieval. In this thesis, two novel automatic image annotation systems targeting dierent types of annotated data are proposed. The rst system, called Supervised Ensemble of Visual Descriptors (SEVD), is trained on a set of annotated images with predened class labels. Then, the system auto- matically annotates...
Personnel assignment problem with hierarchical ordering constraints Toroslu, İsmail Hakkı (Elsevier BV, 2003-10-01) In the standard assignment problem, there is no constraint on the partitions of the bipartite graph. The only objective is to maximize the summation of the weights of the matched edges. Any node in one partition can be matched with any node in the other partition without any restriction. In this paper, we study a variation of the standard assignment problem, having some ordering constraints on the partitions of the bipartite graph. We call this problem as 'assignment problem with hierarchical ordering const...
A heuristic procedure for a single-item dynamic lot sizing problem Benli., Ömer S; Sabuncuoğlu, İhsan; Tüfekçi, Süleyman (Elsevier BV, 1988-1) An O(T) heuristic proceudre for a single-item dynamic lot sizing problem is introduced in this paper. The algorithm tries to establish the regeneration points of the problem whether either the production or the beginning inventory must be equal to zero. The proposed algorithm is very easy to implement and compares very favourably with the existing heuristic procedures.
Random Set Methods Estimation of Multiple Extended Objects Granstrom, Karl; Lundquist, Christian; Gustafsson, Fredrik; Orguner, Umut (Institute of Electrical and Electronics Engineers (IEEE), 2014-06-01) Random set-based methods have provided a rigorous Bayesian framework and have been used extensively in the last decade for point object estimation. In this article, we emphasize that the same methodology offers an equally powerful approach to estimation of so-called extended objects, i.e., objects that result in multiple detections on the sensor side. Building upon the analogy between Bayesian state estimation of a single object and random finite set (RFS) estimation for multiple objects, we give a tutorial...
A Content-Boosted Collaborative Filtering Approach for Movie Recommendation Based on Local and Global Similarity and Missing Data Prediction Özbal, Gozde; Karaman, Hilal; Alpaslan, Ferda Nur (Oxford University Press (OUP), 2011-09-01) Most traditional recommender systems lack accuracy in the case where data used in the recommendation process is sparse. This study addresses the sparsity problem and aims to get rid of it by means of a content-boosted collaborative filtering approach applied to a web-based movie recommendation system. The main motivation is to investigate whether further success can be obtained by combining 'local and global user similarity' and 'effective missing data prediction' approaches, which were previously introduce...

Citation Formats

E. V. Ravve, Z. Volkovich, and G. W. Weber, “Automatic Definition of Optimal Default Parameters of Models: Image Matting Application,” 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52151.