نتایج جستجو برای: translation invariant system
تعداد نتایج: 2387140 فیلتر نتایج به سال:
This paper proposes an RST−invariant multi−bit watermarking system based on LPM and DFT. This system embeds the watermark in a rotation and translation invariant domain obtained by first acquiring log−polar mapped DFT (LPM−DFT) magnitudes of an image, and then taking the magnitude of the 1−dimensional DFT along the angular axis of this LPM−DFT magnitudes. Neither the original cover image nor a ...
A new approach for pole placement of nonlinear systems using state feedback and fuzzy system is proposed. We use a new online fuzzy training method to identify and to obtain a fuzzy model for the unknown nonlinear system using only the system input and output. Then, we linearized this identified model at each sampling time to have an approximate linear time varying system. In order to stabilize...
A Heyting algebra is a distributive lattice with implication and a dual $BCK$-algebra is an algebraic system having as models logical systems equipped with implication. The aim of this paper is to investigate the relation of Heyting algebras between dual $BCK$-algebras. We define notions of $i$-invariant and $m$-invariant on dual $BCK$-semilattices and prove that a Heyting semilattice is equiva...
This paper presents some general representations for set mappings based on Mathematical Morphology. A generalization of the concept of kernel , proposed originaly by Matheron for translation invariant. mappings, will be presented here in order to prove that any set mapping (not necessarily translation invariant.) can be decomposed by a set of (non-translation invariant.) sup-generating mappings...
abstract foreign and iranian cultures are far distinct in the constraints imposed on writing and translating for children, since the iranian literary system is mainly concerned with cultural and religious instructions which lead to manipulation of translated texts. this study sought to identify the cultural and social constraints and norms which determined the strategies applied in the transl...
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید