An elementary proof of a non-triviality of the E8subfactor planar algebra

2015 ◽  
Vol 26 (05) ◽  
pp. 1550037
Author(s):  
Kenta Okazaki

In this paper, we show in a combinatorial way that the 0-box space of the E8subfactor planar algebra is 1-dimensional. In the proof, we improve on Bigelow's relations for the E8subfactor planar algebra and give an efficient algorithm to reduce any planar diagram to the empty diagram.

Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn

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.


1991 ◽  
Vol 11 (3) ◽  
pp. 356-360 ◽  
Author(s):  
Jia'an Yan
Keyword(s):  

2016 ◽  
Vol 2016 (7) ◽  
pp. 1-6
Author(s):  
Sergey Makov ◽  
Vladimir Frantc ◽  
Viacheslav Voronin ◽  
Igor Shrayfel ◽  
Vadim Dubovskov ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document