arXiv subjects

Nitin Singh

Publications and source records attributed to Nitin Singh.

14 recordsLinked to original sources

arXiv2025

Is Architectural Complexity Always the Answer? A Case Study on SwinIR vs. an Efficient CNN

The simultaneous restoration of high-frequency details and suppression of severe noise in low-light imagery presents a significant and persistent challenge in computer vision. While large-scale Transformer models like SwinIR have set the state of the art in performance, their high computational cost can be a barrier for practical applications. This paper investigates the critical trade-off between performance and efficiency by comparing the state-of-the-art SwinIR model against a standard, lightweight Convolutional Neural Network (CNN) on this challenging task. Our experimental results reveal a nuanced but important finding. While the Transformer-based SwinIR model achieves a higher peak performance, with a Peak Signal-to-Noise Ratio (PSNR) of 39.03 dB, the lightweight CNN delivers a surprisingly competitive PSNR of 37.4 dB. Crucially, the CNN reached this performance after converging in only 10 epochs of training, whereas the more complex SwinIR model required 132 epochs. This efficiency is further underscored by the model's size; the CNN is over 55 times smaller than SwinIR. This work demonstrates that a standard CNN can provide a near state-of-the-art result with significantly lower computational overhead, presenting a compelling case for its use in real-world scenarios where resource constraints are a primary concern.

cs.CV↗

arXiv2023

New bounds on the anti-Ramsey numbers of star graphs

The anti-Ramsey number $ar(G,H)$ with input graph $G$ and pattern graph $H$, is the maximum positive integer $k$ such that there exists an edge coloring of $G$ using $k$ colors, in which there are no rainbow subgraphs isomorphic to $H$ in $G$. ($H$ is rainbow if all its edges get distinct colors). The concept of anti-Ramsey number was introduced by Erdös, Simanovitz, and Sós in 1973. Thereafter several researchers investigated this concept in the combinatorial setting. Recently, Feng et al. revisited the anti-Ramsey problem for the pattern graph $K_{1,t}$ (for $t \geq 3$) purely from an algorithmic point of view due to its applications in interference modeling of wireless networks. They posed it as an optimization problem, the maximum edge $q$-coloring problem. For a graph $G$ and an integer $q\geq 2$, an edge $q$-coloring of $G$ is an assignment of colors to edges of $G$, such that edges incident on a vertex span at most $q$ distinct colors. The maximum edge $q$-coloring problem seeks to maximize the number of colors in an edge $q$-coloring of the graph $G$. Note that the optimum value of the edge $q$-coloring problem of $G$ equals $ar(G,K_{1,q+1})$. In this paper, we study $ar(G,K_{1,t})$, the anti-Ramsey number of stars, for each fixed integer $t\geq 3$, both from combinatorial and algorithmic point of view. The first of our main results presents an upper bound for $ar(G,K_{1,q+1})$, in terms of number of vertices and the minimum degree of $G$. The second one improves this result for the case of triangle-free input graphs. For a positive integer $t$, let $H_t$ denote a subgraph of $G$ with maximum number of possible edges and maximum degree $t$. Our third main result presents an upper bound for $ar(G,K_{1,q+1})$ in terms of $|E(H_{q-1})|$. All our results have algorithmic consequences.

cs.DM↗

arXiv2021

Design of pseudo-mechanisms and multistable units for mechanical metamaterials

Mechanism - collections of rigid elements coupled by perfect hinges which exhibit a zero-energy motion -- motivate the design of a variety of mechanical metamaterials. We significantly enlarge this design space by considering pseudo-mechanisms, collections of elastically coupled elements that exhibit motions with very low energy costs. We show that their geometric design generally is distinct from those of true mechanisms, thus opening up a large and virtually unexplored design space. We further extend this space by designing building blocks with bistable and tristable energy landscapes, realize these by 3D printing, and show how these form unit cells for multistable metamaterials.

cond-mat.soft↗

arXiv2020

Uncertainty-aware Short-term Motion Prediction of Traffic Actors for Autonomous Driving

We address one of the crucial aspects necessary for safe and efficient operations of autonomous vehicles, namely predicting future state of traffic actors in the autonomous vehicle's surroundings. We introduce a deep learning-based approach that takes into account a current world state and produces raster images of each actor's vicinity. The rasters are then used as inputs to deep convolutional models to infer future movement of actors while also accounting for and capturing inherent uncertainty of the prediction task. Extensive experiments on real-world data strongly suggest benefits of the proposed approach. Moreover, following completion of the offline tests the system was successfully tested onboard self-driving vehicles.

cs.LG↗

arXiv2019

Improved Approximation for Maximum Edge Colouring Problem

The anti-Ramsey number, $ar(G, H)$ is the minimum integer $k$ such that in any edge colouring of $G$ with $k$ colours there is a rainbow subgraph isomorphic to $H$, i.e., a copy of $H$ with each of its edges assigned a different colour. The notion was introduced by Erd{ö}s and Simonovits in 1973. Since then the parameter has been studied extensively in combinatorics, also the particular case when $H$ is a star graph. Recently this case received the attention of researchers from the algorithm community because of its applications in interface modelling of wireless networks. To the algorithm community, the problem is known as maximum edge $q$-colouring problem. In this paper, we study the maximum edge $2$-colouring problem from the approximation algorithm point of view. The case $q=2$ is particularly interesting due to its application in real-life problems. Algorithmically, this problem is known to be NP-hard for $q\ge 2$. For the case of $q=2$, it is also known that no polynomial-time algorithm can approximate to a factor less than $3/2$ assuming the unique games conjecture. Feng et al. showed a $2$-approximation algorithm for this problem. Later Adamaszek and Popa presented a $5/3$-approximation algorithm with the additional assumption that the input graph has a perfect matching. Note that the obvious but the only known algorithm issues different colours to the edges of a maximum matching (say $M$) and different colours to the connected components of $G \setminus M$. In this article, we give a new analysis of the aforementioned algorithm leading to an improved approximation bound for triangle-free graphs with perfect matching. We also show a new lower bound when the input graph is triangle-free. The contribution of the paper is a completely new, deeper and closer analysis of how the optimum achieves a higher number of colours than the matching based algorithm, mentioned above.

cs.DM↗

arXiv2019

Change Point Detection for Compositional Multivariate Data

Change point detection algorithms have numerous applications in fields of scientific and economic importance. We consider the problem of change point detection on compositional multivariate data (each sample is a probability mass function), which is a practically important sub-class of general multivariate data. While the problem of change-point detection is well studied in univariate setting, and there are few viable implementations for a general multivariate data, the existing methods do not perform well on compositional data. In this paper, we propose a parametric approach for change point detection in compositional data. Moreover, using simple transformations on data, we extend our approach to handle any general multivariate data. Experimentally, we show that our method performs significantly better on compositional data and is competitive on general data compared to the available state of the art implementations.

stat.AP↗

arXiv2016

A construction principle for tight and minimal triangulations of manifolds

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying manifold. Tight triangulations are conjectured to be strongly minimal, and proven to be so for dimensions $\leq 3$. However, in spite of substantial theoretical results about such triangulations, there are precious few examples. In fact, apart from dimension two, we do not know if there are infinitely many of them in any given dimension. In this paper, we present a computer-friendly combinatorial scheme to obtain tight triangulations, and present new examples in dimensions three, four and five. Furthermore, we describe a family of tight triangulated $d$-manifolds, with $2^{d-1} \lfloor d / 2 \rfloor ! \lfloor (d-1) / 2 \rfloor !$ isomorphically distinct members for each dimension $d \geq 2$. While we still do not know if there are infinitely many tight triangulations in a fixed dimension $d > 2$, this result shows that there are abundantly many.

math.GT↗

arXiv2015

Separation index of graphs and stacked 2-spheres

In 1987, Kalai proved that stacked spheres of dimension $d\geq 3$ are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result does not extend to dimension $d=2$. In this article, we give a characterisation of stacked $2$-spheres using what we call the {\em separation index}. Namely, we show that the separation index of a triangulated $2$-sphere is maximal if and only if it is stacked. In addition, we prove that, amongst all $n$-vertex triangulated $2$-spheres, the separation index is {\em minimised} by some $n$-vertex flag sphere for $n\geq 6$. Furthermore, we apply this characterisation of stacked $2$-spheres to settle the outstanding $3$-dimensional case of the Lutz-Sulanke-Swartz conjecture that "tight-neighbourly triangulated manifolds are tight". For dimension $d\geq 4$, the conjecture has already been proved by Effenberger following a result of Novik and Swartz.

math.GT↗

arXiv2014

Efficient algorithms to decide tightness

Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time algorithm, but efficient methods to decide tightness are only known in the trivial setting of triangulated surfaces. In this article, we present a new polynomial time procedure to decide tightness for triangulations of $3$-manifolds -- a problem which previously was thought to be hard. Furthermore, we describe an algorithm to decide general tightness in the case of $4$-dimensional combinatorial manifolds which is fixed parameter tractable in the treewidth of the $1$-skeletons of their vertex links, and we present an algorithm to decide $\mathbb{F}_2$-tightness for weak pseudomanifolds $M$ of arbitrary but fixed dimension which is fixed parameter tractable in the treewidth of the dual graph of $M$.

cs.CG↗

arXiv2014

On Additive Combinatorics of Permutations of \mathbb{Z}_n

Let $\mathbb{Z}_n$ denote the ring of integers modulo $n$. In this paper we consider two extremal problems on permutations of $\mathbb{Z}_n$, namely, the maximum size of a collection of permutations such that the sum of any two distinct permutations in the collection is again a permutation, and the maximum size of a collection of permutations such that the sum of any two distinct permutations in the collection is not a permutation. Let the sizes be denoted by $s(n)$ and $t(n)$ respectively. The case when $n$ is even is trivial in both the cases, with $s(n)=1$ and $t(n)=n!$. For $n$ odd, we prove $s(n)\geq (nϕ(n))/2^k$ where $k$ is the number of distinct prime divisors of $n$. When $n$ is an odd prime we prove $s(n)\leq \frac{e^2}π n ((n-1)/e)^\frac{n-1}{2}$. For the second problem, we prove $2^{(n-1)/2}.(\frac{n-1}{2})!\leq t(n)\leq 2^k.(n-1)!/ϕ(n)$ when $n$ is odd.

math.CO↗

arXiv2013

Minimal triangulations of (S^3\times S^1)^{#3} and (S^3 \(twisted product) S^1)^{#3}

A triangulated $d$-manifold $K$, satisfies the inequality $\binom{f_0(K)-d-1}{2}\geq \binom{d+2}{2}β_1(K;\mathbb{Z}_2)$ for $d\geq 3$. The triangulated $d$-manifolds that meet the bound with equality are called {\em tight neighborly}. In this paper, we present tight neighborly triangulations of 4-manifolds on 15 vertices with $\mathbb{Z}_3$ as automorphism group. One such example wasconstructed by Bagchi and Datta in 2011. We show that there are exactly 12 such triangulations up to isomorphism, 10 of which are orientable.

math.GT↗

arXiv2013

Non-existence of tight neighborly manifolds with $β_1=2$

For $d\geq 2$, Walkup's class $\Kd$ consists of the $d$-dimensional simplicial complexes whose vertex-links are stacked $(d-1)$-spheres. Recently Lutz, Sulanke and Swartz have shown that all $\mathbb{F}$-orientable triangulated $d$-manifolds satisfy the inequality $\binom{f_0-d-1}{2} \geq \binom{d+2}{2}β_1$ for $d\geq 3$. They call a $d$-manifold \emph{tight neighborly} if it attains the equality in the bound. For $d\geq 4$, tight neighborly $d$-manifolds are precisely the 2-neighborly members of $\Kd$. In this paper we show that there does not exist any tight neighborly $d$-manifold with $β_1=2$.

math.GT↗

arXiv2013

An infinite family of tight triangulations of manifolds

We give an explicit construction of vertex-transitive tight triangulations of $d$-manifolds for $d\geq 2$. More explicitly, for each $d\geq 2$, we construct two $(d^2+5d+5)$-vertex neighborly triangulated $d$-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated manifolds currently known is the series of non-simply connected triangulated $d$-manifolds with $2d+3$ vertices constructed by Kühnel. The manifolds we construct are strongly minimal. For $d\geq 3$, they are also tight neighborly as defined by Lutz, Sulanke and Swartz. Like Kühnel's complexes, our manifolds are orientable in even dimensions and non-orientable in odd dimensions.

math.GT↗

arXiv2012

Tight triangulations of some 4-manifolds

Walkup's class ${\cal K}(d)$ consists of the $d$-dimensional simplicial complexes all whose vertex links are stacked $(d-1)$-spheres. According to a result of Walkup, the face vector of any triangulated 4-manifold $X$ with Euler characteristic $χ$ satisfies $f_1 \geq 5f_0 - 15/2 χ$, with equality only for $X \in {\cal K}(4)$. Kühnel observed that this implies $f_0(f_0 - 11) \geq -15χ$, with equality only for 2-neighborly members of ${\cal K}(4)$. For $n = 6, 11$ and 15, there are triangulated 4-manifolds with $f_0=n$ and $f_0(f_0 - 11) = -15χ$. In this article, we present triangulated 4-manifolds with $f_0 = 21, 26$ and 41 which satisfy $f_0(f_0 - 11) = -15χ$. All these triangulated manifolds are tight and strongly minimal.

math.GT↗