Arijit Ghosh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Arijit Ghosh has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
Palash Kumar Kundu
Jadavpur University
6 shared publicationsGautam Sarkar
Department of Electrical Engineering, Jadavpur University, Kolkata, India
5 shared publicationsChanchal Dey
Dept. of Applied Physics, University of Calcutta, Kolkata, India
2 shared publicationsSatyaki Sen
Dept. of ETCE, PTC Kolkata, India
2 shared publicationsSoumi Nandi
Indian Statistical Institute Kolkata India
2 shared publicationsAsit Dey
Dept. of AEIE, RCCIIT, Kolkata, India
1 shared publication
Latest Publications
- 2 January 2026
- Published by Taylor & Francis in LEUKOS
- Vol. 23 (1) , 138-151
A Comparative Performance Analysis for Classification of Real-Time Illumination Images Using Histogram Driven Euclidean Distance and Intersection Technique
- 2 January 2026
- Published by Taylor & Francis in LEUKOS
- Vol. 23 (1) , 138-151
A Comparative Performance Analysis for Classification of Real-Time Illumination Images Using Histogram Driven Euclidean Distance and Intersection Technique
- 28 May 2025
- Published by Taylor & Francis in LEUKOS
- Vol. 22 (3) , 316-325
Real-Time Implementation of Cloud-Based Indoor Illumination Monitoring System
- 28 May 2025
- Published by Taylor & Francis in LEUKOS
- Vol. 22 (3) , 316-325
Real-Time Implementation of Cloud-Based Indoor Illumination Monitoring System
- Open Access
Colorful Helly Theorem for Piercing Boxes with Multiple Points
Let $H_c=H_c(d,n)$ denote the smallest positive integer such that if we have a collection of families $\mathcal{F}_{1}, \dots, \mathcal{F}_{H_{c}}$ of axis-parallel boxes in $\mathbb{R}^{d}$ with the property that every colorful $H_{c}$-tuple from the above families can be pierced by $n$ points then there exits an $i\in \{ 1, \dots, H_{c}\}$, and for all $k\in \{ 1, \dots, H_{c}\} \setminus\{i\}$ there exists $F_k\in\mathcal{F}_k$ such that the following extended family $\mathcal{F}_i\cup\left\{F_k\;|\;k\in \{1, \dots, H_{c}\}\;\mbox{and} \;k\neq i\right\}$ can also be pierced by $n$ points. In this paper, we give a complete characterization of $H_{c}(d,n)$ for all values of $d$ and $n$. Our result is a colorful generalization of piercing axis-parallel boxes with multiple points by Danzer and Gr\"unbaum (Combinatorica 1982).Open AccessColorful Helly Theorem for Piercing Boxes with Multiple Points
Let $H_c=H_c(d,n)$ denote the smallest positive integer such that if we have a collection of families $\mathcal{F}_{1}, \dots, \mathcal{F}_{H_{c}}$ of axis-parallel boxes in $\mathbb{R}^{d}$ with the property that every colorful $H_{c}$-tuple from the above families can be pierced by $n$ points then there exits an $i\in \{ 1, \dots, H_{c}\}$, and for all $k\in \{ 1, \dots, H_{c}\} \setminus\{i\}$ there exists $F_k\in\mathcal{F}_k$ such that the following extended family $\mathcal{F}_i\cup\left\{F_k\;|\;k\in \{1, \dots, H_{c}\}\;\mbox{and} \;k\neq i\right\}$ can also be pierced by $n$ points. In this paper, we give a complete characterization of $H_{c}(d,n)$ for all values of $d$ and $n$. Our result is a colorful generalization of piercing axis-parallel boxes with multiple points by Danzer and Gr\"unbaum (Combinatorica 1982). - Open Access
Almost covering all the layers of hypercube with multiplicities
Given a hypercube $\mathcal{Q}^{n} := \{0,1\}^{n}$ in $\mathbb{R}^{n}$ and $k \in \{0, \dots, n\}$, the $k$-th layer $\mathcal{Q}^{n}_{k}$ of $\mathcal{Q}^{n}$ denotes the set of all points in $\mathcal{Q}^{n}$ whose coordinates contain exactly $k$ many ones. For a fixed $t \in \mathbb{N}$ and $k \in \{0, \dots, n\}$, let $P \in \mathbb{R}\left[x_{1}, \dots, x_{n}\right]$ be a polynomial that has zeroes of multiplicity at least $t$ at all points of $\mathcal{Q}^{n} \setminus \mathcal{Q}^{n}_{k}$, and $P$ has zeros of multiplicity exactly $t-1$ at all points of $\mathcal{Q}^{n}_{k}$. In this short note, we show that $$deg(P) \geq \max\left\{ k, n-k\right\}+2t-2.$$Matching the above lower bound we give an explicit construction of a family of hyperplanes $H_{1}, \dots, H_{m}$ in $\mathbb{R}^{n}$, where $m = \max\left\{ k, n-k\right\}+2t-2$, such that every point of $\mathcal{Q}^{n}_{k}$ will be covered exactly $t-1$ times, and every other point of $\mathcal{Q}^{n}$ will be covered at least $t$ times. Note that putting $k = 0$ and $t=1$, we recover the much celebrated covering result of Alon and F\"uredi (European Journal of Combinatorics, 1993). Using the above family of hyperplanes we disprove a conjecture of Venkitesh (The Electronic Journal of Combinatorics, 2022) on exactly covering symmetric subsets of hypercube $\mathcal{Q}^{n}$ with hyperplanes. To prove the above results we have introduced a new measure of complexity of a subset of the hypercube called index complexity which we believe will be of independent interest. We also study a new interesting variant of the restricted sumset problem motivated by the ideas behind the proof of the above result.Open AccessAlmost covering all the layers of hypercube with multiplicities
Given a hypercube $\mathcal{Q}^{n} := \{0,1\}^{n}$ in $\mathbb{R}^{n}$ and $k \in \{0, \dots, n\}$, the $k$-th layer $\mathcal{Q}^{n}_{k}$ of $\mathcal{Q}^{n}$ denotes the set of all points in $\mathcal{Q}^{n}$ whose coordinates contain exactly $k$ many ones. For a fixed $t \in \mathbb{N}$ and $k \in \{0, \dots, n\}$, let $P \in \mathbb{R}\left[x_{1}, \dots, x_{n}\right]$ be a polynomial that has zeroes of multiplicity at least $t$ at all points of $\mathcal{Q}^{n} \setminus \mathcal{Q}^{n}_{k}$, and $P$ has zeros of multiplicity exactly $t-1$ at all points of $\mathcal{Q}^{n}_{k}$. In this short note, we show that $$deg(P) \geq \max\left\{ k, n-k\right\}+2t-2.$$Matching the above lower bound we give an explicit construction of a family of hyperplanes $H_{1}, \dots, H_{m}$ in $\mathbb{R}^{n}$, where $m = \max\left\{ k, n-k\right\}+2t-2$, such that every point of $\mathcal{Q}^{n}_{k}$ will be covered exactly $t-1$ times, and every other point of $\mathcal{Q}^{n}$ will be covered at least $t$ times. Note that putting $k = 0$ and $t=1$, we recover the much celebrated covering result of Alon and F\"uredi (European Journal of Combinatorics, 1993). Using the above family of hyperplanes we disprove a conjecture of Venkitesh (The Electronic Journal of Combinatorics, 2022) on exactly covering symmetric subsets of hypercube $\mathcal{Q}^{n}$ with hyperplanes. To prove the above results we have introduced a new measure of complexity of a subset of the hypercube called index complexity which we believe will be of independent interest. We also study a new interesting variant of the restricted sumset problem motivated by the ideas behind the proof of the above result. - 16 June 2022
- Published by Elsevier in Gastroenterology
- Vol. 162 (7)
Tu1658: ENTERAL INSULIN DELIVERED BY ANTONOMOUS MICROINJECTORS
- 16 June 2022
- Published by Elsevier in Gastroenterology
- Vol. 162 (7)
Tu1658: ENTERAL INSULIN DELIVERED BY ANTONOMOUS MICROINJECTORS
- 6 June 2022
- Published by Springer Nature in Journal of The Institution of Engineers (India): Series B
- Vol. 103 (5) , 1659-1663
Object Detection Using Computer Vision Methods on Real-Time Lux Sensor Data
- 6 June 2022
- Published by Springer Nature in Journal of The Institution of Engineers (India): Series B
- Vol. 103 (5) , 1659-1663
Object Detection Using Computer Vision Methods on Real-Time Lux Sensor Data
- 14 May 2022
- Published by Springer Nature in Journal of The Institution of Engineers (India): Series B
- Vol. 106 (3) , 1005-1009
Similarity Detection of Illuminance Images using Eigenface Method
- 14 May 2022
- Published by Springer Nature in Journal of The Institution of Engineers (India): Series B
- Vol. 106 (3) , 1005-1009
Similarity Detection of Illuminance Images using Eigenface Method
- 26 February 2022
- Published by Springer Nature in Wireless Personal Communications
- Vol. 125 (2) , 1895-1911
Machine Learning Based Illuminance Estimation from RGB Sensor in a Wireless Network
- 26 February 2022
- Published by Springer Nature in Wireless Personal Communications
- Vol. 125 (2) , 1895-1911
Machine Learning Based Illuminance Estimation from RGB Sensor in a Wireless Network
- 19 May 2020
- Published by Springer Nature in Journal of The Institution of Engineers (India): Series B
- Vol. 101 (3) , 223-227
Design and Real-Time Implementation of Cloud based Indoor Illumination Monitoring System
- 19 May 2020
- Published by Springer Nature in Journal of The Institution of Engineers (India): Series B
- Vol. 101 (3) , 223-227
Design and Real-Time Implementation of Cloud based Indoor Illumination Monitoring System
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 110-113
A Smart Irrigation System
This study is an attempt for an automated irrigation system which enable the users to regularly supervise relative humidity of the soil at different sites through the entire agricultural field for more accurate setting up of irrigation cycles. The sensing unit is modeled on a feedback mechanism with centralized control system which measures relative humidity (RH) of the soil and controls supply of water to the field in a real time process. A wireless communication is established between the sensor as well as controlling unit and the sprinkler. In practice, the pump on which control action is to be taken is at a distance from the land. A data acquisition system with a PC interface using UART-USB is also built up to record instantaneous values of soil temperature.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 110-113
A Smart Irrigation System
This study is an attempt for an automated irrigation system which enable the users to regularly supervise relative humidity of the soil at different sites through the entire agricultural field for more accurate setting up of irrigation cycles. The sensing unit is modeled on a feedback mechanism with centralized control system which measures relative humidity (RH) of the soil and controls supply of water to the field in a real time process. A wireless communication is established between the sensor as well as controlling unit and the sprinkler. In practice, the pump on which control action is to be taken is at a distance from the land. A data acquisition system with a PC interface using UART-USB is also built up to record instantaneous values of soil temperature.