Log in

Relevant bibliographies by topics / Gradient coding

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers
Reports

Academic literature on the topic 'Gradient coding'

Author: Grafiati

Published: 6 September 2023

Last updated: 7 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Gradient coding.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Gradient coding"

1

Cao, Hankun, Qifa Yan, Xiaohu Tang, and Guojun Han. "Adaptive Gradient Coding." IEEE/ACM Transactions on Networking 30, no. 2 (April 2022): 717–34. http://dx.doi.org/10.1109/tnet.2021.3122873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Quweider, M. K., and E. Salari. "Gradient-based block truncation coding." Electronics Letters 31, no. 5 (March 2, 1995): 353–55. http://dx.doi.org/10.1049/el:19950268.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yang, Jucheng, Xiaojing Wang, Shujie Han, Jie Wang, Dong Sun Park, and Yuan Wang. "Improved Real-Time Facial Expression Recognition Based on a Novel Balanced and Symmetric Local Gradient Coding." Sensors 19, no. 8 (April 22, 2019): 1899. http://dx.doi.org/10.3390/s19081899.

Full text

Abstract:

In the field of Facial Expression Recognition (FER), traditional local texture coding methods have a low computational complexity, while providing a robust solution with respect to occlusion, illumination, and other factors. However, there is still need for improving the accuracy of these methods while maintaining their real-time nature and low computational complexity. In this paper, we propose a feature-based FER system with a novel local texture coding operator, named central symmetric local gradient coding (CS-LGC), to enhance the performance of real-time systems. It uses four different directional gradients on 5 × 5 grids, and the gradient is computed in the center-symmetric way. The averages of the gradients are used to reduce the sensitivity to noise. These characteristics lead to symmetric of features by the CS-LGC operator, thus providing a better generalization capability in comparison to existing local gradient coding (LGC) variants. The proposed system further transforms the extracted features into an eigen-space using a principal component analysis (PCA) for better representation and less computation; it estimates the intended classes by training an extreme learning machine. The recognition rate for the JAFFE database is 95.24%, whereas that for the CK+ database is 98.33%. The results show that the system has advantages over the existing local texture coding methods.

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Sinong, Jiashang Liu, and Ness Shroff. "Fundamental Limits of Approximate Gradient Coding." Proceedings of the ACM on Measurement and Analysis of Computing Systems 3, no. 3 (December 17, 2019): 1–22. http://dx.doi.org/10.1145/3366700.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Sinong, Jiashang Liu, and Ness Shroff. "Fundamental Limits of Approximate Gradient Coding." ACM SIGMETRICS Performance Evaluation Review 48, no. 1 (July 8, 2020): 21–22. http://dx.doi.org/10.1145/3410048.3410061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chang, Chein-I. "Gradient texture unit coding for texture analysis." Optical Engineering 43, no. 8 (August 1, 2004): 1891. http://dx.doi.org/10.1117/1.1768183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jing, Zhiyong, Peng Li, Jinchao Zhao, and Qiuwen Zhang. "A Fast CU Partition Algorithm Based on Gradient Structural Similarity and Texture Features." Symmetry 14, no. 12 (December 14, 2022): 2644. http://dx.doi.org/10.3390/sym14122644.

Full text

Abstract:

The H.266/Versatile Video Coding (VVC) standard poses a great challenge for encoder design due to its high computational complexity and long encoding time. In this paper, the fast partitioning decision of coding blocks is investigated to reduce the computational complexity and save the coding time of VVC intra-frame predictive coding. A fast partitioning algorithm of VVC intra-frame coding blocks based on gradient structure similarity and directional features is proposed. First, the average gradient structure similarity of four sub-coding blocks under the current coding block is calculated, and two thresholds are set to determine whether the current coding block terminates the partitioning early or performs quadtree partitioning. Then, for the coding blocks that do not satisfy the above thresholds, the standard deviation of the vertical and horizontal directions of the current coding block is calculated to determine the texture direction and skip unnecessary partitioning to reduce computational complexity. Based on the VTM10.0 platform, this paper evaluates the performance of the designed fast algorithm for partitioning within the VVC coding unit. Compared with VTM10.0, the encoding rate is improved by 1.38% on average, and the encoder execution time is reduced by 49.32%. The overall algorithm achieves a better optimization of the existing VVC intra-frame coding technique.

APA, Harvard, Vancouver, ISO, and other styles

8

Raviv, Netanel, Itzhak Tamo, Rashish Tandon, and Alexandros G. Dimakis. "Gradient Coding From Cyclic MDS Codes and Expander Graphs." IEEE Transactions on Information Theory 66, no. 12 (December 2020): 7475–89. http://dx.doi.org/10.1109/tit.2020.3029396.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Feng, Maochang, Yongfeng Li, Qiqi Zheng, Jieqiu Zhang, Yajuan Han, Jiafu Wang, Hongya Chen, Sui Sai, Hua Ma, and Shaobo Qu. "Two-dimensional coding phase gradient metasurface for RCS reduction." Journal of Physics D: Applied Physics 51, no. 37 (August 10, 2018): 375103. http://dx.doi.org/10.1088/1361-6463/aad5ad.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bitar, Rawad, Mary Wootters, and Salim El Rouayheb. "Stochastic Gradient Coding for Straggler Mitigation in Distributed Learning." IEEE Journal on Selected Areas in Information Theory 1, no. 1 (May 2020): 277–91. http://dx.doi.org/10.1109/jsait.2020.2991361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Gradient coding"

1

Lee, Choon. "Interframe image coding with three-dimensional gradient motion estimation." Diss., This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-08252008-162144/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Yaghoobi, Vaighan Mehrdad. "Adaptive sparse coding and dictionary selection." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4070.

Full text

Abstract:

The sparse coding is approximation/representation of signals with the minimum number of coefficients using an overcomplete set of elementary functions. This kind of approximations/ representations has found numerous applications in source separation, denoising, coding and compressed sensing. The adaptation of the sparse approximation framework to the coding problem of signals is investigated in this thesis. Open problems are the selection of appropriate models and their orders, coefficient quantization and sparse approximation method. Some of these questions are addressed in this thesis and novel methods developed. Because almost all recent communication and storage systems are digital, an easy method to compute quantized sparse approximations is introduced in the first part. The model selection problem is investigated next. The linear model can be adapted to better fit a given signal class. It can also be designed based on some a priori information about the model. Two novel dictionary selection methods are separately presented in the second part of the thesis. The proposed model adaption algorithm, called Dictionary Learning with the Majorization Method (DLMM), is much more general than current methods. This generality allowes it to be used with different constraints on the model. Particularly, two important cases have been considered in this thesis for the first time, Parsimonious Dictionary Learning (PDL) and Compressible Dictionary Learning (CDL). When the generative model order is not given, PDL not only adapts the dictionary to the given class of signals, but also reduces the model order redundancies. When a fast dictionary is needed, the CDL framework helps us to find a dictionary which is adapted to the given signal class without increasing the computation cost so much. Sometimes a priori information about the linear generative model is given in format of a parametric function. Parametric Dictionary Design (PDD) generates a suitable dictionary for sparse coding using the parametric function. Basically PDD finds a parametric dictionary with a minimal dictionary coherence, which has been shown to be suitable for sparse approximation and exact sparse recovery. Theoretical analyzes are accompanied by experiments to validate the analyzes. This research was primarily used for audio applications, as audio can be shown to have sparse structures. Therefore, most of the experiments are done using audio signals.

APA, Harvard, Vancouver, ISO, and other styles

3

Palomino, Daniel Munari Vilchez. "Application-driven temparature-aware solutions for video coding." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/158186.

Full text

Abstract:

Esta tese apresenta soluções para o gerenciamento e otimização de temperatura para sistemas de codificação de vídeo baseados nas características da aplicação e no conteúdo dos vídeos digitais. Diferente dos trabalhos estado-da-arte, as soluções propostas nesta tese focam em técnicas de gerenciamento de temperatura no nível da aplicação e características da aplicação codificação de vídeo e as propriedades dos vídeos digitais são explorados para desenvolver soluções termais para a codificação de vídeo com baixas perdas na qualidade de serviço das aplicações. Diversas análises são realizadas considerando a aplicação de codificação de vídeo para entender o comportamento da temperatura durante o processo de codificação para diferentes sequências de vídeo. Com base nos resultados das análises, soluções com diferentes abordagens são propostas para atenuar os efeitos da temperatura nos sistemas de codificação de vídeo. Gerenciamento de temperatura baseado nas características da aplicação para o padrão de codificação HEVC usa uma técnica de seleção de configuração em tempo de execução para manter a temperatura abaixo dos limites seguros de operação com bons resultados de qualidade de vídeo. Otimização de temperatura baseado em computação imprecisa usa aproximações baseadas em conteúdo para reduzir a temperatura de chips executando o HEVC. Um escalonador de tarefas que usa características da aplicação para guiar o escalonamento de threads focando na redução dos gradientes espaciais de temperatura que são resultantes do desbalanceamento natural de cargas entre as threads da aplicação. As soluções propostas são capazes de reduzir em até 10 ºC a temperatura do chip com perdas insignificantes na eficiência de compressão. Os resultados de qualidade objetiva (medida usando PSNR) são de 12 dBs até 20 dBs maiores quando comparados com trabalhos da literatura. Além disso, o escalonador de tarefas proposto é capaz de eliminar os gradientes espaciais de temperatura maiores que 5 ºC para arquitetura multi-cores. Como principal conclusão, esta tese demonstra que as técnicas de gerenciamento de temperatura que usam o conhecimento da aplicação de maneira conjunta com as propriedades dos vídeos digitais tem um alto potencial para melhorar os resultados de temperatura de sistemas de codificação de vídeo mantendo bons resultados de qualidade visual dos vídeos codificados.
This thesis presents application-driven temperature-aware solutions for next generation video coding systems, such as the High Efficiency Video Coding (HEVC). Different from state-of-the-art works, the proposed solutions raise the abstraction of temperature management to the application-level, where video coding characteristics and video content properties are used to leverage thermal-aware solutions for video coding with low QoS (Quality of Service) degradation. Several video coding and temperature analyses are performed to understand the behavior of temperature when encoding different video sequences. Based on the analyses results, different approaches are proposed to mitigate the temperature effects on video coding systems. Application-driven temperature management for HEVC uses run-time encoder configuration selection to keep temperature under safe operational state while providing good visual quality results. Temperature optimization using approximate computing uses content-driven approximations to reduce the on-chip temperature of HEVC encoding. Application-driven temperature-aware scheduler leverages application-specific knowledge to guide a scheduling technique targeting reducing the spatial temperature gradients that are resulted from the unbalance workload nature of multi-threaded video coding application. The proposed solutions are able to provide up to 10 °C of chip temperature reduction with negligible compression efficiency loss. Besides, when compared with previous works the resulted objective video quality (PSNR) is from 12 dB up to 20 dB higher. Moreover, the proposed scheduler eliminates spatial temperature gradients greater than 5 ºC of multi-core architectures. As conclusion, this thesis demonstrates that leveraging application-specific knowledge and video content properties has a significant potential to improve temperature profiles of video coding systems while still keeping good quality results.

