Sciweavers

1561 search results - page 171 / 313
» Segments Matching Using a Neural Network Approach
Sort
View
ANNPR
2006
Springer
15 years 8 months ago
Simple and Effective Connectionist Nonparametric Estimation of Probability Density Functions
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
Edmondo Trentin
FPGA
2004
ACM
163views FPGA» more  FPGA 2004»
15 years 8 months ago
Time and area efficient pattern matching on FPGAs
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
Zachary K. Baker, Viktor K. Prasanna
181
Voted
CVPR
2009
IEEE
17 years 10 days ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
IDEAL
2007
Springer
15 years 11 months ago
Segmentation and Annotation of Audiovisual Recordings Based on Automated Speech Recognition
Searching multimedia data in particular audiovisual data is still a challenging task to fulfill. The number of digital video recordings has increased dramatically as recording tec...
Stephan Repp, Jörg Waitelonis, Harald Sack, C...
ICPR
2008
IEEE
16 years 6 months ago
Extraction of shoe-print patterns from impression evidence using Conditional Random Fields
Impression evidence in the form of shoe-prints are commonly found in crime scenes. A critical step in automatic shoe-print identification is extraction of the shoe-print pattern. ...
Sargur N. Srihari, Veshnu Ramakrishnan