![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Sravan Danda
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j10]Rohan Agarwal
, Aman Aziz
, Aditya Suraj Krishnan
, Aditya Challa
, Sravan Danda
:
ESW Edge Weights: Ensemble Stochastic Watershed Edge Weights for Hyperspectral Image Classification. IEEE Geosci. Remote. Sens. Lett. 19: 1-5 (2022) - [j9]Aditya Challa
, Geetika Barman
, Sravan Danda
, B. S. Daya Sagar
:
Band Selection Using Dilation Distances. IEEE Geosci. Remote. Sens. Lett. 19: 1-5 (2022) - [j8]Kannan Nagajothi
, Sravan Danda
, Aditya Challa
, B. S. Daya Sagar
:
A Theoretical Analysis of Granulometry-Based Roughness Measures on Cartosat DEMs. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 15: 2836-2844 (2022) - [j7]Aditya Challa
, Sravan Danda
, B. S. Daya Sagar
, Laurent Najman
:
Triplet-Watershed for Hyperspectral Image Classification. IEEE Trans. Geosci. Remote. Sens. 60: 1-14 (2022) - 2021
- [j6]Sampriti Soor
, Aditya Challa
, Sravan Danda
, B. S. Daya Sagar
, Laurent Najman
:
Iterated Watersheds, A Connected Variation of K-Means for Clustering GIS Data. IEEE Trans. Emerg. Top. Comput. 9(2): 626-636 (2021) - 2020
- [j5]Aditya Challa
, Sravan Danda, B. S. Daya Sagar, Laurent Najman
:
Power Spectral Clustering. J. Math. Imaging Vis. 62(9): 1195-1213 (2020) - 2019
- [j4]Sravan Danda
, Aditya Challa
, B. S. Daya Sagar, Laurent Najman
:
Revisiting the Isoperimetric Graph Partitioning Problem. IEEE Access 7: 50636-50649 (2019) - [j3]Sravan Danda
, Aditya Challa
, B. S. Daya Sagar, Laurent Najman
:
Some Theoretical Links Between Shortest Path Filters and Minimum Spanning Tree Filters. J. Math. Imaging Vis. 61(6): 745-762 (2019) - [j2]Aditya Challa
, Sravan Danda
, B. S. Daya Sagar
, Laurent Najman
:
Watersheds for Semi-Supervised Classification. IEEE Signal Process. Lett. 26(5): 720-724 (2019) - 2018
- [j1]Aditya Challa
, Sravan Danda
, B. S. Daya Sagar
, Laurent Najman
:
Some Properties of Interpolations Using Mathematical Morphology. IEEE Trans. Image Process. 27(4): 2038-2048 (2018)
Conference and Workshop Papers
- 2023
- [c8]Harman M. Singh, Shrishailya Agashe, Shreyans Jain, Surjya Ghosh, Aditya Challa, Sravan Danda, Sougata Sen:
(POSTER) Insights from Executing TinyML Models on Smartphones and Microcontrollers. DCOSS-IoT 2023: 89-92 - 2021
- [c7]Pragnya Sridhar
, Deepika Karanji
, Gambhire Swati Sampatrao
, Sravan Danda
, Snehanshu Saha
:
Semantic Influence Score: Tracing Beautiful Minds Through Knowledge Diffusion and Derivative Works. DEXA Workshops 2021: 106-115 - 2018
- [c6]Sampriti Soor
, Aditya Challa
, Sravan Danda, B. S. Daya Sagar, Laurent Najman
:
Extending K-Means to Preserve Spatial Connectivity. IGARSS 2018: 6959-6962 - 2017
- [c5]Aditya Challa, Sravan Danda, B. S. Daya Sagar, Laurent Najman
:
An Introduction to Gamma-Convergence for Spectral Clustering. DGCI 2017: 185-196 - [c4]Aditya Challa
, Sravan Danda, B. S. Daya Sagar, Laurent Najman
:
Power spectral clustering on hyperspectral data. IGARSS 2017: 2195-2198 - [c3]Sravan Danda, Aditya Challa, B. S. Daya Sagar, Laurent Najman
:
Power Tree Filter: A Theoretical Framework Linking Shortest Path Filters and Minimum Spanning Tree Filters. ISMM 2017: 199-210 - 2016
- [c2]Sravan Danda, Aditya Challa
, B. S. Daya Sagar:
A morphology-based approach for cloud detection. IGARSS 2016: 80-83 - [c1]Aditya Challa
, Sravan Danda, B. S. Daya Sagar:
Morphological interpolation for temporal changes. IGARSS 2016: 3358-3361
Informal and Other Publications
- 2024
- [i6]Aditya Challa, Sravan Danda, Laurent Najman:
A Novel Approach to Regularising 1NN classifier for Improved Generalization. CoRR abs/2402.08405 (2024) - [i5]Aditya Challa, Sravan Danda, Laurent Najman, Snehanshu Saha:
Quantile Activation: departing from single point estimation for better generalization across distortions. CoRR abs/2405.11573 (2024) - 2022
- [i4]Rohan Agarwal, Aman Aziz, Aditya Suraj Krishnan, Aditya Challa, Sravan Danda:
ESW Edge-Weights : Ensemble Stochastic Watershed Edge-Weights for Hyperspectral Image Classification. CoRR abs/2202.13502 (2022) - [i3]Siddharth Saravanan, Aditya Challa, Sravan Danda:
A Robust Morphological Approach for Semantic Segmentation of Very High Resolution Images. CoRR abs/2208.01254 (2022) - 2021
- [i2]Aditya Challa, Sravan Danda, B. S. Daya Sagar, Laurent Najman:
Triplet-Watershed for Hyperspectral Image Classification. CoRR abs/2103.09384 (2021) - [i1]Kannan Nagajothi, Sravan Danda, Aditya Challa, B. S. Daya Sagar:
A Theoretical Analysis of Granulometry-based Roughness Measures on Cartosat DEMs. CoRR abs/2107.07827 (2021)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-18 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint