Filters








7,514 Hits in 3.2 sec

Near-optimal asymmetric binary matrix partitions [article]

Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris
2015 arXiv   pre-print
We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al.  ...  Instances of the problem consist of an n × m binary matrix A and a probability distribution over its columns. A partition scheme B=(B_1,...,B_n) consists of a partition B_i for each row i of A.  ...  Consider the instance of the asymmetric binary matrix partition problem that consists of the matrix Lemma 4. 1 . 1 For every ǫ > 0, there exists an instance of the asymmetric binary matrix partition  ... 
arXiv:1407.8170v3 fatcat:tr5jcdbmwvdcvhn7wyvxgxn7ri

Near-Optimal Asymmetric Binary Matrix Partitions [chapter]

Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris
2015 Lecture Notes in Computer Science  
We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al.  ...  In this work we focus on the simplest binary case of asymmetric matrix partition which has been proved to be APX-hard.  ...  Consider the instance of the asymmetric binary matrix partition problem consisting of the matrix Corollary 4. 4 . 4 There exists a (1 − 1/e)-approximation algorithm for the asymmetric binary matrix partition  ... 
doi:10.1007/978-3-662-48054-0_1 fatcat:pwrjxinozffvjf7sjsrbf7hdj4

Near-Optimal Asymmetric Binary Matrix Partitions

Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris
2016 Algorithmica  
We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al.  ...  In this work we focus on the simplest binary case of asymmetric matrix partition which has been proved to be APX-hard.  ...  Consider the instance of the asymmetric binary matrix partition problem consisting of the matrix Corollary 4. 4 . 4 There exists a (1 − 1/e)-approximation algorithm for the asymmetric binary matrix partition  ... 
doi:10.1007/s00453-016-0238-4 fatcat:6axdy5i7vrdzpf6pw45gwoe3vm

Optimized Distances for Binary Code Ranking

Jianfeng Wang, Heng Tao Shen, Shuicheng Yan, Nenghai Yu, Shipeng Li, Jingdong Wang
2014 Proceedings of the ACM International Conference on Multimedia - MM '14  
Such a scheme is applied to both the symmetric distance and the asymmetric distance.  ...  The entries of the lookup tables are optimized by minimizing the misalignment between the approximate distance and the original distance.  ...  We have Algorithm 2 Optimized Asymmetric Distance.  ... 
doi:10.1145/2647868.2654898 dblp:conf/mm/WangSYYLW14 fatcat:fnhpitdhmjddrbk5wf4bnguywm

A New Anticorrelation-Based Spectral Clustering Formulation [chapter]

Julia Dietlmeier, Ovidiu Ghita, Paul F. Whelan
2011 Lecture Notes in Computer Science  
The column-wise processing allows the applicability of SCE to Very Large Scale problems and asymmetric datasets.  ...  Instead of solving for the spectral decomposition of a similarity matrix as in SC, SCE converts the similarity matrix to a columncentered dissimilarity matrix and searches for a pair of the most anticorrelated  ...  For the two iterations near the transition point we compute the binary classification and combine the results to yield the optimal figure ground segmentation.  ... 
doi:10.1007/978-3-642-23687-7_13 fatcat:4ucqdyakbnandi67yjjwu4hedi

Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication [article]

Peter Ahrens
2021 arXiv   pre-print
Graph partitioning schedules parallel calculations like sparse matrix-vector multiply (SpMV).  ...  We propose the first near-linear time algorithms for several graph partitioning problems in the contiguous regime.  ...  The resulting partitioners use linear space to optimize accurate cost models in linear or near-linear time.  ... 
arXiv:2007.16192v4 fatcat:lrjtllq7e5emfclfu3wfcejhne

Toward a generic evaluation of image segmentation

J.S. Cardoso, L. Corte-Real
2005 IEEE Transactions on Image Processing  
A metric based on the distance between segmentation partitions is proposed to overcome some of the limitations of existing approaches.  ...  Evaluating the adequacy of a segmentation algorithm for a given application is a requisite both to allow the appropriate selection of segmentation algorithms as well as to tune their parameters for optimal  ...  Distance Applied to Binary Partitions What do we get if we apply to the edge maps? These are nothing more than binary partitions of an image in edge/non edge pixels.  ... 
doi:10.1109/tip.2005.854491 pmid:16279178 fatcat:o6jeixug5bhypodgjqnx64y7mm

Hashing for Similarity Search: A Survey [article]

Jingdong Wang, Heng Tao Shen, Jingkuan Song, Jianqiu Ji
2014 arXiv   pre-print
YDY T = I (101) YD1 = 0, (102) where Y is a real-valued matrix, relaxed from the binary matrix), L is the Laplacian matrix and D is the degree matrix.  ...  YY T = σI (120) R T R = I. (121) It is different from ITQ in that the formulation does not require Y to be a binary matrix. An iterative algorithm is presented to optimize the above problem.  ... 
arXiv:1408.2927v1 fatcat:reknwesjnbafvcbouyudrzp4rq

