Back to Results
First PageMeta Content
Statistical inference / Image processing / RANSAC / String searching algorithm / Statistical hypothesis testing / Segmentation / Statistics / Design of experiments / Hypothesis testing


PARTIAL CONTOUR MATCHING FOR DOCUMENT PIECES WITH CONTENT-BASED PRIOR Fabian Richter, Christian X. Ries, Stefan Romberg, Rainer Lienhart Multimedia Computing and Computer Vision Lab, University of Augsburg, Germany {rich
Add to Reading List

Document Date: 2014-11-14 11:15:54


Open Document

File Size: 2,18 MB

Share Result on Facebook

City

Piscataway / /

Company

Suzuki / /

Country

United States / /

Currency

pence / /

/

Event

Product Issues / Product Recall / /

Facility

Fraunhofer Institute / University of Augsburg / /

IndustryTerm

incorrect solutions / real-world applications / curve matching algorithm / contour matching algorithm / smith-waterman algorithm / tree algorithm / partial solutions / using smith-waterman algorithm / /

Organization

IEEE Service Center / Stasi / Fraunhofer Institute / Lienhart Multimedia Computing and Computer Vision Lab / University of Augsburg / /

Person

Christian X. Ries / H. Liu / Rainer Lienhart / S. Yan / Fabian Richter / S. Cao / /

/

Position

Manager / Copyrights and Permissions / Cartographer / vol / Do ceo / Cao / /

Product

Pentax K-x Digital Camera / min-overlap vs. / 0.1 0.4 0.6 0.8 1 min−overlap 1 min−overlap min−overlap min−overlap vs / min−overlap vs / /

ProvinceOrState

New Jersey / /

PublishedMedium

Journal of Molecular Biology / Communications of the ACM / /

Technology

contour matching algorithm / curve matching algorithm / SmithWaterman algorithm / Douglas-Peucker algorithm / spanning tree algorithm / Smith-Waterman algorithm / Image Processing / /

SocialTag