Sciweavers

1272 search results - page 200 / 255
» The Set Cover with Pairs Problem
Sort
View
ORL
2006
105views more  ORL 2006»
13 years 10 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
ICCV
2009
IEEE
1821views Computer Vision» more  ICCV 2009»
15 years 3 months ago
Feature Correspondence and Deformable Object Matching via Agglomerative Correspondence Clustering
We present an efficient method for feature correspondence and object-based image matching, which exploits both photometric similarity and pairwise geometric consistency from local ...
Minsu Cho (Seoul National University), Jungmin Lee...
ICCV
2009
IEEE
1103views Computer Vision» more  ICCV 2009»
15 years 1 months ago
Piecewise-Consistent Color Mappings of Images Acquired Under Various Conditions
Many applications in computer vision require comparisons between two images of the same scene. Comparison applications usually assume that corresponding regions in the two image...
S. Kagarlitsky, Y. Moses, and Y. Hel-Or
CVPR
2008
IEEE
15 years 9 days ago
Pair-activity classification by bi-trajectories analysis
In this paper, we address the pair-activity classification problem, which explores the relationship between two active objects based on their motion information. Our contributions...
Yue Zhou, Shuicheng Yan, Thomas S. Huang
ICCV
2007
IEEE
15 years 7 days ago
Discriminant Embedding for Local Image Descriptors
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and visual recognition. However, such descriptors are generally par...
Gang Hua, Matthew Brown, Simon A. J. Winder