scholarly journals Compression Algorithms to Optimize Battery Consumption in Precision Livestock Farming.

2021 ◽  
Author(s):  
Maria Isabel Arango Palacio ◽  
Isabella Montoya henao ◽  
Andres Felipe Agudelo Ortega ◽  
Mauricio Toro

The 34% world supply of food proteins comes from livestock and the need to supplement it, makes that the number of animals rearing increases day by day. Nowadays, this process is not effective due to the farmers not having the correcttools and devices to minimize their energy consumption. In line, the objective of this project is to design an algorithm that helps to compress and decompress images to optimize the energy that is required for classifying and obtaining theinformation of the animals. The algorithms that we imple?mented to achieve the objective previously mentioned were the lossy image compression with Fast Fourier Transform and lossless image compression with Huffman Coding, they were the ones that gave us the best results in terms of complexity execution time, the least possible loss of information and with a good compression ratio.

2021 ◽  
Author(s):  
Simón Marín Giraldo ◽  
Julian David Ramirez Lopera ◽  
Mauricio Toro ◽  
Andres Salazar Galeano

This work introduces some of the most widely usedcompression algorithms, and their relevance to the field oflivestock farming, which has been historically characterizedfor requiring menial and inefficient labor, introducingenvironmental. And also for lacking the scale andautomation that cutting edge technologies can provide. Bydoing this we will explain how this opens the door tolocations untouched by technology, and the generaladvantages, and possibilities that integrating patternrecognition models bring to the table. In addition, we willexplain the ins and outs of these compression algorithms,and our reasoning behind our decision to choose analgorithm to implement in our pattern recognition model.To solve this problem, Seam Carving, Image Scaling andRun-Length encoding were used. With them we compressedthe images an average of 17.5% of their original size in atime complexity of O(L*N*M). This research shows howyou can create an efficient compression algorithm for usagein PLF.


2011 ◽  
Vol 1 (4) ◽  
pp. 1-8
Author(s):  
G. Chenchu Krishnaiah ◽  
T. Jayachandraprasad ◽  
M.N. Giri Prasad

2018 ◽  
Vol 5 (4) ◽  
pp. 34
Author(s):  
R. PANDIAN ◽  
KUMARI S. LALITHA ◽  
KUMAR R. RAJA ◽  
RAVIKUMAR D. N. S. ◽  
◽  
...  

2017 ◽  
Vol 7 (1) ◽  
pp. 12-17 ◽  
Author(s):  
Marcella Guarino ◽  
Tomas Norton ◽  
Dries Berckmans ◽  
Erik Vranken ◽  
Daniel Berckmans

Sign in / Sign up

Export Citation Format

Share Document