End-To-End Supervised Product Quantization for Image Search and Retrieval

Benjamin Klein, Lior Wolf
2019 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)  
In recent years, several works have achieved state of the art results on hashing benchmarks by learning binary representations in a supervised manner.  ...  DPQ explicitly learns soft and hard representations to enable an efficient and accurate asymmetric search, by using a straightthrough estimator.  ...  To create a better partition of the space, they suggest to first transform the data by an orthonormal matrix, R, and then to do the Cartesian decomposition and learn the optimal clusters.  ... 
doi:10.1109/cvpr.2019.00518 dblp:conf/cvpr/KleinW19 fatcat:xnhcjp7gzfhgrpmqpgxurxowke

End-to-End Supervised Product Quantization for Image Search and Retrieval [article]

Benjamin Klein, Lior Wolf
2020 arXiv   pre-print
In recent years, several works have achieved state of the art results on hashing benchmarks by learning binary representations in a supervised manner.  ...  DPQ explicitly learns soft and hard representations to enable an efficient and accurate asymmetric search, by using a straight-through estimator.  ...  To create a better partition of the space, they suggest to first transform the data by an orthonormal matrix, R, and then to do the Cartesian decomposition and learn the optimal clusters.  ... 
arXiv:1711.08589v2 fatcat:2ppjfq2eznbivgyihzrvd5grz4

Anchor-based manifold binary pattern for finger vein recognition

Haiying Liu, Gongping Yang, Lu Yang, Kun Su, Yilong Yin
2019 Science China Information Sciences  
The manifold structure actually plays a very important role in binary code learning, but constructing a similarity matrix for large-scale datasets involves a lot of computational and storage cost.  ...  Second, we construct an asymmetric graph, on which each data point can be a linear combination of its K-nearest neighbor anchors, and the anchors are randomly selected from the training samples.  ...  Moreover, during the optimization, it is not necessary to explicitly construct the graph Laplacian matrix.  ... 
doi:10.1007/s11432-018-9651-8 fatcat:zm6qyxoumjhszbniqp4aftktem

Low-complexity concatenated two-state TCM schemes with near-capacity performance

Li Ping, Baoming Bai, Xinmei Wang
2003 IEEE Transactions on Information Theory  
This leads to so-called asymmetrical and time-varying trellis structures, which possess good Hamming and Euclidean distance distributions.  ...  Let a binary -tuple be an information symbol. Let be an input sequence to the binary encoder, producing a coded symbol sequence .  ...  Following Ungerboeck's principle of mapping by set partitioning [19] , we partition the original constellation of size into four subsets: .  ... 
doi:10.1109/tit.2003.820011 fatcat:qwcnbpn7nbfqpmipctkqjsrkhe

Near duplicate image identification with patially Aligned Pyramid Matching

Dong Xu, Tat-Jen Cham, Shuicheng Yan, Shih-Fu Chang
2008 2008 IEEE Conference on Computer Vision and Pattern Recognition  
For retrieval ranking, a pyramid-based scheme is constructed to fuse matching results from different partition levels.  ...  Two application scenarios are addressed -retrieval ranking and binary classification.  ...  The alignment process involves computing a flow matrix F rc comprising binary elements, which represent unique matches between blocks x r and y c .  ... 
doi:10.1109/cvpr.2008.4587720 dblp:conf/cvpr/XuCYC08 fatcat:afbdt3jd55bwrmcbmjwdkq6n7a

Task-adaptive Asymmetric Deep Cross-modal Hashing [article]

Fengling Li, Tong Wang, Lei Zhu, Zheng Zhang, Xinhua Wang
2022 arXiv   pre-print
Unlike previous cross-modal hashing approaches, our learning framework jointly optimizes semantic preserving that transforms deep features of multimedia data into binary hash codes, and the semantic regression  ...  Motivated by this, we present a Task-adaptive Asymmetric Deep Cross-modal Hashing (TA-ADCMH) method in this paper.  ...  In each iteration, we randomly select a mini-batch samples from the database to train the network, which relieves the SGD algorithm from falling directly into the local optimal value near the initial point  ... 
arXiv:2004.00197v2 fatcat:osykjo375jdy5hkpo6kbhxnbsq

Complexity in UAV cooperative control

P.R. Chandler, M. Pachter, D. Swaroop, J.M. Fowler, J.K. Howlett, S. Rasmussen, C. Schumacher, K. Nygard
2002 Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301)  
These are globally optimal algorithms and require that the complete cost matrix be centrally available.  ...  Network flow solvers, auction implementations, and binary linear programming algorithms all yield the optimal solution for the binary linear single assignment problem.  ... 
doi:10.1109/acc.2002.1023833 fatcat:klc2wvetxraotaqiky5mvcsmue
« Previous Showing results 1 — 15 out of 7,514 results