1,012,626 Hits in 2.8 sec

Fast and robust bootstrap

Matías Salibián-Barrera, Stefan Van Aelst, Gert Willems
2007 Statistical Methods & Applications  
This fast and robust bootstrap method is, under reasonable regularity conditions, asymptotically consistent.  ...  We describe the method in general and then consider its application to perform inference based on robust estimators for the linear regression and multivariate location-scatter models.  ...  authors starting with Maronna (1976) , Campbell (1980) and Devlin et al. (1981) . More recently Croux Fast and Robust Bootstrap  ... 
doi:10.1007/s10260-007-0048-6 fatcat:557u3opmzzbz5k63ewhw3o7euy

Robust model selection using fast and robust bootstrap

Matias Salibian-Barrera, Stefan Van Aelst
2008 Computational Statistics & Data Analysis  
It is shown that the expected prediction error can be estimated using a very fast and robust bootstrap method, and that this approach yields a consistent model selection method that is computationally  ...  Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function when measuring either the  ...  Finally, for the fast and robust bootstrap, (23) holds with a = 1 (see Salibian-Barrera and Zamar, 2002) .  ... 
doi:10.1016/j.csda.2008.05.007 fatcat:rztknenszjgc3gbqhpaauwabz4

Fast and robust discriminant analysis

Mia Hubert, Katrien Van Driessen
2004 Computational Statistics & Data Analysis  
In particular the highly robust MCD estimator is used as it can be computed very fast for large data sets. Also the probability of misclassification is estimated in a robust way.  ...  Robust discriminant rules are obtained by inserting robust estimates of location and scatter into generalized maximum likelihood rules at normal distributions.  ...  This would also yield a fast and robust analysis.  ... 
doi:10.1016/s0167-9473(02)00299-2 fatcat:ess5rajufzdunpdojdo2t365ze

Fast and Robust Fixed-Rank Matrix Recovery [article]

German Ros, Julio Guerrero
2015 arXiv   pre-print
We introduce a novel and fast projector for the SPD manifold and a proof of its validity. Further acceleration is achieved using a Nystrom scheme.  ...  Extensive experiments with synthetic and real data in the context of robust photometric stereo and spectral clustering show that our proposals outperform the state of the art.  ...  to produce fast and accurate approximations of the solution [24] .  ... 
arXiv:1503.03004v3 fatcat:fuldfhdafvbz5aw6eumn2i7dui

StainNet: a fast and robust stain normalization network [article]

Hongtao Kang, Die Luo, Weihua Feng, Junbo Hu, Shaoqun Zeng, Tingwei Quan, Xiuli Liu
2021 arXiv   pre-print
Here, we use distillation learning to reduce the complexity of deep learning methods and a fast and robust network called StainNet to learn the color mapping between the source image and target image.  ...  The pixel-to-pixel manner restricts the network size and avoids artifacts in the style transformation.  ...  Our proposed StainNet can achieve good results because of its robustness and less relying on the distribution of training set.  ... 
arXiv:2012.12535v6 fatcat:n4lhxc7be5eyviylysldavq3hm

A Fast and Robust TSVM for Pattern Classification [article]

Bin-Bin Gao, Jian-Jun Wang
2019 arXiv   pre-print
In this paper, we propose a Fast and Robust TSVM~(FR-TSVM) to deal with the above issues.  ...  The experimental results on several artificial and benchmark datasets indicate that the FR-TSVM not only obtains a fast learning speed but also shows a robust classification performance.  ...  In this paper, we propose a fast and robust twin support vector machine (FR-TSVM) for classification problem.  ... 
arXiv:1711.05406v3 fatcat:fusftdmourfqjlps3gghikyop4

Fast and Robust Iterative Closest Point [article]

Juyong Zhang and Yuxin Yao and Bailin Deng
2020 arXiv   pre-print
Recent work such as Sparse ICP achieves robustness via sparsity optimization at the cost of computational speed. In this paper, we propose a new method for robust registration with fast convergence.  ...  Finally, we extend the robust formulation to point-to-plane ICP, and solve the resulting problem using a similar Anderson-accelerated MM strategy.  ...  FAST AND ROBUST ICP Although the ICP algorithm enjoys fast decrease of target energy in the first few iterations, the decrease can slow down in subsequent iterations and result in slow convergence to the  ... 
arXiv:2007.07627v2 fatcat:c4i5qj7gizaonedkw3xce4j4ge

FastSpeech: Fast, Robust and Controllable Text to Speech [article]

Yi Ren, Yangjun Ruan, Xu Tan, Tao Qin, Sheng Zhao, Zhou Zhao, Tie-Yan Liu
2019 arXiv   pre-print
Compared with traditional concatenative and statistical parametric approaches, neural network based end-to-end models suffer from slow inference speed, and the synthesized speech is usually not robust  ...  cases, and can adjust voice speed smoothly.  ...  Conclusions In this work, we have proposed FastSpeech: a fast, robust and controllable neural TTS system.  ... 
arXiv:1905.09263v5 fatcat:p5vuiy3yfvband4f6bacr2bwoi

genieclust: Fast and robust hierarchical clustering

Marek Gagolewski
2021 SoftwareX  
This method frequently outperforms other state-of-the-art approaches in terms of clustering quality and speed, supports various distances over dense, sparse, and string data domains, and can be robustified  ...  social sciences as well as technology and engineering.  ...  Acknowledgements The author would like to thank Anna Cena and Maciej Bartoszuk for comments, discussion, and remarks.  ... 
doi:10.1016/j.softx.2021.100722 fatcat:xexys45dsbfoffifprmvgz7bce

FRoTeMa: Fast and Robust Template Matching

Abdullah M., M. I., Rawya Y.
2015 International Journal of Advanced Computer Science and Applications  
This paper considers the rotation, scale, brightness and contrast invariant grayscale template matching problem.  ...  Theoretical analysis and experiments on eight image datasets show that the proposed simple algorithm can maintain exhaustive accuracy while providing a significant speedup.  ...  Our algorithm, named FRoTeMa (Fast and Robust Template Matching), is also rotation/scale-discriminating within a predefined level of accuracy, i.e., the method determines the scale and rotation angle of  ... 
doi:10.14569/ijacsa.2015.061028 fatcat:ife77nvqzjaefki6h2hvqo2geq

Fast and Robust Distributed Subgraph Enumeration [article]

Xuguang Ren, Junhu Wang, Wook-Shin Han, Jeffrey Xu Yu
2019 arXiv   pre-print
This feature not only reduces network communication cost and memory usage, but also allows us to adopt simple strategies for memory control and load balancing, making it more robust.  ...  This strategy not only improves the overall performance but also reduces network communication and memory cost.  ...  , making our system more robust.  ... 
arXiv:1901.07747v1 fatcat:2kdi4rdtkjgaflg6tnso3ep3hi

SHARC: Fast and Robust Unidirectional Routing [chapter]

Reinhard Bauer, Daniel Delling
2008 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX)  
Moreover, we show how to exploit the advantage of unidirectional routing for fast exact queries in timetable information systems and for fast approximative queries in time-dependent scenarios.  ...  By running experiments on several inputs other than road networks, we show that our approach is very robust to the input.  ...  We would like to thank Peter Sanders and Dominik Schultes for interesting discussions on contraction and Arc-Flags. We also thank Daniel Karch for implementing Arc-Flags.  ... 
doi:10.1137/1.9781611972887.2 dblp:conf/alenex/BauerD08 fatcat:vm2xh5jdtvffhbmez52nyvngv4

Mixed Upward Planarization – Fast and Robust [chapter]

Martin Siebenhaller, Michael Kaufmann
2006 Lecture Notes in Computer Science  
We outline a fast and simple heuristic approach that provides a good quality and can be applied to larger graphs as before in reasonable time.  ...  We apply a fast variant that keeps the number of dummy vertices small and runs in time O((|V | + |E|) log |E|) [3] .  ... 
doi:10.1007/11618058_52 fatcat:kz6gh5cifzbt7hlatcangynzdm

Fast and Robust Multiframe Super Resolution

S. Farsiu, M.D. Robinson, M. Elad, P. Milanfar
2004 IEEE Transactions on Image Processing  
This computationally inexpensive method is robust to errors in motion and blur estimation and results in images with sharp edges.  ...  We propose an alternate approach using 1 norm minimization and robust regularization based on a bilateral prior to deal with different data and noise models.  ...  Nowak and the three reviewers for valuable comments that helped improve the clarity of presentation of this paper.  ... 
doi:10.1109/tip.2004.834669 pmid:15462143 fatcat:c4zdzjkhojhddnjbfvk3nd2u2y

A fast and robust text spotter

Siyang Qin, Roberto Manduchi
2016 2016 IEEE Winter Conference on Applications of Computer Vision (WACV)  
We also introduce a version that is three times as fast, with only a slight reduction in performance.  ...  We introduce an algorithm for text detection and localization ("spotting") that is computationally efficient and produces state-of-the-art results.  ...  The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health.  ... 
doi:10.1109/wacv.2016.7477663 pmid:27616942 pmcid:PMC5016027 dblp:conf/wacv/QinM16 fatcat:hg6b7il4vrcuxarljrloikbkky
« Previous Showing results 1 — 15 out of 1,012,626 results