نتایج جستجو برای: decomposition level
تعداد نتایج: 1170856 فیلتر نتایج به سال:
This paper introduces a hierarchical process for propagating image annotations throughout a partially labelled database. Long-term learning, where users’ query and browsing patterns are retained over multiple sessions, is used to guide the propagation of keywords onto image regions based on low-level feature distances. We demonstrate how singular value decomposition (SVD), normally used with la...
This paper presents a digital watermarking scheme based on a new application of DWT and SVD for color artworks protection. This scheme uses the major features of the two chrominance components where the watermark bits are embedded only into one chrominance component according to the color prevalence rate. In watermark embedding process, more modifications can be done upon the selected chrominan...
This paper presents a digital watermarking scheme based on a new application of DWT and SVD for color artworks protection. This scheme uses the major features of the two chrominance components where the watermark bits are embedded only into one chrominance component according to the color prevalence rate. In watermark embedding process, more modifications can be done upon the selected chrominan...
Video watermarking is relatively a new technology that has been proposed to solve the problem of illegal manipulation and distribution of digital video. It is the process of embedding copyright information in video bit streams. In this paper, we propose two effective, robust and imperceptible video watermarking algorithms. The two algorithms are based on the algebraic transform of Singular Valu...
In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.
A conjecture is formulated for an upper bound on the number of points in PG(2, q) of a plane curve without linear components, defined over GF(q). We prove a new bound which is half way from the known bound to the conjectured one. The conjecture is true for curves of low or high degree, or with rational singularity. Let C be a plane curve of degree n, defined over GF(q), without (rational) linea...
This paper presents a digital watermarking scheme based on a new application of DWT and SVD for color artworks protection. This scheme uses the major features of the two chrominance components where the watermark bits are embedded only into one chrominance component according to the color prevalence rate. In watermark embedding process, more modifications can be done upon the selected chrominan...
The Robust-Control Toolboz [1] is a collection of 40 "M-files" which extend the capability of PC/PRO-MATLAB to do modern multivariable robust control system design. Included are robust analysis tools like singular values and structured singular values, robust synthesis tools like continuous/discrete H2/H o° synthesis and LQG Loop Transfer Recovery methods and a variety of robust model reduction...
There are four primary goals of this dissertation. First, design a competent optimization algorithm capable of learning and exploiting appropriate problem decomposition by sampling and evaluating candidate solutions. Second, extend the proposed algorithm to enable the use of hierarchical decomposition as opposed to decomposition on only a single level. Third, design a class of difficult hierarc...
We propose a strategy, based on domain decomposition methods , for parallelizing existing sequential simulators for solving partial diier-ential equations. Using an object-oriented programming framework, high-level parallelizations can be done in an eecient and systematical way. Concrete case studies, including numerical experiments, are provided to further illustrate this parallelization strat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید