Foveated, log-polar, or space-variant image architectures provide a high resolution and wide field workspace, while providing a small pixel computation load. These characteristics are ideal for mobile robotic and active vision applications, but have been little used due to the general lack of image processing tools that are applicable to the log-polar coordinate system. Recently, we have descri...

With increased digital images in image repositories efficient indexing and searching becomes essential for large image archives. Content based image retrieval system (CBIR) retrieve relevant images using low-level features like color, texture and shape for image representation. In this approach, a scheme of novel color image retrieval based on visual interest point is presented. The existing sy...

Edge detection has been a hot issue in image processing field for many years. This paper focuses on the LOG operator and its improvement methods. Firstly, a new edge detection template is proposed, which increases the detect direction for the original Laplace template and re-allocation of the weight reasonable. Secondly, this paper proposes an adaptive selection strategy of threshold for edge e...

We propose a feature extraction method for a newly developed vibratory image sensor. The proposed method extracts a local log-polar symmetry as image feature. In this article, it is shown that log-polar symmetric patterns include well-known characteristic points such as edges, corners, peaks, and so on. The principle of our method is as follows: a periodic vibration of an image sensor modulates...

Change detection algorithms play a vital role in overseeing the transformations on the earth surface. Unsupervised change detection has an indispensable role in an immense range of applications like remote sensing, motion detection, environmental monitoring, medical diagnosis, damage assessment, agricultural surveys, surveillance etc. In this paper, a novel method for unsupervised change detect...

A work-optimal O(log M log n) time parallel implementation of lossless image compression by block matching of bi-level images is shown on a full binary tree architecture under some realistic assumptions, where n is the size of the image and M is the maximum size of the match. Decompression on this architecture is also possible with the same parallel computational complexity. Such implementation...

It is well known that the wavefront error (WFE) of the eye varies from individual to individual with pupil diameter (PD) and age. Numerous studies have been proposed evaluating the relationship between visual acuity and WFE, but all these studies were performed with either a fixed or natural PD. It is still not clear if metrics of image quality correlate well with visual acuity independent of P...

of thesis entitled: Statistical Machine Learning for Bridging the Semantic Gap in Image Retrieval Submitted by HOI, Chu Hong (Steven) With the explosive growth of multimedia data, more and more research attentions have been devoted to visual information retrieval. Image retrieval, particularly content-based image retrieval (CBIR), has been actively studied in multimedia information retrieval co...

This work first reviews an already-developed, existing deterministic parallel algorithm [2] to compute the complete histogram of an image in optimal number of steps ( ) n log on a hypercube architecture and utilizing memory space on the order of ( ), log 2 1 x x O where x is the number of gray levels in the image, at each processing element. The paper then introduces our improvement to this alg...

Work-optimal O(log M log n) time implementations of lossless image compression by block matching are shown on the PRAM EREW, where n is the size of the image and M is the maximum size of the match, which can be implemented on practical architectures such as meshes of trees, pyramids and multigrids. The workoptimal implementations on pyramids and multigrids are possible under some realistic assu...