Sciweavers

721 search results - page 125 / 145
» Graphs with Large Obstacle Numbers
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 6 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
EMNLP
2010
13 years 5 months ago
Practical Linguistic Steganography Using Contextual Synonym Substitution and Vertex Colour Coding
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...
Ching-Yun Chang, Stephen Clark
CVPR
2011
IEEE
13 years 4 months ago
Towards a practical lipreading system
A practical lipreading system can be considered either as subject dependent (SD) or subject-independent (SI). An SD system is user-specific, i.e., customized for some particular ...
Ziheng Zhou, Matti Pietik, Guoying Zhao
CVPR
2011
IEEE
13 years 4 months ago
Scale and Rotation Invariant Matching Using Linearly Augmented Trees
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
Hao Jiang, Tai-Peng Tian, Stan Sclaroff
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool