Sciweavers

1261 search results - page 223 / 253
» Approximation algorithms for aligning points
Sort
View
ADHOCNOW
2010
Springer
14 years 7 months ago
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
92
Voted
ICMCS
2009
IEEE
215views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Image trimming via saliency region detection and iterative feature matching
Detection of saliency regions in images is useful for object based image understanding and object localization. In our work, we investigate a saliency region detection algorithm b...
Jiawei Huang, Ze-Nian Li
VC
2011
106views more  VC 2011»
14 years 4 months ago
Width-bounded geodesic strips for surface tiling
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
Joe Kahlert, Matt Olson, Hao Zhang 0002
115
Voted
FGR
2011
IEEE
247views Biometrics» more  FGR 2011»
14 years 1 months ago
Segment and recognize expression phase by fusion of motion area and neutral divergence features
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
Shizhi Chen, YingLi Tian, Qingshan Liu, Dimitris N...
JMLR
2012
13 years 3 days ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...