All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

8 648 (0,177s)

Result

Blind Deconvolution Using Alternating Maximum a Posteriori Estimation with Heavy-Tailed Priors

We presented a method on blur estimation from a single image and sharp image recovery using ultra sparse gradient priors and augmented Lagrangian method....

JD - Využití počítačů, robotika a její aplikace

  • 2013
  • D
Result

Recent Advances in Image Restoration

Recent advances in the field of image blind deconvolution have been presented.

JD - Využití počítačů, robotika a její aplikace

  • 2013
  • O
Result

Motion Blur Prior

We have proposed a novel methodology for generating priors that favor motion blur. Priors play an important role of regularizers in image deblurring algorithms. Image priors are frequently studied and many forms were propos...

Computer hardware and architecture

  • 2020
  • D
  • Link
Result

Approximating Clustered Millimeter Wave Vehicular Channels by Sparse Subband Fitting

, few attempts of low-complexity approximation of such channels exist. Prior results structures and are efficiently approximated as sparse channels. We thereby render sparse tapped delay line model fits possible. In this co...

Communication engineering and systems

  • 2018
  • D
Result

Weighted decomposition in high-performance lattice-Boltzmann simulations: are some lattice sites more equal than others?

-Boltzmann simulations of realistic sparse problems to the exascale. Here we analyse-Boltzmann simulation environment, when applied to sparse domains. Both techniques are applied prior to partitioning our domain using a thi...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2015
  • D
  • Link
Result

Assessments of Implementation of the Minimum Degree Ordering Algorithms

The minimum degree ordering is one of the most widely used algorithms to preorder a symmetric sparse matrix prior to numerical factorization. There are number of variants which try to reduce the computational complexity of the origi...

BA - Obecná matematika

  • 2009
  • Jx
Result

Fast Bayesian JPEG Decompression and Denoising With Tight Frame Priors

a posteriori probability framework by iterative optimization algorithms. Prior knowledge about an image is usually describednby the l1 norm of its sparse domain representation. For many problems, if the sparse domain forms...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
  • Jimp
  • Link
Result

Human activity recognition on raw sensor data via sparse approximation

achievingup to 99.60% recognition accuracy even without any prior data processing...

IN - Informatika

  • 2013
  • D
  • Link
Result

Identification of gene pathways implicated in Alzheimer's disease using longitudinal imaging phenotypes with sparse regression

of patients with Alzheimer's disease (AD). Our method, known as pathways sparse reduced pathways using prior knowledge of gene-gene interactions. Pathways are ranked in order......

EB - Genetika a molekulární biologie

  • 2012
  • Jx
  • Link
Result

Implementation of Sparse Matrix Storage Schemes for Direct Solution Methods

This article describes the properties of two sparse matrix storage schemes and their actual implementaion in a sparse direct solver.

BA - Obecná matematika

  • 2008
  • O
  • 1 - 10 out of 8 648