Sciweavers

33 search results - page 6 / 7
» The zero exemplar distance problem
Sort
View
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 2 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
CORR
2008
Springer
117views Education» more  CORR 2008»
13 years 6 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
ECCV
2004
Springer
14 years 9 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
IPMI
2005
Springer
14 years 8 months ago
Inverse Consistent Mapping in 3D Deformable Image Registration: Its Construction and Statistical Properties
Abstract. This paper presents a new approach to inverse consistent image registration. A uni-directional algorithm is developed using symmetric cost functionals and regularizers. I...
Alex D. Leow, Sung-Cheng Huang, Alex Geng, James T...
CVPR
2010
IEEE
14 years 4 months ago
Online Visual Vocabulary Pruning Using Pairwise Constraints
Given a pair of images represented using bag-of-visual words and a label corresponding to whether the images are “related”(must-link constraint) or “unrelated” (must not li...
Pavan Mallapragada, Rong Jin and Anil Jain