Sciweavers

941 search results - page 125 / 189
» Efficient Testing of Large Graphs
Sort
View
ICPR
2006
IEEE
15 years 11 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan
CVIU
2008
141views more  CVIU 2008»
14 years 9 months ago
Change detection using a statistical model in an optimally selected color space
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon
ICDM
2010
IEEE
101views Data Mining» more  ICDM 2010»
14 years 7 months ago
Tru-Alarm: Trustworthiness Analysis of Sensor Networks in Cyber-Physical Systems
A Cyber-Physical System (CPS) integrates physical devices (e.g., sensors, cameras) with cyber (or informational) components to form a situation-integrated analytical system that re...
Lu An Tang, Xiao Yu, Sangkyum Kim, Jiawei Han, Chi...
ICCV
2009
IEEE
16 years 2 months ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
CVPR
2004
IEEE
15 years 11 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell