Filters








2,197 Hits in 5.7 sec

Efficient Projection Algorithms onto the Weighted l1 Ball [article]

Guillaume Perez, Sebastian Ament, Carla Gomes, Michel Barlaud
<span title="2020-09-07">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we propose three new efficient algorithms for projecting any vector of finite length onto the weighted ℓ_1 ball. The first two algorithms have a linear worst case complexity.  ...  We illustrate this effectiveness by adapting an efficient compress sensing algorithm to weighted projections.  ...  Reconstruction results We show in the section the reconstruction efficiency of the SIRL1, which is a direct application of having an efficient projection onto the weighted L1 ball.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.02980v1">arXiv:2009.02980v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dxvbexwx3fbujh2qo7bvpaitl4">fatcat:dxvbexwx3fbujh2qo7bvpaitl4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200917185526/https://arxiv.org/pdf/2009.02980v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2009.02980v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Sparsity Based Image Retrieval using relevance feedback

Osman Gunay, A. Enis Cetin
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/anlh4tvwprcrtoxv5d4h6a7rye" style="color: black;">2012 19th IEEE International Conference on Image Processing</a> </i> &nbsp;
The algorithm determines a sparse set of eigenvectors by L1 based optimization of the generalized eigenvalue problem arising in BDA for each feedback round.  ...  In this way, a transformation matrix is constructed using the sparse set of eigenvectors and a new feature space is formed by projecting the current features using the transformation matrix.  ...  Making a projection onto the L1-ball consists of making orthogonal projections onto hyperplanes forming the boundary of the L1 ball.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icip.2012.6467382">doi:10.1109/icip.2012.6467382</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icip/GunayC12.html">dblp:conf/icip/GunayC12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cruuaqfcdvfhti3gcp7c6l2ukq">fatcat:cruuaqfcdvfhti3gcp7c6l2ukq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723114718/http://repository.bilkent.edu.tr/bitstream/handle/11693/28131/Sparsity%20Based%20Image%20Retrieval%20using%20relevance%20feedback.pdf;jsessionid=3B31C26D43DF1C782AED3EF2CA5A1D65?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b2/dd/b2dd343c11df5f35e9a4ac9eb51bb43194a1600b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icip.2012.6467382"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Denosing Using Wavelets and Projections onto the L1-Ball [article]

A. Enis Cetin, Mohammad Tofighi
<span title="2014-06-10">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The key step is an orthogonal projection onto the epigraph set of the L1-norm cost function.  ...  L1-balls to reduce noise.  ...  If w pi [n] is not on the 1 -ball we can still project w i [n] onto the 1 -ball using Algorithm 1 or Duchi et al's 1 -ball projection algorithm [11] using the values of d i determined in Eq.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1406.2528v1">arXiv:1406.2528v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qldza5ityjhidjtbjxsdddag7q">fatcat:qldza5ityjhidjtbjxsdddag7q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200907014523/https://arxiv.org/pdf/1406.2528v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/7c/197cae273a91c363f1eb838c01c71f572ca752b4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1406.2528v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Web-scale k-means clustering

D. Sculley
<span title="">2010</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/s4hirppq3jalbopssw22crbwwa" style="color: black;">Proceedings of the 19th international conference on World wide web - WWW &#39;10</a> </i> &nbsp;
Second, we achieve sparsity with projected gradient descent, and give a fast ǫaccurate projection onto the L1-ball. Source code is freely available:  ...  We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web applications.  ...  The projection to the L1 ball can be performed effectively using, for example, the linear time L1-ball projection algorithm of Duchi et al. [2] , referred to here as LTL1P.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1772690.1772862">doi:10.1145/1772690.1772862</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/www/Sculley10.html">dblp:conf/www/Sculley10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v63f6x2kangs5nt2py4bpdq3lq">fatcat:v63f6x2kangs5nt2py4bpdq3lq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100617234738/http://www.eecs.tufts.edu/~dsculley/papers/fastkmeans.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cd/8d/cd8dec37ae0f0f523550b8c114c22e5dc237c849.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1772690.1772862"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Efficient projections onto thel1-ball for learning in high dimensions

John Duchi, Shai Shalev-Shwartz, Yoram Singer, Tushar Chandra
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v54jrmjbpzgodi4buoyaj7vrzm" style="color: black;">Proceedings of the 25th international conference on Machine learning - ICML &#39;08</a> </i> &nbsp;
We describe efficient algorithms for projecting a vector onto the ℓ 1 -ball. We present two methods for projection.  ...  The second works on vectors k of whose elements are perturbed outside the ℓ 1 -ball, projecting in O(k log(n)) time.  ...  Acknowledgments We thank the anonymous reviewers for their helpful and insightful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1390156.1390191">doi:10.1145/1390156.1390191</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icml/DuchiSSC08.html">dblp:conf/icml/DuchiSSC08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/teibrsxryzhhfpjrjcp5idndjm">fatcat:teibrsxryzhhfpjrjcp5idndjm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20121119211317/http://machinelearning.org:80/archive/icml2008/papers/361.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/74/67/74677211c1c8dd107da148b7d9bf8a5632779eac.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1390156.1390191"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

L1 Projections with Box Constraints [article]

Mithun Das Gupta, Sanjeev Kumar, Jing Xiao
<span title="2010-09-30">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We study the L1 minimization problem with additional box constraints. We motivate the problem with two different views of optimality considerations.  ...  We look into imposing such constraints in projected gradient techniques and propose a worst case linear time algorithm to perform such projections.  ...  the proposed efficient algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1010.0141v1">arXiv:1010.0141v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3pkarsg5vrczlgisoqi3mlkf4i">fatcat:3pkarsg5vrczlgisoqi3mlkf4i</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1010.0141/1010.0141.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8b/3b/8b3b8795c5ebe8f4d05c88e6667402c0769350ad.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1010.0141v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ [chapter]

Alexander May, Alexander Meurer, Enrico Thomae
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Recently, Bernstein, Lange and Peters proposed a new technique called Ball-collision decoding which offers a speed-up over Stern's algorithm by improving the running time toÕ 2 0.05558n .  ...  The best attacks on the most prominent code-based cryptosystems such as McEliece directly use decoding algorithms for linear codes.  ...  The authors would like to thank Antoine Joux for useful discussions and Jannik Pewny for carrying out the experiments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-25385-0_6">doi:10.1007/978-3-642-25385-0_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v646otbbk5dkficfkwrwmmdk5e">fatcat:v646otbbk5dkficfkwrwmmdk5e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727100731/https://link.springer.com/content/pdf/10.1007%2F978-3-642-25385-0_6.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c8/10/c8102ade2b551bf13bc585789f7982fe78347689.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-25385-0_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Robust Adaptive Sparse System Identification By Using Weighted L1 Balls And Moreau Envelopes

Yannis Kopsinis, Konstantinos Slavakis, S. Theodoridis
<span title="2011-08-29">2011</span> <i title="Zenodo"> Zenodo </i> &nbsp;
Publication in the conference proceedings of EUSIPCO, Barcelona, Spain, 2011  ...  Afterwords, the relaxed projection mapping onto the weighted ℓ 1 ball B ℓ1 [w w wn, ρn] is applied.  ...  We noticed that values of αn ≥ 1, i.e., the exact or an over-relaxation of the projection onto the weighted ℓ 1 ball, offer sequence of estimates with a fast speed of convergence, at the expense of non-smooth  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.42449">doi:10.5281/zenodo.42449</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6apdtxqafvenzbkzdxufttlkmq">fatcat:6apdtxqafvenzbkzdxufttlkmq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181102003110/https://zenodo.org/record/42449/files/1569424873.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9a/5f/9a5f25cfe0814d0ad8a2b93233c81358045ab2a5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.42449"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

Splitting Methods for Convex Clustering

Eric C. Chi, Kenneth Lange
<span title="2015-10-02">2015</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uuo44cjltzg2flanabrks3a5fi" style="color: black;">Journal of Computational And Graphical Statistics</a> </i> &nbsp;
While the differences between the two algorithms appear to be minor on the surface, complexity analysis and numerical experiments show AMA to be significantly more efficient.  ...  The first is an instance of the alternating direction method of multipliers (ADMM); the second is an instance of the alternating minimization algorithm (AMA).  ...  The proximal map for the ∞ norm requires projection onto the unit simplex and lacks an explicit solution. However, there are good algorithms for projecting onto the unit simplex [15, 46] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/10618600.2014.948181">doi:10.1080/10618600.2014.948181</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/27087770">pmid:27087770</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4830509/">pmcid:PMC4830509</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kkwuuro6yne3jbthgus5nlxo5e">fatcat:kkwuuro6yne3jbthgus5nlxo5e</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1304.0499/1304.0499.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/10618600.2014.948181"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> tandfonline.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4830509" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Projection onto Epigraph Sets for Rapid Self-Tuning Compressed Sensing MRI [article]

Mohammad Shahdloo, Efe Ilicak, Mohammad Tofighi, Emine U. Saritas, A.Enis Çetin, Tolga Çukur
<span title="2019-01-25">2019</span> <i title="Institute of Electrical and Electronics Engineers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yhnt2pif75h2bmnnmdg7m6nlc4" style="color: black;">IEEE Transactions on Medical Imaging</a> </i> &nbsp; <span class="release-stage">accepted</span>
The proposed method uses computationally efficient projections onto epigraph sets of the $l_1$ and total-variation norms to simultaneously achieve parameter selection and regularization.  ...  The proposed method achieves nearly an order of magnitude improvement in computational efficiency over line-search methods while maintaining near-optimal parameter selection.  ...  The resulting projection point determines both the size of the Φ-ball in R k (i.e. 1ball or TV-ball, see Fig. 2 ) and the actual projection onto the ball.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tmi.2018.2885599">doi:10.1109/tmi.2018.2885599</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/30530317">pmid:30530317</a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1802.01892v2">arXiv:1802.01892v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7uen7ag55felrnkn576lzqyncu">fatcat:7uen7ag55felrnkn576lzqyncu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502101814/http://repository.bilkent.edu.tr/bitstream/handle/11693/48210/08567963.pdf;jsessionid=D6E31655B34E570291019A8E6EE46607?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/44/94/4494ca04b6987d9cc8048be9cad0c2b3e911ebf7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tmi.2018.2885599"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1802.01892v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

L1-medial skeleton of point cloud

Hui Huang, Shihao Wu, Daniel Cohen-Or, Minglun Gong, Hao Zhang, Guiqing Li, Baoquan Chen
<span title="2013-07-01">2013</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cqrugwalkvcezgalqorn4fwnuu" style="color: black;">ACM Transactions on Graphics</a> </i> &nbsp;
We develop a L1-medial skeleton construction algorithm, which can be directly applied to an unoriented raw point scan with significant noise, outliers, and large areas of missing data.  ...  We introduce L1-medial skeleton as a curve skeleton representation for 3D point cloud data. The L1-median is well-known as a robust global center of an arbitrary set of points.  ...  Acknowledgments The authors would like to thank all the reviewers for their valuable comments. The raw scan data shown in Figure 8 is courtesy of Andrea Tagliasacchi.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2461912.2461913">doi:10.1145/2461912.2461913</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/k5oko2clzza3nkbke7au4jrn4m">fatcat:k5oko2clzza3nkbke7au4jrn4m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705124229/http://www.math.tau.ac.il/~dcor/articles/2013/L1-Medial-Skeleton-of-Point.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/da/a0da4476121124b9186490f27f7a2ee7c131073d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2461912.2461913"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Distributed Projections onto a Simplex [article]

Yongzheng Dai, Chen Chen
<span title="2022-04-25">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Numerous algorithms have been proposed for determining the projection; however, all but one of these algorithms are serial.  ...  Projecting a vector onto a simplex is a well-studied problem that arises in a wide range of optimization problems.  ...  Finally, we note that methods for projection onto the scaled standard simplex and 1 ball can be extended to projection onto the weighted simplex and weighted 1 ball [31] (see Section 4.3) .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.08153v2">arXiv:2204.08153v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r6lhgyelk5azpofbcttio4mj6a">fatcat:r6lhgyelk5azpofbcttio4mj6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220504202004/https://arxiv.org/pdf/2204.08153v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0d/3b/0d3baea1eeec4cd8237f026dd1324527ee2a8de1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2204.08153v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Inexact Primal-Dual Gradient Projection Methods for Nonlinear Optimization on Convex Set [article]

Fan Zhang, Hao Wang, Jiashan Wang, Kai Yang
<span title="2019-11-18">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Numerical results exhibit that our inexact gradient projection methods for solving l1-ball constrained problems are more efficient than the exact methods.  ...  This method only needs inexact computation of the projections onto the convex set for each iteration, consequently reducing the computational cost for projections per iteration.  ...  Inexact ℓ 1 -ball projection algorithm As shown in the previous subsection, Algorithm 3 can be used to find the exact projection onto the ℓ 1 ball.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.07758v1">arXiv:1911.07758v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yhavnppot5hd7bi2rkhlkenr64">fatcat:yhavnppot5hd7bi2rkhlkenr64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200824100228/https://arxiv.org/pdf/1911.07758v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/59/ca/59ca72e10c3282ad20119b27f19295d85fa80a80.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.07758v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Footskate cleanup for motion capture editing

Lucas Kovar, John Schreiner, Michael Gleicher
<span title="">2002</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ufj23cmftbe47kik7exdpigzsi" style="color: black;">Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA &#39;02</a> </i> &nbsp;
In this paper we present a simple, efficient algorithm for removing footskate. Our algorithm exactly satisfies footplant constraints without introducing disagreeable artifacts.  ...  Rather, it is first fit onto a skeleton and then edited to satisfy the particular demands of the animation. This process can introduce artifacts into the motion.  ...  Acknowledgements Our work was made possible through generous motion data donations from Spectrum Studios (particularly Demian Gordon), House of Moves, and The Ohio State University.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/545261.545277">doi:10.1145/545261.545277</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sca/KovarSG02.html">dblp:conf/sca/KovarSG02</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pkmogd6cuzfoxpyykguaymtfoe">fatcat:pkmogd6cuzfoxpyykguaymtfoe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811154741/http://www.vis.uni-stuttgart.de/plain/vdl/vdl_upload/91_34_mocap%20anti%20footskate%20p97-kovar.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4e/85/4e858852301d623a14de2a11ac7943f7a729bf40.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/545261.545277"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Footskate cleanup for motion capture editing

Lucas Kovar, John Schreiner, Michael Gleicher
<span title="">2002</span> <i title="ACM Press"> Proceedings of the 2002 ACM SIGGRAPH/Eurographics symposium on Computer animation - SCA &#39;02 </i> &nbsp;
In this paper we present a simple, efficient algorithm for removing footskate. Our algorithm exactly satisfies footplant constraints without introducing disagreeable artifacts.  ...  Rather, it is first fit onto a skeleton and then edited to satisfy the particular demands of the animation. This process can introduce artifacts into the motion.  ...  Acknowledgements Our work was made possible through generous motion data donations from Spectrum Studios (particularly Demian Gordon), House of Moves, and The Ohio State University.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/545274.545277">doi:10.1145/545274.545277</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/snosn6yqwnezbkrf4ppvmp6mei">fatcat:snosn6yqwnezbkrf4ppvmp6mei</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811154741/http://www.vis.uni-stuttgart.de/plain/vdl/vdl_upload/91_34_mocap%20anti%20footskate%20p97-kovar.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4e/85/4e858852301d623a14de2a11ac7943f7a729bf40.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/545274.545277"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 2,197 results