Photometric stereo involves estimating the surface normals of an object given appearance variations in multiple images taken under different lighting conditions. Most conventional algorithms for non-Lambertian photometric stereo can be partitioned into two categories. The first category is built upon stable outlier rejection techniques while assuming a dense Lambertian structure for the inliers, and […]
Archives for May 2015
SPARSE BAYESIAN REGRESSION BASED PHOTOMETRIC STEREO FOR GENERAL DIFFUSE SURFACES
Photometric stereo involves estimating the surface normals of an object given appearance variations in multiple images taken under different lighting conditions. Most conventional algorithms for non-Lambertian photometric stereo can be partitioned into two categories. The first category is built upon stable outlier rejection techniques while assuming a dense Lambertian structure for the inliers, and thus […]
FDM ALGORITHM BASED SECURE MINING OF ASSOCIATION RULES IN HORIZONTALLY DISTRIBUTED DATABASES
Our protocol, like theirs, is based on the Fast Distributed Mining (FDM) algorithm of Cheung et al., which is an unsecured distributed version of the Apriori algorithm. The main ingredients in our protocol each of the interacting players hold, and another that tests the inclusion of an element held by one player in a subset […]
HORIZONTALLY DISTRIBUTED DATABASES USING SECURE MINING OF ASSOCIATION RULE
There are several sites (or players) that hold homogeneous databases, i.e., databases that share the same schema but hold information on different entities. The goal is to find all association rules with support at least s and confidence at least c , for some given minimal support size s and confidence level c , that […]
PHOTOMETRIC STEREO FOR GENERAL DIFFUSE SURFACES USING SPARSE BAYESIAN REGRESSION
Photometric stereo algorithm used for stably and accurately estimating the surface normals of a scene in the presence of various non-Lambertian effects. Most conventional algorithms for non-Lambertian photometric stereo can be partitioned into two categories. The first category is built upon stable outlier rejection techniques while assuming a dense Lambertian structure for the inliers, and […]
A GENERALISED APPROXIMATE NEAREST NEIGHBOUR FIELD (ANNF) COMPUTATION FRAMEWORK BETWEEN SOURCE AND TARGET IMAGE
Approximate Nearest Neighbour Field (ANNF) computations are a recent development in the image processing community which have gained wide popularity, especially in the graphics community, due to their fast computation times. In this abstract, we propose FeatureMatch, a generalised approximate nearest-neighbour field (ANNF) computation framework, between a source and target image. The proposed algorithm can […]
SHARING VISUAL SECRETS IN SINGLE IMAGE RANDOM DOT STEREOGRAMS BASED ON BVCS
In this abstract, a binocular VCS (BVCS), called the ( 2 , n ) -BVCS, and an encryption algorithm are proposed to hide the shared pixels in the single image random dot stereograms (SIRDSs). Because the SIRDSs have the same 2D appearance as the conventional shares of a VCS, this paper tries to use SIRDSs […]
BVCS: SHARING VISUAL SECRETS IN SINGLE IMAGE RANDOM DOT STEREOGRAMS
Visual cryptography (VC) is a technique that encrypts a secret image into n shares, with each participant holding one share; Conventional VCSs suffer from a transmission risk problem because the noise-like shares will raise the suspicion of attackers and the attackers might intercept the transmission. Previous research has involved in hiding shared content in halftone […]
AS-PROJECTIVE-AS-POSSIBLE WARPS WITH MOVING DIRECT LINEAR TRANSFORMATION
Image stitching or photo stitching is the process of combining multiple photographic images with overlapping fields of view to produce a segmented panorama or high-resolution image. Commonly performed through the use of computer software, most approaches to image stitching require nearly exact overlaps between images and identical exposures to produce seamless results. We investigate projective […]