Results 251 to 260 of about 22,509,590 (296)
Some of the next articles are maybe not open access.
Convex Clustering Analysis for Histogram-Valued Data
Biometrics, 2018Abstract In recent years, there has been increased interest in symbolic data analysis, including for exploratory analysis, supervised and unsupervised learning, time series analysis, etc. Traditional statistical approaches that are designed to analyze single-valued data are not suitable because they cannot incorporate the additional ...
Cheolwoo Park +4 more
openaire +3 more sources
A Bounding Histogram Approach for Network Performance Analysis
2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013We analyze the performance of a network under general traffics derived from traces. We apply stochastic comparisons in order to derive bounding histograms with a reduced size and complexity. We prove some stochastic monotonicity properties for the network elements, in order to derive bounds on the performance measures such as delays and losses. We show
Ait Salaht, Farah +3 more
openaire +2 more sources
Analysis of Histogram of Oriented Gradients on Gait Recognition
2021This study investigates the impact of Histogram of Oriented Gradients (HoG) on gait recognition. HoG is applied to four basic gait representations, i.e. Gait Energy Image (GEI), Gait Entropy Image (GEnI), Gait Gaussian Image (GGI), and newly developed Gait Gaussian Entropy Image (GGEnI).
Chirawat Wattanapanich, Hong Wei, Wei Xu
openaire +2 more sources
Information granules in image histogram analysis
Computerized Medical Imaging and Graphics, 2018A concept of granular computing employed in intensity-based image enhancement is discussed. First, a weighted granular computing idea is introduced. Then, the implementation of this term in the image processing area is presented. Finally, multidimensional granular histogram analysis is introduced.
openaire +3 more sources
An Analysis of Histogram-Based Thresholding Algorithms
CVGIP: Graphical Models and Image Processing, 1993Abstract Eleven histogram-based global thresholding algorithms are presented in a common notational framework. Relationships among them are identified from 654 mixtures of two Gaussian distributions, plus effects of mixed pixels. The iterated version of Kittler and Illingworth′s minimum error algorithm ( Pattern Recognition , 19, 1986, 41-47) is ...
openaire +1 more source
A new SAO based on histogram analysis in HEVC
2013 Picture Coding Symposium (PCS), 2013High Efficiency Video Coding (HEVC) is under development by the Joint video coding standardization project of ITU-T Video Coding Experts Group and Moving Picture Experts Group. The current in-loop filter has two tools, deblocking filter (DF) and sample adaptive offset (SAO).
Binji Luo +4 more
openaire +1 more source
Stochastic Bounds and Histograms for Network Performance Analysis
2013Exact analysis of queueing networks under real traffic histograms becomes quickly intractable due to the state explosion. In this paper, we propose to apply the stochastic comparison method to derive performance measure bounds under histogram-based traffics.
Ait Salaht, Farah +3 more
openaire +1 more source
Parametric analysis of histograms measured in flow cytometry
Cytometry, 1983AbstractFlow cytometric histograms frequently consist of several components that show various degrees of overlap. For many types of analysis it is of great importance to decompose the original histogram into its components. To that purpose, we investigated the maximum likelihood approach in detail.
R C, Mann, R E, Hand, G R, Braslawsky
openaire +2 more sources
Fuzzy histograms: A Statistical Analysis.
2005Fuzzy histograms are a fuzzy generalization of ordinary crisp histograms. In this paper, fuzzy histograms are analyzed statistically and are compared with other nonparametric density estimators. It turns out that fuzzy histograms can be used to combine a high level of statistical efficiency with a high level of computational efficiency.
Waltman, L.R. +2 more
openaire +3 more sources
1992
The cell cycle In 1951 Howard and Pelc discovered that the DNA synthesis period occupied a discrete interval separated temporally from mitosis. The immediate conclusion was that there must be at least four distinct phases within the division cycle, one of which (mitosis) had already been defined.
openaire +1 more source
The cell cycle In 1951 Howard and Pelc discovered that the DNA synthesis period occupied a discrete interval separated temporally from mitosis. The immediate conclusion was that there must be at least four distinct phases within the division cycle, one of which (mitosis) had already been defined.
openaire +1 more source