Sciweavers

202 search results - page 13 / 41
» Locally identifying coloring of graphs
Sort
View
99
Voted
ACCV
2007
Springer
15 years 6 months ago
Image Segmentation Using Iterated Graph Cuts Based on Multi-scale Smoothing
We present a novel approach to image segmentation using iterated Graph Cuts based on multi-scale smoothing. We compute the prior probability obtained by the likelihood from a color...
Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kana...
ACCV
2009
Springer
15 years 4 months ago
Video Segmentation Using Iterated Graph Cuts Based on Spatio-temporal Volumes
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kana...
ACSAC
2005
IEEE
15 years 5 months ago
Building Evidence Graphs for Network Forensics Analysis
In this paper, we present techniques for a network forensics analysis mechanism that includes effective evidence presentation, manipulation and automated reasoning. We propose the...
Wei Wang, Thomas E. Daniels
TIP
2008
208views more  TIP 2008»
14 years 11 months ago
Vision Processing for Realtime 3-D Data Acquisition Based on Coded Structured Light
Structured light vision systems have been successfully used for accurate measurement of 3-D surfaces in computer vision. However, their applications are mainly limited to scanning ...
S. Y. Chen, Y. F. Li, Jianwei Zhang
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
15 years 4 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker