We describe a new cardinality estimation algorithm that is extremely space-efficient. It applies one of three novel estimators to the compressed state of the Flajolet-Martin-85 coupon collection process. In an apples-to-apples empirical comparison against compressed HyperLogLog sketches, the new algorithm simultaneously wins on all three dimensions of the time space accuracy tradeoff. Our prototype uses the zstd compression library, and produces sketches that are smaller than the entropy of HLL, so no possible implementation of compressed HLL can match its space efficiency. The paper's technical contributions include analyses and simulations of the three new estimators, accurate values for the entropies of FM85 and HLL, and a non-trivial method for estimating a double asymptotic limit via simulation.
HIP estimators were discovered independently by @cite_18 and @cite_16 , and both papers used HLL sketches to illustrate how this idea can be applied.
@cite_18 @cite_16
2952155300 1491968272 2159988341 2565438365
In this paper, we consider the problem of locating the information source with sparse observations. We assume that a piece of information spreads in a network following a heterogeneous susceptible-infected-recovered (SIR) model and that a small subset of infected nodes are reported, from which we need to find the source of the information. We adopt the sample path based estimator developed in [1], and prove that on infinite trees, the sample path based estimator is a Jordan infection center with respect to the set of observed infected nodes. In other words, the sample path based estimator minimizes the maximum distance to observed infected nodes. We further prove that the distance between the estimator and the actual source is upper bounded by a constant independent of the number of infected nodes with a high probability on infinite trees. Our simulations on tree networks and real world networks show that the sample path based estimator is closer to the actual source than several other algorithms. This paper explores a method, first proposed by Wei and Chai [1], for estimating 3D human pose from several frames of uncalibrated 2D point correspondences containing projected body joint locations. In their work Wei and Chai boldly claimed that, through the introduction of rigid constraints to the torso and hip, camera scales, bone lengths and absolute depths could be estimated from a finite number of frames (i.e. ≥ 5). In this paper we show this claim to be false, demonstrating in principle one can never estimate these parameters in a finite number of frames. Further, we demonstrate their approach is only valid for rigid sub-structures of the body (e.g. torso). Based on this analysis we propose a novel approach using deterministic structure from motion based on assumptions of rigidity in the body's torso. Our approach provides notably more accurate estimates and is substantially faster than Wei and Chai's approach, and unlike the original, can be solved as a deterministic least-squares problem. Summary Objective To determine whether computer-based analysis can detect features predictive of osteoarthritis (OA) development in radiographically normal knees. Method A systematic computer-aided image analysis method weighted neighbor distances using a compound hierarchy of algorithms representing morphology (WND-CHARM) was used to analyze pairs of weight-bearing knee X-rays. Initial X-rays were all scored as normal Kellgren–Lawrence (KL) grade 0, and on follow-up approximately 20 years later either developed OA (defined as KL grade=2) or remained normal. Results The computer-aided method predicted whether a knee would change from KL grade 0 to grade 3 with 72 accuracy ( P P Conclusion Radiographic features detectable using a computer-aided image analysis method can predict the future development of radiographic knee OA. A novel approach for estimating the instantaneous velocity of the pelvis during walking was developed based on Inertial Measurement Units (IMUs). The instantaneous velocity was modeled by the sum of a cyclical component, decomposed in the Medio-Lateral (ML), VerTical (VT) and Antero-Posterior (AP) directions, and the Average Progression Velocity (APV) over each gait cycle. The proposed method required the availability of two IMUs, attached to the pelvis and one shank. Gait cycles were identified from the shank angular velocity; for each cycle, the Fourier series coefficients of the pelvis and shank acceleration signals were computed. The cyclical component was estimated by Fourier-based time-integration of the pelvis acceleration. A Bayesian Linear Regression (BLR) with Automatic Relevance Determination (ARD) predicted the APV from the stride time, the stance duration, and the Fourier series coefficients of the shank acceleration. Healthy subjects performed tasks of Treadmill Walking (TW) and Overground Walking (OW), and an optical motion capture system (OMCS) was used as reference for algorithm performance assessment. The widths of the limits of agreements (±1.96 standard deviation) were computed between the proposed method and the reference OMCS, yielding, for the cyclical component in the different directions: ML: ±0.07 m s (±0.10 m s); VT: ±0.03 m s (±0.05 m s); AP: ±0.06 m s (±0.10 m s), in TW (OW) conditions. The ARD-BLR achieved an APV root mean square error of 0.06 m s (0.07 m s) in the same conditions.