An optical decoding technique is proposed for a spectral-amplitude-coding-optical code division multiple access, namely, the AND subtraction technique. The theory is being elaborated and experimental results have been done by comparing a double-weight code against the existing code, Hadamard. We have proved that the and subtraction technique gives better bit error rate performance than the conventional complementary subtraction technique against the received power level.
A process that involves the registration of two brain Magnetic Resonance Imaging (MRI) acquisitions is proposed for the subtraction between previous and current images at two different follow-up (FU) time points. Brain tumours can be non-cancerous (benign) or cancerous (malignant). Treatment choices for these conditions rely on the type of brain tumour as well as its size and location. Brain cancer is a fast-spreading tumour that must be treated in time. MRI is commonly used in the detection of early signs of abnormality in the brain area because it provides clear details. Abnormalities include the presence of cysts, haematomas or tumour cells. A sequence of images can be used to detect the progression of such abnormalities. A previous study on conventional (CONV) visual reading reported low accuracy and speed in the early detection of abnormalities, specifically in brain images. It can affect the proper diagnosis and treatment of the patient. A digital subtraction technique that involves two images acquired at two interval time points and their subtraction for the detection of the progression of abnormalities in the brain image was proposed in this study. MRI datasets of five patients, including a series of brain images, were retrieved retrospectively in this study. All methods were carried out using the MATLAB programming platform. ROI volume and diameter for both regions were recorded to analyse progression details, location, shape variations and size alteration of tumours. This study promotes the use of digital subtraction techniques on brain MRIs to track any abnormality and achieve early diagnosis and accuracy whilst reducing reading time. Thus, improving the diagnostic information for physicians can enhance the treatment plan for patients.
We present an efficient method for the fusion of medical captured images using different modalities that enhances the original images and combines the complementary information of the various modalities. The contourlet transform has mainly been employed as a fusion technique for images obtained from equal or different modalities. The limitation of directional information of dual-tree complex wavelet (DT-CWT) is rectified in dual-tree complex contourlet transform (DT-CCT) by incorporating directional filter banks (DFB) into the DT-CWT. The DT-CCT produces images with improved contours and textures, while the property of shift invariance is retained. To improve the fused image quality, we propose a new method for fusion rules based on principle component analysis (PCA) which depend on frequency component of DT-CCT coefficients (contourlet domain). For low frequency components, PCA method is adopted and for high frequency components, the salient features are picked up based on local energy. The final fusion image is obtained by directly applying inverse dual tree complex contourlet transform (IDT-CCT) to the fused low and high frequency components. The experimental results showed that the proposed method produces fixed image with extensive features on multimodality.
This is a prospective study with the objective of comparing Three Dimensional (3D) Dynamic Subtraction Contrast Enhanced Magnetic Resonance Angiography (3DDSCEMRA) with Conventional Catheter Arteriography (CCA) as the gold standard, in the diagnosis of peripheral occlusive disease. Three patients scheduled for CCA in this hospital in between September and October 2000 were included in this study. Patients underwent 3DDSCEMRA before proceeding to CCA on the same day. The 3DDSCEMRA reader was blinded to the CCA results. The results showed good correlation in iliofemoral segment and poor correlation in the infrapopliteal segment due to artifacts in 3DDSCEMRA images. 3DDSCEMRA is a new, non-invasive and promising technique in the diagnosis of peripheral occlusive disease.
Automating the detection of lesions in liver CT scans requires a high performance and robust solution. With CT-scan start to become the norm in emergency department, the need for a fast and efficient liver lesions detection method is arising. In this paper, we propose a fast and evolvable method to profile the features of pre-segmented healthy liver and use it to detect the presence of liver lesions in emergency scenario. Our preliminary experiment with the MICCAI 2007 grand challenge datasets shows promising results of a fast training time, ability to evolve the produced healthy liver profiles, and accurate detection of the liver lesions. Lastly, the future work directions are also presented.
Image retrieval at the semantic level mostly depends on image annotation or image classification. Image annotation performance largely depends on three issues: (1) automatic image feature extraction; (2) a semantic image concept modeling; (3) algorithm for semantic image annotation. To address first issue, multilevel features are extracted to construct the feature vector, which represents the contents of the image. To address second issue, domain-dependent concept hierarchy is constructed for interpretation of image semantic concepts. To address third issue, automatic multilevel code generation is proposed for image classification and multilevel image annotation. We make use of the existing image annotation to address second and third issues. Our experiments on a specific domain of X-ray images have given encouraging results.
An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics--such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient--are insufficient for achieving adequate results under different image deformations. Thus, new descriptor's similarity metrics based on normalized Eigenvector correlation and signal directional differences, which are robust under local variation of the image information, are proposed to establish an efficient feature matching technique. The method proposed in this study measures the dissimilarity in the signal frequency along the path between two features. Moreover, these dissimilarity values are accumulated in a 2D dissimilarity space, allowing accurate corresponding features to be extracted based on the cumulative space using a voting strategy. This method can be used in image registration applications, as it overcomes the limitations of the existing approaches. The output results demonstrate that the proposed technique outperforms the other methods when evaluated using a standard dataset, in terms of precision-recall and corner correspondence.
To segment an image using the random walks algorithm; users are often required to initialize the approximate locations of the objects and background in the image. Due to its segmenting model that is mainly reflected by the relationship among the neighborhood pixels and its boundary conditions, random walks algorithm has made itself sensitive to the inputs of the seeds. Instead of considering the relationship between the neighborhood pixels solely, an attempt has been made to modify the weighting function that accounts for the intensity changes between the neighborhood nodes. Local affiliation within the defined neighborhood region of the two nodes is taken into consideration by incorporating an extra penalty term into the weighting function. Besides that, to better segment images, particularly medical images with texture features, GLCM variance is incorporated into the weighting function through kernel density estimation (KDE). The probability density of each pixel belonging to the initialized seeds is estimated and integrated into the weighting function. To test the performance of the proposed weighting model, several medical images that mainly made up of 174-brain tumor images are experimented. These experiments establish that the proposed method produces better segmentation results than the original random walks.
Utilizing the multiple degrees of freedom offered by the data glove for each finger and the hand, a novel on-line signature verification system using the Singular Value Decomposition (SVD) numerical tool for signature classification and verification is presented. The proposed technique is based on the Singular Value Decomposition in finding r singular vectors sensing the maximal energy of glove data matrix A, called principal subspace, so the effective dimensionality of A can be reduced. Having modeled the data glove signature through its r-principal subspace, signature authentication is performed by finding the angles between the different subspaces. A demonstration of the data glove is presented as an effective high-bandwidth data entry device for signature verification. This SVD-based signature verification technique is tested and its performance is shown to be able to recognize forgery signatures with a false acceptance rate of less than 1.2%.