APA, Harvard, Vancouver, ISO, and other styles

4

Surget, Gwladys. "Processus adaptatifs des végétaux marins face au changement climatique à différentes échelles de temps et d'espace : dynamique de populations, métabolomique, écophysiologie et potentiels de valorisation." Thesis, Brest, 2017. http://www.theses.fr/2017BRES0056/document.

Full text

Abstract:

Trois modèles invasifs à large répartition en Europe, le long d'un gradient latitudinal Norvège-Portugal, ont été choisis : Sargassum muticum, Codium fragile et Gracilaria vermiculophylla. Cette thèse a pour objectif l'étude de la phénologie, de l'écophysiologie et du métabolome de ces macrophytes invasifs face à une variation de facteurs environnementaux 1) à une échelle locale, 2) à l'échelle du gradient latitudinal (en lien avec le changement climatique global) ainsi que l'étude 3) des voies de valorisation possibles des métabolites de stress par bio-inspiration. Le gradient latitudinal, se traduisant par un gradient thermique, permet de mimer le réchauffement climatique car les conséquences de ce changement climatique sur les espèces en milieu naturel ne sont généralement appréciables qu'à l'échelle de dizaines d'années. Les suivis de l'écologie, dumétabolome ainsi que des impacts potentiels de ces espèces à une échelle locale en France, a permis d'étudier le développement et le cycle de vie des espèces. En particulier, G. vermiculophylla se caractérise par une phénologie spécifique (avec la prépondérance de petits fragments végétatifs, <3cm) en Rade de Brest et par une tolérance accrue à l'envasement jusqu'à 12 cm de profondeur en acclimatant son métabolome tout en maintenant une physiologie dormante. Cette espèce ingénieur impacte en profondeur l'écosystème vaseux de la Rade. Le suivi le long du gradient latitudinal a permis d'illustrer la plasticité phénologique des espèces et notamment un potentiel invasif contrasté de C. fragile entre les différentes latitudes. Lors de marée basse de vives eaux, les espèces présentent une acclimatation de leur photo-physiologie en fonction de la latitude avec la mise en évidence d'une photoinhibition du PSll, lié au stress engendré par les conditions environnementales.Enfin, ce travail a illustré les propriétés multifonctionnelles d'extraits enrichis en composés phénoliques, présentant des activités antioxydantes mais également photoprotectrices ou ostéogéniques, soulignant l'émergence de voies de valorisation originales par bio-inspiration pour divers secteurs tels que la cosmétologie et les biomatériaux en santé humaine
Three model species with a large distribution along European coasts, along a latitudinal gradient from Norway to Portugal was chosen: Sargassum muticum, Codium fragile and Gracilaria vermiculophylla. The aims of this PhD thesis were to study the phenology, ecophysiology and the metabolom of these non-native marine macrophytes and their ability to cope with a variation of environmental factors 1) at a population scale, 2) along the latitudinal gradient (in relation with the global climatic change) and to propose 3) bio-inspired molecules for industrial purposes. The latitudinal gradient corresponding to a thermic gradient, allows to imitate the global warming as climatic change ¡mpacts are most of the time only visible at decennial scale.Monitorings of ecology, metabolome and potential impacts of these macroalgae, at a population scale, allowed to study the development and life cycle of these models. In particular, G. vermiculophylla exhibited a specific phenology (with a majority of small vegetative fragments, <3cm) in the Bay of Brest and a highly tolerance to burial until 12 cm depth in the sediment by acclimatizing its metabolome together with the ability to maintain a dormancy physiology. This engineer species modifies deeply muddy shores of this Bay. Latitunal gradients's monitoring highlighted the phenological plasticity and a contrasted invasive potential of C.fragile between latitudes. During low spring tides, species exhibited an acclimation of their photophysiology between latitudes with photoinhibition process related to induce environmental stress. Furthermore, this work showed the multifunctional properties of polyphenols enriched extracts with antioxidant, photoprotective or osteogenic activities, highlighting the emergence of original bio-inspired pathways for cosmetic or biomaterial applications

