[null, null, null, null, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://1.bp.blogspot.com/_etngz9u1UGM/TNsbQ1rMDSI/AAAAAAAAAsQ/urV4YWS5Z6U/s320/iCanDraw.jpg", "src": "http://1.bp.blogspot.com/_etngz9u1UGM/TNsbQ1rMDSI/AAAAAAAAAsQ/urV4YWS5Z6U/s320/iCanDraw.jpg", "formatted_filename": "iCanDraw", "rendered_width": 320, "rendered_height": 195}, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://www.multimediaeval.org/files/mediaeval.jpg", "src": "http://www.multimediaeval.org/files/mediaeval.jpg", "formatted_filename": "mediaeval", "alt_text": "MediaEval Logo", "rendered_width": 242, "rendered_height": 84}, null, null, null, null, null, null, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://sphotos.ak.fbcdn.net/hphotos-ak-snc4/hs919.snc4/73264_451135783796_620478796_5566371_578882_n.jpg", "src": "http://sphotos.ak.fbcdn.net/hphotos-ak-snc4/hs919.snc4/73264_451135783796_620478796_5566371_578882_n.jpg", "rendered_width": 197, "rendered_height": 132}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://sphotos.ak.fbcdn.net/hphotos-ak-snc4/hs919.snc4/73264_451135783796_620478796_5566371_578882_n.jpg", "src": "http://sphotos.ak.fbcdn.net/hphotos-ak-snc4/hs919.snc4/73264_451135783796_620478796_5566371_578882_n.jpg", "rendered_width": 197, "rendered_height": 132}, null, null, null, null, null, null, null, null, null, null, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://2.bp.blogspot.com/_mEhPqpXDNKY/TD9eZYzrMRI/AAAAAAAABOk/lZxzgQDvYtY/S1600-R/lowlevel.jpg", "src": "http://2.bp.blogspot.com/_mEhPqpXDNKY/TD9eZYzrMRI/AAAAAAAABOk/lZxzgQDvYtY/S1600-R/lowlevel.jpg", "formatted_filename": "lowlevel", "rendered_width": 231, "rendered_height": 36}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://2.bp.blogspot.com/-CtHDzakZq38/U0KU_X64WcI/AAAAAAAAJ3o/d6FDhafs44Y/s1600/simple.png", "src": "http://2.bp.blogspot.com/-CtHDzakZq38/U0KU_X64WcI/AAAAAAAAJ3o/d6FDhafs44Y/s1600/simple.png", "formatted_filename": "simple", "alt_text": "SIMPLE Descriptors", "rendered_width": 248, "rendered_height": 95}, null, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://4.bp.blogspot.com/_mEhPqpXDNKY/TD9HSilA_VI/AAAAAAAABNc/jPZPQ98jPCU/S1600-R/ccds.jpg", "src": "http://4.bp.blogspot.com/_mEhPqpXDNKY/TD9HSilA_VI/AAAAAAAABNc/jPZPQ98jPCU/S1600-R/ccds.jpg", "formatted_filename": "ccds", "alt_text": "Compact Composite Descriptors", "rendered_width": 248, "rendered_height": 86}, null, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://1.bp.blogspot.com/_mEhPqpXDNKY/TD9HhrIZlHI/AAAAAAAABNk/eDWUJjd22MI/S1600-R/mpeg7.jpg", "src": "http://1.bp.blogspot.com/_mEhPqpXDNKY/TD9HhrIZlHI/AAAAAAAABNk/eDWUJjd22MI/S1600-R/mpeg7.jpg", "formatted_filename": "mpeg", "alt_text": "MPEG-7 Descriptors", "rendered_width": 248, "rendered_height": 86}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://4.bp.blogspot.com/_mEhPqpXDNKY/TD9HmkMAO7I/AAAAAAAABNs/YVVKiCt87Xs/S1600-R/lire.jpg", "src": "http://4.bp.blogspot.com/_mEhPqpXDNKY/TD9HmkMAO7I/AAAAAAAABNs/YVVKiCt87Xs/S1600-R/lire.jpg", "formatted_filename": "lire", "rendered_width": 248, "rendered_height": 86}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://3.bp.blogspot.com/-l4n269VW54g/Tl62QrK04LI/AAAAAAAABdg/zg-z4cSPX9o/s1600/ccd.jpg", "src": "http://3.bp.blogspot.com/-l4n269VW54g/Tl62QrK04LI/AAAAAAAABdg/zg-z4cSPX9o/s1600/ccd.jpg", "formatted_filename": "ccd", "rendered_width": 248, "rendered_height": 349}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://1.bp.blogspot.com/-l4VfKNrOhMc/ULd0vE6To1I/AAAAAAAAHBc/B359YJBubho/s300/personal.jpg", "src": "http://1.bp.blogspot.com/-l4VfKNrOhMc/ULd0vE6To1I/AAAAAAAAHBc/B359YJBubho/s300/personal.jpg", "formatted_filename": "personal", "rendered_width": 242, "rendered_height": 240}, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://2.bp.blogspot.com/-tl8GdksRGPo/Tihi_-K0MUI/AAAAAAAABbw/vzEwDBds0mc/s1600/Untitled%2B-%2B1.jpg", "src": "http://2.bp.blogspot.com/-tl8GdksRGPo/Tihi_-K0MUI/AAAAAAAABbw/vzEwDBds0mc/s1600/Untitled%2B-%2B1.jpg", "formatted_filename": "Untitled B B", "rendered_width": 231, "rendered_height": 36}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://2.bp.blogspot.com/_mEhPqpXDNKY/TD9G0PXkMbI/AAAAAAAABNU/sEBJvP4J8zo/S1600-R/rummager.jpg", "src": "http://2.bp.blogspot.com/_mEhPqpXDNKY/TD9G0PXkMbI/AAAAAAAABNU/sEBJvP4J8zo/S1600-R/rummager.jpg", "formatted_filename": "rummager", "alt_text": "Img(Rummager)", "rendered_width": 248, "rendered_height": 170}, null, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://3.bp.blogspot.com/_mEhPqpXDNKY/TD9F5fyI9lI/AAAAAAAABNE/7OUt7orWQ34/S1600-R/anaktisi.jpg", "src": "http://3.bp.blogspot.com/_mEhPqpXDNKY/TD9F5fyI9lI/AAAAAAAABNE/7OUt7orWQ34/S1600-R/anaktisi.jpg", "formatted_filename": "anaktisi", "alt_text": "Img(Anaktisi)", "rendered_width": 248, "rendered_height": 170}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://1.bp.blogspot.com/_mEhPqpXDNKY/TD9e2Fg3q0I/AAAAAAAABOs/EQ-DRn6hFIk/S1600-R/tutorials.jpg", "src": "http://1.bp.blogspot.com/_mEhPqpXDNKY/TD9e2Fg3q0I/AAAAAAAABOs/EQ-DRn6hFIk/S1600-R/tutorials.jpg", "formatted_filename": "tutorials", "rendered_width": 231, "rendered_height": 36}, null, {"document_url": "http://savvash.blogspot.com/2010/", "unformatted_src": "http://3.bp.blogspot.com/_mEhPqpXDNKY/TD9e9T-IT4I/AAAAAAAABO0/Tii4ZAIRK5M/S1600-R/hot.jpg", "src": "http://3.bp.blogspot.com/_mEhPqpXDNKY/TD9e9T-IT4I/AAAAAAAABO0/Tii4ZAIRK5M/S1600-R/hot.jpg", "formatted_filename": "hot", "rendered_width": 231, "rendered_height": 36}, null, null, null]

Wishing You A Merry Christmas..
 from the Non-Relevant information retrieval unit and the Image Processing and Retrieval Trends blog

Two papers at ECIR2011 accepted (one oral, one poster)
 1.Fusion vs Two-Stage for Multimodal Retrieval

Abstract. We compare two methods for retrieval from multimodal collections. The first is a score-based fusion of results, retrieved visually and textually. The second is a two-stage method that visually re-ranks the top-K results textually retrieved. We discuss their underlying hypotheses and practical limitations, and contact a comparative evaluation on a standardized snapshot of Wikipedia. Both methods are found to be significantly more effective than single-modality baselines, with no clear winner but with different robustness features. Nevertheless,
two-stage retrieval provides efficiency benefits over fusion.

2.Dynamic Two-Stage Image Retrieval from Large Multimodal Databases

Abstract. Content-based image retrieval (CBIR) with global features is notoriously noisy, especially for image queries with low percentages of relevant images in a collection. Moreover, CBIR typically ranks the whole collection, which is inefficient for large databases. We experiment with a method for image retrieval from multimodal databases, which improves both the effectiveness and efficiency of traditional CBIR by exploring secondary modalities. We perform retrieval in a two-stage fashion: first rank by a secondary modality, and then perform CBIR only on the top-K items. Thus, effectiveness is improved by performing CBIR on a ‘better’ subset. Using a relatively ‘cheap’ first stage, efficiency is also improved via the fewer CBIR operations performed. Our main novelty is that K is dynamic, i.e. estimated per query to optimize a predefined effectiveness measure. We show that such dynamic two-stage setups can be significantly more effective and robust than similar setups with static thresholds previously proposed.



Using Sketch Recognition and Corrective Feedback to Assist a User in Drawing Human Faces (Dixon)
 Read the original article

iCanDraw is the first application that uses Sketch Recognition to assist the user in learning how to draw. Although most of the algorithms and techniques of this paper are not new there is a major contribution in opening a new field of application for sketch recognition. They show sketch recognition can have great use in this kind of applications. The results going through 2 iterations of the application reveal that such application is feasible, and although much more studies have to be done to prove this is an efficient teaching tool, the end-to-end system is now available to begin such studies. Another important result of the paper is the set of design principles obtained from the user study in this kind of applications for assisted drawing using free sketch. For the implementation of the application the user interface is remarkably well achieved. After a first iteration and a deep analysis of it, many mistakes or weaknesses were detected and corrected such that the final version of this interface is very user oriented and can give a more much effective teaching experience. Each face template goes through a face recognizer to extract its most prominent features, and then some hand corrections are done to finally get to a template of the ideal face sketch. The recognition then is mostly template matching oriented. Some gesture recognition is also used as part of the interface for actions such as erasing or undoing.


The work presented opens a very interesting field of application to sketch recognition. In the sketch recognition class a project about how to draw an eye is one of the possible descendants of this project.  I think one of the mayor challenges in this field is to determine the appropriate amount and quality of the feedback given to the user. If the user is forced to draw too close to the template the experience can be frustrating, but if it is too loose the improvement in drawing might be poor, a solution might be having several difficulty level in different lessons.



My Defense Online
 Watch live streaming video from prostreams at livestream.com
THURSDAY, DECEMBER 9, 2010 - 10:00 (Greece local time)


1st ACM International Conference on *Multimedia Retrieval* - Call for Multimedia Retrieval Demonstrators
 The First ACM International Conference on Multimedia Retrieval (ICMR), puts together the long-lasting experience of former ACM CIVR and ACM MIR. It is the ideal forum to present and encounter the most recent developments and applications in the area of multimedia content retrieval. Originally set up to illuminate the state-of-the-art in image and video retrieval, ICMR aims at becoming the world reference event in this exciting field of research, where researchers and practitioners can exchange knowledge and ideas.

ICMR 2011 is accepting proposals for technical demonstrators that will be showcased during the conference. The session will include demonstrations of latest innovations by research and engineering groups in industry, academia and government. ICMR 2011 is seeking original high quality submissions addressing innovative research in the broad field of multimedia retrieval. Demonstrations can be related to any of the topics defined by ICMR as shown in the call for papers. The technical demonstration showcase will run concurrently with regular ICMR sessions in the poster area.

Papers must be formatted according to the ACM conference style. Papers must not exceed 2 pages in 9 point font and must be submitted as pdf files. While submitting the paper, please make sure that the names and affiliations of the authors are included in the document. Either the Microsoft Word or LaTeX format are accepted. The paper templates can be downloaded directly from the ACM website at http://www.acm.org/sigs/publications/proceedings-templates

All demo submissions will be peer-reviewed to ensure maximum quality and accepted demo papers will be included in the conference proceedings. The best demo will be awarded and announced during the Social Event.




 TOP-SURF is an image descriptor that combines interest points with visual words, resulting in a high performance yet compact descriptor that is designed with a wide range of content-based image retrieval applications in mind. TOP-SURF offers the flexibility to vary descriptor size and supports very fast image matching. In addition to the source code for the visual word extraction and comparisons, we also provide a high level API and very large pre-computed codebooks targeting web image content for both research and teaching purposes.

Bart Thomee, Erwin M. Bakker and Michael S. Lew

The TOP-SURF descriptor is completely open source, although the libraries it depends on use different licenses. As the original SURF descriptor is closed source, we used the open source alternative called OpenSURF, which is released under the GNU GPL version 3 license. OpenSURF itself is dependent on OpenCV that is released under the BSD license. Furthermore we used FLANN for approximate nearest neighbor matching, which is also released under the BSD license. To represent images we used CxImage, which is released under the zlib license. Our own code is licensed under the GNU GLP version 3 license, and also under the Creative Commons Attribution version 3 license. The latter license simply asks you give us credit whenever you use our library. All the aforementioned open source licenses are compatible with each other. Figure 1. Visualizing the visual words. Figure 2. Comparing the descriptors of several images using cosine normalized difference, which ranges between 0 (identical) and 1 (completely different). The first image is the original image, the second is the original image but significantly changed in saturation, the third image is the original image but framed with black borders and the fourth image is a completely different one. Using a dictionary of 10,000 words, the distance between the first and second images is 0.42, the distance between the first and the third is 0.64 and the distance between the first and the fourth is 0.98. We have noticed that a (seemingly high) threshold of around 0.80 appears to be able to separate the near-duplicates from the non-duplicates, although this value requires more validation.




 6-8 July 2011, Corfu Island, Greece


The 2011 17th International Conference on Digital Signal Processing (DSP2011), the longest in existence Conference in the area of DSP (http://www.dsp-conferences.org/), organized in cooperation with the IEEE and EURASIP, will be held in July 6-8, 2011 on the island of Corfu, Greece.

DSP2011 addresses the theory and application of filtering, coding, transmitting, estimating, detecting, analyzing, recognizing, synthesizing, recording, and reproducing signals by means of digital devices or techniques. The term "signal" includes audio, video, speech, image, communication, geophysical, sonar, radar, medical, musical, and other signals.

The program will include presentations of novel research theories / applications / results in lecture, poster and plenary sessions. A significant number of Special Sessions organised by internationally recognised experts in the area, will be held (http://www.dsp2011.gr/special-sessions).


- Adaptive Signal Processing

- Array Signal Processing

- Audio / Speech / Music Processing & Coding

- Biomedical Signal and Image Processing

- Digital and Multirate Signal Processing

- Digital Watermarking and Data Hiding

- Geophysical / Radar / Sonar Signal Processing

- Image and Multidimensional Signal Processing

- Image/Video Content Analysis

- Image/Video Indexing, Search and Retrieval

- Image/Video Processing Techniques

- Image/Video Compression & Coding Standards

- Information Forensics and Security

- Multidimensional Filters and Transforms

- Multiresolution Signal Processing

- Nonlinear Signals and Systems

- Real-Time Signal/Image/Video Processing

- Signal and System Modelling

- Signal Processing for Smart Sensor & Systems

- Signal Processing for Telecommunications

- Social Signal Processing and Affective Computing

- Statistical Signal Processing

- Theory and Applications of Transforms

- Time-Frequency Analysis and Representation

- VLSI Architectures & Implementations

Prospective authors are invited to electronically submit the full camera-ready paper (http://www.dsp2011.gr/submitpapers). The paper must not exceed six (6) pages, including figures, tables and references, and should be written in English. Faxed submissions are not acceptable.

Papers should follow the double-column IEEE format. Authors should indicate one or more of the above listed categories that best describe the topic of the paper, as well as their preference (if any) regarding lecture or poster sessions. Lecture and poster sessions will be treated equally in terms of the review process. The program committee will make every effort to satisfy these preferences. Submitted papers will be reviewed by at least two referees and all accepted papers will be published in the Conference Proceedings (CD ROM) and will be available in IEEExplore digital library. In addition to the technical program, a social program will be offered to the participants and their companions.

It will provide an opportunity to meet colleagues and friends against a backdrop of outstanding natural beauty and rich cultural heritage in one of the best known international tourist destinations.



Image Processing in Windows Presentation Foundation (.NET Framework 3.0)

Αναρτήθηκε από Konstantinos Zagoris Many image processing researchers which they develop on .NET/C# they still stuck in GDI+. That means, they still using the unsafe bracket and by pointers they get the image information. This has changed since the introduction of the Windows Presentation Foundation (WPF) for .NET Framework 3.0 and beyond. In this blog post, we will discuss how to open and process an image using the WPF tools. Let's consider that the image.png is a 32bits/pixel color image. To access the image pixels:

PngBitmapDecoder myImage = new PngBitmapDecoder(new Uri("image.png"), BitmapCreateOptions.DelayCreation, BitmapCacheOption.OnLoad);
byte[] myImageBytes = new byte [myImage.Frames[0].PixelWidth * 4 * myImage.Frames[0].PixelHeight];
myImage.Frames[0].CopyPixels(myImageBytes, myImage.Frames[0].PixelWidth * 4, 0);

At first line, a image object is created by using the pngbitmapdecoder class. The myImage.Frames collection holds the image information. In this example, an image is opened so the collection is equal to 1 and the picture is accessed by the myImage.Frames[0].

Then a byte array is created which it will hold the image pixels information. The CopyPixels function of the Frames[0] is used to get the pixels of the opened image. In this particular example because the image format is Bgra32, the array byte size is equal to 4*Width*Height. In general, the ordering of bytes in the bitmap corresponds to the ordering of the letters B, G, R, and A in the property name. So in Bgra32 the order is Blue, Green, Red and Alpha. Generally, the image format for the image is accessed by myImage.Frames[0].Format and the palette (if the image is using one) by myImage.Frames[0].Palette.

To manipulate the image pixels in order to create a greyscale image:

int Width = myImage.Frames[0].PixelWidth;
int Height = myImage.Frames[0].PixelHeight;
for (int x = 0; x < Width; x++)
for (int y = 0; y < Height; y++)
int r = myImageBytes[4 * x + y * (4 * Width) + 2];
int g = myImageBytes[4 * x + y * (4 * Width) + 1];
int b = myImageBytes[4 * x + y * (4 * Width) + 0];
int greyvalue = (int)(0.3 * r + 0.59 * g + 0.11 * b);
myImageBytes[4 * x + y * (4 * Width) + 2] = (byte)greyvalue;
myImageBytes[4 * x + y * (4 * Width) + 1] = (byte)greyvalue;
myImageBytes[4 * x + y * (4 * Width) + 0] = (byte)greyvalue;

Finally, to create a new image object from the byte array and save it:

BitmapSource myNewImage = BitmapSource.Create(Width, Height, 96, 96, PixelFormats.Bgra32, null, myImageBytes, 4 * Width);
BmpBitmapEncoder enc = new
FileStream fs = newFileStream("newimage.png", FileMode.Create);

A BitmapSource object is created with the corresponding Width, Height and PixelFormat. Then a bmp encoder object is created to save the image as bmp format. A frame is added and the encoder save the image to the corresponding stream.

These programming tools for image manipulation are only a subset of those that they are available in WPF. For example is the WriteableBitmap Class which it is not an immutable object, suitable for dynamic images.



Research Fellow - Image Retrieval
 
Centre for Interactive Systems Research, City University London

Experience in collaborating with partners from industry is desirable.

For informal enquiries, please contact Dr. Ayse Goker:


Closing Date: 10 December, 2010



Public Thesis Defense–Invitation
 

December 09, 10:00, Democritus University of Thrace 

Abstract – Introduction 



Hessian Optimal Design for image retrieval
 Ke Lu, Jidong Zhao and Yue Wu

Available online 19 November 2010.

Keywords: Active learning; Regularization; Image retrieval



Introduction to Content Based Image Retrieval Tutorial
 Introduction to Content Based Image Retrieval by Bin Shen 



20 Must-See TED Speeches for Computer Scientists
 

3. Jeff Han demos his breakthrough touchscreen | Video on TED.com

5. http://www.ted.com/talks/stephen_wolfram_computing_a_theory_of_everything.html

6. Dennis Hong: My seven species of robot

7. http://www.ted.com/talks/gary_flake_is_pivot_a_turning_point_for_web_exploration.html




Relative status of journal and conference publications in computer science
 



Elsevier Releases Image Search; New SciVerse ScienceDirect Feature
 



All-seeing eye for CCTV surveillance

Αναρτήθηκε από Georgios Sirakoulis Reported by Duncan Graham-Rowe 09 November 2010 in New Scientist


 Ετικέτες conference




MediaEval Benchmarking Initiative
 Ετικέτες Benchmarking, CBIR, Retrieval, Video 

Facial recognition security to keep handset data safe
 Reported By Stewart Mitchell in PCPro – Article from 

Facial recognition software could change that picture drastically.


 Prof. Ioannis Andreadis
Democritus University of Thrace, Greece



MMRetrieval Presentation
 Visit MMretrieval Experimental multimodal search engine


Orasis (ver. 1.1)
 

The new version includes:

· JPEG compression support

· EXIF data support

· Keyboard shortcuts

· Decorrelation between brightness and local contrast enhancement

· Automatic Color Saturation

· Automatic check for Updates

· Improved memory management

· Improved Noise reduction algorithms

· Improved Automatic selection of parameters

· Improved Color Correction algorithm

· Improved Independent RGB mode

· Improved Interface

(Greek Version) 



Unlogo - The Corporate Identity Media Filter
 Unlogo is a web service, FFMPEG plugin, and AfterEffects plugin that eliminates logos and other corporate signage from videos. On a practical level, it takes back your personal media from the corporations and advertisers. On a technical level, it is a really cool combination of some brand new OpenCV and FFMPEG functionality. On a poetic level, it is a tool for focusing on what is important in the record of your life rather than the ubiquitous messages that advertisers want you to focus on. In short, Unlogo gives people the opportunity to opt out of having corporate messages permanently imprinted into the photographic record of their lives.

It's simple: you upload a video, and after your video is processed, you get an email with a link to the unlogofied version (example: http://vimeo.com/14531292). You can choose to have the logos simply blocked out with a solid color or replaced with other images, such as the disembodied head of the CEO of the company. This scheme is a bit ridiculous (which is kind of my style), but I like it because it literalizes the intrusion into the record of your life that these logos represent.

What is the money for?

The majority of the money will allow me to work on Unlogo for another 2 months. These is enough time to get the filter out of training mode and into active recognition mode.

Some will go towards paying off some of the debt from the money that I have already spent on programming help and server costs.

Some of the money (probably $1k-$1.5k) will be used to pay the consultants and additional programmers who have been helping to get the filter finished and running smoothly.

Some of the money ($300-$400) will go to the hoisting bills. The CPU power to run this filter publicly isn't cheap! I have 1 Amazon EC2 server where the filtering/encoding is done, another S3 bucket where the videos are stored, and a 3rd server to host the front-end.




Best Paper Award–2nd in a Week!!!!
 My paper with Yiannis Boutalis and Avi Arampatzis awarded as the BEST PAPER* at the “The Fifth International Multi-Conference on Computing in the Global Information Technology (ICCGI 2010)»,

Full Citation:

S. A. Chatzichristofis, Y.S. Boutalis and Avi Arampatzis, “ACCELERATING IMAGE RETRIEVAL USING BINARY HAAR WAVELET TRANSFORM ON THE COLOR AND EDGE DIRECTIVITY DESCRIPTOR”, «The Fifth International Multi-Conference on Computing in the Global Information Technology (ICCGI 2010)», Proceedings: IEEE Computer Society, pp. 41-47,  September 20 to 25, 2010, Valencia, Spain


In this paper, a new accelerating technique for content-based image retrieval is proposed, suitable for the Color and Edge Directivity Descriptor (CEDD). To date, the experimental results presented in the literature have shown that the CEDD demonstrates high rates of successful retrieval in benchmark image databases. Although its storage requirements are minimal, only 54 bytes per image, the time required for the retrieval procedure may be practically too long when searching on large databases. The proposed technique utilizes the Binary Haar Wavelet Transform in order to extract from the CEDD a smaller and more efficient descriptor, with a size of less than 2 bytes per image, speeding up retrieval from large image databases. This descriptor describes the CEDD, but not necessarily the image from which is extracted. The effectiveness of the proposed method is demonstrated through experiments performed with a known benchmark database.

*9 papers were  awarded




Best Paper Award
 My paper with Vicky Kalogeiton, Dim Papadopoulos and Yiannis Boutalis


awarded as the BEST PAPER* at the “1st International Conference for Undergraduate and Postgraduate Students in Computer Engineering, Informatics, related Technologies and Applications”, October 14 to 15, 2010, Patra, Greece 
V. S. Kalogeiton, D. P. Papadopoulos, S. A. Chatzichristofis and Y. S. Boutalis, “A NOVEL VIDEO SUMMARIZATION METHOD BASED ON COMPACT COMPOSITE DESCRIPTORS AND FUZZY CLASSIFIER”, «1st International Conference for Undergraduate and Postgraduate Students in Computer Engineering, Informatics, related Technologies and Applications (EUREKA 2010)», October 14 to 15, 2010, Patra, Greece,

Please note that both Vicky Kalogeiton and Dim Papadopoulos are undergraduate students and members of the DUTH EECE Robotics team. I feel totally honored, thank you :)

On the occasion of the award, I would like to congratulate all members of the DUTH EECE Robotics team for the high quality papers presented at the EUREKA 2010 conference.

*4 papers were  awarded



Limited-time FREE access: International Journal of Pattern Recognition and Artificial Intelligence (IJPRAI)
 This journal publishes both applications and theory-oriented articles on new developments in the fields of pattern recognition and artificial intelligence, and is of interest to both researchers in industry and academia. From the beginning, there has always been a close relationship between the disciplines of pattern recognition and artificial intelligence. The recognition and understanding of sensory data like speech or images, which are major concerns in pattern recognition, have always been considered as important subfields of artificial intelligence.

As part of our contribution to the dissemination of scientific knowledge in the fields of Pattern Recognition and Artificial Intelligence, we have decided to extend a free access for the latest Volume of the journal. So sign up here and gain Free Access to the 2010 full text articles today!



Greece: Funding Opportunities for Postdoctoral Research
 The Greek Ministry of Education, Lifelong Learning and Religious Affairs invites all interested beneficiaries to submit proposal summaries for their inclusion in the Action "Support of Postdoctoral Researchers".

The aim of this Action is to facilitate the acquirement of new research skills by Postdoctoral Researchers (PR) that will promote their career development in any field and/or help them restart their careers after a leave of absence (but no more than seven (7) years following their doctorate conferment date). Emphasis will be given to the support of new scientists at the beginning of their career. The duration of the research projects should range from 24 to 36 months. Each candidate can submit only one (1) research proposal. The total pubic cost of the present call is 30.000.000€ and it is co-financed by the ESF (European Social Fund). The maximum budget for each project is 150.000€. At least 60% of the total budget should be related to costs pertaining to activities undertaken by the PR and should include a monthly net allowance of 1.600€, subject to cost-of-living adjustments for different countries.

Read More or Direct contact me at email@example.com



Final Call for Papers - ECIR 2011
 3rd European Conference on Information Retrieval
18 - 21 April 2011
In cooperation with: BCS-IRSG, Dublin City University, University of Sheffield

The 33rd European Conference on Information Retrieval (ECIR 2011) will take place in Dublin, Ireland from 18-21 April 2011. ECIR provides an opportunity for both new and established researchers to present research papers reporting new, unpublished, and innovative research results within Information Retrieval. ECIR has traditionally had a strong student focus and papers whose sole or main author is a postgraduate student or postdoctoral researcher are especially welcome. As an added incentive at ECIR2011, accepted full-papers whose first author is a student will be given the opportunity to be paired with a senior mentor who will interact with them during the course of the conference. Each mentor will be an expert in the relevant area of the student's work, and will provide questions and subsequent feedback after their presentation.
We are seeking the submission of high-quality and original full-length research papers, short-papers, posters and demos, which will be reviewed by experts on the basis of the originality of the work, the validity of the results, chosen methodology, writing quality and the overall contribution to the field of Information Retrieval. Papers that demonstrate a high level of research adventure or which break out of the traditional IR paradigms are particularly welcome.
Relevant topics include, but are not limited to:

-       Enterprise Search, Intranet Search, Desktop Search, Adversarial IR
-       Web IR and Web log analysis
-       Multimedia IR
-       Digital libraries
-       IR Theory and Formal Models
-       Distributed IR, Peer-to-peer IR,
-       Mobile IR, Fusion/Combination
-       Cross-language retrieval, Multilingual retrieval, Machine translation for IR
-       Topic detection and tracking, Routing
-       Content-based filtering, Collaborative filtering, Agents, Spam filtering
-       Question answering, NLP for IR
-       Summarization, Lexical acquisition
-       Text Data Mining
-       Text Categorization, Clustering
-       Performance, Scalability, Architectures, Efficiency, Platforms
-       Indexing, Query representation, Query reformulation,
-       Structure-based representation, XML Retrieval
-       Metadata, Social networking/tagging
-       Evaluation methods and metrics, Experimental design, Test collections
-       Interactive IR, User studies, User models, Task-based IR
-       User interfaces and visualization
-       Opinion mining, Sentiment Analysis
-       Blog and online-community search
-       Other domain-specific IR (e.g., Genomic IR, legal IR, IR for chemical structures)

The ECIR 2011 conference proceedings will be published by Springer in the Lecture Notes in Computer Science (LNCS) series. Authors for both long and short papers are invited to submit their paper on or before 15 October 2010. All paper submissions must be written in English following the LNCS author guidelines [http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0]. Full papers must not exceed 12 pages including references and figures, short-papers submissions should have a maximum length of 6 pages, and posters and demos must not be longer than 4 pages. All papers will be refereed through double-blind peer review so authors should take reasonable care not identify themselves in their submissions. The proceedings will be distributed to all delegates at the Conference.



CBMI 2010
 Following the eight successful previous events of CBMI (Toulouse 1999, Brescia 2001, Rennes 2003, Riga 2005, Bordeaux 2007, London 2008, Chania 2009 and Grenoble 2010), the Video Processing and Understanding Lab (VPULab) and the Information Retrieval Group (IRG) at Universidad Autónoma de Madrid will organize the next CBMI event.

CBMI 2011 aims at bringing together the various communities involved in the different aspects of content-based multimedia indexing, retrieval, browsing and presentation. The scientific program of CBMI 2011 will include invited keynote talks and regular and special sessions with contributed research papers.

Topics of interest, grouped in technical tracks, include, but are not limited to:

Visual Indexing

Audio and Multi-modal Indexing

Multimedia Information Retrieval

Multimedia Browsing and Presentation

Selected papers will appear, after extension and peer-review, in a special issue of Multimedia Tools and Applications.