SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Eldar Yonina C.) "

Sökning: WFRF:(Eldar Yonina C.)

  • Resultat 1-4 av 4
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Björnson, Emil, Professor, 1983-, et al. (författare)
  • Twenty-Five Years of Signal Processing Advances for Multiantenna Communications: From theory to mainstream technology
  • 2023
  • Ingår i: IEEE signal processing magazine (Print). - : Institute of Electrical and Electronics Engineers (IEEE). - 1053-5888 .- 1558-0792. ; 40:4, s. 107-117
  • Tidskriftsartikel (refereegranskat)abstract
    • Wireless communication technology has progressed dramatically over the past 25 years, in terms of societal adoption as well as technical sophistication. In 1998, mobile phones were still in the process of becoming compact and affordable devices that could be widely utilized in both developed and developing countries. There were “only” 300 million mobile subscribers in the world [1] . Cellular networks were among the first privatized telecommunication markets, and competition turned the devices into fashion accessories with attractive designs that could be individualized. The service was circumscribed to telephony and text messaging, but it was groundbreaking in that, for the first time, telecommunication was between people rather than locations.
  •  
2.
  • Das, Sandipan, et al. (författare)
  • Neural Greedy Pursuit for Feature Selection
  • 2022
  • Ingår i: 2022 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN). - : Institute of Electrical and Electronics Engineers (IEEE).
  • Konferensbidrag (refereegranskat)abstract
    • We propose a greedy algorithm to select N important features among P input features for a non-linear prediction problem. The features are selected one by one sequentially, in an iterative loss minimization procedure. We use neural networks as predictors in the algorithm to compute the loss and hence, we refer to our method as neural greedy pursuit (NGP). NGP is efficient in selecting N features when N << P, and it provides a notion of feature importance in a descending order following the sequential selection procedure. We experimentally show that NGP provides better performance than several feature selection methods such as DeepLIFT and Drop-one-out loss. In addition, we experimentally show a phase transition behavior in which perfect selection of all N features without false positives is possible when the training data size exceeds a threshold.
  •  
3.
  • del Aguila Pla, Pol, 1990- (författare)
  • Inverse problems in signal processing : Functional optimization, parameter estimation and machine learning
  • 2019
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Inverse problems arise in any scientific endeavor. Indeed, it is seldom the case that our senses or basic instruments, i.e., the data, provide the answer we seek. It is only by using our understanding of how the world has generated the data, i.e., a model, that we can hope to infer what the data imply. Solving an inverse problem is, simply put, using a model to retrieve the information we seek from the data.In signal processing, systems are engineered to generate, process, or transmit signals, i.e., indexed data, in order to achieve some goal. The goal of a specific system could be to use an observed signal and its model to solve an inverse problem. However, the goal could also be to generate a signal so that it reveals a parameter to investigation by inverse problems. Inverse problems and signal processing overlap substantially, and rely on the same set of concepts and tools. This thesis lies at the intersection between them, and presents results in modeling, optimization, statistics, machine learning, biomedical imaging and automatic control.The novel scientific content of this thesis is contained in its seven composing publications, which are reproduced in Part II. In five of these, which are mostly motivated by a biomedical imaging application, a set of related optimization and machine learning approaches to source localization under diffusion and convolutional coding models are presented. These are included in Publications A, B, E, F and G, which also include contributions to the modeling and simulation of a specific family of image-based immunoassays. Publication C presents the analysis of a system for clock synchronization between two nodes connected by a channel, which is a problem of utmost relevance in automatic control. The system exploits a specific node design to generate a signal that enables the estimation of the synchronization parameters. In the analysis, substantial contributions to the identifiability of sawtooth signal models under different conditions are made. Finally, Publication D brings to light and proves results that have been largely overlooked by the signal processing community and characterize the information that quantized linear models contain about their location and scale parameters.
  •  
4.
  • Ohlsson, Henrik, et al. (författare)
  • Compressive Shift Retrieval
  • 2014
  • Ingår i: IEEE Transactions on Signal Processing. - : Institute of Electrical and Electronics Engineers (IEEE). - 1053-587X .- 1941-0476. ; , s. 4105-4113
  • Tidskriftsartikel (refereegranskat)abstract
    • The classical shift retrieval problem considers two signals in vector form that are related by a shift. This problem is of great importance in many applications and is typically solved by maximizing the cross-correlation between the two signals. Inspired by compressive sensing, in this paper, we seek to estimate the shift directly from compressed signals. We show that under certain conditions, the shift can be recovered using fewer samples and less computation compared to the classical setup. We also illustrate the concept of superresolution for shift retrieval. Of particular interest is shift estimation from Fourier coefficients. We show that under rather mild conditions only one Fourier coefficient suffices to recover the true shift.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-4 av 4

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy