Please use this identifier to cite or link to this item: http://10.1.7.192:80/jspui/handle/123456789/8199
Full metadata record
DC FieldValueLanguage
dc.contributor.authorParmar, Akshay-
dc.date.accessioned2019-02-25T07:56:41Z-
dc.date.available2019-02-25T07:56:41Z-
dc.date.issued2018-05-
dc.identifier.urihttp://10.1.7.192:80/jspui/handle/123456789/8199-
dc.description.abstractIn the recent scenario of Earth Data, information on a broad variety of topics (e.g.,Population, land use, agriculture, soils, climate) is growing rapidly in five eras i.e. volume, variety, value, velocity and veracity. These data exceeds their boundary in form of storage, manage, compute, access and analysis called Big Data. Moreover, the fast growth rate of such large data generates numerous challenges, such as the rapid access growth of value, transfer speed, diverse data, processing speed and security. However, there exist compact data structure based techniques which directly access the compressed data without the need of decompressing it and also indexing its content. In this work, we have presented the compact data structure based technique. We applied this technique to OCM2-NDVI GeoTIFF single and stacked image to develop compressed dataset for efficient representation. Then we applied scalable clustering on compressed datasets. However, when the datasets have larger values developed compact data structure work very well in both the compact representation of data as well as on scalable clustering.en_US
dc.language.isoenen_US
dc.publisherInstitute of Technologyen_US
dc.subjectComputer 2016en_US
dc.subjectProject Report 2016en_US
dc.subjectIdea Lab Project Reporten_US
dc.subjectProject Reporten_US
dc.subject16MCEen_US
dc.subject16MCECen_US
dc.subject16MCEC11en_US
dc.titleEfficient Earth Observation Data Representation for Scalable Clusteringen_US
dc.typeDissertationen_US
Appears in Collections:Dissertation, CE

Files in This Item:
File Description SizeFormat 
16MCEC11.pdf16MCEC118.89 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.