Search for: All records

Fiber optic bundles are used in narrow-diameter medical and industrial instruments for acquiring images from confined locations. Images transmitted through these bundles contain only one pixel of information per fiber core and fail to capture information from the cladding region between cores. Both factors limit the spatial resolution attainable with fiber bundles. We show here that computational imaging (CI) can be combined with spectral coding to overcome these two fundamental limitations and improve spatial resolution in fiber bundle imaging. By acquiring multiple images of a scene with a high-resolution mask pattern imposed, up to 17 pixels of information can be recovered from each fiber core. A dispersive element at the distal end of the bundle imparts a wavelength-dependent lateral shift on light from the object. This enables light that would otherwise be lost at the inter-fiber cladding to be transmitted through adjacent fiber cores. We experimentally demonstrate this approach using synthetic and real objects. Using CI with spectral coding, object features 5× smaller than individual fiber cores were resolved, whereas conventional imaging could only resolve features at least 1.5× larger than each core. In summary, CI combined with spectral coding provides an approach for overcoming the two fundamental limitations ofmore »fiber optic bundle imaging.

« less

We revisit the problem of building static hash tables on the GPU and present an efficient implementation of bucketed hash tables. By decoupling the probing scheme from the hash table in-memory representation, we offer an implementation where the number of probes and the bucket size are the only factors limiting performance. Our analysis sweeps through the hash table parameter space for two probing schemes: cuckoo and iceberg hashing. We show that a bucketed cuckoo hash table (BCHT) that uses three hash functions outperforms alternative methods that use iceberg hashing and a cuckoo hash table that uses a bucket size of one. At load factors as high as 0.99, BCHT enjoys an average probe count of 1.43 during insertion. Using three hash functions only, positive and negative queries require at most 1.39 and 2.8 average probes per key, respectively.

Portable smartphone-based fluorescent microscopes are becoming popular owing to their ability to provide major functionalities offered by regular benchtop microscopes at a fraction of the cost. However, smartphone-based microscopes are still limited to a single fluorophore, fixed magnification, the inability to work with a different smartphones, and limited usability to either glass slides or cover slips. To overcome these challenges, here we present a modular smartphone-based microscopic attachment. The modular design allows the user to easily swap between different sets of filters and lenses, thereby enabling utility of multiple fluorophores and magnification levels. Our microscopic smartphone attachment can also be used with different smartphones and was tested with Nokia Lumia 1020, Samsung Galaxy S9+, and an iPhone XS. Further, we showed imaging results of samples on glass slides, cover slips, and microfluidic devices. A 1951 USAF resolution test target was used to quantify the maximum resolution of the microscope which was found to be 3.9 μm. The performance of the smartphone-based microscope was compared with a benchtop microscope and we found an R 2 value of 0.99 using polystyrene beads and blood cells isolated from human blood samples collected from Robert Wood Johnson Medical Hospital. Additionally, to count the particlesmore »(cells and beads) imaged from the smartphone-based fluorescent microscope, we developed artificial neural networks (ANNs) using multiple training algorithms, and evaluated their performances compared to the control (ImageJ). Finally, we did ANOVA and Tukey's post-hoc analysis and found a p -value of 0.97 which shows that no statistical significant difference exists between the performance of the trained ANN and control (ImageJ).« less

We present a fast dynamic graph data structure for the GPU. Our dynamic graph structure uses one hash table per vertex to store adjacency lists and achieves 3.4–14.8x faster insertion rates over the state of the art across a diverse set of large datasets, as well as deletion speedups up to 7.8x. The data structure supports queries and dynamic updates through both edge and vertex insertion and deletion. In addition, we define a comprehensive evaluation strategy based on operations, workloads, and applications that we believe better characterize and evaluate dynamic graph data structures.