Relevant bibliographies by topics / Gradient coding / Journal articles
To see the other types of publications on this topic, follow the link: Gradient coding.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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
11

TANG, H. "A Gradient Based Predictive Coding for Lossless Image Compression." IEICE Transactions on Information and Systems E89-D, no. 7 (July 1, 2006): 2250–56. http://dx.doi.org/10.1093/ietisy/e89-d.7.2250.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Ramos, Thaís A. R., Nilbson R. O. Galindo, Raúl Arias-Carrasco, Cecília F. da Silva, Vinicius Maracaja-Coutinho, and Thaís G. do Rêgo. "RNAmining: A machine learning stand-alone and web server tool for RNA coding potential prediction." F1000Research 10 (June 8, 2021): 323. http://dx.doi.org/10.12688/f1000research.52350.2.

Full text
Abstract:
Non-coding RNAs (ncRNAs) are important players in the cellular regulation of organisms from different kingdoms. One of the key steps in ncRNAs research is the ability to distinguish coding/non-coding sequences. We applied seven machine learning algorithms (Naive Bayes, Support Vector Machine, K-Nearest Neighbors, Random Forest, Extreme Gradient Boosting, Neural Networks and Deep Learning) through model organisms from different evolutionary branches to create a stand-alone and web server tool (RNAmining) to distinguish coding and non-coding sequences. Firstly, we used coding/non-coding sequences downloaded from Ensembl (April 14th, 2020). Then, coding/non-coding sequences were balanced, had their trinucleotides count analysed (64 features) and we performed a normalization by the sequence length, resulting in total of 180 models. The machine learning algorithms validations were performed using 10-fold cross-validation and we selected the algorithm with the best results (eXtreme Gradient Boosting) to implement at RNAmining. Best F1-scores ranged from 97.56% to 99.57% depending on the organism. Moreover, we produced a benchmarking with other tools already in literature (CPAT, CPC2, RNAcon and TransDecoder) and our results outperformed them. Both stand-alone and web server versions of RNAmining are freely available at https://rnamining.integrativebioinformatics.me/.
APA, Harvard, Vancouver, ISO, and other styles
13

Jing, Zhiyong, Wendi Zhu, and Qiuwen Zhang. "A Fast VVC Intra Prediction Based on Gradient Analysis and Multi-Feature Fusion CNN." Electronics 12, no. 9 (April 23, 2023): 1963. http://dx.doi.org/10.3390/electronics12091963.

Full text
Abstract:
The Joint Video Exploration Team (JVET) has created the Versatile Video Coding Standard (VVC/H.266), the most up-to-date video coding standard, offering a broad selection of coding tools. The maturity of commercial VVC codecs can significantly reduce costs and improve coding efficiency. However, the latest video coding standards have introduced binomial and trinomial tree partitioning methods, which cause the coding units (CUs) to have various shapes, increasing the complexity of coding. This article proposes a technique to simplify VVC intra prediction through the use of gradient analysis and a multi-feature fusion CNN. The gradient of CUs is computed by employing the Sobel operator, the calculation results are used for predecision-making. Further decisions can be made by CNN for coding units that cannot be judged whether they should be segmented or not. We calculate the standard deviation (SD) and the initial depth as the input features of the CNN. To implement this method, the initial depth can be determined by constructing a segmented depth prediction dictionary. For the initial segmentation depth of the coding unit, regardless of its shape, it can also be determined by consulting the dictionary. The algorithm can determine whether to split CUs of varying sizes, decreasing the complexity of the CU division process and making VVC more practical. Experimental results demonstrate that the proposed algorithm can reduce encoding time by 36.56% with a minimal increase of 1.06% Bjøntegaard delta bit rate (BD-BR) compared to the original algorithm.
APA, Harvard, Vancouver, ISO, and other styles
14

Huang, Shuying, Yating Xu, Mingyang Ren, Yong Yang, and Weiguo Wan. "Rain Removal of Single Image Based on Directional Gradient Priors." Applied Sciences 12, no. 22 (November 16, 2022): 11628. http://dx.doi.org/10.3390/app122211628.

Full text
Abstract:
Images taken on rainy days often lose a significant amount of detailed information owing to the coverage of rain streaks, which interfere with the recognition and detection of the intelligent vision systems. It is, therefore, extremely important to recover clean rain-free images from the rain images. In this paper, we propose a rain removal method based on directional gradient priors, which aims to retain the structural information of the original rain image to the greatest extent possible while removing the rain streaks. First, to solve the problem of residual rain streaks, on the basis of the sparse convolutional coding model, two directional gradient regularization terms are proposed to constrain the direction information of the rain stripe. Then, for the rain layer coding in the directional gradient prior terms, a multi-scale dictionary is designed for convolutional sparse coding to detect rain stripes of different widths. Finally, to obtain a more accurate solution, the alternating direction method of multipliers (ADMM) is used to update the multi-scale dictionary and coding coefficients alternately to obtain a rainless image with rich details. Finally, experiments verify that the proposed algorithm achieves good results both subjectively and objectively.
APA, Harvard, Vancouver, ISO, and other styles
15

Jiang, Rui, Hong Qiao, and Bo Zhang. "Speeding Up Graph Regularized Sparse Coding by Dual Gradient Ascent." IEEE Signal Processing Letters 22, no. 3 (March 2015): 313–17. http://dx.doi.org/10.1109/lsp.2014.2358853.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Anderson, Nathaniel D., Joseph C. Toscano, Monica Fabiani, Gabriele Gratton, and Susan M. Garnsey. "Gradient coding of voice onset time in posterior temporal cortex." Journal of the Acoustical Society of America 135, no. 4 (April 2014): 2225. http://dx.doi.org/10.1121/1.4877273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

ALSAM, ALI, HANS JAKOB RIVERTZ, and PUNEET SHARMA. "WHAT THE EYE DID NOT SEE — A FUSION APPROACH TO IMAGE CODING." International Journal on Artificial Intelligence Tools 22, no. 06 (December 2013): 1360014. http://dx.doi.org/10.1142/s0218213013600142.

Full text
Abstract:
The concentration of the cones and ganglion cells is much higher in the fovea than the rest of the retina. This non-uniform sampling results in a retinal image that is sharp at the fixation point, where a person is looking, and blurred away from it. This difference between the sampling rates at the different spatial locations presents us with the question of whether we can employ this biological characteristic to achieve better image compression. This can be achieved by compressing an image less at the fixation point and more away from it. It is, however, known that the vision system employs more that one fixation to look at a single scene which presents us with the problem of combining images pertaining to the same scene but exhibiting different spatial contrasts. This article presents an algorithm to combine such a series of images by using image fusion in the gradient domain. The advantage of the algorithm is that unlike other algorithms that compress the image in the spatial domain our algorithm results in no artifacts. The algorithm is based on two steps, in the first we modify the gradients of an image based on a limited number of fixations and in the second we integrate the modified gradient. Results based on measured and predicted fixations verify our approach.
APA, Harvard, Vancouver, ISO, and other styles
18

Si, Wen, Qian Zhang, Zhengcheng Shi, Bin Wang, Tao Yan, and Yihai Chen. "A Fast Mode Decision Algorithm for Intra Prediction in High Efficiency Video Coding." Journal of Medical Imaging and Health Informatics 10, no. 2 (February 1, 2020): 496–501. http://dx.doi.org/10.1166/jmihi.2020.2896.

Full text
Abstract:
High Efficiency Video Coding (HEVC) is the next generation video coding standard. In HEVC, 35 intra prediction modes are defined to improve coding efficiency, which result in huge computational complexity, as a large number of prediction modes and a flexible coding unit (CU) structure is adopted in CU coding. To reduce this computational burden, this paper presents a gradient-based candidate list clipping algorithm for Intra mode prediction. Experimental results show that the proposed algorithm can reduce 29.16% total encoding time with just 1.34% BD-rate increase and –0.07 dB decrease of BD-PSNR.
APA, Harvard, Vancouver, ISO, and other styles
19

Xiao, Ming, and Mikael Skoglund. "Coding for Large-Scale Distributed Machine Learning." Entropy 24, no. 9 (September 12, 2022): 1284. http://dx.doi.org/10.3390/e24091284.

Full text
Abstract:
This article aims to give a comprehensive and rigorous review of the principles and recent development of coding for large-scale distributed machine learning (DML). With increasing data volumes and the pervasive deployment of sensors and computing machines, machine learning has become more distributed. Moreover, the involved computing nodes and data volumes for learning tasks have also increased significantly. For large-scale distributed learning systems, significant challenges have appeared in terms of delay, errors, efficiency, etc. To address the problems, various error-control or performance-boosting schemes have been proposed recently for different aspects, such as the duplication of computing nodes. More recently, error-control coding has been investigated for DML to improve reliability and efficiency. The benefits of coding for DML include high-efficiency, low complexity, etc. Despite the benefits and recent progress, however, there is still a lack of comprehensive survey on this topic, especially for large-scale learning. This paper seeks to introduce the theories and algorithms of coding for DML. For primal-based DML schemes, we first discuss the gradient coding with the optimal code distance. Then, we introduce random coding for gradient-based DML. For primal–dual-based DML, i.e., ADMM (alternating direction method of multipliers), we propose a separate coding method for two steps of distributed optimization. Then coding schemes for different steps are discussed. Finally, a few potential directions for future works are also given.
APA, Harvard, Vancouver, ISO, and other styles
20

Nosovskiy, Gleb. "Geometrical coding of color images." Publications de l'Institut Math?matique (Belgrade) 103, no. 117 (2018): 159–73. http://dx.doi.org/10.2298/pim1817159n.

Full text
Abstract:
Formal analysis and computer recognition of 2D color images is important branch of modern computer geometry. However, existing algorithms, although they are highly developed, are not quite satisfactory and seem to be much worse than (unknown) algorithms, which our brain uses to analyze eye information. Almost all existing algorithms omit colors and deal with grayscale transformations only. But in many cases color information is important. In this paper fundamentally new method of coding and analyzing color digital images is suggested. The main point of this method is that a full-color digital image is represented, without dropping colors, by special 2D surface in 3D space, after which it is analyzed by methods of differential geometry, rather than traditional gradient-based or Hessian-based methods (like in SIFT, GLOH, SURF, Canny operator, and many other algorithms).
APA, Harvard, Vancouver, ISO, and other styles
21

K.S.R.K, Sarma. "Local Gradient Dual Coding Book (LGDCB) Framework for Effective Texture Classification." International Journal of Advanced Trends in Computer Science and Engineering 6, no. 4 (August 25, 2019): 1680–87. http://dx.doi.org/10.30534/ijatcse/2019/95842019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Sheeba, K., and M. Abdul Rahiman. "Fractal Coding Using Gradient Direction Based Tag Matrix and Score Value." Procedia Computer Science 93 (2016): 439–45. http://dx.doi.org/10.1016/j.procs.2016.07.231.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Nawaz, Faiza, and Varun Jeoti. "GREEN protocol: gradient based energy efficient routing with network coding capacity." Telecommunication Systems 62, no. 1 (June 3, 2015): 135–47. http://dx.doi.org/10.1007/s11235-015-0069-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Guo, Yang, Yong Gang Ji, and Jia Xu. "Study on Utility Maximization Effectiveness in Packet Network Coding." Applied Mechanics and Materials 182-183 (June 2012): 2091–94. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.2091.

Full text
Abstract:
In this paper, the coding for multicast packet network call, the network utility maximiza- tion problem, when multicast call, given coding subgraph case modeling, Coded packet networks set up to maximize the effectiveness of modeling .Then use the duality theory, the distributed gradient projection algorithm that can solve the problem of modeling the network utility maximization
APA, Harvard, Vancouver, ISO, and other styles
25

Liu, Lulu, and Jing Yang. "An Adaptive CU Split Method for VVC Intra Encoding." International Journal of Information Technologies and Systems Approach 16, no. 2 (May 2, 2023): 1–17. http://dx.doi.org/10.4018/ijitsa.322433.

Full text
Abstract:
In order to reduce the coding complexity and ensure that versatile video coding (H.266/VVC) effectively maintains the equilibrium between coding efficiency and quality in the coding process, an adaptive coding unit (CU) split method for intra encoding is proposed in this paper. First, the coding speed of CU division is accelerated by an iterative algorithm based on the interval relation of texture complexity energy. Then, according to the relationship between texture features and CU segmentation patterns, the Scharr edge gradient operator algorithm is used to describe the texture information and the threshold. Texture uniformity, directionality, and subblock discrepancy are analyzed and discussed, respectively. Finally, the optimal segmentation pattern is determined based on the texture information to adaptively skip unnecessary segmentation modes. The results show that the algorithm can save 45.2% of the overall coding time on average with an average cost of 0.51% Bjontegaard delta bit rate (BDBR). The algorithm ensures the coding quality while reducing the computational complexity.
APA, Harvard, Vancouver, ISO, and other styles
26

Liu, Jiangang, and Jie Tian. "Registration of Brain MRI/PET Images Based on Adaptive Combination of Intensity and Gradient Field Mutual Information." International Journal of Biomedical Imaging 2007 (2007): 1–10. http://dx.doi.org/10.1155/2007/93479.

Full text
Abstract:
Traditional mutual information (MI) function aligns two multimodality images with intensity information, lacking spatial information, so that it usually presents many local maxima that can lead to inaccurate registration. Our paper proposes an algorithm of adaptive combination of intensity and gradient field mutual information (ACMI). Gradient code maps (GCM) are constructed by coding gradient field information of corresponding original images. The gradient field MI, calculated from GCMs, can provide complementary properties to intensity MI. ACMI combines intensity MI and gradient field MI with a nonlinear weight function, which can automatically adjust the proportion between two types MI in combination to improve registration. Experimental results demonstrate that ACMI outperforms the traditional MI and it is much less sensitive to reduced resolution or overlap of images.
APA, Harvard, Vancouver, ISO, and other styles
27

Kang Yanqin, 亢艳芹, 刘进 Liu Jin, 王勇 Wang Yong, 强俊 Qiang Jun, 顾云波 Gu Yunbo, and 陈阳 Chen Yang. "联合卷积稀疏编码与梯度L0范数的低剂量CT三维重建." Acta Optica Sinica 41, no. 9 (2021): 0911005. http://dx.doi.org/10.3788/aos202141.0911005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Wang Jingli, 汪静丽, 尹亮 Yin Liang, 董先超 Dong Xianchao, 杨志雄 Yang Zhixiong, 万洪丹 Wan Hongdan, 陈鹤鸣 Chen Heming, and 钟凯 Zhong Kai. "基于编码相位梯度超表面实现太赫兹雷达散射截面缩减." Acta Optica Sinica 43, no. 11 (2023): 1124001. http://dx.doi.org/10.3788/aos222095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Sanada, Takahisa M., Jerry D. Nguyenkim, and Gregory C. DeAngelis. "Representation of 3-D surface orientation by velocity and disparity gradient cues in area MT." Journal of Neurophysiology 107, no. 8 (April 15, 2012): 2109–22. http://dx.doi.org/10.1152/jn.00578.2011.

Full text
Abstract:
Neural coding of the three-dimensional (3-D) orientation of planar surface patches may be an important intermediate step in constructing representations of complex 3-D surface structure. Spatial gradients of binocular disparity, image velocity, and texture provide potent cues to the 3-D orientation (tilt and slant) of planar surfaces. Previous studies have described neurons in both dorsal and ventral stream areas that are selective for surface tilt based on one or more of these gradient cues. However, relatively little is known about whether single neurons provide consistent information about surface orientation from multiple gradient cues. Moreover, it is unclear how neural responses to combinations of surface orientation cues are related to responses to the individual cues. We measured responses of middle temporal (MT) neurons to random dot stimuli that simulated planar surfaces at a variety of tilts and slants. Four cue conditions were tested: disparity, velocity, and texture gradients alone, as well as all three gradient cues combined. Many neurons showed robust tuning for surface tilt based on disparity and velocity gradients, with relatively little selectivity for texture gradients. Some neurons showed consistent tilt preferences for disparity and velocity cues, whereas others showed large discrepancies. Responses to the combined stimulus were generally well described as a weighted linear sum of responses to the individual cues, even when disparity and velocity preferences were discrepant. These findings suggest that area MT contains a rudimentary representation of 3-D surface orientation based on multiple cues, with single neurons implementing a simple cue integration rule.
APA, Harvard, Vancouver, ISO, and other styles
30

Liu, Peng, Qin-xiao Liu, Ting-yu Zhao, Yan-ping Chen, and Fei-hong Yu. "Biconjugate gradient stabilized method in image deconvolution of a wavefront coding system." Optics & Laser Technology 47 (April 2013): 329–35. http://dx.doi.org/10.1016/j.optlastec.2012.08.022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Li, Xiao-Xin, Pengyi Hao, Lin He, and Yuanjing Feng. "Image gradient orientations embedded structural error coding for face recognition with occlusion." Journal of Ambient Intelligence and Humanized Computing 11, no. 6 (March 14, 2019): 2349–67. http://dx.doi.org/10.1007/s12652-019-01257-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Feng, Maochang, Xiaoli Chen, Yongfeng Li, Qiqi Zheng, Yajuan Han, Jieqiu Zhang, Jiafu Wang, et al. "Circularly Polarized Spin‐Selectivity Absorbing Coding Phase Gradient Metasurface for RCS Reduction." Advanced Theory and Simulations 3, no. 3 (January 27, 2020): 1900217. http://dx.doi.org/10.1002/adts.201900217.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Migabo, M. E., T. O. Olwal, K. Djouani, and A. M. Kurien. "Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks." Journal of Computer Networks and Communications 2017 (2017): 1–10. http://dx.doi.org/10.1155/2017/5301462.

Full text
Abstract:
Despite its low computational cost, the Gradient Based Routing (GBR) broadcast of interest messages in Wireless Sensor Networks (WSNs) causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR) technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S) at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC) techniques.
APA, Harvard, Vancouver, ISO, and other styles
34

Cheung, Steven W., Purvis H. Bedenbaugh, Srikantan S. Nagarajan, and Christoph E. Schreiner. "Functional Organization of Squirrel Monkey Primary Auditory Cortex: Responses to Pure Tones." Journal of Neurophysiology 85, no. 4 (April 1, 2001): 1732–49. http://dx.doi.org/10.1152/jn.2001.85.4.1732.

Full text
Abstract:
The spatial organization of response parameters in squirrel monkey primary auditory cortex (AI) accessible on the temporal gyrus was determined with the excitatory receptive field to pure tone stimuli. Dense, microelectrode mapping of the temporal gyrus in four animals revealed that characteristic frequency (CF) had a smooth, monotonic gradient that systematically changed from lower values (0.5 kHz) in the caudoventral quadrant to higher values (5–6 kHz) in the rostrodorsal quadrant. The extent of AI on the temporal gyrus was ∼4 mm in the rostrocaudal axis and 2–3 mm in the dorsoventral axis. The entire length of isofrequency contours below 6 kHz was accessible for study. Several independent, spatially organized functional response parameters were demonstrated for the squirrel monkey AI. Latency, the asymptotic minimum arrival time for spikes with increasing sound pressure levels at CF, was topographically organized as a monotonic gradient across AI nearly orthogonal to the CF gradient. Rostral AI had longer latencies (range = 4 ms). Threshold and bandwidth co-varied with the CF. Factoring out the contribution of the CF on threshold variance, residual threshold showed a monotonic gradient across AI that had higher values (range = 10 dB) caudally. The orientation of the threshold gradient was significantly different from the CF gradient. CF-corrected bandwidth, residual Q10, was spatially organized in local patches of coherent values whose loci were specific for each monkey. These data support the existence of multiple, overlying receptive field gradients within AI and form the basis to develop a conceptual framework to understand simple and complex sound coding in mammals.
APA, Harvard, Vancouver, ISO, and other styles
35

Chen, Jing, Jie Liao, Huanqiang Zeng, Canhui Cai, and Kai-Kuang Ma. "An Efficient Multiple Description Coding for Multi-View Video Based on the Correlation of Spatial Polyphase Transformed Subsequences." Journal of Imaging Science and Technology 63, no. 5 (September 1, 2019): 50401–1. http://dx.doi.org/10.2352/j.imagingsci.technol.2019.63.5.050401.

Full text
Abstract:
Abstract For a robust three-dimensional video transmission through error prone channels, an efficient multiple description coding for multi-view video based on the correlation of spatial polyphase transformed subsequences (CSPT_MDC_MVC) is proposed in this article. The input multi-view video sequence is first separated into four subsequences by spatial polyphase transform and then grouped into two descriptions. With the correlation of macroblocks in corresponding subsequence positions, these subsequences should not be coded in completely the same way. In each description, one subsequence is directly coded by the Joint Multi-view Video Coding (JMVC) encoder and the other subsequence is classified into four sets. According to the classification, the indirectly coding subsequence selectively employed the prediction mode and the prediction vector of the counter directly coding subsequence, which reduces the bitrate consumption and the coding complexity of multiple description coding for multi-view video. On the decoder side, the gradient-based directional interpolation is employed to improve the side reconstructed quality. The effectiveness and robustness of the proposed algorithm is verified by experiments in the JMVC coding platform.
APA, Harvard, Vancouver, ISO, and other styles
36

CHOI, Kwon-Yul, and Min-Cheol HONG. "A Spatially Adaptive Gradient-Projection Algorithm to Remove Coding Artifacts of H.264." IEICE Transactions on Information and Systems E94-D, no. 5 (2011): 1073–81. http://dx.doi.org/10.1587/transinf.e94.d.1073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Miao, Lusheng, Karim Djouani, Anish Kurien, and Guillaume Noel. "Network coding and competitive approach for gradient based routing in wireless sensor networks." Ad Hoc Networks 10, no. 6 (August 2012): 990–1008. http://dx.doi.org/10.1016/j.adhoc.2012.01.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Bo Tao and M. T. Orchard. "Gradient-based residual variance modeling and its applications to motion-compensated video coding." IEEE Transactions on Image Processing 10, no. 1 (2001): 24–35. http://dx.doi.org/10.1109/83.892440.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Kaneko, Y., Y. Shishikui, Y. Tanaka, and F. Okano. "Improvement of motion estimation accuracy using gradient vector distribution in advanced picture coding." IEEE Transactions on Broadcasting 42, no. 3 (1996): 237–44. http://dx.doi.org/10.1109/11.536586.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Ye, Lei, Can Wang, Xin Xu, and Wei Chen. "Multi-class ℓ2-Boost with the scoring coding." International Journal of Wavelets, Multiresolution and Information Processing 14, no. 06 (November 2016): 1650049. http://dx.doi.org/10.1142/s0219691316500491.

Full text
Abstract:
Boosting, one of the best off-the-shelf classification methods, has evoked widespread interest in machine learning and statistics. However, the original algorithm was developed for binary classification problems. In this paper, we study multi-class boosting algorithms under the [Formula: see text]-loss framework, and devise two multi-class [Formula: see text]-Boost algorithms. These are based on coordinate descent and gradient descent to minimize the multi-class [Formula: see text]-loss function. We derive a scoring coding scheme using optimal scoring constraints to encode class labels and a simple decoder to recover the true class labels. Our boosting algorithms are easily implemented and their results converge to the global optimum. Experiments with synthetic and real-world datasets show that, compared with several state-of-art methods, our algorithms provide more accurate results.
APA, Harvard, Vancouver, ISO, and other styles
41

Kamal, Ilias, Khalid Housni, and Youssef Hadi. "Online dictionary learning for car recognition using sparse coding and LARS." IAES International Journal of Artificial Intelligence (IJ-AI) 9, no. 1 (March 1, 2020): 164. http://dx.doi.org/10.11591/ijai.v9.i1.pp164-174.

Full text
Abstract:
<p>The bag of feature method coupled with online dictionary learning is the basis of our car make and model recognition algorithm. By using a sparse coding computing technique named LARS (Least Angle Regression) we learn a dictionary of codewords over a dataset of Square Mapped Gradient feature vectors obtained from a densely sampled narrow patch of the front part of vehicles. We then apply SVMs (Support Vector Machines) and KMeans supervised classification to obtain some promising results.</p>
APA, Harvard, Vancouver, ISO, and other styles
42

Zhang, Cheng, Jin Yang, Liu Xi Yang, Jun Chen Ke, Ming Zheng Chen, Wen Kang Cao, Mao Chen, et al. "Convolution operations on time-domain digital coding metasurface for beam manipulations of harmonics." Nanophotonics 9, no. 9 (February 18, 2020): 2771–81. http://dx.doi.org/10.1515/nanoph-2019-0538.

Full text
Abstract:
AbstractTime-domain digital coding metasurfaces have been proposed recently to achieve efficient frequency conversion and harmonic control simultaneously; they show considerable potential for a broad range of electromagnetic applications such as wireless communications. However, achieving flexible and continuous harmonic wavefront control remains an urgent problem. To address this problem, we present Fourier operations on a time-domain digital coding metasurface and propose a principle of nonlinear scattering-pattern shift using a convolution theorem that facilitates the steering of scattering patterns of harmonics to arbitrarily predesigned directions. Introducing a time-delay gradient into a time-domain digital coding metasurface allows us to successfully deviate anomalous single-beam scattering in any direction, and thus, the corresponding formula for the calculation of the scattering angle can be derived. We expect this work to pave the way for controlling energy radiations of harmonics by combining a nonlinear convolution theorem with a time-domain digital coding metasurface, thereby achieving more efficient control of electromagnetic waves.
APA, Harvard, Vancouver, ISO, and other styles
43

Ren, Weizheng, Wei He, and Yansong Cui. "An Improved Fast Affine Motion Estimation Based on Edge Detection Algorithm for VVC." Symmetry 12, no. 7 (July 8, 2020): 1143. http://dx.doi.org/10.3390/sym12071143.

Full text
Abstract:
As a newly proposed video coding standard, Versatile Video Coding (VVC) has adopted some revolutionary techniques compared to High Efficiency Video Coding (HEVC). The multiple-mode affine motion compensation (MM-AMC) adopted by VVC saves approximately 15%-25% Bjøntegaard Delta Bitrate (BD-BR), with an inevitable increase of encoding time. This paper gives an overview of both the 4-parameter affine motion model and the 6-parameter affine motion model, analyzes their performances, and proposes improved algorithms according to the symmetry of iterative gradient descent for fast affine motion estimation. Finally, the proposed algorithms and symmetric MM-AMC flame of VTM-7.0 are compared. The results show that the proposed algorithms save 6.65% total encoding time on average, which saves approximately 30% encoding time of affine motion compensation.
APA, Harvard, Vancouver, ISO, and other styles
44

File-Muriel, Richard J., and Earl K. Brown. "The gradient nature ofs-lenition in Caleño Spanish." Language Variation and Change 23, no. 2 (June 10, 2011): 223–43. http://dx.doi.org/10.1017/s0954394511000056.

Full text
Abstract:
AbstractWhereas previous studies of Spanishs-weakening have relied on impressionistic coding, the present study examines temporal and gradient acoustic details in the production of /s/ by eight females from Cali, Colombia, during sociolinguistic interviews. We propose a metric for quantifyings-realization by employing three scalar-dependent variables:s-duration, centroid, and voicelessness. The results of linear regressions indicate that the dependent variables are significantly conditioned by local speaking rate, word position, following and preceding phonological context, stress, and lexical frequency. This study sheds light on how each independent variable influencess-realization acoustically. For example, as local speaking rate increases, duration, centroid, and voicelessness decrease, which is indicative of lenition, and the same weakening tendency is observed when /s/ occurs in word-final position or is followed by a nonhigh vowel, whereas frequency contributes only tos-duration. We discuss the advantages of opting for instrumental measurements over symbolic representation.
APA, Harvard, Vancouver, ISO, and other styles
45

Sedláková, V., P. Sedlák, D. Zeka, J. Domkářová, P. Doležal, and P. Vejl. "Evaluation of variations in plastid DNA non-coding regions in selected species of the genus Solanum." Czech Journal of Genetics and Plant Breeding 53, No. 3 (September 13, 2017): 127–31. http://dx.doi.org/10.17221/76/2015-cjgpb.

Full text
Abstract:
The diversity of three non-coding plastid DNA loci (trnL/trnF spacer, trnV/16SrRNA spacer, trnL/trnL intron) was assessed in 16 Solanum L. species (135 individuals). Polymorphisms were detected by denaturing gradient gel electrophoresis (DGGE) and verified by direct sequencing. No intraspecific diversity and only poor interspecific diversity was detected. Unique S. mochiquense Ochoa specific length polymorphism at the trnL/trnL locus represented by duplication of an 18 bp segment was discovered. The detected DGGE interspecific trnL/trnF locus polymorphism did not specifically associate with single point mutations in the sequence confirmed by sequencing. The DGGE method was found to be a simple and cheap pre-exploring tool for mutation detection in compared DNA regions. Some identified polymorphisms can be used in the management of genetic resources.
APA, Harvard, Vancouver, ISO, and other styles
46

Dang, Xiang Ying. "New Fast Image Edge-Detection Algorithm Based on Composite Self-Adaption Predictor." Advanced Materials Research 791-793 (September 2013): 1546–49. http://dx.doi.org/10.4028/www.scientific.net/amr.791-793.1546.

Full text
Abstract:
Using advantages of gradient adjusted predictor (GAP) and gradient edge detection (GED) predictors of lossless image coding for reference, and the image was cut into four equal parts with the application of Graphics Processor Unit (GPU) parallel technology operation. In four sub-images, the composite self-adaption predictor was employed for predicting error image, threshold classification error image edge and thinning edge. Results showed that with the application of the parallel technology which avoided errors multiply, not only the complexity of the time was reduced significantly, but also the distinct, holistic and detail-rich edge image was obtained.
APA, Harvard, Vancouver, ISO, and other styles
47

Lurng-Kuo Liu and E. Feig. "A block-based gradient descent search algorithm for block motion estimation in video coding." IEEE Transactions on Circuits and Systems for Video Technology 6, no. 4 (1996): 419–22. http://dx.doi.org/10.1109/76.510936.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Wang, Yanjun, Yong Liu, Jinchao Zhao, and Qiuwen Zhang. "Low-Complexity Fast CU Classification Decision Method Based on LGBM Classifier." Electronics 12, no. 11 (May 31, 2023): 2488. http://dx.doi.org/10.3390/electronics12112488.

Full text
Abstract:
At present, the latest video coding standard is Versatile Video Coding (VVC). Although the coding efficiency of VVC is significantly improved compared to the previous generation, standard High-Efficiency Video Coding (HEVC), it also leads to a sharp increase in coding complexity. VVC significantly improves HEVC by adopting the quadtree with nested multi-type tree (QTMT) partition structure, which has been proven to be very effective. This paper proposes a low-complexity fast coding unit (CU) partition decision method based on the light gradient boosting machine (LGBM) classifier. Representative features were extracted to train a classifier matching the framework. Secondly, a new fast CU decision framework was designed for the new features of VVC, which could predict in advance whether the CU was divided, whether it was divided by quadtree (QT), and whether it was divided horizontally or vertically. To solve the multi-classification problem, the technique of creating multiple binary classification problems was used. Subsequently, a multi-threshold decision-making scheme consisting of four threshold points was proposed, which achieved a good balance between time savings and coding efficiency. According to the experimental results, our method achieved a significant reduction in encoding time, ranging from 47.93% to 54.27%, but only improved the Bjøntegaard delta bit-rate (BDBR) by 1.07%~1.57%. Our method showed good performance in terms of both encoding time reduction and efficiency.
APA, Harvard, Vancouver, ISO, and other styles
49

Sharma, Urvashi, Meenakshi Sood, and Emjee Puthooran. "Lossless Compression of Medical Image Sequences Using a Resolution Independent Predictor and Block Adaptive Encoding." International journal of electrical and computer engineering systems 9, no. 2 (June 6, 2019): 69–79. http://dx.doi.org/10.32985/ijeces.9.2.4.

Full text
Abstract:
The proposed block-based lossless coding technique presented in this paper targets at compression of volumetric medical images of 8-bit and 16-bit depth. The novelty of the proposed technique lies in its ability of threshold selection for prediction and optimal block size for encoding. A resolution independent gradient edge detector is used along with the block adaptive arithmetic encoding algorithm with extensive experimental tests to find a universal threshold value and optimal block size independent of image resolution and modality. Performance of the proposed technique is demonstrated and compared with benchmark lossless compression algorithms. BPP values obtained from the proposed algorithm show that it is capable of effective reduction of inter-pixel and coding redundancy. In terms of coding efficiency, the proposed technique for volumetric medical images outperforms CALIC and JPEG-LS by 0.70 % and 4.62 %, respectively.
APA, Harvard, Vancouver, ISO, and other styles
50

Denimal, Emmanuel, Ambroise Marin, Stéphane Guyot, Ludovic Journaux, and Paul Molin. "Automatic Biological Cell Counting Using a Modified Gradient Hough Transform." Microscopy and Microanalysis 23, no. 1 (February 2017): 11–21. http://dx.doi.org/10.1017/s1431927616012617.

Full text
Abstract:
AbstractWe present a computational method for pseudo-circular object detection and quantitative characterization in digital images, using the gradient accumulation matrix as a basic tool. This Gradient Accumulation Transform (GAT) was first introduced in 1992 by Kierkegaard and recently used by Kaytanli & Valentine. In the present article, we modify the approach by using the phase coding studied by Cicconet, and by adding a “local contributor list” (LCL) as well as a “used contributor matrix” (UCM), which allow for accurate peak detection and exploitation. These changes help make the GAT algorithm a robust and precise method to automatically detect pseudo-circular objects in a microscopic image. We then present an application of the method to cell counting in microbiological images.
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!

To the bibliography