APA, Harvard, Vancouver, ISO, and other styles

5

Stynsberg, John. "Incorporating Scene Depth in Discriminative Correlation Filters for Visual Tracking." Thesis, Linköpings universitet, Datorseende, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153110.

Full text

Abstract:

Visual tracking is a computer vision problem where the task is to follow a targetthrough a video sequence. Tracking has many important real-world applications in several fields such as autonomous vehicles and robot-vision. Since visual tracking does not assume any prior knowledge about the target, it faces different challenges such occlusion, appearance change, background clutter and scale change. In this thesis we try to improve the capabilities of tracking frameworks using discriminative correlation filters by incorporating scene depth information. We utilize scene depth information on three main levels. First, we use raw depth information to segment the target from its surroundings enabling occlusion detection and scale estimation. Second, we investigate different visual features calculated from depth data to decide which features are good at encoding geometric information available solely in depth data. Third, we investigate handling missing data in the depth maps using a modified version of the normalized convolution framework. Finally, we introduce a novel approach for parameter search using genetic algorithms to find the best hyperparameters for our tracking framework. Experiments show that depth data can be used to estimate scale changes and handle occlusions. In addition, visual features calculated from depth are more representative if they were combined with color features. It is also shown that utilizing normalized convolution improves the overall performance in some cases. Lastly, the usage of genetic algorithms for hyperparameter search leads to accuracy gains as well as some insights on the performance of different components within the framework.

APA, Harvard, Vancouver, ISO, and other styles

6

Zabaleta, Razquin Itziar. "Image processing algorithms as artistic tools in digital cinema." Doctoral thesis, Universitat Pompeu Fabra, 2021. http://hdl.handle.net/10803/672840.

Full text

Abstract:

The industry of cinema has experienced a radical change in the last decades: the transition from film cinematography to its digital format. As a consequence, several challenges have appeared, but, at the same time, many possibilities are open now for cinematographers to explore with this new medium. In this thesis, we propose different tools that can be useful for cinematographers while doing their craft. First, we develop a tool for automatic color grading. It is a statistics-based method to automatically transfer the style from a graded image to unprocessed footage. Some advantages of the model are its simplicity and low computational cost, which make it amenable for real-time implementation, allowing cinematographers to experiment on-set with different styles and looks. Then, a method for adding texture to footage is created. In cinema, the most commonly used texture is film grain, either directly shooting on film, or adding synthetic grain later-on at post-production stage. We propose a model of "retinal noise" which is inspired by processes in the visual system, and produces results that look natural and visually pleasing. It has parameters that allow to vary widely the resulting texture appearance, which make it an artistic tool for cinematographers. Moreover, due to the "masking" phenomenon of the visual system, the addition of this texture improves the perceived visual quality of images, resulting in bit rate and bandwidth savings. The method has been validated through psychophysical experiments in which observers, including cinema professionals, prefer it over film grain emulation alternatives from academia and the industry. Finally, we introduce a physiology-based image quality metric, which can have several applications in the image processing field, and more specifically in the cinema and broadcasting context: video coding, image compression, etc. We study an optimization of the model parameters in order to be competitive with the state-of-the-art quality metrics. An advantage of the method is its reduced number of parameters, compared with some state-of-the-art methods based in deep-learning, which have a number of parameters several orders of magnitude larger.
La industria del cine ha experimentado un cambio radical en las últimas décadas: la transición de su soporte fílmico a la tecnología del cine digital. Como consecuencia, han aparecido algunos desafíos técnicos, pero, al mismo tiempo, infinitas nuevas posibilidades se han abierto con la utilización de este nuevo medio. En esta tesis, se proponen diferentes herramientas que pueden ser útiles en el contexto del cine. Primero, se ha desarrollado una herramienta para aplicar \textit{color grading} de manera automática. Es un método basado en estadísticas de imágenes, que transfiere el estilo de una imagen de referencia a metraje sin procesar. Las ventajas del método son su sencillez y bajo coste computacional, que lo hacen adecuado para ser implementado a tiempo real, permitiendo que se pueda experimentar con diferentes estilos y 'looks', directamente on-set. En segundo lugar, se ha creado un método para mejorar imágenes mediante la adición de textura. En cine, el grano de película es la textura más utilizada, ya sea porque la grabación se hace directamente sobre película, o porque ha sido añadido a posteriori en contenido grabado en formato digital. En esta tesis se propone un método de 'ruido retiniano' inspirado en procesos del sistema visual, que produce resultados naturales y visualmente agradables. El modelo cuenta con parámetros que permiten variar ampliamente la apariencia de la textura, y por tanto puede ser utilizado como una herramienta artística para cinematografía. Además, debido al fenómeno de enmascaramiento del sistema visual, al añadir esta textura se produce una mejora en la calidad percibida de las imágenes, lo que supone ahorros en ancho de banda y tasa de bits. El método ha sido validado mediante experimentos psicofísicos en los cuales ha sido elegido por encima de otros métodos que emulan grano de película, métodos procedentes de academia como de industria. Finalmente, se describe una métrica de calidad de imágenes, basada en fenómenos fisiológicos, con aplicaciones tanto en el campo del procesamiento de imágenes, como más concretamente en el contexto del cine y la transmisión de imágenes: codificación de vídeo, compresión de imágenes, etc. Se propone la optimización de los parámetros del modelo, de manera que sea competitivo con otros métodos del estado del arte . Una ventaja de este método es su reducido número de parámetros comparado con algunos métodos basados en deep learning, que cuentan con un número varios órdenes de magnitud mayor.

APA, Harvard, Vancouver, ISO, and other styles

7

Sasi, Shanuja. "Contributions on Index Coding, Coded Caching and Gradient Coding." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5164.

Full text

Abstract:

In this thesis, we cover three major areas, namely, index coding, coded caching and gradient coding. We begin by considering unicast index coding problems where a server broadcasts coded messages over a noiseless channel, to a set of receivers which knows some messages a priori, in such a way that all the receivers can decode their desired messages. For unicast index coding problems with the special structure on the side-information graphs called Interlinked Cycle (IC) structures, index codes have been proposed in the literature. We relax the definition of IC structures by removing one of the requirements in the definition to define a wider class of side-information graphs called Generalized Interlinked Cycle (GIC) structures. In this thesis, optimal index code construction for GIC structures is explored. Construction of optimal length error correcting index code is also discussed for such GIC structures. There have been several variants and extensions to the index coding problem studied in the literature. One such variant of index coding problem formulated in the literature is Pliable Index Coding (PICOD) problem, where the setting is same as that of index coding problem, i.e., we consider a server holding a set of messages and a set of users having a subset of messages available with them. The only difference is that in PICOD problem, each user is satisfied if it receives any of the messages it doesn't have. We study some of the extensions of PICOD problems in this thesis where we assume that the side-information is consecutive. We introduce the notion of security in PICOD problems where each user gets exactly one desired message. The second extension studied is PICOD problems where the total number of messages decoded by the effective users is maximized. Another extension of index coding problem is Constrained Pliable Index Coding Problem where each message is decoded by at most c users demanding that message. We provide index codes for all these three extensions of PICOD problems with consecutive side-information. In index coding problem as well as PICOD problem, there will be a central server which is responsible for all the transmissions done. In contrast to this, a new extension called Embedded Index Coding Problem (EICP) was studied in literature which was motivated by its application in distributed computing where every user can act as sender for other users. We introduce the idea of sub-packetization of the messages in index coding problems to provide a novel code construction for a special class of EICP termed as Consecutive and Symmetric Embedded Index Coding Problem (CS-EICP) in contrast to the scalar linear solutions provided in the prior works. An extension to EICP- task based EICP is also studied, where each user can use transmissions from only one other user. We provide code construction for task based CS-EICP as well when each user demands only one message. In the second part, we consider a generalization of well-known coded caching problem, referred as multi-access coded caching problem, where each user has access to z neighboring caches in a cyclic wrap-around way. We present placement scheme and delivery algorithms for this problem, under the restriction of uncoded placement. We consider two classes of multi-access coded caching problems in this thesis. The first class under consideration is a generalization of one of the cases considered in ``Multi-access coded caching : gains beyond cache-redundancy'' by B. Serbetci, E. Parrinello and P. Elia. To be precise, when our scheme is specialized to z={K-1}/{K \gamma }, for any K\gamma, where K is the number of users and \gamma is the normalized cache size, we show that our result coincides with their result. We show that for the cases considered, our scheme outperforms the scheme proposed in ``Rate-memory trade-off for multi-access coded caching with uncoded placement'' by K. S. Reddy and N. Karamchandani, except for some special cases considered in that paper. We also show that for z= K-1, our scheme achieves the optimal transmission rate. In this thesis, we construct a new class of Placement Delivery Array (PDA) which we call as t-cyclic g-regular PDA. This class of PDA is used for providing the delivery scheme for the second class of multi-access coded caching problems under consideration. The sub-packetization level required for our scheme is the least compared to the state-of-the-art schemes for this class. For certain ranges of values of z, the transmission rate is also less compared to some of the existing schemes. Lastly, we address the gradient coding problem by finding efficient code construction that minimizes per-server task sizes with the flexibility of tiered launching of tasks. Coding theoretic techniques have been proposed for performing synchronous gradient descent on multiple servers to mitigate stragglers. These techniques provide the flexibility that the job is complete when any k out of n servers finish their assigned tasks. The task size on each server is found based on the values of k and n. However, it is assumed that all the n jobs are started when the job is requested. In contrast, we assume a tiered system, where we start with n_1> k tasks, and on completion of c tasks, we start n_2-n_1 more tasks. The aim is that as long as k servers can execute their tasks, the job gets completed. This thesis exploits the flexibility that not all servers are started at the request time to obtain reduced task sizes on each server. This helps to reduce the job completion time as well as the total server utilization cost (total time any server is being used for computation).

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Wen-Ching, and 王文慶. "The application of spatial-temporal gradient method on image coding." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/35221139918112634829.

Full text

Abstract:

碩士
國立交通大學
資訊工程研究所
81
Motion estimation is the major concept for applying 1- D and 2-D signal processing techniques into 3-D image sequ ence processing.Traditionally,the full search block matchi ng method is the most widely used motion estimation method .In this paper, the spatial-temporal gradient method is con sidered for the motion estimation in image coding. Accordi ng to different motion behaviors,the motion parameters are described by translation model and Affine model. Because t he motion parameters are solved by the least square method ,the computational complexity is ,while the full search block matching method is ,where the block size is N*N. We simulate the MPEG environments combining DCT, quantizat ion, and Huffman coding to compare the performance of the spatial-temporal gradient method and the full search block matching method. Simulation results show that the spatial- temporal gradient method has a lower bit rate.

APA, Harvard, Vancouver, ISO, and other styles

9

Faro, João António Pereira. "Detection of Unusual Events in Videos via Dynamic Sparse Coding." Master's thesis, 2013. http://hdl.handle.net/10316/40380.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

"Kitsune: Structurally-Aware and Adaptable Plagiarism Detection." Master's thesis, 2020. http://hdl.handle.net/2286/R.I.57364.

Full text

Abstract:

abstract: Plagiarism is a huge problem in a learning environment. In programming classes especially, plagiarism can be hard to detect as source codes' appearance can be easily modified without changing the intent through simple formatting changes or refactoring. There are a number of plagiarism detection tools that attempt to encode knowledge about the programming languages they support in order to better detect obscured duplicates. Many such tools do not support a large number of languages because doing so requires too much code and therefore too much maintenance. It is also difficult to add support for new languages because each language is vastly different syntactically. Tools that are more extensible often do so by reducing the features of a language that are encoded and end up closer to text comparison tools than structurally-aware program analysis tools. Kitsune attempts to remedy these issues by tying itself to Antlr, a pre-existing language recognition tool with over 200 currently supported languages. In addition, it provides an interface through which generic manipulations can be applied to the parse tree generated by Antlr. As Kitsune relies on language-agnostic structure modifications, it can be adapted with minimal effort to provide plagiarism detection for new languages. Kitsune has been evaluated for 10 of the languages in the Antlr grammar repository with success and could easily be extended to support all of the grammars currently developed by Antlr or future grammars which are developed as new languages are written.
Dissertation/Thesis
Masters Thesis Software Engineering 2020

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Gradient coding"

1

Saldanha, Mário, Gustavo Sanchez, César Marcon, and Luciano Agostini. "Light Gradient Boosting Machine Configurable Fast Block Partitioning for Luminance." In Versatile Video Coding (VVC), 71–88. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-11640-7_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Desai, Padmashree, and Jagadeesh Pujari. "Shape Based Image Retrieval Using Gradient Operators and Block Truncation Coding." In Lecture Notes in Electrical Engineering, 439–43. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3363-7_50.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mao, Yingchi, Jun Wu, Xiaoming He, Ping Ping, and Jianxin Huang. "Communication Optimization in Heterogeneous Edge Networks Using Dynamic Grouping and Gradient Coding." In Wireless Algorithms, Systems, and Applications, 47–58. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-19211-1_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Nayak, Pratik, Fritz Göbel, and Hartwig Anzt. "A Collaborative Peer Review Process for Grading Coding Assignments." In Computational Science – ICCS 2021, 654–60. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-77980-1_49.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

"Predictive Coding." In Gradient Expectations, 93–116. The MIT Press, 2023. http://dx.doi.org/10.7551/mitpress/14723.003.0008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Suthar, Madhuri, and Bahram Jalali. "Phase-Stretch Adaptive Gradient-Field Extractor (PAGE)." In Coding Theory. IntechOpen, 2020. http://dx.doi.org/10.5772/intechopen.90361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sharma, Urvashi, Meenakshi Sood, Emjee Puthooran, and Yugal Kumar. "A Block-Based Arithmetic Entropy Encoding Scheme for Medical Images." In Research Anthology on Improving Medical Imaging Techniques for Analysis and Intervention, 190–206. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-6684-7544-7.ch012.

Full text

Abstract:

The digitization of human body, especially for treatment of diseases can generate a large volume of data. This generated medical data has a large resolution and bit depth. In the field of medical diagnosis, lossless compression techniques are widely adopted for the efficient archiving and transmission of medical images. This article presents an efficient coding solution based on a predictive coding technique. The proposed technique consists of Resolution Independent Gradient Edge Predictor16 (RIGED16) and Block Based Arithmetic Encoding (BAAE). The objective of this technique is to find universal threshold values for prediction and provide an optimum block size for encoding. The validity of the proposed technique is tested on some real images as well as standard images. The simulation results of the proposed technique are compared with some well-known and existing compression techniques. It is revealed that proposed technique gives a higher coding efficiency rate compared to other techniques.

APA, Harvard, Vancouver, ISO, and other styles

8

Ye, Sang-Myoung, Rae-Hong Park, and Dong-Kyu Lee. "Object Segmentation Based on a Nonparametric Snake with Motion Prediction in Video." In Cross-Disciplinary Applications of Artificial Intelligence and Pattern Recognition, 86–107. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-61350-429-1.ch006.

Full text

Abstract:

Object segmentation in video sequence is a basic and important task in video applications such as surveillance systems and video coding. Nonparametric snake algorithms for object segmentation have been proposed to overcome the drawback of conventional snake algorithms: the dependency on several parameters. In this chapter, a new object segmentation algorithm for video, based on a nonparametric snake model with motion prediction, is proposed. Object contour is initialized by using the mean absolute difference of intensity between input and previous frames. And in order to convert initial object contours into more exact object contours, the gradient vector flow snake is used. Finally object contour is predicted using a Kalman filter in successive frames. The proposed object segmentation method for video can provide more detailed and improved object segmentation results than the conventional methods. Various experimental results show the effectiveness of the proposed method in terms of the pixel-based quality measure and the computation time.

APA, Harvard, Vancouver, ISO, and other styles

9

Ong, Ee Ping, Weisi Lin, Bee June Tye, and Minoru Etoh. "Fast Automatic Video Object Segmentation for Content-Based Applications." In Advances in Image and Video Segmentation, 140–60. IGI Global, 2006. http://dx.doi.org/10.4018/978-1-59140-753-9.ch007.

Full text

Abstract:

An algorithm has been devised for fast, fully automatic and reliable object segmentation from live video for scenarios with static camera. The contributions in this chapter include methods for: (a) adaptive determination of the threshold for change detection; (b) robust stationary background reference frame generation, which when used in change detection can reduce segmentation fault rate and solve the problems of dis-occluded objects appearing as part of segmented moving objects; (c) adaptive reference frame selection to improve segmentation results; and (d) spatial refinement of modified change detection mask by incorporating information from edges, gradients and motion to improve accuracy of segmentation contours. The algorithm is capable of segmenting multiple objects at a speed of 12 QCIF frames per second with a Pentium-4 2.8GHz personal computer in C coding without resorting to any code optimization. The result shows advantages over related work in terms of both fault rate and processing speed.

APA, Harvard, Vancouver, ISO, and other styles

10

Khan, Zeenath Reza, Sabiha Mumtaz, and Salma Sadia Rakhman. "Mentoring to Affect Student Perceptions of Academic Integrity." In Academic Language and Learning Support Services in Higher Education, 98–118. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-7998-2878-5.ch004.

Full text

Abstract:

Supporting higher education (HE) students by aiding in their learning journey and encouraging them to make advantageous choices so as to become members of their institution's community of scholars (CoS) is critical to their success. This is particularly true when instilling values of academic integrity (AI). Academic misconduct is constant, and combating it is difficult because of the immersion of technology, questionable role models, mistrust, bad decision makers, and possible political turmoil. HE educators are stretched thin between grading, teaching, career progression, and such to go beyond classrooms to support students in many such areas. Research posits the importance of proactive actions in developing a culture of AI on campus. Expanding a study tracking students' journey through mentorship, this chapter uses case study methodology and qualitative coding to record the impact of mentors (i.e., how they helped students combat hurdles such as peer pressure, demotivating experiences, lack of knowledge as examples, and how they were able to make students into advocates of AI at university and in their future workplaces).

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Gradient coding"

1

