Jan Flusser

Jan Flusser

Auto-generated profile, based on publicly available information

Jan Flusser

The Czech Academy of Sciences

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 November 2006 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
JFJan Flusser
Jan Flusser
TSTom Suk
Tom Suk
In this paper, a new set of moment invariants with respect to rotation, translation, and scaling suitable for recognition of objects having N-fold rotation symmetry are presented. Moment invariants described earlier cannot be used for this purpose because most moments of symmetric objects vanish. The invariants proposed here are based on complex moments. Their independence and completeness are proven theoretically and their performance is demonstrated by experiments

1 March 2015 in Pattern Recognition Letters
Verified
Journal Article
Closed access
BYBo Yang
Bo Yang
JFJan Flusser
Jan Flusser
TSTomáš Suk
Tomáš Suk

1 January 2021 in Digital Signal Processing
Verified
Journal Article
Closed access
MYM. Yamni
M. Yamni
HKH. Karmouni
H. Karmouni
MSM. Sayyouri
M. Sayyouri
HQH. Qjidaa
H. Qjidaa
JFJ. Flusser
J. Flusser

1 April 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
SASadiq H. Abdulhussain
Sadiq H. Abdulhussain
BMBasheera M. Mahmmod
Basheera M. Mahmmod
JFJan Flusser
Jan Flusser
KAKhaled AlUtaibi
Khaled AlUtaibi
Sadiq SaitSadiq Sait
Sadiq Sait
In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally that the speed up of the proposed method compared with traditional approaches approximately reaches up to 20 times depending on the block parameters.

1 August 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
SASadiq H. Abdulhussain
Sadiq H. Abdulhussain
BMBasheera M. Mahmmod
Basheera M. Mahmmod
AAAmer AlGhadhban
Amer AlGhadhban
JFJan Flusser
Jan Flusser
Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face image datasets, ORL and FEI. Different state-of-the-art face recognition methods were compared with the proposed method in order to evaluate its accuracy. We demonstrate that the proposed method achieves the highest recognition rate in different considered scenarios. Based on the obtained results, it can be seen that the proposed method is robust against noise and significantly outperforms previous approaches in terms of speed.

1 November 2015 in Pattern Recognition
Verified
Journal Article
Closed access
TSTomáš Suk
Tomáš Suk
JFJan Flusser
Jan Flusser
JBJiří Boldyš
Jiří Boldyš