✦ LIBER ✦

Optimizing templates for finding trees in aerial photographs

✍ Scribed by Morten Larsen; Mats Rudemo

Book ID: 108410869
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 522 KB
Volume: 19
Category: Article
ISSN: 0167-8655
DOI: 10.1016/s0167-8655(98)00092-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Change detection for linear features in

Change detection for linear features in aerial photographs using edge-finding

✍ Rowe, N.C.; Grewe, L.L. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 205 KB

POSSIBILITIES AND LIMITATIONS FOR ELIMIN

POSSIBILITIES AND LIMITATIONS FOR ELIMINATION OF DISTORTION IN AERIAL PHOTOGRAPHS

✍ J. Hothmer 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 844 KB

POSSIBILITIES AND LIMITATIONS FOR ELIMIN

POSSIBILITIES AND LIMITATIONS FOR ELIMINATION OF DISTORTION IN AERIAL PHOTOGRAPHS

✍ J. Hothmer 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 906 KB

Optimal Pointer Algorithms for Finding N

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees

✍ Stephen Alstrup; Mikkel Thorup 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 146 KB

GRASP for Seam Drawing in Mosaicking of

GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps

✍ Elena Fernández; Rafael Martí 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 680 KB

A sufficiently fast algorithm for findin

A sufficiently fast algorithm for finding close to optimal clique trees

✍ Ann Becker; Dan Geiger 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

We offer an algorithm that finds a clique tree such that the size of the largest clique is at most (2α + 1)k where k is the size of the largest clique in a clique tree in which this size is minimized and α is the approximation ratio of an α-approximation algorithm for the 3-way vertex cut problem. W