In this paper, we introduce the Equipment Nameplate Dataset, a large dataset for scene text detection and recognition. Natural images in this dataset are taken in the wild and thus this dataset includes various intra-...
详细信息
A real-time scheme is introduced that meets a need for fast, reliable, multiple-target motion detection without accurate object velocity or structure measurements. A multiresolution approach decomposes images into a p...
详细信息
ISBN:
(纸本)0818608625
A real-time scheme is introduced that meets a need for fast, reliable, multiple-target motion detection without accurate object velocity or structure measurements. A multiresolution approach decomposes images into a pyramid with several spatial frequency bands to selectively detect motions of interest. Multiple moving targets are detected using a multiple window, coarse-to-fine focus of attention scheme to reconstruct motion energy and search for targets. Real-time sensor motion (translation and rotation) compensations use hierarchical correlation and minimum perturbation. Results are shown for multiple moving targets in FLIR (forward-looking infrared) image sequences from both stationary and moving sensors.
For the first time, we formulate an auxiliary particle filter jointly in the pixel domain and modulation domain for tracking infrared targets. This dual domain approach provides an information rich image representatio...
详细信息
ISBN:
(纸本)9781424439942
For the first time, we formulate an auxiliary particle filter jointly in the pixel domain and modulation domain for tracking infrared targets. This dual domain approach provides an information rich image representation comprising the pixel domain frames acquired directly from an imaging infrared sensor as well as 18 amplitude modulation functions obtained through a multicomponent AM-FM image analysis. The new dual domain auxiliary particle filter successfully tracks all of the difficult targets in the well-known AMCOM closure sequences in terms of both centroid location and target magnification. In addition, we incorporate the template update procedure into the particle filter formulation to extend previously studied dual domain track consistency checking mechanism far beyond the normalized cross correlation (NCC) trackers of the past by explicitly quantifying the differences in target signature evolution between the modulation and pixel domains. Experimental results indicate that the dual domain auxiliary particle filter with integrated target signature update provides a significant performance advantage relative to several recent competing algorithms.
Most tracking-by-detection methods employ a local search window around the predicted object location in the current frame assuming the previous location is accurate, the trajectory is smooth, and the computational cap...
详细信息
ISBN:
(纸本)9781467388511
Most tracking-by-detection methods employ a local search window around the predicted object location in the current frame assuming the previous location is accurate, the trajectory is smooth, and the computational capacity permits a search radius that can accommodate the maximum speed yet small enough to reduce mismatches. These, however, may not be valid always, in particular for fast and irregularly moving objects. Here, we present an object tracker that is not limited to a local search window and has ability to probe efficiently the entire frame. Our method generates a small number of "high-quality" proposals by a novel instance-specific objectness measure and evaluates them against the object model that can be adopted from an existing tracking-by-detection approach as a core tracker. During the tracking process, we update the object model concentrating on hard false-positives supplied by the proposals, which help suppressing distractors caused by difficult background clutters, and learn how to re-rank proposals according to the object model. Since we reduce significantly the number of hypotheses the core tracker evaluates, we can use richer object descriptors and stronger detector. Our method outperforms most recent state-of-the-art trackers on popular tracking benchmarks, and provides improved robustness for fast moving objects as well as for ultra lowframe-rate videos.
The basic MINPRAN (MINimize the Probability of RANdomness) technique, introduced by C.V. Stewart (1994), is extended to handle range data taken from complex scenes. Such data often includes: (1) a large numbers of out...
详细信息
The basic MINPRAN (MINimize the Probability of RANdomness) technique, introduced by C.V. Stewart (1994), is extended to handle range data taken from complex scenes. Such data often includes: (1) a large numbers of outliers, (2) points from multiple surfaces interspersed over large image regions, and (3) extended regions containing only bad data. The initial version of MINPRAN handles cases (1) and (3). For (2), given an image region containing data from more than one surface, the basic technique tends to favor a single fit that "bridges" two surfaces. We analyze the extent of this problem and introduce two modifications to solve it. The new version of the algorithm, called MINPRAN2, produces extremely good results on difficult range data.< >
Modality is a key facet in medical image retrieval, as a user is likely interested in only one of e.g. radiology images, flowcharts, and pathology photos. While assessing image modality is trivial for humans, reliable...
详细信息
ISBN:
(纸本)9781467316118
Modality is a key facet in medical image retrieval, as a user is likely interested in only one of e.g. radiology images, flowcharts, and pathology photos. While assessing image modality is trivial for humans, reliable automatic methods are required to deal with large un-annotated image bases, such as figures taken from the millions of scientific publications. We present a multi-disciplinary approach to tackle the classification problem by combining image features, meta-data, textual and referential information. We test our system’s accuracy on the ImageCLEF 2011 medical modality classification data set. We show that using multiple kernel based classification, where the kernels are carefully selected for the different features, significantly increases the classification accuracy. Moreover, we demonstrate that by using linear support vector machine with explicit feature maps [35] of the selected kernels one can achieve comparable results to the (non-linear) kernel based one. Our best method achieves 88.47% accuracy and outperforms the state of the art.
We propose a novel method for the multi-view reconstruction problem. Surfaces which do not have direct support in the input 3D point cloud and hence need not be photo-consistent but represent real parts of the scene (...
详细信息
Indexing is an efficient method of recovering match hypotheses in model-based object recognition. Unlike other methods, which search for viewpoint-invariant shape descriptors to use as indices, we use a learning metho...
详细信息
Indexing is an efficient method of recovering match hypotheses in model-based object recognition. Unlike other methods, which search for viewpoint-invariant shape descriptors to use as indices, we use a learning method to model the smooth variation in appearance of local feature sets (LFS). Indexing from LFS effectively deals with the problems of occlusion and missing features. The indexing functions generated by the learning method are probability distributions describing the possible interpretations of each index value. During recognition, this information can be used to select the least ambiguous features for matching. A verification stage follows so that the final reliability and accuracy of the match is greater than that from indexing alone. This approach has the potential to work with a wide range of image features and model types.< >
Accurately segmenting and quantifying structures is a key issue in biomedical image analysis. The two conventional methods of image segmentation, region-based segmentation and boundary finding, often suffer from a var...
详细信息
Accurately segmenting and quantifying structures is a key issue in biomedical image analysis. The two conventional methods of image segmentation, region-based segmentation and boundary finding, often suffer from a variety of limitations. We propose a method which endeavors to integrate the two approaches in an effort to form a unified approach that is robust to noise and poor initialization. Our approach uses Green's theorem to derive the boundary of a homogeneous region-classified area in the image and integrates this with a grey-level-gradient-based boundary finder. This combines the perceptual notions of edge/shape information with gray level homogeneity.< >
We empirically evaluate a distance-guided learning method embedded in a multiple classifier system (MCS) for tissue segmentation in optical images of the uterine cervix. Instead of combining multiple base classifiers ...
详细信息
ISBN:
(纸本)9781424439942
We empirically evaluate a distance-guided learning method embedded in a multiple classifier system (MCS) for tissue segmentation in optical images of the uterine cervix. Instead of combining multiple base classifiers as in traditional ensemble methods, we propose a Bhattacharyya distance based metric for measuring the similarity in decision boundary shapes between a pair of statistical classifiers. By generating an ensemble of base classifiers trained independently on separate training images, we can use the distance metric to select those classifiers in the ensemble whose decision boundaries are similar to that of an unknown test image. In an extreme case, we select the base classifier with the most similar decision boundary to accomplish classification and segmentation on the test image. Our approach is novel in the way that the nearest neighbor is picked and effectively solves classification problems in which base classifiers with good overall performance are not easy to construct due to a large variation in the training examples. In our experiments, we applied our method and several popular ensemble methods to segmenting acetowhite regions in cervical images. The overall classification accuracy of the proposed method is significantly better than that of a single classifier learned using the entire training set, and is also superior to other ensemble methods including majority voting, STAPLE, Boosting and Bagging.
暂无评论