ABAdrian G. Bors

Adrian G. Bors

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Adrian G. Bors has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Kernel Bandwidth Estimation for Nonparametric Modeling

    by Adrian G. Bors, Nikolaos Nasios

    Kernel density estimation is a nonparametric procedure for probability density modeling, which has found several applications in various fields. The smoothness and modeling ability of the functional approximation are controlled by the kernel bandwidth. In this paper, we describe a Bayesian estimation method for finding the bandwidth from a given data set. The proposed bandwidth estimation method is applied in three different computational-intelligence methods that rely on kernel density estimation: 1) scale space; 2) mean shift; and 3) quantum clustering. The third method is a novel approach that relies on the principles of quantum mechanics. This method is based on the analogy between data samples and quantum particles and uses the Schrodinger potential as a cost function. The proposed methodology is used for blind-source separation of modulated signals and for terrain segmentation based on topography information.


  • 3-D Scene Modelling from Multiple Images using Radial Basis Function Networks

    by Matthew Grum, Adrian G. Bors

    A new approach for modelling multiple 3-D objects from a sparse set of images taken from various viewpoints is proposed in this paper. A voxel model of the scene is estimated from the given set of images using the space carving algorithm. An implicit radial basis function (RBF) network is used afterwards to model the voxel data. The multiorder function is chosen as the kernel function due to its property of enforcing smoothing constraints in the first three derivatives. A suitable initialization is proposed for the RBF parameters. Displacements of surface patches along epipolar lines are used to update the centers of basis functions leading to the modelling errors minimization. The proposed method is used to model a complex 3-D scene.

  • Robust Diffusion of Structural Flows for Volumetric Image Interpolation

    by Ashish Doshi, Adrian G. Bors

    In this paper we propose a set of algorithms that combine the anisotropic smoothing using the heat kernel with the outlier rejection capability of robust statistics. The proposed algorithms are applied on structural vector flows that model the internal shape variation in volumetric images. The 3D shapes are represented by sparse cross-sections along the main axis of the object. The dual directional block matching algorithm is used to initially extract the structural flows. This algorithm uses block matching between pixel blocks from consecutive images representing sparse cross-sections through a volume. Two flows are produced using forward and reverse matching along the main axis of the 3D object. After smoothing, the structural flows are used for slice interpolation. Experimental results provide a comparison among the given algorithms when used for digital 3D reconstruction of an incisor and of two human bones.


  • Selective Encryption of Human Skin in JPEG Images

    by J.M. Rodrigues, W. Puech, A.G. Bors

    In this study we propose a new approach for selective encryption in the Huffman coding of the discrete cosine transform (DCT) coefficients using the advanced encryption standard (AES). The objective is to partially encrypt the human face in an image or video sequence. This approach is based on the AES stream ciphering using variable length coding (VLC) of the Huffman's vector. The proposed scheme allows the decryption of a specific region of the image and results in a significant reduction in encrypting and decrypting processing time. It also provides a constant bit rate while maintaining the JPEG and MPEG bitstream compliance.


  • Robust Diffusion Kernels for Optical Flowsmoothing

    by Ashish Doshi, Adrian G. Bors

    This paper provides a comparison study among a set of novel algorithms that implement robust diffusion on optical flows. The proposed algorithms combine the anisotropic smoothing ability of the heat kernel and the outlier rejection mechanism of robust statistics algorithms. The diffusion kernel is considered Gaussian, where the covariance matrix is the local Hessian. This enables the kernel to detect significant transitions in the signal. In this study we show that diffusion does not eliminate outliers but rather spreads them around. We calculate the resulting bias induced by diffusing the outliers in their neighbourhood. On the other hand robust statistics operators reject the outliers from the diffusion process. Alpha-trimmed mean and median statistics are considered in combination with the diffusion processing. The proposed algorithms are applied for smoothing optical flow.

  • Scale Estimation for Kernel-Based Classification

    by Nikolaos Nasios, Adrian G. Bors

    This paper considers kernel density estimation for unsupervised data classification. A new methodology is proposed for finding the kernel scale using Bayesian statistics. K- nearest neighbourhoods are sampled by considering K as a random variable. The variance of each if-nearest neighbourhood is calculated and its probability density is fitted with a Gamma distribution. The estimated Gamma distribution is used to calculate the kernel scale. The proposed methodology is applied in three different machine learning algorithms: scale space, mean shift and quantum clustering. Quantum clustering employs the Shrodinger partial differential equation and uses the analogy between particles with their electro-magnetic field and data samples with their corresponding probability density function (pdf). The classification relies on the mode detection and the consequent data assignment in the resulting pdf. The proposed algorithm is applied for the classification of modulated signals and of topography extracted from radar images of terrain.

  • Watermarking mesh-based representations of 3-D objects using local moments

    by A.G. Bors

    A new methodology for fingerprinting and watermarking three-dimensional (3-D) graphical objects is proposed in this paper. The 3-D graphical objects are described by means of polygonal meshes. The information to be embedded is provided as a binary code. A watermarking methodology has two stages: embedding and detecting the information that has been embedded in the given media. The information is embedded by means of local geometrical perturbations while maintaining the local connectivity. A neighborhood localized measure is used for selecting appropriate vertices for watermarking. A study is undertaken in order to verify the suitability of this measure for selecting vertices from regions where geometrical perturbations are less perceptible. Two different watermarking algorithms, that do not require the original 3-D graphical object in the detection stage, are proposed. The two algorithms differ with respect to the type of constraint to be embedded in the local structure: by using parallel planes and bounding ellipsoids, respectively. The information capacity of various 3-D meshes is analyzed when using the proposed 3-D watermarking algorithms. The robustness of the 3-D watermarking algorithms is tested to noise perturbation and to object cropping.


  • Prediction and tracking of moving objects in image sequences

    by A.G. Bors, I. Pitas

    We employ a prediction model for moving object velocity and location estimation derived from Bayesian theory. The optical flow of a certain moving object depends on the history of its previous values. A joint optical flow estimation and moving object segmentation algorithm is used for the initialization of the tracking algorithm. The segmentation of the moving objects is determined by appropriately classifying the unlabeled and the occluding regions. Segmentation and optical flow tracking is used for predicting future frames.