Scene invariant multi camera crowd counting

Automated crowd counting has become an active field of computer vision research in recent years. Existing approaches are scene-specific, as they are designed to operate in the single camera viewpoint that was used to train the system. Real world camera networks often span multiple viewpoints within a facility, including many regions of overlap. This paper proposes a novel scene invariant crowd counting algorithm that is designed to operate across multiple cameras. The approach uses camera calibration to normalise features between viewpoints and to compensate for regions of overlap. This compensation is performed by constructing an 'overlap map' which provides a measure of how much an object at one location is visible within other viewpoints. An investigation into the suitability of various feature types and regression models for scene invariant crowd counting is also conducted. The features investigated include object size, shape, edges and keypoints. The regression models evaluated include neural networks, K-nearest neighbours, linear and Gaussian process regresion. Our experiments demonstrate that accurate crowd counting was achieved across seven benchmark datasets, with optimal performance observed when all features were used and when Gaussian process regression was used. The combination of scene invariance and multi camera crowd counting is evaluated by training the system on footage obtained from the QUT camera network and testing it on three cameras from the PETS 2009 database. Highly accurate crowd counting was observed with a mean relative error of less than 10%. Our approach enables a pre-trained system to be deployed on a new environment without any additional training, bringing the field one step closer toward a 'plug and play' system.

Does counting still count? Revisiting the security of counting based user authentication protocols against statistical attacks

At NDSS 2012, Yan et al. analyzed the security of several challenge-response type user authentication protocols against passive observers, and proposed a generic counting based statistical attack to recover the secret of some counting based protocols given a number of observed authentication sessions. Roughly speaking, the attack is based on the fact that secret (pass) objects appear in challenges with a different probability from non-secret (decoy) objects when the responses are taken into account. Although they mentioned that a protocol susceptible to this attack should minimize this difference, they did not give details as to how this can be achieved barring a few suggestions. In this paper, we attempt to fill this gap by generalizing the attack with a much more comprehensive theoretical analysis. Our treatment is more quantitative which enables us to describe a method to theoretically estimate a lower bound on the number of sessions a protocol can be safely used against the attack. Our results include 1) two proposed fixes to make counting protocols practically safe against the attack at the cost of usability, 2) the observation that the attack can be used on non-counting based protocols too as long as challenge generation is contrived, 3) and two main design principles for user authentication protocols which can be considered as extensions of the principles from Yan et al. This detailed theoretical treatment can be used as a guideline during the design of counting based protocols to determine their susceptibility to this attack. The Foxtail protocol, one of the protocols analyzed by Yan et al., is used as a representative to illustrate our theoretical and experimental results.

Counting the costs : assessments under the UCPR

In McCoombes v Curragh Queensland Mining Ltd [2001] QDC 142 the court considered a number of significant issues in relation to assessments of costs under the Uniform Civil Procedure Rules 1999 (Qld). The Court of Appeal subsequently declined an application for leave to appeal the decision under s118(3) of the District Court Act 1967 (McCoombes v Curragh Queensland Mining Ltd [2001] QCA 379. The judgment in the District Court, and on some matters the subsequent observations in the Court of Appeal, provide clarification in respect of many issues relating the assessment of costs under the UCPR.

An evaluation of crowd counting methods, features and regression models

Existing crowd counting algorithms rely on holistic, local or histogram based features to capture crowd properties. Regression is then employed to estimate the crowd size. Insufficient testing across multiple datasets has made it difficult to compare and contrast different methodologies. This paper presents an evaluation across multiple datasets to compare holistic, local and histogram based methods, and to compare various image features and regression models. A K-fold cross validation protocol is followed to evaluate the performance across five public datasets: UCSD, PETS 2009, Fudan, Mall and Grand Central datasets. Image features are categorised into five types: size, shape, edges, keypoints and textures. The regression models evaluated are: Gaussian process regression (GPR), linear regression, K nearest neighbours (KNN) and neural networks (NN). The results demonstrate that local features outperform equivalent holistic and histogram based features; optimal performance is observed using all image features except for textures; and that GPR outperforms linear, KNN and NN regression

Automated counting of the Northern Pacific Sea Star in the Derwent using shape recognition

A novel shape recognition algorithm was developed to autonomously classify the Northern Pacific Sea Star (Asterias amurenis) from benthic images that were collected by the Starbug AUV during 6km of transects in the Derwent estuary. Despite the effects of scattering, attenuation, soft focus and motion blur within the underwater images, an optimal joint classification rate of 77.5% and misclassification rate of 13.5% was achieved. The performance of algorithm was largely attributed to its ability to recognise locally deformed sea star shapes that were created during the segmentation of the distorted images.

Counting the cost of fast fashion

There’s a polyester mullet skirt gracing a derrière near you. It’s short at the front, long at the back, and it’s also known as the hi-lo skirt. Like fads that preceded it, the mullet skirt has a short fashion life, and although it will remain potentially wearable for years, it’s likely to soon be heading to the charity shop or to landfill...

Measurements of partial discharges-corrections to erroneous counts occurring in a cumulative pulse-counting system

The discharge pulse rates at different magnitude levels are often used as criteria for monitoring the partial-discharge aging of insulation systems. Use of suggested corrections for errors in cumulative probability counting leads to better use of available counters.

Counting the cost: Estimating the number of deaths among recently released prisoners in Australia

TO THE EDITOR: Kinner and colleagues described the high proportion of deaths among recently released prisoners in Australia...

Computing Fractal Dimension of Signals using Multiresolution Box-counting Method

In this paper, we have developed a method to compute fractal dimension (FD) of discrete time signals, in the time domain, by modifying the box-counting method. The size of the box is dependent on the sampling frequency of the signal. The number of boxes required to completely cover the signal are obtained at multiple time resolutions. The time resolutions are made coarse by decimating the signal. The loglog plot of total number of boxes required to cover the curve versus size of the box used appears to be a straight line, whose slope is taken as an estimate of FD of the signal. The results are provided to demonstrate the performance of the proposed method using parametric fractal signals. The estimation accuracy of the method is compared with that of Katz, Sevcik, and Higuchi methods. In ddition, some properties of the FD are discussed.

Unified approach to the constraint counting theory of glasses

An approach to the constraint counting theory of glasses is applied to many glass systems which include an oxide, chalcohalide, and chalcogenides. In this, shifting of the percolation threshold due to noncovalent bonding interactions in a basically covalent network and other recent extensions of the theory appear natural. This is particularly insightful and reveals that the chemical threshold signifies another structural transition along with the rigidity percolation threshold, thus unifying these two seemingly disparate toplogical concepts. [S0163-1829(99)11441-3].

Cross-section fluctuations in open microwave billiards and quantum graphs: The counting-of-maxima method revisited

The fluctuations exhibited by the cross sections generated in a compound-nucleus reaction or, more generally, in a quantum-chaotic scattering process, when varying the excitation energy or another external parameter, are characterized by the width Gamma(corr) of the cross-section correlation function. Brink and Stephen Phys. Lett. 5, 77 (1963)] proposed a method for its determination by simply counting the number of maxima featured by the cross sections as a function of the parameter under consideration. They stated that the product of the average number of maxima per unit energy range and Gamma(corr) is constant in the Ercison region of strongly overlapping resonances. We use the analogy between the scattering formalism for compound-nucleus reactions and for microwave resonators to test this method experimentally with unprecedented accuracy using large data sets and propose an analytical description for the regions of isolated and overlapping resonances.

Morphological and functional characterisation of the burrow systems of six earthworm species (Lumbricidae)

Earthworm burrow systems are generally described based on postulated behaviours associated with the three ecological types. In this study, we used X-ray tomography to obtain 3D information on the burrowing behaviour of six very common anecic (Aporrectodea nocturna and Lumbricus terrestris) and endogeic (Aporrectodea rosea, Allolobophora chlorotica, Aporrectodea caliginosa, Aporrectodea icterica) earthworm species, introduced into repacked soil cores for 6 weeks. A simple water infiltration test, the Beerkan method, was also used to assess some functional properties of these burrow systems. Endogeic worms make larger burrow systems, which are more highly branched, less continuous and of smaller diameter, than those of anecic worms. Among the anecic species, L. terrestris burrow systems are shorter (9.2 vs 21.2 m) with a higher number (14.5 vs 23.5) of less branched burrows (12.2 vs 20.2 branches m(-1)), which are also wider (7.78 vs 5.16 mm) than those of A. nocturna. In comparison, the burrow systems made by endogeic species appeared similar to each other. However, A. rosea burrows were short and narrow, whereas A. icterica had a longer burrow system (15.7 m), more intense bioturbation intensity (refilled macropores or soil lateral compaction around them) and thus a greater number of burrows. Regarding water infiltration, anecic burrow systems were far more efficient due to open burrows linking the top and bottom of the cores. For endogeic species, we observed a linear relationship between burrow length and the water infiltration rate (R (2) = 0.49, p < 0.01). Overall, the three main characteristics significantly influencing water infiltration were burrow length, burrow number and bioturbation volume. This last characteristic highlighted the effect of burrow refilling by casts.

Counting zero kernel pairs over a finite field

Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called zero kernel pairs over a finite field. We show that the problem is, equivalent to certain other enumeration problems and outline a connection with some recent results of Guo and Yang on the natural density of rectangular unimodular matrices over F-qx]. We also propose a new conjecture on the density of unimodular matrix polynomials. (C) 2016 Elsevier Inc. All rights reserved.