ABSTRACT The Biopolis takes a radical approach to the long term preservation of digital user content. The system will allow Biopolis enriched User Content to be distributed and redistributed through a network of commercial and... more
ABSTRACT The Biopolis takes a radical approach to the long term preservation of digital user content. The system will allow Biopolis enriched User Content to be distributed and redistributed through a network of commercial and non-commercial file (Preservation Services), while ensuring a lasting relationship, between the holder and the owner of the intellectual content. Based on web and mobile technologies and using a cloud based storage system will allow the end user to maintain the time and geolocation parameter on its digital content, providing new advanced business models for e-business end users.
... Technical University of Crete, Greece Luc van Gool, Eidgenoessische Technische Hochschule Zuerich, Switzerland Mak Nixon, University of ... Austria Matthew Addis, IT Innovation Labs, United Kingdom Emmanuel Sardis, Aegean... more
... Technical University of Crete, Greece Luc van Gool, Eidgenoessische Technische Hochschule Zuerich, Switzerland Mak Nixon, University of ... Austria Matthew Addis, IT Innovation Labs, United Kingdom Emmanuel Sardis, Aegean University, Greece Ignacio Soler, ATOS ...
Research Interests:
... 210 772 1511 sardis@aegean.gr Theodora Varvarigou National Technical University of Athens 9, Heroon Polytechniou 157 73 Zografou, Athens Tel: + 30 210 772 2484 dora@telecom.ntua.gr ABSTRACT In this paper, we propose ...
Research Interests:
Research Interests:
Research Interests:
A wavelet-based steganographic method is proposed for robust message hiding. The message is embedded into the most significant wavelet coefficients of a cover image to provide invisibility and resistance against lossy transmission,... more
A wavelet-based steganographic method is proposed for robust message hiding. The message is embedded into the most significant wavelet coefficients of a cover image to provide invisibility and resistance against lossy transmission, compression or other distortion. The architecture consists of three modules. In the first module, the initial message is enciphered by an encryption algorithm. The enciphered message is imprinted
Research Interests:
Research Interests:
... 0 2002 IEEE SMC TAlH3 Page 2. Im rint Msssags-lmagcN(OU-Messagk N ( fi ) + - ebi T l Stereoscopic Pairs-Video Objects Module Selection Estimation '? Extraction Module Video6batN QSWTs Detection Module L Module QSWTs Detection... more
... 0 2002 IEEE SMC TAlH3 Page 2. Im rint Msssags-lmagcN(OU-Messagk N ( fi ) + - ebi T l Stereoscopic Pairs-Video Objects Module Selection Estimation '? Extraction Module Video6batN QSWTs Detection Module L Module QSWTs Detection Module L ...
Research Interests:
Research Interests: Pattern Recognition, Performance, Watermarking, Video Compression, Image segmentation, and 16 moreParameter estimation, Video Object, Distortion, DWT, Frequency, Feature Extraction, Image recognition, Lossy Compression, Embedding, Discrete wavelet transform, Embedded Computing, Digital System Testing, Discrete Wavelet Transforms, Random Sequences, High energy, and Embedded Zerotree Wavelet
A modified snake-based scheme is presented for unsupervised stereoscopic semantic segmentation. The scheme utilizes the provided depth information and the power of active contours to adjust to object edges. Each stereo pair is analyzed... more
A modified snake-based scheme is presented for unsupervised stereoscopic semantic segmentation. The scheme utilizes the provided depth information and the power of active contours to adjust to object edges. Each stereo pair is analyzed and a depth map is constructed. Then a multiresolution implementation of the recursive shortest spanning tree (RSST) segmentation algorithm is applied to the depth field to
Research Interests:
A multiscale video content organization scheme is proposed for fast browsing and efficient transmission of video sequences. The scheme leads to construction of a five-layer tree structure. At layer 0 the root-node is located, connected to... more
A multiscale video content organization scheme is proposed for fast browsing and efficient transmission of video sequences. The scheme leads to construction of a five-layer tree structure. At layer 0 the root-node is located, connected to all nodes of layer 1, each corresponding to a class of shots. Then every class of shot is expanded at layer 2. The nodes of this layer represent shots. At the next resolution level (layer 3) nodes represent key-frames of shots. Finally at layer 4 the full resolution level is reached, where nodes correspond to frames of the sequence. Each node contains a viewing element and we focus on the extraction of these elements for layers 1, 2 and 3. Viewing elements of layers 1 and 3 are optimally extracted by minimizing a cross correlation criterion. Additionally viewing elements of layer 2 are selected according to a correlation measure between the mean vector of a shot and each of the frames within this shot. The resulting tree-structure enables a user to quickly and easily detect content of interest, by selecting the viewing element of his/her liking. Experimental results on real-life video sequences indicate the promising performance of the proposed scheme
Research Interests:
An efficient system for unsupervised structuring of stereoscopic sequences is presented in this paper, which generates links between similar VOPs of different shots. Particularly after shot cut detection, for each shot, a fast,... more
An efficient system for unsupervised structuring of stereoscopic sequences is presented in this paper, which generates links between similar VOPs of different shots. Particularly after shot cut detection, for each shot, a fast, unsupervised VOP detection and tracking algorithm is applied. Then for each of the foreground VOPs of a frame, a feature vector is constructed using low level features
Research Interests:
In this paper an efficient scheme for automatic organization of stereo-captured video sequences is presented, which exploits foreground VOP information of frames. More specifically after shot cut detection, for each frame of a shot, a... more
In this paper an efficient scheme for automatic organization of stereo-captured video sequences is presented, which exploits foreground VOP information of frames. More specifically after shot cut detection, for each frame of a shot, a fast, unsupervised foreground VOP extraction algorithm is applied, based on depth information and normalized Motion Geometric Spaces. Then for each frame, a feature vector is
Research Interests:
The efficiency of a content-based image retrieval (CBIR) sys- tem depends on the efficiency of the image visual content repre- sentation Usually, the extracted descriptors are organized in a bi- nary framework, which, apart from the fact... more
The efficiency of a content-based image retrieval (CBIR) sys- tem depends on the efficiency of the image visual content repre- sentation Usually, the extracted descriptors are organized in a bi- nary framework, which, apart from the fact that it is sensitive to noise, it cannot also provide a physical interpretation of the image content. This problem is faced in this
Research Interests: Information Retrieval, Data Mining, Image segmentation, Content based image retrieval, Image Retrieval, and 12 moreNoise reduction, Video Object, Indexing, Shape, Depth Map, Spatial resolution, Image Database, Estimation Method, User Interaction, Histograms, Application Software, and Gradient vector flow
... The key algorithm, which is applied on the stereo pair of images and performs the segmentation, is a powerful low-complexity multiresolution implementation of the RSST algorithm. ... Then the M-RSST algorithm [9] performs color and... more
... The key algorithm, which is applied on the stereo pair of images and performs the segmentation, is a powerful low-complexity multiresolution implementation of the RSST algorithm. ... Then the M-RSST algorithm [9] performs color and depth segmentation. ...
Research Interests:
In this paper two efficient unsupervised video object seg- mentation approaches are proposed and then extensively com- pared in terms of computational cost and quality of segmentation results. Both methods exploit depth information. In... more
In this paper two efficient unsupervised video object seg- mentation approaches are proposed and then extensively com- pared in terms of computational cost and quality of segmentation results. Both methods exploit depth information. In particular a depth segments map is initially estimated by analyzing a stereo- scopic pair of frames and applying a segmentation algorithm. In the first a "Constrained Fusion of Color Segments" (CFCS) in which video object segmentation is performed by fusion of color segments according to a depth similarity criterion. In the second approach firstly a dilated version of the boundary of each depth segment is produced and several feature points are estimated on this dilated boundary. Then for each initial point a normalized Motion Geometric Space (MGS) is created which determines the only allowed way the point can move onto. In the last step each initial point moves onto its MGS and stops according to a weighted stop-function. Experiments on real life stereoscopic se- quences are presented to exhibit the speed and accuracy of the proposed schemes.
Research Interests:
In this paper efficient performance generalization of neural network classifiers is accomplished, for unsupervised video object segmentation in videoconference/videophone sequences. Each time conditions change, a retraining phase is... more
In this paper efficient performance generalization of neural network classifiers is accomplished, for unsupervised video object segmentation in videoconference/videophone sequences. Each time conditions change, a retraining phase is activated and the neural network classifier is adapted to the new environment. During retraining both the former and current knowledge are utilized so that good network generalization is achieved. The retraining algorithm results in the minimization of a convex function subject to linear constraints, leading to very fast network weight adaptation. Current knowledge is unsupervisedly extracted using a face-body detector, based on Gaussian p.d.f models. A binary template matching technique is also incorporated, which imposes shape constraints to candidate face regions. Finally the retrained network performs video object segmentation to the new environment. Several experiments on real sequences indicate the promising performance of the proposed adaptive neural network as efficient video object segmentation tool.
Research Interests:
Research Interests:
Page 1. Signal Processing 82 (2002) 545 www.elsevier.com/locate/sigpro Erratum Erratum to: “A fuzzy video content representation for video summarization and content-based retrieval” [Signal Processing 80(6) (2000) 1049–1067] ...