Computationally Efficient Image Mosaicing Using Spanning Tree Representations | Zendy

Nikos Nikolaidis | Zendy; Ioannis Pitas | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computationally Efficient Image Mosaicing Using Spanning Tree Representations

Author(s) -

Nikos Nikolaidis,

Ioannis Pitas

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29673-5

DOI - 10.1007/11573036_68

Subject(s) - computation , computer science , image (mathematics) , spanning tree , artificial intelligence , minimum spanning tree , computer vision , tree (set theory) , computational complexity theory , algorithm , pattern recognition (psychology) , mathematics , combinatorics

Optimal image mosaicing has large computational complexity, that becomes prohibitive as the number of sub-images increases. Two methods are proposed, which require less computation time by performing mosaicing in pairs of two sub-images at a time, without significant reconstruction losses, as evidenced by simulation results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research