|
Search the dblp DataBase
Adrian Burian:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Adrian Burian, Perttu Salmela, Jarmo Takala
Complex Fixed-Point Matrix Inversion Using Transport Triggered Architecture. [Citation Graph (0, 0)][DBLP] ASAP, 2005, pp:107-112 [Conf]
- Adrian Burian, Markku Vehvilainen, Mejdi Trimeche, Jukka Saarinen
Document image binarization using the camera device in mobile phones. [Citation Graph (0, 0)][DBLP] ICIP (2), 2005, pp:546-548 [Conf]
- Adrian Burian, Jarmo Takala
A recurrent neural network for 1-D phase retrieval. [Citation Graph (0, 0)][DBLP] ISCAS (5), 2003, pp:729-732 [Conf]
- Adrian Burian, Jarmo Takala, Marina Dana Topa
Parallel iterations for recursive median filter. [Citation Graph (0, 0)][DBLP] ISCAS (4), 2003, pp:488-491 [Conf]
- Mikko Ylinen, Adrian Burian, Jarmo Takala
Direct versus iterative methods for fixed-point implementation of matrix inversion. [Citation Graph (0, 0)][DBLP] ISCAS (3), 2004, pp:225-228 [Conf]
- Adrian Burian, Jarmo Takala
VLSI-efficient implementation of full adder-based median filter. [Citation Graph (0, 0)][DBLP] ISCAS (2), 2004, pp:817-820 [Conf]
- Adrian Burian, Jukka Saarinen, Pauli Kuosmanen
Neural Networks for Image Restoration from the Magnitude of Its Fourier Transform. [Citation Graph (0, 0)][DBLP] IWANN (2), 2001, pp:311-318 [Conf]
- Adrian Burian, Pauli Kuosmanen
Recursive median filtering with partial replaces. [Citation Graph (0, 0)][DBLP] NSIP, 1999, pp:61-64 [Conf]
- Adrian Burian, Jukka Saarinen, Pauli Kuosmanen
A discrete-time recurrent neural network for image restoration from its Fourier spectrum magnitudes. [Citation Graph (0, 0)][DBLP] Int. J. Comput. Syst. Signal, 2002, v:3, n:1, pp:29-39 [Journal]
- Adrian Burian, Pauli Kuosmanen, Corneliu Rusu
1-D direct phase retrieval. [Citation Graph (0, 0)][DBLP] Signal Processing, 2002, v:82, n:8, pp:1059-1066 [Journal]
Complex-valued QR decomposition implementation for MIMO receivers. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|