English
Related papers

Related papers: Faulty picture-hanging improved

200 papers

All techniques for denoising involve a notion of a true (noise-free) image, and a hypothesis space. The hypothesis space may reconstruct the image directly as a grayscale valued function, or indirectly by its Fourier or wavelet spectrum.…

Image and Video Processing · Electrical Eng. & Systems 2025-05-29 Sajal Chakroborty , Suddhasattwa Das

The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to…

Bounding volumes are an established concept in computer graphics and vision tasks but have seen little change since their early inception. In this work, we study the use of neural networks as bounding volumes. Our key observation is that…

Graphics · Computer Science 2024-05-27 Stephanie Wenxin Liu , Michael Fischer , Paul D. Yoo , Tobias Ritschel

We study the following combinatorial problem. Given a set of $n$ y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers such that any two consecutive layers differ only in swaps…

Discrete Mathematics · Computer Science 2024-01-02 Oksana Firman , Philipp Kindermann , Boris Klemz , Alexander Ravsky , Alexander Wolff , Johannes Zink

We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…

Combinatorics · Mathematics 2020-06-26 Guo-Niu Han

We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…

Discrete Mathematics · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Helena A. Verrill

The solution of the classical Coupon Collector's Problem is based on the assumptions that all stickers are independently and uniformly distributed. We can prove statistically as well as analytically that in particular the assumption of…

Probability · Mathematics 2016-03-10 Niklas Braband , Sonja Braband , Malte Braband

Image segmentation is the process of partitioning an image into a set of meaningful regions according to some criteria. Hierarchical segmentation has emerged as a major trend in this regard as it favors the emergence of important regions at…

Machine Learning · Statistics 2018-02-21 Amin Fehri , Santiago Velasco-Forero , Fernand Meyer

The pancake puzzle is a classic optimization problem that has become a standard benchmark for heuristic search algorithms. In this paper, we provide full proofs regarding the local search topology of the gap heuristic for the pancake…

Artificial Intelligence · Computer Science 2017-05-15 Richard Anthony Valenzano , Danniel Sihui Yang

The edge-of-the-wedge theorem in several complex variables gives the analytic continuation of functions defined on the poly upper half plane and the poly lower half plane, the set of points in $\mathbb{C}^d$ with all coordinates in the…

Complex Variables · Mathematics 2017-09-19 J. E. Pascoe

We resolve the complexity of the point-boundary variant of the art gallery problem, showing that it is $\exists\mathbb{R}$-complete, meaning that it is equivalent under polynomial time reductions to deciding whether a system of polynomial…

Computational Geometry · Computer Science 2025-04-11 Jack Stade

This paper studies the optimal solution of the classical problem of detecting the location of multiple image occurrences in a two-dimensional, noisy measurement. Assuming the image occurrences do not overlap, we formulate this task as a…

Image and Video Processing · Electrical Eng. & Systems 2024-07-31 Simon Anuk , Tamir Bendory , Amichai Painsky

We apply a classic result in Theoretical Computer Science to solve a sticky problem, and give a neat and slick quick proof of half of it

Combinatorics · Mathematics 2012-10-23 Larry Shepp , Doron Zeilberger , Cun-Hui Zhang

Image deblurring in photon-limited conditions is ubiquitous in a variety of low-light applications such as photography, microscopy, and astronomy. However, the presence of photon shot noise due to low illumination and/or short exposure…

Image and Video Processing · Electrical Eng. & Systems 2022-10-28 Yash Sanghvi , Abhiram Gnanasambandam , Stanley H. Chan

In image processing, classical methods minimize a suitable functional that balances between computational feasibility (convexity of the functional is ideal) and suitable penalties reflecting the desired image decomposition. The fact that…

Computer Vision and Pattern Recognition · Computer Science 2020-10-20 Robin Richter , Duy H. Thai , Stephan F. Huckemann

Using derandomization, we provide an upper bound on the compression size of solutions to the graph coloring problem. In general, if solutions to a combinatorial problem exist with high probability and the probability is simple, then there…

Computational Complexity · Computer Science 2023-09-08 Samuel Epstein

Progress in language and image understanding by machines has sparkled the interest of the research community in more open-ended, holistic tasks, and refueled an old AI dream of building intelligent machines. We discuss a few prominent…

Artificial Intelligence · Computer Science 2015-01-16 Mateusz Malinowski , Mario Fritz

Generating a description of an image is called image captioning. Image captioning requires to recognize the important objects, their attributes and their relationships in an image. It also needs to generate syntactically and semantically…

Computer Vision and Pattern Recognition · Computer Science 2018-10-16 Md. Zakir Hossain , Ferdous Sohel , Mohd Fairuz Shiratuddin , Hamid Laga

In this paper, we present a strategy for training convolutional neural networks to effectively resolve interference arising from competing hypotheses relating to inter-categorical information throughout the network. The premise is based on…

Computer Vision and Pattern Recognition · Computer Science 2020-08-14 Md Amirul Islam , Matthew Kowal , Konstantinos G. Derpanis , Neil D. B. Bruce

We consider a logical puzzle which we call double pouring problem, which was original defined for $k=3$ vessels. We generalize this definition to $k \ge 2 $ as follows. Each of the $k$ vessels contains an integer amount of water, called its…

Combinatorics · Mathematics 2025-04-07 Gerold Jäger , Tuomo Lehtilä
‹ Prev 1 3 4 5 6 7 10 Next ›