arXiv subjects

Sonali Gupta

Publications and source records attributed to Sonali Gupta.

5 recordsLinked to original sources

arXiv2026

Super-resolved reconstruction of single-photon emitter locations from $g^{(2)}(0)$ maps

Single-photon sources are vital for emerging quantum technologies. In particular, Nitrogen-vacancy (NV) centers in diamond are promising due to their room-temperature stability, long spin coherence, and compatibility with nanophotonic structures. A key challenge, however, is the reliable identification of isolated NV centers, since conventional confocal microscopy is diffraction-limited and cannot resolve emitter distributions within a focal spot. Besides, the associated intensity scanning is a time-expensive procedure. Here, we introduce a raster-scanned $g^{(2)}(0)$ mapping technique combined with an inversion-based reconstruction algorithm. By directly measuring local photon antibunching across the field of view, we extract the effective emitter number within each focal spot and reconstruct occupancy maps on a sub-focal-spot grid. This enables recovery of the number and spatial distribution of emitters within regions smaller than the confocal focal spot, thereby offering possibilities of going beyond the diffraction limit. Our simulations confirm robust reconstruction of NV-center distributions. The method provides a practical diagnostic tool for locating single-photon sources in an efficient and accurate manner, at much lesser time and effort compared to conventional intensity scanning. It offers valuable feedback for nanophotonic device fabrication, supporting more precise and scalable integration of NV-based quantum photonic technologies.

quant-ph↗

arXiv2026

Efficient imaging of quantum emitters using compressive sensing

Optical imaging of quantum emitters is essential for a wide range of quantum applications. Conventional confocal imaging relies on point-by-point raster scanning, which is inherently time-consuming and photon-inefficient, particularly for sparse emitter distributions and photon-limited samples. Here, we demonstrate a compressive sensing-based imaging approach, where spatially structured wide-field excitation replaces raster scanning, enabling reconstruction of sparse emitters. In our implementation, random binary patterns are used to acquire compressive measurements, from which the spatial fluorescence distribution is reconstructed using a GPSR-BB algorithm. We experimentally demonstrate this approach using nitrogen-vacancy (NV) centers in diamond as a representative platform, with high-fidelity image reconstruction achieved using only approximately $20\%$ of the measurements required for conventional raster scanning. In addition to intensity reconstruction, we extend this framework to reconstruct spatial maps of the second-order correlation function $g^{(2)}(0)$ from compressive measurements. This enables identification of single-photon emitters through antibunching signatures using significantly reduced data.

physics.optics↗

arXiv2014

A Comparative Study of Hidden Web Crawlers

A large amount of data on the WWW remains inaccessible to crawlers of Web search engines because it can only be exposed on demand as users fill out and submit forms. The Hidden web refers to the collection of Web data which can be accessed by the crawler only through an interaction with the Web-based search form and not simply by traversing hyperlinks. Research on Hidden Web has emerged almost a decade ago with the main line being exploring ways to access the content in online databases that are usually hidden behind search forms. The efforts in the area mainly focus on designing hidden Web crawlers that focus on learning forms and filling them with meaningful values. The paper gives an insight into the various Hidden Web crawlers developed for the purpose giving a mention to the advantages and shortcoming of the techniques employed in each.

cs.IR↗

arXiv2014

WebParF: A Web partitioning framework for Parallel Crawlers

With the ever proliferating size and scale of the WWW [1] efficient ways of exploring content are of increasing importance. How can we efficiently retrieve information from it through crawling? And in this era of tera and multi-core processors, we ought to think of multi-threaded processes as a serving solution. So, even better how can we improve the crawling performance by using parallel crawlers that work independently? The paper devotes to the fundamental development in the field of parallel crawlers [4] highlighting the advantages and challenges arising from its design. The paper also focuses on the aspect of URL distribution among the various parallel crawling processes or threads and ordering the URLs within each distributed set of URLs. How to distribute URLs from the URL frontier to the various concurrently executing crawling process threads is an orthogonal problem. The paper provides a solution to the problem by designing a framework WebParF that partitions the URL frontier into a several URL queues while considering the various design issues.

cs.IR↗

arXiv2013

A Novel Term Weighing Scheme Towards Efficient Crawl of Textual Databases

The Hidden Web is the vast repository of informational databases available only through search form interfaces, accessible by therein typing a set of keywords in the search forms. Typically, a Hidden Web crawler is employed to autonomously discover and download pages from the Hidden Web. Traditional hidden web crawlers do not provide the search engines with an optimal search experience because of the excessive number of search requests posed through the form interface so as to exhaustively crawl and retrieve the contents of the target hidden web database. Here in our work, we provide a framework to investigate the problem of optimal search and curtail it by proposing an effective query term selection approach based on the frequency & distribution of terms in the document database. The paper focuses on developing a term-weighing scheme called VarDF (acronym for variable document frequency) that can ease the identification of optimal terms to be used as queries on the interface for maximizing the achieved coverage of the crawler which in turn will facilitate the search engine to have a diversified and expanded index. We experimentally evaluate the effectiveness of our approach on a manually created database of documents in the area of Information Retrieval.

cs.IR↗