Searcharxiv⌕ Search

arXiv subjects

Akash Kumar

Publications and source records attributed to Akash Kumar.

At least 127 records · Page 7Linked to original sources

Direct measurement of interfacial Dzyaloshinskii-Moriya interaction at the MoS$_{\rm 2}$/Ni$_{80}$Fe$_{20}$ interface

We report on a direct measurement of sizable interfacial Dzyaloshinskii-Moriya interaction (iDMI) at the interface of two-dimensional transition metal dichalcogenide (2D-TMD), MoS$_{\rm 2}$ and Ni$_{80}$Fe$_{20}$ (Py) using Brillouin light scattering spectroscopy. A clear asymmetry in spin-wave dispersion is measured in MoS$_{\rm 2}$/Py/Ta, while no such asymmetry is detected in the reference Py/Ta system. A linear scaling of the DMI constant with the inverse of Py thickness indicates the interfacial origin of the observed DMI. We further observe an enhancement of DMI constant in three to four layer MoS$_{\rm 2}$/Py system (by 56$\%$) as compared to 2 layer MoS$_{\rm 2}$/Py which is caused by a higher density of MoO$_{\rm 3}$ defect species in the case of three to four layer MoS$_{\rm 2}$. The results open possibilities of spin-orbitronic applications utilizing the 2D-TMD based heterostructures.

physics.app-ph↗

Near Memory Acceleration on High Resolution Radio Astronomy Imaging

Modern radio telescopes like the Square Kilometer Array (SKA) will need to process in real-time exabytes of radio-astronomical signals to construct a high-resolution map of the sky. Near-Memory Computing (NMC) could alleviate the performance bottlenecks due to frequent memory accesses in a state-of-the-art radio-astronomy imaging algorithm. In this paper, we show that a sub-module performing a two-dimensional fast Fourier transform (2D FFT) is memory bound using CPI breakdown analysis on IBM Power9. Then, we present an NMC approach on FPGA for 2D FFT that outperforms a CPU by up to a factor of 120x and performs comparably to a high-end GPU, while using less bandwidth and memory.

cs.DC↗

Detecting Deepfakes with Metric Learning

With the arrival of several face-swapping applications such as FaceApp, SnapChat, MixBooth, FaceBlender and many more, the authenticity of digital media content is hanging on a very loose thread. On social media platforms, videos are widely circulated often at a high compression factor. In this work, we analyze several deep learning approaches in the context of deepfakes classification in high compression scenario and demonstrate that a proposed approach based on metric learning can be very effective in performing such a classification. Using less number of frames per video to assess its realism, the metric learning approach using a triplet network architecture proves to be fruitful. It learns to enhance the feature space distance between the cluster of real and fake videos embedding vectors. We validated our approaches on two datasets to analyze the behavior in different environments. We achieved a state-of-the-art AUC score of 99.2% on the Celeb-DF dataset and accuracy of 90.71% on a highly compressed Neural Texture dataset. Our approach is especially helpful on social media platforms where data compression is inevitable.

cs.CV↗

Syn2Real: Forgery Classification via Unsupervised Domain Adaptation

In recent years, image manipulation is becoming increasingly more accessible, yielding more natural-looking images, owing to the modern tools in image processing and computer vision techniques. The task of the identification of forged images has become very challenging. Amongst different types of forgeries, the cases of Copy-Move forgery are increasing manifold, due to the difficulties involved to detect this tampering. To tackle such problems, publicly available datasets are insufficient. In this paper, we propose to create a synthetic forged dataset using deep semantic image inpainting and copy-move forgery algorithm. However, models trained on these datasets have a significant drop in performance when tested on more realistic data. To alleviate this problem, we use unsupervised domain adaptation networks to detect copy-move forgery in new domains by mapping the feature space from our synthetically generated dataset. Furthermore, we improvised the F1 score on CASIA and CoMoFoD dataset to 80.3% and 78.8%, respectively. Our approach can be helpful in those cases where the classification of data is unavailable.

cs.CV↗

Solar Potential Analysis of Rooftops Using Satellite Imagery

Solar energy is one of the most important sources of renewable energy and the cleanest form of energy. In India, where solar energy could produce power around trillion kilowatt-hours in a year, our country is only able to produce power of around in gigawatts only. Many people are not aware of the solar potential of their rooftop, and hence they always think that installing solar panels is very much expensive. In this work, we introduce an approach through which we can generate a report remotely that provides the amount of solar potential of a building using only its latitude and longitude. We further evaluated various types of rooftops to make our solution more robust. We also provide an approximate area of rooftop that can be used for solar panels placement and a visual analysis of how solar panels can be placed to maximize the output of solar power at a location.

cs.CV↗

Copy-Move Forgery Classification via Unsupervised Domain Adaptation

In the current era, image manipulation is becoming increasingly easier, yielding more natural looking images, owing to the modern tools in image processing and computer vision techniques. The task of the segregation of forged images has become very challenging. To tackle such problems, publicly available datasets are insufficient. In this paper, we propose to create a synthetic forged dataset using deep semantic image inpainting algorithm. Furthermore, we use an unsupervised domain adaptation network to detect copy-move forgery in images. Our approach can be helpful in those cases, where the classification of data is unavailable.

cs.CV↗

Shouji: A Fast and Efficient Pre-Alignment Filter for Sequence Alignment

Motivation: The ability to generate massive amounts of sequencing data continues to overwhelm the processing capability of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and hardware acceleration to significantly reduce the execution time of short sequence alignment, a crucial step in analyzing sequenced genomes. We introduce Shouji, a highly-parallel and accurate pre-alignment filter that remarkably reduces the need for computationally-costly dynamic programming algorithms. The first key idea of our proposed pre-alignment filter is to provide high filtering accuracy by correctly detecting all common subsequences shared between two given sequences. The second key idea is to design a hardware accelerator that adopts modern FPGA (Field-Programmable Gate Array) architectures to further boost the performance of our algorithm. Results: Shouji significantly improves the accuracy of pre-alignment filtering by up to two orders of magnitude compared to the state-of-the-art pre-alignment filters, GateKeeper and SHD. Our FPGA-based accelerator is up to three orders of magnitude faster than the equivalent CPU implementation of Shouji. Using a single FPGA chip, we benchmark the benefits of integrating Shouji with five state-of-the-art sequence aligners, designed for different computing platforms. The addition of Shouji as a pre-alignment step reduces the execution time of the five state-of-the-art sequence aligners by up to 18.8x. Shouji can be adapted for any bioinformatics pipeline that performs sequence alignment for verification. Unlike most existing methods that aim to accelerate sequence alignment, Shouji does not sacrifice any of the aligner capabilities, as it does not modify or replace the alignment step. Availability: https://github.com/CMU-SAFARI/Shouji

cs.CE↗

Random walks and forbidden minors II: A $\text{poly}(d\varepsilon^{-1})$-query tester for minor-closed properties of bounded-degree graphs

Let $G$ be a graph with $n$ vertices and maximum degree $d$. Fix some minor-closed property $\mathcal{P}$ (such as planarity). We say that $G$ is $\varepsilon$-far from $\mathcal{P}$ if one has to remove $\varepsilon dn$ edges to make it have $\mathcal{P}$. The problem of property testing $\mathcal{P}$ was introduced in the seminal work of Benjamini-Schramm-Shapira (STOC 2008) that gave a tester with query complexity triply exponential in $\varepsilon^{-1}$. Levi-Ron (TALG 2015) have given the best tester to date, with a quasipolynomial (in $\varepsilon^{-1}$) query complexity. It is an open problem to get property testers whose query complexity is $\text{poly}(d\varepsilon^{-1})$, even for planarity. In this paper, we resolve this open question. For any minor-closed property, we give a tester with query complexity $d\cdot \text{poly}(\varepsilon^{-1})$. The previous line of work on (independent of $n$, two-sided) testers is primarily combinatorial. Our work, on the other hand, employs techniques from spectral graph theory. This paper is a continuation of recent work of the authors (FOCS 2018) analyzing random walk algorithms that find forbidden minors.

cs.DM↗

Direct Observation of Unusual Interfacial Dzyaloshinskii-Moriya Interaction in Graphene/NiFe/Ta Heterostructure

Graphene/ferromagnet interface promises a plethora of new science and technology. The interfacial Dzyaloshinskii Moriya interaction (iDMI) is essential for stabilizing chiral spin textures, which are important for future spintronic devices. Here, we report direct observation of iDMI in graphene/Ni80Fe20/Ta heterostructure from non-reciprocity in spin-wave dispersion using Brillouin light scattering (BLS) technique. Linear scaling of iDMI with the inverse of Ni80Fe20 thicknesses suggests primarily interfacial origin of iDMI. Both iDMI and spin-mixing conductance increase with the increase in defect density of graphene obtained by varying argon pressure during sputter deposition of Ni80Fe20. This suggests that the observed iDMI originates from defect-induced extrinsic spin-orbit coupling at the interface. The direct observation of iDMI at graphene/ferromagnet interface without perpendicular magnetic anisotropy opens new route in designing thin film heterostructures based on 2-D materials for controlling chiral spin structure such as skyrmions and bubbles, and magnetic domain-wall-based storage and memory devices.

cond-mat.mtrl-sci↗

Improving Landmark Recognition using Saliency detection and Feature classification

Image Landmark Recognition has been one of the most sought-after classification challenges in the field of vision and perception. After so many years of generic classification of buildings and monuments from images, people are now focussing upon fine-grained problems - recognizing the category of each building or monument. We proposed an ensemble network for the purpose of classification of Indian Landmark Images. To this end, our method gives robust classification by ensembling the predictions from Graph-Based Visual Saliency (GBVS) network alongwith supervised feature-based classification algorithms such as kNN and Random Forest. The final architecture is an adaptive learning of all the mentioned networks. The proposed network produces a reliable score to eliminate false category cases. Evaluation of our model was done on a new dataset, which involves challenges such as landmark clutter, variable scaling, partial occlusion, etc.

cs.CV↗

Bird Species Classification using Transfer Learning with Multistage Training

Bird species classification has received more and more attention in the field of computer vision, for its promising applications in biology and environmental studies. Recognizing bird species is difficult due to the challenges of discriminative region localization and fine-grained feature learning. In this paper, we have introduced a Transfer learning based method with multistage training. We have used both Pre-Trained Mask-RCNN and an ensemble model consisting of Inception Nets (InceptionV3 & InceptionResNetV2 ) to get localization and species of the bird from the images respectively. Our final model achieves an F1 score of 0.5567 or 55.67 % on the dataset provided in CVIP 2018 Challenge.

cs.CV↗

Finding forbidden minors in sublinear time: a $n^{1/2+o(1)}$-query one-sided tester for minor closed properties on bounded degree graphs

Let $G$ be an undirected, bounded degree graph with $n$ vertices. Fix a finite graph $H$, and suppose one must remove $\varepsilon n$ edges from $G$ to make it $H$-minor free (for some small constant $\varepsilon > 0$). We give an $n^{1/2+o(1)}$-time randomized procedure that, with high probability, finds an $H$-minor in such a graph. As an application, suppose one must remove $\varepsilon n$ edges from a bounded degree graph $G$ to make it planar. This result implies an algorithm, with the same running time, that produces a $K_{3,3}$ or $K_5$ minor in $G$. No prior sublinear time bound was known for this problem. By the graph minor theorem, we get an analogous result for any minor-closed property. Up to $n^{o(1)}$ factors, this resolves a conjecture of Benjamini-Schramm-Shapira (STOC 2008) on the existence of one-sided property testers for minor-closed properties. Furthermore, our algorithm is nearly optimal, by an $Ω(\sqrt{n})$ lower bound of Czumaj et al (RSA 2014). Prior to this work, the only graphs $H$ for which non-trivial one-sided property testers were known for $H$-minor freeness are the following: $H$ being a forest or a cycle (Czumaj et al, RSA 2014), $K_{2,k}$, $(k\times 2)$-grid, and the $k$-circus (Fichtenberger et al, Arxiv 2017).

cs.DM↗

Parallel FPGA Router using Sub-Gradient method and Steiner tree

In the FPGA (Field Programmable Gate Arrays) design flow, one of the most time-consuming step is the routing of nets. Therefore, there is a need to accelerate it. In a recent paper by Hoo et. al., the authors have developed a Linear Programming based framework that parallelizes this routing process to achieve significant speedups (the algorithm is termed as ParaLaR). However, this approach has certain weaknesses. Namely, the constraints violation by the solution and a local minima that could be improved. We address these two issues here. In our paper, we use this framework and solve it using the Primal-Dual sub-gradient method that better exploits the problem properties. We also propose a better way to update the size of the step taken by this iterative algorithm. We perform experiments on a set of standard benchmarks, where we show that our algorithm outperforms the standard existing algorithms (VPR and ParaLaR). We achieve up to 22% improvement in the constraints violation and the standard metric of the minimum channel width when compared with ParaLaR (which is same as in VPR). We achieve about 20% savings in another standard metric of the total wire length (when compared with VPR), which is the same as for ParaLaR. Hence, our algorithm achieves minimum value for all the three parameters. Also, the critical path delay for our algorithm is almost same as compared to VPR and ParaLaR. We achieve relative speedups of 3 times when we run a parallel version of our algorithm using 4 threads.

cs.DC↗

IceBreaker: Solving Cold Start Problem for Video Recommendation Engines

Internet has brought about a tremendous increase in content of all forms and, in that, video content constitutes the major backbone of the total content being published as well as watched. Thus it becomes imperative for video recommendation engines such as Hulu to look for novel and innovative ways to recommend the newly added videos to their users. However, the problem with new videos is that they lack any sort of metadata and user interaction so as to be able to rate the videos for the consumers. To this effect, this paper introduces the several techniques we develop for the Content Based Video Relevance Prediction (CBVRP) Challenge being hosted by Hulu for the ACM Multimedia Conference 2018. We employ different architectures on the CBVRP dataset to make use of the provided frame and video level features and generate predictions of videos that are similar to the other videos. We also implement several ensemble strategies to explore complementarity between both the types of provided features. The obtained results are encouraging and will impel the boundaries of research for multimedia based video recommendation systems.

cs.IR↗

Large spin current generation by the spin Hall effect in mixed crystalline phase Ta thin films

Manipulation of the magnetization in heavy-metal/ferromagnetic bilayers via the spin-orbit torque requires high spin Hall conductivity of the heavy metal. We measure inverse spin Hall voltage using a co-planar wave-guide based broadband ferromagnetic resonance set-up in Py/Ta system with varying crystalline phase of Ta. We demonstrate a strong correlation between the measured spin mixing conductance and spin Hall conductivity with the crystalline phase of Ta thin films. We found a large spin Hall conductivity of $-2439~(\hbar/e)~Ω^{-1}$cm$^{-1}$ for low-resistivity (68 $μΩ-$cm) Ta film having mixed crystalline phase, which we attribute to an extrinsic mechanism of the spin Hall effect.

cond-mat.mes-hall↗

Flipping out with many flips: hardness of testing k-monotonicity

A function f : {0, 1}^n -> {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in circuit complexity, PAC learning, and cryptography. Our work is part of a renewed focus in understanding testability of properties characterized by freeness of arbitrary order patterns as a generalization of monotonicity. Recently, Canonne et al. (ITCS 2017) initiate the study of k-monotone functions in the area of property testing, and Newman et al. (SODA 2017) study testability of families characterized by freeness from order patterns on real-valued functions over the line [n] domain. We study k-monotone functions in the more relaxed parametrized property testing model, introduced by Parnas et al. (JCSS, 72(6), 2006). In this process we resolve a problem left open in previous work. Specifically, our results include the following. 1. Testing 2-monotonicity on the hypercube non-adaptively with one-sided error requires an exponential in \sqrt n number of queries. This behavior shows a stark contrast with testing (1-)monotonicity, which only needs O(\sqrt n) queries (Khot et al. (FOCS 2015)). Furthermore, even the apparently easier task of distinguishing 2-monotone functions from functions that are far from being n^.01 -monotone also requires an exponential number of queries. 2. On the hypercube [n]^d domain, there exists a testing algorithm that makes a constant number of queries and distinguishes functions that are k-monotone from functions that are far from being O(kd^2)-monotone. Such a dependency is likely necessary, given the lower bound above for the hypercube.

cs.CC↗

Crystal structure, stability and optoelectronic properties of the organic-inorganic wide bandgap perovskite CH3NH3BaI3: Candidate for transparent conductor applications

Structural stability, electronic structure and optical properties of CH3NH3BaI3 hybrid perovskite is examined both from theory as well as experiment. Solution-processed thin films of CH3NH3BaI3 exhibited a high band gap of approximately 3.87 eV, which is in excellent agreement with the theoretical estimate of 4 eV. Also, the XRD patterns of the thin films match well with the l-peaks of the simulated pattern obtained from the relaxed unit cell of CH3NH3BaI3, crystallizing in the I4/mcm space group, with lattice parameters, a = 9.30 A, c = 13.94 A. Atom projected density of state and band structure calculations reveal the conduction and valence band edges to be comprised primarily of Barium d-orbitals and Iodine p-orbitals, respectively. The larger band gap of CH3NH3BaI3 compared to CH3NH3PbI3 can be attributed to the lower electro-negativity coupled with the lack of d-orbitals in the valence band of Ba{2+}. A more detailed analysis reveals the excellent chemical and mechanical stability of CH3NH3BaI3 against humidity, unlike its lead halide counterpart, which degrades under such conditions. The dopability of the CH3NH3BaI3 compound e.g. by doping La on the Ba site combined with its structural and mechanical stability under the ambient conditions, suggests this compound as a promising candidate for transparent conductor applications, especially for all perovskite solar cells.

cond-mat.mtrl-sci↗

Testing $k$-Monotonicity

A Boolean $k$-monotone function defined over a finite poset domain ${\cal D}$ alternates between the values $0$ and $1$ at most $k$ times on any ascending chain in ${\cal D}$. Therefore, $k$-monotone functions are natural generalizations of the classical monotone functions, which are the $1$-monotone functions. Motivated by the recent interest in $k$-monotone functions in the context of circuit complexity and learning theory, and by the central role that monotonicity testing plays in the context of property testing, we initiate a systematic study of $k$-monotone functions, in the property testing model. In this model, the goal is to distinguish functions that are $k$-monotone (or are close to being $k$-monotone) from functions that are far from being $k$-monotone. Our results include the following: - We demonstrate a separation between testing $k$-monotonicity and testing monotonicity, on the hypercube domain $\{0,1\}^d$, for $k\geq 3$; - We demonstrate a separation between testing and learning on $\{0,1\}^d$, for $k=ω(\log d)$: testing $k$-monotonicity can be performed with $2^{O(\sqrt d \cdot \log d\cdot \log{1/\varepsilon})}$ queries, while learning $k$-monotone functions requires $2^{Ω(k\cdot \sqrt d\cdot{1/\varepsilon})}$ queries (Blais et al. (RANDOM 2015)). - We present a tolerant test for functions $f\colon[n]^d\to \{0,1\}$ with complexity independent of $n$, which makes progress on a problem left open by Berman et al. (STOC 2014). Our techniques exploit the testing-by-learning paradigm, use novel applications of Fourier analysis on the grid $[n]^d$, and draw connections to distribution testing techniques.

cs.DS↗