Filters








561,220 Hits in 13.8 sec

Rate-Distortion and Complexity Optimized Motion Estimation for H.264 Video Coding

H.F. Ates, Y. Altunbasak
2008 IEEE transactions on circuits and systems for video technology (Print)  
For the latter case, the algorithm provides a tight upper bound on the worst case complexity/execution time of the motion estimation module.  ...  Motion vector search is carried out for only the selected partitions, thus reducing the complexity of the motion estimation step.  ...  For the average computational cost, we define the expected complexity of each partition as follows.  ... 
doi:10.1109/tcsvt.2008.918114 fatcat:vi74zfshz5btxaznmafhm667fa

Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm [article]

Niraj Kumar Singh, Soubhik Chakraborty
2012 arXiv   pre-print
We have also performed empirical analysis of average case behavior of our proposed algorithm along with the necessary theoretical analysis for best and worst cases.  ...  Smart Sort algorithm is a "smart" fusion of heap construction procedures (of Heap sort algorithm) into the conventional "Partition" function (of Quick sort algorithm) resulting in a robust version of Quick  ...  The quick sort was found to be excellent on continuous data sets, whereas heap sort worked superbly well with the discrete data set.  ... 
arXiv:1204.5083v1 fatcat:7pcrl47aljhyfatshxmsdi63qq

Low Complexity Inter-Mode Selection for H.264

Seydou-Nourou Ba, Yucel Altunbasak, Hasan Ates
2006 2006 International Conference on Image Processing  
Due to the use of multiple Macroblock (MB) partitions, the Motion estimation module has extremely high complexity that makes it unpractical for most real-time applications on resource-limited platforms  ...  The proposed method reduces the Motion estimation (ME) computational complexity by accurately predicting the optimal MB partitions and restricting the number of candidate modes based on a-priori probabilities  ...  Most of the methods based on the latter approach have been successful in reducing the average ME time.  ... 
doi:10.1109/icip.2006.312584 dblp:conf/icip/BaAA06 fatcat:vdc5udptbncknm57v6wu7q4hjq

Fast consensus clustering in complex networks

Aditya Tandon, Aiiad Albeshri, Vijey Thayananthan, Wadee Alhalabi, Santo Fortunato
2019 Physical review. E  
Consensus clustering has proven to be an effective technique to derive more stable and accurate partitions than the ones obtained by the direct application of the algorithm.  ...  Consequently, the complexity can get dangerously close to quadratic, which makes the technique inapplicable on large graphs.  ...  This procedure can improve considerably the accuracy of the result, with respect to the set of initial partitions, but the construction of the consensus matrix has a worst time and space complexity of  ... 
doi:10.1103/physreve.99.042301 fatcat:3og3col4k5duvmy2yfxxzrdxle

A scalable framework for cluster ensembles

Prodip Hore, Lawrence O. Hall, Dmitry B. Goldgof
2009 Pattern Recognition  
If the data set is very large, clustering may be done on tractable size disjoint subsets.  ...  The advantage of these approaches is that they provide a final partition of data that is comparable to the best existing approaches, yet scale to extremely large data sets.  ...  Acknowledgements This research was partially supported by the National Institutes of Health under grant number 1 R01 EB00822-01 and by the Department of Energy through the ASCI PPPE Data Discovery Program  ... 
doi:10.1016/j.patcog.2008.09.027 pmid:20160846 pmcid:PMC2654620 fatcat:sxyemtspujd6rlascbmwhg26yu

A Measurement Set Partitioning Algorithm Based on CFSFDP for Multiple Extended Target Tracking in PHD Filter

Y. Gong, C. Cui
2021 Radioengineering  
One crucial problem of the ET-PHD filter is partitioning the measurement set. This paper proposes a partitioning algorithm based on clustering by fast search and find density peaks (CFSFDP).  ...  Firstly, we adopt CFSFDP algorithm to partition the measurement set and the field theory is introduced to determine the cutoff distance of the CFSFDP algorithm.  ...  However, the average run time of the proposed algorithm is much less than that of the compared algorithms.  ... 
doi:10.13164/re.2021.0407 fatcat:dcf7qgiaqzcwjhzlv7mev324n4

Rough Set Feature Selection Methods for Case-Based Categorization of Text Documents [chapter]

Kalyan Moy Gupta, Philip G. Moore, David W. Aha, Sankar K. Pal
2005 Lecture Notes in Computer Science  
Our comparative evaluation of our method with a conventional method on the Reuters-21578 data set shows that it can dramatically decrease training time without compromising classification accuracy.  ...  Also, we found that randomized training set partitions dramatically reduce training time.  ...  Acknowledgement We thank the Naval Research Laboratory for supporting this research.  ... 
doi:10.1007/11590316_128 fatcat:ujd43mxdgbeltizadffqzexyg4

Complexity Reduction Opportunities in the Future VVC Intra Encoder

A. Tissier, A. Mercat, T. Amestoy, W. Hamidouche, J. Vanne, D. Menard
2019 2019 IEEE 21st International Workshop on Multimedia Signal Processing (MMSP)  
However, these new tools also play an integral part in making VTM intra encoding around 20 times as complex as that of HM.  ...  According to our evaluations, the complexity reduction opportunity of block partitioning is up to 97%, i.e., the encoding complexity would drop down to 3% for the same coding efficiency if the optimal  ...  Tango2 sequence was chosen since its average encoding time per frame was close to the average of its class A1.  ... 
doi:10.1109/mmsp.2019.8901754 dblp:conf/mmsp/TissierMAHVM19 fatcat:xdnxqyf7xfdupktlxkwn3d4bra

Low complexity H.264 video encoding

Paula Carrillo, Hari Kalva, Tao Pin, Andrew G. Tescher
2009 Applications of Digital Image Processing XXXII  
Results show, on average, a 67.36% reduction in encoding time, a 0.2 dB decrease in PSNR, and an average bit rate increase of 0.05%.  ...  The current technological challenge is to conserve the compression capacity and quality that H.264 offers but reduce the encoding time and, therefore, the processing complexity.  ...  Figure 3 3 Applying machine learning to video coding Table 2 2 Average results HD formatFor SD format sequences tested, in the first set of experiments, results show, on average, a time reduction of  ... 
doi:10.1117/12.829400 fatcat:jxvvxbe2kbechfgh6vrscmqqiq

Efficient VVC Intra Prediction Based on Deep Feature Fusion and Probability Estimation [article]

Tiesong Zhao, Yuhang Huang, Weize Feng, Yiwen Xu, Sam Kwong
2022 arXiv   pre-print
However, the gain of VVC is achieved at the cost of significant encoding complexity, which brings the need to realize fast encoder with comparable Rate Distortion (RD) performance.  ...  Experimental results on standard database demonstrate the superiority of proposed method, especially for High Definition (HD) and Ultra-HD (UHD) video sequences.  ...  This two-stage approach has a great efficiency of time reduction compared with state-of-the-arts with negligible RD performance loss, offering 55.59% encoding complexity reduction on average.  ... 
arXiv:2205.03587v1 fatcat:vgqc2yqnbbbntea2xxjan7o5ue

Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems

Jun-Seong Park, Lei Huang, C.-C.J. Kuo
2008 IEEE Transactions on Vehicular Technology  
The first approach reduces the complexity of the DCA scheme by partitioning the total resource (either capacity or service class) into several mutually exclusive subsets and assigns each subset of resource  ...  The second approach reduces the complexity of the optimal CAC scheme with the Markov decision process over an infinite time horizon by a suboptimal CAC policy, which is designed by observing the behavior  ...  In Fig. 8 , we see that the class-partitioning DCA scheme with the partition of [ ({0, 2}, 8), ({1, 3}, 8) ] has an average throughput close to that of the optimum with 20 times less complexity.  ... 
doi:10.1109/tvt.2007.904506 fatcat:lxptkyo23rfwrfht525dvus4jm

Querying Shortest Path Distance with Bounded Errors in Large Graphs [chapter]

Miao Qiao, Hong Cheng, Jeffrey Xu Yu
2011 Lecture Notes in Computer Science  
complexity of reference node embedding.  ...  To guarantee the user-specified error bound, we design a novel coverage-based reference node selection strategy, and show that selecting the optimal set of reference nodes is NP-hard.  ...  |R| on Social NetworkFigure 15shows that the average error of RN-basic is in the range of [0.009, 0.04] Table 1 . 1 Comparison between RN-basic and RN-partition RN-basic RN-partition Offline Time Complexity  ... 
doi:10.1007/978-3-642-22351-8_16 fatcat:xoxxndffgjgrdpomexajdd4rha

Efficient Clustering Aggregation Based on Data Fragments

Ou Wu, Weiming Hu, Stephen J. Maybank, Mingliang Zhu, Bing Li
2012 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
The algorithms are inefficient if the number of data points is large. We define an efficient approach for clustering aggregation based on data fragments.  ...  The experimental results obtained using several public data sets show that the new algorithms have lower computational complexity than three well-known existing point-based clustering aggregation algorithms  ...  ACKNOWLEDGMENT The authors would like to thank Q. Wang and X. Zou for their helpful suggestions.  ... 
doi:10.1109/tsmcb.2012.2183591 pmid:22334025 fatcat:ffivk2xu35b4lfgmbelbfmpjga

Learning feature-projection based classifiers

Aynur Dayanik
2012 Expert systems with applications  
The GFP.MC algorithm is slightly inferior to the OFP.MC algorithm, but, if it is used for datasets with large number of instances, then it reduces the space requirement of the OFP.MC algorithm.  ...  The first algorithm, OFP.MC, learns on each feature pairwise disjoint intervals which minimize feature classification error.  ...  For each data set, the accuracy of the best performing algorithm is shown in boldface. Complexity analysis We analyze the algorithms in terms of space and time complexities.  ... 
doi:10.1016/j.eswa.2011.09.133 fatcat:26ztfue6uvgbbcypzt3sdirqrm

A Novel Strategy Selection Method for Multi-Objective Clustering Algorithms Using Game Theory [article]

Mahsa Badami, Ali Hamzeh, Sattar Hashemi
2012 arXiv   pre-print
In this case, the size of payoff matrices reduces significantly which has a remarkable impact on time complexity.  ...  The most important factors which contribute to the efficiency of game-theoretical algorithms are time and game complexity.  ...  They would also like to thank extensive comments from the reviewers and the anonymous associate editor.  ... 
arXiv:1208.3432v1 fatcat:4lr27aawfzgvzpblkmbwozcbuq
« Previous Showing results 1 — 15 out of 561,220 results