Application of Marching Square Algorithm in 2D Tensor Voting
نویسندگان
چکیده
منابع مشابه
N-Dimensional Tensor Voting and Application to Epipolar Geometry Estimation
ÐWe address the problem of epipolar geometry estimation efficiently and effectively, by formulating it as one of hyperplane inference from a sparse and noisy point set in an 8D space. Given a set of noisy point correspondences in two images of a static scene without correspondences, even in the presence of moving objects, our method extracts good matches and rejects outliers. The methodology is...
متن کاملInvestigations of Tensor Voting Modeling
Tensor voting (TV) is a method for inferring geometric structures from sparse, irregular and possibly noisy input. It was initially proposed by Guy and Medioni [Guy96] and has been applied to several computer vision applications. TV generates a dense output field in a domain by dispersing information associated with sparse input tokens. In 3-D this implies that a surface can be generated from a...
متن کاملapplication of brand personality scale in automobile industry: the study of samand’s brand personality dimensions
این تحقیق شخصیت برند سمند را در ایران با استفاده از مدل پنج بعدی آکر (1997) بعنوان یک چهارچوب بطور توصیفی سنجیده است. بنابر این چهارچوب که دراصل در 42 جزء (42 ویزگی شخصیتی) ودر پنج بعد شخصیتی طراحی شده بود ودر کشورها وصنایع مختلف آزموده شده بود, پرسنامه به زبان فارسی ترجمه شده و با استفاده از روشهای ترجمه معکوس و مصاحبه عمیق با 12 متخصص ایرانی به 38 جزء کاهش یافت. و نظرسنجی ای در پنج نمایندگی ا...
15 صفحه اولTensor Voting Based Binary Classifier
We propose two novel Tensor Voting (TV) based supervised binary classification algorithms for N-Dimensional (N-D) data points. (a) The first one finds an approximation to a separating hyper-surface that best separates the given two classes in N-D: this is done by finding a set of candidate decision-surface points (using the training data) and then modeling the decision surface by local planes u...
متن کاملTensor Voting: Theory and Applications
We present a unified computational framework which properly implements the smoothness constraint to generate descriptions in terms of surfaces, regions, curves, and labelled junctions, from sparse, noisy, binary data in 2-D or 3-D. Each input site can be a point, a point with an associated tangent direction, a point with an associated normal direction, or any combination of the above. The metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software Engineering and Applications
سال: 2015
ISSN: 2325-2286,2325-2278
DOI: 10.12677/sea.2015.42002