scholarly journals Computationally Efficient Image Mosaicing Using Spanning Tree Representations

2005 ◽  
pp. 716-724 ◽  
Author(s):  
Nikos Nikolaidis ◽  
Ioannis Pitas
Keyword(s):  
Spanning Tree ◽  
Computationally Efficient ◽  
Image Mosaicing ◽  
Tree Representations

scholarly journals Laplacian based Image Mosaicing

2020 ◽  
Vol 9 (4) ◽  
pp. 791-794
Keyword(s):  
Spanning Tree ◽  
Decision Fusion ◽  
Image Mosaicing ◽  
Multiple Images ◽  
Image Blending ◽  
Homography Estimation ◽  
Fusion Framework

In this paper, we propose to stitch multiple images using the technique of homography estimation. Firstly, Sorting the images,then computing pairwise homography between the images and then by performing image blending the objective is achieved.Then a novel decision fusion framework based on spanning tree and exif data to obtain the order of images is proposed. After the order of images are obtained, to estimate the pairwise projective homographies between the images is done. Then we warp the images according to the computed homography. The warped images later undergo feathering and laplacian blending in order to obtain seamless stitching.

scholarly journals A Robust Image Mosaicing Technique Using Frequency Domain

2018 ◽  
Vol 6 (1) ◽  
pp. 1-8
Author(s):  
Sarabpreet Kaur ◽  
Jyoti Patel
Keyword(s):  
Image Registration ◽  
Frequency Domain ◽  
Spatial Domain ◽  
Field Of View ◽  
Computationally Efficient ◽  
Illumination Variation ◽  
Image Mosaicing ◽  
Robustness To Noise ◽  
Robust Image

Image mosaicing is the process of joining small images of the same scene which may be clicked at different times, with different cameras, or illumination variation and produce the image with bigger field of view. The leading contribution of the paper lies in the primary detection of features using SURF which completely works in the spatial domain. For image registration frequency based approach has been used. The proposed approach is global, has robustness to noise and is computationally efficient.

scholarly journals About Some Localization Problems in Delaunay Triangulations

2015 ◽  
Vol 19 (6) ◽  
pp. 112-126
Author(s):  
N. F. Dyshkant
Keyword(s):  
Computational Complexity ◽  
Problem Solving ◽  
Computational Geometry ◽  
Delaunay Triangulation ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Computationally Efficient ◽  
Delaunay Triangulations ◽  
Efficient Approach ◽  
Geometric Search

We study some problems of nodes localization in a Delaunay triangulation and problem-solving procedures. For the problem of the set of nodes the computationally efficient approach that uses Euclidean minimum spanning tree of Delaunay triangulation is proposed. Efficient estimations for computational comlexity of the proposed methods in the average and in the worst cases are proved.computational geometry, geometric search, Delaunay triangulation, merging of overlapping triangulations, unregular discrete mesh, computational complexity

Computationally efficient model of the implanted knee for time-sensitive applications

2020 ◽  
Author(s):  
E Bori ◽  
A Navacchia ◽  
L Wang ◽  
L Duxbury ◽  
S McGuan ◽  
...  
Keyword(s):  
Computationally Efficient
Sign in / Sign up

Export Citation Format

Share Document