نتایج جستجو برای: least square matching

تعداد نتایج: 594518  

Journal: :Methods in molecular biology 2013
Hervé Abdi Lynne J Williams

Partial least square (PLS) methods (also sometimes called projection to latent structures) relate the information present in two data tables that collect measurements on the same set of observations. PLS methods proceed by deriving latent variables which are (optimal) linear combinations of the variables of a data table. When the goal is to find the shared information between two tables, the ap...

2010
Xiuguang Zhou Egon Dorrer

A novel image matching algorithm is presented in this paper. One significant property of this algorithm is: free of large non-linear scale difference and orientation difference between left and right. The algorithm tries to match every pixel in the image pair to provide a very detailed matched point set for generating a very good quality DEM. The matching approach, which combines feature based ...

Journal: : 2023

ضرورت دسترسی به کاربردهای وسیع تصاویر ابرطیفی سبب توسعة سیستم‌های تصویربرداری نوآورانه و اقتصادی در ثبت این شده است. به‌منظور استفاده از تصاویر، لازم است ارتباط هندسی دقیقی میان آنها فضای زمین برقرار شود فرایند نیازمند نقاط کنترلی بسیاری نکته راهکارهای اصلاح منطبق با ساختار هریک دوربین‌ها را بارز می‌کند. سنجندة (nm 400-1000) BaySpec OCI-F یکی نوآورانه‌ای که هندسة پوش‌بروم دریافت سنجنده، علاوه‌ب...

Journal: :Photogrammetric Engineering & Remote Sensing 2010

Journal: :The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences 2021

Journal: :International Journal of Adaptive Control and Signal Processing 2021

The diffusion least mean square (DLMS) and the normalized (DNLMS) algorithms are analyzed for a network having fusion center. This structure reduces dimensionality of resulting stochastic models while preserving important properties. analysis is done in system identification framework cyclostationary white nodal inputs. parameters vary according to random walk model. cyclostationarity modeled b...

Journal: :Journal of Graph Theory 2016
András Gyárfás Gábor N. Sárközy

We determine the 2-color Ramsey number of a connected triangle matching c(nK3) which is a graph with n vertex disjoint triangles plus (at least n − 1) further edges that keep these triangles connected. We obtain that R(c(nK3), c(nK3)) = 7n − 2, somewhat larger than in the classical result of Burr, Erdős and Spencer for a triangle matching, R(nK3, nK3) = 5n. The motivation is to determine the Ra...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید