Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
9,882
datasets available to search
ShareScore release 0.9.0
Dataset results
9,882 results for “scales”
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 10. Block example
<p>First, we have to convert the pixelated small image to the original size image, and then divide these into the blocks as it done in extraction time. Then we have to add or subtract random bits from each of these blocks to equal each block hamming bit to original hamming bit number. And then GA is applied to match these randomness to original image hamming bits in per row and column. In figure 10 there is a 4-block example which regenerates randomly using total block bit count. Now we will try to match their row and column bits of information with the extracted data which is described in later section.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 6. Methodology
<p>Our method will first resize the image using normal image resizing option provided by operating system or standard library and attach the extra 2 array of data which contains no of 1 in original image in each row and column. Also, the total no of 1 in that image will be present too.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 16. Failed Generations
<p>For some images there is a chance to get stuck where fitness function maxed, but we are not near to the original image like in figure 16, both row and column fitness matched. But image lost a key portion from original image, in these cases we should increase the weight of fitness function Fx(X), which will solve the issue.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 2. Image stored in cloud each year (Perret, 2017)
<p>Currently, 4.7 trillion of photos are saved in the cloud (Perret, 2017). And only a few percentage are called to use again. So less used files can be stores in a compression technique which can save more space than time and make the cloud system faster as memory redundancy time will be reduced.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 1. Photo amount by year (Perret, 2017)
<p>Revolution of a portable camera with computer started to produce an exponential rate of media files, and users are sharing these files with everyone. So, using the cloud to store images is becoming a favorite choice for users. But cloud does not only store huge files which are approximately 1.2 trillion in 2017 (Perret, 2017), it also has to transfer these files to a different network to serve users. To reduce load, the cloud system started to use different compression algorithm. These algorithms have a tradeoff between time and space. Most of these have better time complexity than space. But as the cloud has powerful and distributed computing power, it may be better to focus on saving space. As data transfer takes more time than processing same data in the cloud. A perfect use case is a mobile sending the large image to the cloud takes more data transfer time than the compression and decompression process in the cloud. So, in this age of the distributed computer, it is better to reduce size as computation time is less important than network data transfer time.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 9. Resized image and extracted data for a 100*100 size image
<p>For the extraction, our goal is to divide an image into smaller blocks and keep the row and column data for these blocks. But for our experiment we used a single block, which means taking the full image as a single block. For bigger image we should always divide the image in separate blocks and work on them par rally. As in figure 8, after extracting the data we can add the row and column bits information in the resized image or saved in a separate file. For proof of concept we saved it in a text file. And later that file is used to feed GA to make the fitness function, in figure 9 an extraction has been shown. In upper and side textbox containing the information which later is saved in a text file.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 7. Basic Methodology
<p>As in figure 7 we are storing the extra data which is look like figure 8. Where a 20*20 size image of alphabet ‘A’ data has been stored. When we regenerate image, we are using these data.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 5. Image down sample
<p>Our proposal is to store each column and row bits count in a separate file and used that to reproduce the image using genetic algorithm.If we take 10% of an image size and the row and column image hamming bit count our total size will be approximately below 15% of the actual image size. We proposed a method to reproduce original image from using this 15% information.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 8. Sample Data Extraction for a 20*20 size image
<p>As in figure 7 we are storing the extra data which is look like figure 8. Where a 20*20 size image of alphabet ‘A’ data has been stored. When we regenerate image, we are using these data.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 4. Image regeneration using GA
<p>In 2008, Roger Johansson was able to regenerate a Mona Lisa image from random sampling (Roger Johansson, 2017). It uses a genetic algorithm to model a population of individuals, each containing a string of DNA which can be visualized in the form of an image (Grow Your Own Picture Genetic Algorithms & Generative Art, 2017).</p> <p>By starting with a population consisting of a randomly generated gene pool, each individual is compared to the reference image (the one on the left), and the individuals can then be ranked by their likeness to it, known as their "fitness", with the best fit being displayed on the output image (the one on the right) (Grow Your Own Picture Genetic Algorithms & Generative Art, 2017). By breeding the fittest individuals from the population, the DNA which produces the most accurate representation of the reference image is selected over successive generations, effectively demonstrating the power of a natural selection process to produce the best candidate for any given environment (Grow Your Own Picture Genetic Algorithms & Generative Art, 2017).</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 3. Data compression and image reconstruction (55:148 Digital Image Processing, 2017)
<p>There are several techniques which are normally divided into two categories lossy and lossless image compressions. In lossy compression, after recovery there are negligible difference present where lossless gives accurate image. Huffman encoding is very well known, which can provide optimal compression and decompression without error (55:148 Digital Image Processing, 2017). The basic idea of Huffman coding is to represent data by number of variable size, where more frequent info being represented by shorter number (55:148 Digital Image Processing, 2017). Currently the Lempel-Ziv (or Lempel-Ziv-Welch, LZW) algorithm for dictionary-based coding has got attention as a better compression algorithm (55:148 Digital Image Processing, 2017).</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 12. After few generation
<p>In figure 11 it is the initial population showed and figure 12 the population started to change and figure 13 we reached a convergence.</p>
A Genetic Algorithm Approach to Regenerate Image from a Reduce Scaled Image Using Bit Data Count-Figure 13. Reached convergence
<p>In figure 11 it is the initial population showed and figure 12 the population started to change and figure 13 we reached a convergence.</p>
Influence of storm sequencing and beach recovery on sediment transport and beach resilience data set at CIEM large scale wave flume.
<p>The Influence of storm sequencing and beach recovery on sediment transport and beach resilience (RESIST) experiments project proposes to study experimentally sequences of storm induced erosion and beach recovery, with a particular focus on the poorly known morphodynamic processes under low energy conditions. Series of large scale experimental tests were done to collect data on the cross-shore hydrodynamics, sediment transport and beach evolution. The main aim of this proposal is to investigate the influence of sequences of beach erosion-recovery in the overall beach profile evolution.</p> <p>The tested wave conditions (2 erosive and 3 Accretive bichromatic conditions) were combined to form three sequences of changing high/mild energy conditions. Each condition started from an initial beach 1/15 handmade profile.</p> <p>The experiments were carried out in the large scale wave flume CIEM at Universitat Politècnica de Catalunya (UPC), Barcelona within the program of Transnational Access of Hydralab+.</p> <p>Due to its size, the data set can not be placed on this repository and will be provided on demand. Please contact with the authors or with the data manager of the CIEM installation.</p>
Ripple Complex Experiments data set at CIEM large scale wave flume within Hydralab + project.
<p>The RIPCOM experiments (RIPple COMplex experiments) are presented in order to study the ripple growth conditions on large wave flume tests under fine unimodal, coarse unimodal and mixed sands conditions. The main objectives of the experiments is to improve and understand the protocols to perform mixed sediment experiments within the ripple regime and use/improve the equipment developed at Task 9.1 of the COMPLEX Joint Research Activity within Hydralab+. The experiments were carried out in the large scale wave flume CIEM at Universitat Politècnica de Catalunya (UPC), Barcelona.</p> <p>The experimental plan is divided in three steps:</p> <p>1. Find the optimum wave conditions that ensure ripples (based on measured velocities and previous literature studies) on the study area. Test the targeted waves with unimodal fine sediment (d 50 =0.250 mm) and measure the obtained ripples under the tested conditions. From the obtained measurements, the waves to be used on the next two steps are selected in order to fix the best conditions to produce ripples within the experimental constrains.</p> <p>2. The 13 upper cm of the fine sediment is removed and replaced by the coarser sediment (d 50 =0.545 mm). Once that is done the selected waves to be tested are reproduced and the bottom bedforms are measured.</p> <p>3. Mix both sediments fine and coarser sand homogeneously in order to repeat the selected wave conditions and measure the ripples growth and evolution under mixed sediment conditions.</p> <p>Due to its size, the data set can not be placed on this repository and will be provided on demand. Please contact with the authors or with the data manager of the CIEM installation.</p>
Validation of liquefaction retrofitting techniques from geotechnical centrifuge small scale models
<p>The dataset is composed by the results of 37 dynamic geotechnical centrifuge tests performed in the frame of the project:</p> <p>H2020-DRA-2015 <strong>LIQUEFACT: </strong><em>Assessment and mitigation of Liquefaction potential across Europe: a holistic approach to protect structures/infrastructure for improved resilience to earthquake-induced Liquefaction disasters.</em></p> <p>The experiments firstly reproduced on reduced scale models the liquefaction conditions and secondly tested the effectiveness of three mitigation techniques: vertical drains, horizontal drains, induced partial saturation.</p> <p>The dataset is strictly linked to the document <strong>"DELIVERABLE D4.2 - Report on validation of retrofitting techniques from small scale models"</strong>. This document is of public access and can be downloaded from the website of the project <a href="http://www.liquefact.eu/">www.liquefact.eu</a></p> <p>The document D4.2 illustrates the testing programme, the objectives, the experimental procedures and gives the elements for the interpretation of data.</p>
Simulated Neutral Landscape Models and Scaling Results for Testing of Multi-Dimensional Grid-Point Scaling Algorithm
<p>The data package contains (1) simulations of neutral landscape models of categorical data for benchmark testing of scaling algorithms, and (2) scaling results for testing consistency and sensitivity of the newly developed Multi-Dimensional Grid-Point (MDGP) scaling algorithm.</p> <p>Neutral landscapes were generated using the "nlmpy" python module. The MDGP scaling algorithm and the test framework were implemented in R (https://github.com/gannd/landscapeScaling). </p>
Multi-scale modeling - WRF-CIM coupling
<p>In this dataset you can find WRF and CIM simulated data produced and used in the paper (<a href="https://www.sciencedirect.com/science/article/pii/S2212095518301688">Multi-scale modeling of the urban meteorology: Integration of a new canopy model in the WRF model</a>).</p> <p>More details on the datasets can be found in the Python Notebook.</p> <p>Additional data (namelists for ex.) can be obtained directly by contacting the authors.</p>
Data and results for manuscript "Small scale characterization of vine plant root water uptake via 3D electrical resistivity tomography and Mise-à-la-Masse method"
<p>This package contains measured raw ERT and MALM data used to generate the plots in the manuscript.</p> <p> </p>
Slovenian adaptation of the Brief Sensation Seeking Scale (BSSS-8)
<p>Dataset accompanying the paper "Adaptation and psychometric properties of the Slovenian Brief Sensation Seeking Scale (BSSS-8)" submitted to the Current Psychology.</p>
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.