Registration-Is-Evaluation: Robust Point Set Matching With Multigranular Prior Assessment

2021 ◽  
pp. 1-14
Author(s):  
Yucheng Shu ◽  
Zhenlong Liao ◽  
Bin Xiao ◽  
Weisheng Li ◽  
Xinbo Gao
Keyword(s):  
Point Set ◽  
Is Evaluation

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Almost empty polygons

2003 ◽  
Vol 40 (3) ◽  
pp. 269-286 ◽  
Author(s):  
H. Nyklová
Keyword(s):  
Exact Results ◽  
Point Sets ◽  
Planar Point ◽  
Convex Position ◽  
Vertex Set ◽  
Point Set ◽  
Empty Polygons

In this paper we study a problem related to the classical Erdos--Szekeres Theorem on finding points in convex position in planar point sets. We study for which n and k there exists a number h(n,k) such that in every planar point set X of size h(n,k) or larger, no three points on a line, we can find n points forming a vertex set of a convex n-gon with at most k points of X in its interior. Recall that h(n,0) does not exist for n = 7 by a result of Horton. In this paper we prove the following results. First, using Horton's construction with no empty 7-gon we obtain that h(n,k) does not exist for k = 2(n+6)/4-n-3. Then we give some exact results for convex hexagons: every point set containing a convex hexagon contains a convex hexagon with at most seven points inside it, and any such set of at least 19 points contains a convex hexagon with at most five points inside it.

Enterprise Architecture Planning Untuk Proses Pengelolaan Manajemen Aset Dengan Zachman Framework

2016 ◽  
Vol 2 (2) ◽  
pp. 98
Author(s):  
Titus Kristanto
Keyword(s):  
Data Collection ◽  
Asset Management ◽  
Enterprise Architecture ◽  
Management Process ◽  
Implementation Planning ◽  
Is Evaluation ◽  
Zachman Framework ◽  
Architectural Planning

AbstrakManajemen aset merupakan hal terpenting dalam perusahaan. Proses manajemen aset yang tepat, dapat membuat aset yang dimiliki perusahaan lebih optimal. Dalam penelitian ini, Penulis membahas perancangan Enterprise Architecture (EA) manajemen aset yang dimiliki oleh PT Pembangkit Jawa Bali (PT PJB) dengan Zachman Framework. Ada 7 (tujuh) tahapan yang dilakukan perusahaan dalam manajemen aset yaitu tahapan pengumpulan data, inisialisasi perencanaan, melihat kondisi perusahaan, menganalisis hasil kondisi enterprise, membuat perencanaan arsitektur, membuat rencana implementasi, dan membuat portofolio aplikasi. Hasil penelitian adalah evaluasi blueprint arsitektur untuk diimplementasikan pada beberapa tahun di masa mendatang.Kata kunci: Enterprise Architecture Planning, manajemen aset, Zachman Frameworks. AbstractAsset management is a cornerstone for any business organisations. Proper asset management process can make a company's assets more optimal. This paper discusses the design of enterprise architecture of management assets owned by PT Pembangkit Jawa Bali with Zachman Framework. There are 7 stages in asset management, i.e. data collection, initialization planning, Observing the existing condition of enterprise, analyze the results of the condition of enterprise companies, create architectural planning, create implementation planning, and create application portfolio. The results of this reseach is evaluation of architectural blueprint to be implemented for several years in the future.Keywords: Asset management, Enterprise Architecture Planning, Zachman Framework.

Modified K-means clustering algorithm based on good point set and Leader method

2011 ◽  
Vol 31 (5) ◽  
pp. 1359-1362
Author(s):  
Yan-ping ZHANG ◽  
Juan ZHANG ◽  
Cheng-gang HE ◽  
Wei-cui CHU ◽  
Li-na ZHANG
Keyword(s):  
Clustering Algorithm ◽  
Good Point ◽  
Point Set ◽  
Good Point Set

Iterative algorithm for a split equilibrium problem and fixed problem for finite asymptotically nonexpansive mappings in Hlbert space

Filomat ◽  
2017 ◽  
Vol 31 (5) ◽  
pp. 1423-1434 ◽  
Author(s):  
Sheng Wang ◽  
Min Chen
Keyword(s):  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Common Element ◽  
Fixed Point Set ◽  
Split Equilibrium Problem ◽  
Asymptotically Nonexpansive Mappings ◽  
Asymptotically Nonexpansive ◽  
Point Set ◽  
The Common

In this paper, we propose an iterative algorithm for finding the common element of solution set of a split equilibrium problem and common fixed point set of a finite family of asymptotically nonexpansive mappings in Hilbert space. The strong convergence of this algorithm is proved.

Multi-View Image Color Correction Using 3D Point Set Registration

2021 ◽  
Author(s):  
Hyeonwoo Jeong ◽  
Byunghyun Yoon ◽  
Honggu Jeong ◽  
Kang-Sun Choi
Keyword(s):  
Color Correction ◽  
Point Set Registration ◽  
Point Set
Sign in / Sign up

Export Citation Format

Share Document