English
Related papers

Related papers: An Encoder-Decoder Approach for Packing Circles

200 papers

In this paper, we focus on improving binary 2D instance segmentation to assist humans in labeling ground truth datasets with polygons. Humans labeler just have to draw boxes around objects, and polygons are generated automatically. To be…

Computer Vision and Pattern Recognition · Computer Science 2022-08-25 Darshan Ganganna Ravindra , Laslo Dinges , Al-Hamadi Ayoub , Vasili Baranau

Point cloud filtering is a fundamental problem in geometry modeling and processing. Despite of significant advancement in recent years, the existing methods still suffer from two issues: 1) they are either designed without preserving sharp…

Graphics · Computer Science 2020-09-29 Dongbo Zhang , Xuequan Lu , Hong Qin , Ying He

Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…

Quantum Physics · Physics 2024-02-29 Benjamin J. Brown

The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm…

Optimization and Control · Mathematics 2012-04-03 Caroline Uhler , Stephen J. Wright

In this paper, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications, the data to be transmitted may lie (or can be well approximated) in a…

Information Theory · Computer Science 2017-04-11 Bhavya Kailkhura , Lakshmi Narasimhan Theagarajan , Pramod K. Varshney

Matrix inversion problems are often encountered in experimental physics, and in particular in high-energy particle physics, under the name of unfolding. The true spectrum of a physical quantity is deformed by the presence of a detector,…

Machine Learning · Statistics 2020-09-08 Pietro Vischia

We address the NP-hard problem of finding a non-overlapping dense packing pattern for n Unequal Circle items in a two-dimensional Square Container (PUC-SC) such that the size of the container is minimized. Based on our previous work on an…

Computational Geometry · Computer Science 2017-02-28 Kun He , Mohammed Dosh , Shenghao Zou

In this paper we formulate the problem of packing unequal rectangles/squares into a fixed size circular container as a mixed-integer nonlinear program. Here we pack rectangles so as to maximise some objective (e.g. maximise the number of…

Optimization and Control · Mathematics 2018-02-22 C. O. López , J. E. Beasley

Benders' decomposition (BD) is a framework for solving optimization problems by removing some variables and modeling their contribution to the original problem via so-called Benders cuts. While many advanced optimization techniques can be…

Optimization and Control · Mathematics 2025-12-18 Christopher Hojny , Cédric Roy

Background subtraction is a fundamental low-level processing task in numerous computer vision applications. The vast majority of algorithms process images on a pixel-by-pixel basis, where an independent decision is made for each pixel. A…

Computer Vision and Pattern Recognition · Computer Science 2013-03-19 Vikas Reddy , Conrad Sanderson , Brian C. Lovell

Convolution and cross-correlation are the basis of filtering and pattern or template matching in multimedia signal processing. We propose two throughput scaling options for any one-dimensional convolution kernel in programmable processors…

Multimedia · Computer Science 2012-01-17 Mohammad Ashraful Anam , Yiannis Andreopoulos

We present a new multi-layer peeling technique to cluster points in a metric space. A well-known non-parametric objective is to embed the metric space into a simpler structured metric space such as a line (i.e., Linear Arrangement) or a…

Data Structures and Algorithms · Computer Science 2023-05-03 Yossi Azar , Danny Vainstein

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

Computational Geometry · Computer Science 2015-03-30 Milos Tatarevic

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…

Information Theory · Computer Science 2009-11-13 Tadashi Wadayama

Deep Learning has been widely applied in the area of image processing and natural language processing. In this paper, we propose an end-to-end communication structure based on autoencoder where the transceiver can be optimized jointly. A…

Information Theory · Computer Science 2019-06-18 Tianjie Mu , Xiaohui Chen , Li Chen , Huarui Yin , Weidong Wang

Undersampled inverse problems occur everywhere in the sciences including medical imaging, radar, astronomy etc., yielding underdetermined linear or non-linear reconstruction problems. There are now a myriad of techniques to design decoders…

Optimization and Control · Mathematics 2023-11-29 Nina Maria Gottschling , Paolo Campodonico , Vegard Antun , Anders C. Hansen

Medical image segmentation is a fundamental task in computer-aided diagnosis, requiring models that balance segmentation accuracy and computational efficiency. However, existing segmentation models often struggle to effectively capture…

Computer Vision and Pattern Recognition · Computer Science 2025-12-09 Dalia Alzu'bi , A. Ben Hamza

Packing is a complex phenomenon of prominence in many natural and industrial processes (liquid crystals, granular materials, infiltration, melting, flow, sintering, segregation, sedimentation, compaction, etc.). A variety of computational…

Chemical Physics · Physics 2012-05-31 Danilo Sergi , Claudio D'Angelo , Giulio Scocchi , Alberto Ortona

We consider the irregular strip packing problem of rasterized shapes, where a given set of pieces of irregular shapes represented in pixels should be placed into a rectangular container without overlap. The rasterized shapes provide simple…

Computational Geometry · Computer Science 2022-03-23 Shunji Umetani , Shohei Murakami

We present a Multi-Scale Pyramidal Pooling Network, featuring a novel pyramidal pooling layer at multiple scales and a novel encoding layer. Thanks to the former the network does not require all images of a given classification task to be…

Computer Vision and Pattern Recognition · Computer Science 2012-07-10 Jonathan Masci , Ueli Meier , Gabriel Fricout , Jürgen Schmidhuber