Reisizadeh, Amirhossein, Saurav Prakash, Ramtin Pedarsani, and Amir Salman Avestimehr. "Tree Gradient Coding." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849431.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Charalambides, Neophytos, Hessam Mahdavifar, and Alfred O. Hero. "Numerically Stable Binary Gradient Coding." In 2020 IEEE International Symposium on Information Theory (ISIT). IEEE, 2020. http://dx.doi.org/10.1109/isit44484.2020.9174512.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sarmasarkar, Sahasrajit, V. Lalitha, and Nikhil Karamchandani. "On Gradient Coding with Partial Recovery." In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9517849.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Glasgow, Margalit, and Mary Wootters. "Approximate Gradient Coding with Optimal Decoding." In 2021 IEEE International Symposium on Information Theory (ISIT). IEEE, 2021. http://dx.doi.org/10.1109/isit45174.2021.9517990.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Sinong, Jiashang Liu, and Ness Shroff. "Fundamental Limits of Approximate Gradient Coding." In SIGMETRICS '20: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3393691.3394188.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Johri, Amogh, Arti Yardi, and Tejas Bodas. "Approximate Gradient Coding for Heterogeneous Nodes." In 2021 IEEE Information Theory Workshop (ITW). IEEE, 2021. http://dx.doi.org/10.1109/itw48936.2021.9611493.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Qi, Ying Cui, Chenglin Li, Junni Zou, and Hongkai Xiong. "Optimization-based Block Coordinate Gradient Coding." In GLOBECOM 2021 - 2021 IEEE Global Communications Conference. IEEE, 2021. http://dx.doi.org/10.1109/globecom46510.2021.9685858.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Son, Kyungrak, and Aditya Ramamoorthy. "Coded matrix computation with gradient coding." In 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206996.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Pientka, Sophie, Michael Schafer, Jonathan Pfaff, Heiko Schwarz, Detlev Marpe, and Thomas Wiegand. "Deep video coding with gradient-descent optimized motion compensation and Lanczos filtering." In 2022 Picture Coding Symposium (PCS). IEEE, 2022. http://dx.doi.org/10.1109/pcs56426.2022.10018006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Savin, Valentin. "Gradient Descent Bit-Flipping Decoding with Momentum." In 2021 11th International Symposium on Topics in Coding (ISTC). IEEE, 2021. http://dx.doi.org/10.1109/istc49272.2021.9594128.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Gradient coding"

1

Phillips, Donald, and Yoram Kapulnik. Using Flavonoids to Control in vitro Development of Vesicular Arbuscular Mycorrhizal Fungi. United States Department of Agriculture, January 1995. http://dx.doi.org/10.32747/1995.7613012.bard.

Full text

Abstract:

Vesicular-arbuscular mycorrhizal (VAM) fungi and other beneficial rhizosphere microorganisms, such as Rhizobium bacteria, must locate and infect a host plant before either symbiont profits. Although benefits of the VAM association for increased phosphorous uptake have been widely documented, attempts to improve the fungus and to produce agronomically useful amounts of inoculum have failed due to a lack of in vitro production methods. This project was designed to extend our prior observation that the alfalfa flavonoid quercetin promoted spore germination and hyphal growth of VAM fungi in the absence of a host plant. On the Israeli side of the project, a detailed examination of changes in flavonoids and flavonoid-biosynthetic enzymes during the early stages of VAM development in alfalfa found that VAM fungi elicited and then suppressed transcription of a plant gene coding for chalcone isomerase, which normally is associated with pathogenic infections. US workers collaborated in the identification of flavonoid compounds that appeared during VAM development. On the US side, an in vitro system for testing the effects of plant compounds on fungal spore germination and hyphal growth was developed for use, and intensive analyses of natural products released from alfalfa seedlings grown in the presence and absence of microorganisms were conducted. Two betaines, trigonelline and stachydrine, were identified as being released from alfalfa seeds in much higher concentrations than flavonoids, and these compounds functioned as transcriptional signals to another alfalfa microsymbiont, Rhizobium meliloti. However, these betaines had no effect on VAM spore germination or hyphal growth i vitro. Experiments showed that symbiotic bacteria elicited exudation of the isoflavonoids medicarpin and coumestrol from legume roots, but neither compound promoted growth or germination of VAM fungi in vitro. Attempts to look directly in alfalfa rhizosphere soil for microbiologically active plant products measured a gradient of nod-gene-inducing activity in R. meliloti, but no novel compounds were identified for testing in the VAM fungal system in vitro. Israeli field experiments on agricultural applications of VAM were very successful and developed methods for using VAM to overcome stunting in peanuts and garlic grown in Israel. In addition, deleterious effects of soil solarization on growth of onion, carrot and wheat were linked to effects on VAM fungi. A collaborative combination of basic and applied approaches toward enhancing the agronomic benefits of VAM asociations produced new knowledge on symbiotic biology and successful methods for using VAM inocula under field conditions

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!