161,384 research outputs found

    Gait Extraction and Description by Evidence-Gathering

    No full text
    Using gait as a biometric is of increasing interest, yet there are few model-based, parametric, approaches to extract and describe moving articulated objects. One new approach can detect moving parametric objects by evidence gathering, hence accruing known performance advantages in terms of performance and occlusion. Here we show how that the new technique can be extended not only to extract a moving person, but also to extract and concurrently provide a gait signature for use as a biometric. We show the natural relationship between the bases of these approaches, and the results they can provide. As such, these techniques allow for gait extraction and description for recognition purposes, and with known performance advantages of a well-established vision technique

    Watershed algorithm for moving object extraction considering energy minimization by snakes

    Get PDF
    金沢大学理工研究域電子情報学系MPEG-4, which is a video coding standard, supports object-based functionalities for high efficiency coding. MPEG-7, a multimedia content description interface, handles the object data in, for example, retrieval and/or editing systems. Therefore, extraction of semantic video objects is an indispensable tool that benefits these newly developed schemes. In the present paper, we propose a technique that extracts the shape of moving objects by combining snakes and watershed algorithm. The proposed method comprises two steps. In the first step, snakes extract contours of moving objects as a result of the minimization of an energy function. In the second step, the conditional watershed algorithm extracts contours from a topographical surface including a new function term. This function term is introduced to improve the estimated contours considering boundaries of moving objects obtained by snakes. The efficiency of the proposed approach in moving object extraction is demonstrated through computer simulations. © 2007 IEEE

    Moving object extraction by watershed algorithm considering energy minimization

    Get PDF
    金沢大学大学院自然科学研究科情報システムMPEG-4, which is a video coding standard, supports object-based functionalities for high efficiency coding. MPEG-7, a multimedia content description interface, handles the object data in, for example, retrieval and/or editing systems. Therefore, extraction of semantic video objects is an indispensable tool that benefits these newly developed schemes. In the present paper, we propose a technique that extracts the shape of moving objects by combining snakes and watershed algorithm. The proposed method comprises two steps. In the first step, snakes extract contours of moving objects as a result of the minimization of an energy function. In the second step, the conditional watershed algorithm extracts contours from a topographical surface including a new function term. This function term is introduced to improve the estimated contours considering boundaries of moving objects obtained by snakes. The efficiency of the proposed approach in moving object extraction is demonstrated through computer simulations. © Springer-Verlag Berlin Heidelberg 2007

    The SCUBA 8-mJy survey - I: Sub-millimetre maps, sources and number counts

    Get PDF
    We present maps, source lists, and number counts from the largest, unbiassed, extragalactic sub-mm survey so far undertaken with the SCUBA camera on the JCMT. Our maps cover 260 sq. arcmin, to a noise level S(850)=2.5 mJy/beam. We have reduced the data using both SURF, and our own pipeline which produces zero-footprint maps and noise images. The uncorrelated noise maps produced by the latter approach have allowed application of a maximum-likelihood method to measure the statistical significance of each peak, leading to properly quantified flux-density errors for all potential sources. We detect 19 sources with S/N > 4, 38 with S/N > 3.5, and 72 with S/N > 3. To assess completeness and the impact of source confusion we have applied our source extraction algorithm to a series of simulated images. The result is a new estimate of the sub-mm source counts in the flux-density range S(850)=5-15mJy, which we compare with other estimates, and with model predictions. Our estimate of the cumulative source count at S(850) > 8 mJy is 320 (+80,-100) per square degree. Assuming that the majority of sources have z > 1.5, the co-moving number density of high-z galaxies forming stars at a rate >1000 solar masses per year is 10^-5 per Mpc^3, with only a weak dependence on the precise redshift distribution. This number density corresponds to that of massive ellipticals with L > 3-4 L* at low redshift and is also the same as the co-moving number density of comparably massive, passively-evolving objects in the redshift band 1<z<2 inferred from recent surveys of extremely red objects. Thus the bright sub-mm sources can plausibly account for the formation of all present-day massive ellipticals. Improved z constraints, and a proper measurement of sub-mm clustering can refine or refute this picture.Comment: Minor revisions. 27 pages, 13 figures. Higher resolution versions of Figs 5,6,7 and 8 are available from the autho

    An Event-Based Neurobiological Recognition System with Orientation Detector for Objects in Multiple Orientations

    Get PDF
    A new multiple orientation event-based neurobiological recognition system is proposed by integrating recognition and tracking function in this paper, which is used for asynchronous address-event representation (AER) image sensors. The characteristic of this system has been enriched to recognize the objects in multiple orientations with only training samples moving in a single orientation. The system extracts multi-scale and multi-orientation line features inspired by models of the primate visual cortex. An orientation detector based on modified Gaussian blob tracking algorithm is introduced for object tracking and orientation detection. The orientation detector and feature extraction block work in simultaneous mode, without any increase in categorization time. An addresses lookup table (addresses LUT) is also presented to adjust the feature maps by addresses mapping and reordering, and they are categorized in the trained spiking neural network. This recognition system is evaluated with the MNIST dataset which have played important roles in the development of computer vision, and the accuracy is increase owing to the use of both ON and OFF events. AER data acquired by a DVS are also tested on the system, such as moving digits, pokers, and vehicles. The experimental results show that the proposed system can realize event-based multi-orientation recognition.The work presented in this paper makes a number of contributions to the event-based vision processing system for multi-orientation object recognition. It develops a new tracking-recognition architecture to feedforward categorization system and an address reorder approach to classify multi-orientation objects using event-based data. It provides a new way to recognize multiple orientation objects with only samples in single orientation

    Catadioptric panoramic stereovision for humanoid robots

    Get PDF
    This paper proposes a novel design of a reconfigurable humanoid robot head, based on biological likeness of human being so that the humanoid robot could agreeably interact with people in various everyday tasks. The proposed humanoid head has a modular and adaptive structural design and is equipped with three main components: frame, neck motion system and omnidirectional stereovision system modules. The omnidirectional stereovision system module being the last module, a motivating contribution with regard to other computer vision systems implemented in former humanoids, it opens new research possibilities for achieving human-like behaviour. A proposal for a real-time catadioptric stereovision system is presented, including stereo geometry for rectifying the system configuration and depth estimation. The methodology for an initial approach for visual servoing tasks is divided into two phases, first related to the robust detection of moving objects, their depth estimation and position calculation, and second the development of attention-based control strategies. Perception capabilities provided allow the extraction of 3D information from a wide range of visions from uncontrolled dynamic environments, and work results are illustrated through a number of experiments

    Dynamic visual attention model in image sequences

    Get PDF
    A new computational architecture of dynamic visual attention is introduced in this paper. Our approach defines a model for the generation of an active attention focus on a dynamic scene captured from a still or moving camera. The aim is to obtain the objects that keep the observer?s attention in accordance with a set of predefined features, including color, motion and shape. The solution proposed to the selective visual attention problem consists in decomposing the input images of an indefinite sequence of images into its moving objects, by defining which of these elements are of the user?s interest, and by keeping attention on those elements through time. Thus, the three tasks involved in the attention model are introduced. The Feature-Extraction task obtains those features (color, motion and shape features) necessary to perform object segmentation. The Attention-Capture task applies the criteria established by the user (values provided through parameters) to the extracted features and obtains the different parts of the objects of potential interest. Lastly, the Attention-Reinforcement task maintains attention on certain elements (or objects) of the image sequence that are of real interest

    Interaction between high-level and low-level image analysis for semantic video object extraction

    Get PDF
    Authors of articles published in EURASIP Journal on Advances in Signal Processing are the copyright holders of their articles and have granted to any third party, in advance and in perpetuity, the right to use, reproduce or disseminate the article, according to the SpringerOpen copyright and license agreement (http://www.springeropen.com/authors/license)

    Hierarchical morphological segmentation for image sequence coding

    Get PDF
    This paper deals with a hierarchical morphological segmentation algorithm for image sequence coding. Mathematical morphology is very attractive for this purpose because it efficiently deals with geometrical features such as size, shape, contrast, or connectivity that can be considered as segmentation-oriented features. The algorithm follows a top-down procedure. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, the segmentation quality is improved by introducing regions corresponding to more local information. The algorithm, considering sequences as being functions on a 3-D space, directly segments 3-D regions. A 3-D approach is used to get a segmentation that is stable in time and to directly solve the region correspondence problem. Each segmentation stage relies on four basic steps: simplification, marker extraction, decision, and quality estimation. The simplification removes information from the sequence to make it easier to segment. Morphological filters based on partial reconstruction are proven to be very efficient for this purpose, especially in the case of sequences. The marker extraction identifies the presence of homogeneous 3-D regions. It is based on constrained flat region labeling and morphological contrast extraction. The goal of the decision is to precisely locate the contours of regions detected by the marker extraction. This decision is performed by a modified watershed algorithm. Finally, the quality estimation concentrates on the coding residue, all the information about the 3-D regions that have not been properly segmented and therefore coded. The procedure allows the introduction of the texture and contour coding schemes within the segmentation algorithm. The coding residue is transmitted to the next segmentation stage to improve the segmentation and coding quality. Finally, segmentation and coding examples are presented to show the validity and interest of the coding approach.Peer ReviewedPostprint (published version
    corecore