The Experts below are selected from a list of 78 Experts worldwide ranked by ideXlab platform

J. Wawrzynek - One of the best experts on this subject based on the ideXlab platform.

  • Quality based compute-resource allocation in real-time signal processing
    2003 IEEE International Conference on Acoustics Speech and Signal Processing 2003. Proceedings. (ICASSP '03)., 2003
    Co-Authors: J. Wawrzynek
    Abstract:

    We present a novel method for controlling the complexity of real-time signal processing Computational tasks, in order to make sure that a total quality metric for all the signal processing tasks is maximized. The method makes decisions about how much compute power is allocated to each task through past observations of the input and output data of each task. We present preliminary results from filtering applications that demonstrate the ability of the system to maximize the total quality of a large number of tasks under a real-time Computational Constraint.

  • Compute-resource allocation for motion estimation in real-time video compression
    The Thrity-Seventh Asilomar Conference on Signals Systems & Computers 2003, 2003
    Co-Authors: J. Wawrzynek
    Abstract:

    We present a novel method for allocating Computational resources in motion estimation for real time video compression that attempts to minimize prediction error over the whole image. The method makes decisions about how much compute power is allocated to motion estimation for each particular block based upon past observations of the input and output data of each task. We present results that demonstrate the ability of our method to improve the resulting quality of encoded video under a real-time Computational Constraint.

P. Agathoklis - One of the best experts on this subject based on the ideXlab platform.

  • Performance and Computational complexity optimization in configurable hybrid video coding system
    IEEE Transactions on Circuits and Systems for Video Technology, 2006
    Co-Authors: D.n. Kwon, P.f. Driessen, A. Basso, P. Agathoklis
    Abstract:

    In this paper, a configurable coding scheme is proposed and analyzed with respect to Computational complexity and distortion (C-D). The major coding modules are analyzed in terms of Computational C-D in the H.263 video coding framework. Based on the analyzed data, operational C-D curves are obtained through an exhaustive search, and the Lagrangian multiplier method. The proposed scheme satisfies the given Computational Constraint independently of the changing properties of the input video sequence. A technique to adaptively control the optimal encoding mode is also proposed. The performance of the proposed technique is compared with a fixed scheme where parameters are determined by off-line processing. Experimental results demonstrate that the adaptive approach leads to computation reductions of up to 19%, which are obtained with test video sequences and compared to the fixed, while the peak signal-to-noise ratio degradations of the reconstructed video are less than 0.05 dB.

M.d. Adams - One of the best experts on this subject based on the ideXlab platform.

  • Entropy based feature selection scheme for real time simultaneous localization and map building
    2005 IEEE RSJ International Conference on Intelligent Robots and Systems, 2005
    Co-Authors: Sen Zhang, M.d. Adams
    Abstract:

    We propose a novel entropy-based method for feature selection in order to reduce the Computational burden for real time simultaneous localization and map building (SLAM) for mobile robot navigation. Our approach is based on information (entropy) theory together with a data association method to initialize new features into the map, match measurements to the map features, and remove out-of-date features. The selected features are optimum in the sense that fusion of measurements from those features with existing information would yield the most entropy reduction in estimating the robot location and the map features' locations. Our method has the advantage of selecting a suitable number of features by considering the Computational Constraint in real time implementations. Simulation results show that the proposed entropy based feature selection strategy is effective in dealing with the map scaling problem in SLAM.

D.n. Kwon - One of the best experts on this subject based on the ideXlab platform.

  • Performance and Computational complexity optimization in configurable hybrid video coding system
    IEEE Transactions on Circuits and Systems for Video Technology, 2006
    Co-Authors: D.n. Kwon, P.f. Driessen, A. Basso, P. Agathoklis
    Abstract:

    In this paper, a configurable coding scheme is proposed and analyzed with respect to Computational complexity and distortion (C-D). The major coding modules are analyzed in terms of Computational C-D in the H.263 video coding framework. Based on the analyzed data, operational C-D curves are obtained through an exhaustive search, and the Lagrangian multiplier method. The proposed scheme satisfies the given Computational Constraint independently of the changing properties of the input video sequence. A technique to adaptively control the optimal encoding mode is also proposed. The performance of the proposed technique is compared with a fixed scheme where parameters are determined by off-line processing. Experimental results demonstrate that the adaptive approach leads to computation reductions of up to 19%, which are obtained with test video sequences and compared to the fixed, while the peak signal-to-noise ratio degradations of the reconstructed video are less than 0.05 dB.

Todd Wareham - One of the best experts on this subject based on the ideXlab platform.

  • Rational analysis, intractability, and the prospects of ‘as if’-explanations
    Synthese, 2018
    Co-Authors: Iris Rooij, Cory D. Wright, Johan Kwisthout, Todd Wareham
    Abstract:

    The plausibility of so-called ‘rational explanations’ in cognitive science is often contested on the grounds of Computational intractability. Some have argued that intractability is a pseudoproblem, however, because cognizers do not actually perform the rational calculations posited by rational models; rather, they only behave as if they do. Whether or not the problem of intractability is dissolved by this gambit critically depends, inter alia, on the semantics of the ‘as if’ connective. First, this paper examines the five most sensible explications in the literature, and concludes that none of them actually circumvents the problem. Hence, rational ‘as if’ explanations must obey the minimal Computational Constraint of tractability. Second, this paper describes how rational explanations could satisfy the tractability Constraint. Our approach suggests a Computationally unproblematic interpretation of ‘as if’ that is compatible with the original conception of rational analysis.

  • Rational analysis, intractability, and the prospects of 'as if'-explanations
    Synthese, 2014
    Co-Authors: Iris Rooij, Johan Kwisthout, Crispin Wright, Todd Wareham
    Abstract:

    The plausibility of so-called ‘rational explanations’ in cognitive science is often contested on the grounds of Computational intractability. Some have argued that intractability is a pseudoproblem, however, because cognizers do not actually perform the rational calculations posited by rational models; rather, they only behave as if they do. Whether or not the problem of intractability is dissolved by this gambit critically depends, inter alia, on the semantics of the ‘as if’ connective. First, this paper examines the five most sensible explications in the literature, and concludes that none of them actually circumvents the problem. Hence, rational ‘as if’ explanations must obey the minimal Computational Constraint of tractability. Second, this paper describes how rational explanations could satisfy the tractability Constraint. Our approach suggests a Computationally unproblematic interpretation of ‘as if’ that is compatible with the original conception of rational analysis.