This paper introduces an affine invariant of trapezia, and the explicit constraint equation between the intrinsic matrix of a camera and the similarity invariants of a trapezium are established using the affine invariant. By this constraint, the inner parameters, motion parameters of the cameras and the similarity invariants of trapezia can be linearly determined using some prior knowledge on the cameras or the trapezia. The proposed algorithms have wide applicability since parallel lines are not rare in many scenes. Experimental results validate the proposed approaches. This work presents a unifying framework based on the parallelism constraint, and the previous methods based on the parallelograms or the parallelepipeds can be integrated into this framework.
Key words: invariant parallelism constraint camera calibration 3D reconstruction
This program compress and recostruct using wavelets. We can select level of decomposition(here maximum 4 levels are given) of images using selected wavelet.
For eg:-wavelets can be haar, db1, db2,dmey...............
Decomposition can be viewed in figure.
(Please note that select 256X256 image for better result.)
Then compression can performed,
PERFL2 give compression score.
Then reconstruction can be performed.
Each decompsition we can choose different threshold values.
For each threshold value we can calculate mse,psnr,pq(picture quality),
bit ratio etc. To get pq install pqs function .
IEEE Std 1180-1990. IEEE Standard Specifications for the Implementations of 8x8 Inverse Discrete Cosine Transform, specifies the numerical characteristics of the 8x8 inverse discrete cosine transform (IDCT) for use in visual telephony and similar applications where the 8x8 IDCT results are used in a reconstruction loop. The specifications ensure the compatibility between different implementations of the IDCT.
State_space_reconstruction_parameters_in_the_analysis_of_chaotic_time_series_-_the_role_of_the_time_window_length.
It is used for reconstruction of state space in chaotic time series, and also how to determine time window.
The PMSM FOC is made of several C modules, compatible with the free-of-charge IAR
EWARM KickStart edition toolchain version 4.42. It is used to quickly evaluate both the MCU
and the available tools. In addition, when used together with the STM32F103xx motor
control starter kit (STM3210B-MCKIT) and PM motor, a motor can be made to run in a very
short time. It also eliminates the need for time-consuming development of FOC and speed
regulation algorithms by providing ready-to-use functions that let the user concentrate on
the application layer. Moreover, it is possible to get rid of any speed sensor thanks to the
sensorless algorithm for rotor position reconstruction.
This directory includes matlab interface of the curvelet transform
using usfft.
Basic functions
fdct_usfft.m -- forward curvelet transform
afdct_usfft.m -- adjoint curvelet transform
ifdct_usfft.m -- inverse curvelet transform
fdct_usfft_param.m -- returns the location of each curvelet in phase-space
Useful tools
fdct_usfft_dispcoef.m -- returns a matrix contains all curvelet coefficients
fdct_usfft_pos2idx.m -- for fixed scale and fixed direction, returns
the curvelet which is closest to a certain point on the image
Demos
fdct_usfft_demo_basic.m -- display the shape of a curvelet
fdct_usfft_demo_recon.m -- partial reconstruction using curvelet
fdct_usfft_demo_disp.m -- display all the curvelet coefficients of an image
fdct_usfft_demo_denoise.m -- image denoising using curvelet
MATLAB Code for Optimal Quincunx Filter
Bank Design
Yi Chen
July 17, 2006
This file introduces the MATLAB code that implements the two algorithms (i.e., Algorithms
1 and 2 in [1], or Algorithms 4.1 and 4.2 in [2]) used for the construction of
quincunx filter banks with perfect reconstruction, linear phase, high coding gain, certain
vanishing moments properties, and good frequency selectivity. The code can be
used to design quincunx filter banks with two, three, or four lifting steps. The SeDuMi
Matlab toolbox [3] is used to solve the second-order cone programming subproblems
in the two algorithms, and must be installed in order for this code to work.
