Sciweavers

136 search results - page 6 / 28
» Experimental Study of Minimum Cut Algorithms
Sort
View
MVA
2008
305views Computer Vision» more  MVA 2008»
14 years 9 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong
ICMCS
2006
IEEE
164views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Video Break Detection based on Similarity Analysis and Temporal Statistical Characteristics
Video Shot boundary detection is a fundamental task in any kind of video content manipulation and retrieval. The area of shot boundary detection has been extensively studied, but ...
Jianjun Huang
ENGL
2007
180views more  ENGL 2007»
14 years 9 months ago
Reordering Algorithm for Minimizing Test Power in VLSI Circuits
— Power consumption has become a crucial concern in Built In Self Test (BIST) due to the switching activity in the circuit under test(CUT). In this paper we present a novel metho...
K. Paramasivam, K. Gunavathi
ISCSCT
2008
IEEE
15 years 4 months ago
Large Scale Scenes Reconstruction from Multiple Views
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
Limin Shi, Feng Zhang, Zhenhui Xu, Zhanyi Hu
88
Voted
COCOON
2008
Springer
14 years 11 months ago
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
Xianchao Zhang, Weifa Liang, Guoliang Chen