We present a method allowing a significant speed-up of the eigen-detection method (detection based on principle component analysis). We derive a formula for an upper bound on the class-conditional probability (or equi...
详细信息
In this paper,a parallel coordinative visual model—The revised Plate Parallel Retrieval Model(Wang 1994) [1]is presented based on the analysis of the global effect of Chinese Characters and the recent neurobiological...
详细信息
In this paper,a parallel coordinative visual model—The revised Plate Parallel Retrieval Model(Wang 1994) [1]is presented based on the analysis of the global effect of Chinese Characters and the recent neurobiological researches on the function of neuroglia in learning and *** theory assumes that visual neurons possess the function of memory and retrieval in addition to the commonly recognised function of signal *** supposes all the pixels on the array of a Chinese character are encoded,stored and relieved simultaneously and sychronously by each neuron separately.
The matching of an object, a region of an image segmentation, to a template is a heavy computation process and is not very robust. We represent an object by a region adjacency graph (RAG) on the top of which a pyramid...
详细信息
The matching of an object, a region of an image segmentation, to a template is a heavy computation process and is not very robust. We represent an object by a region adjacency graph (RAG) on the top of which a pyramid...
详细信息
The matching of an object, a region of an image segmentation, to a template is a heavy computation process and is not very robust. We represent an object by a region adjacency graph (RAG) on the top of which a pyramid (a decreasing sequence of RAG) is built according to a set of rules, which verify some uniqueness and uniformity properties. The contraction process preserves the structure of the RAG across the pyramid's levels, and the rules are chosen according to the characteristics of the template. By building such a pyramid and then by a top-down process to match all the sub-graphs we have a linear parallel complexity time, with a robust match and a partial match relative to the given set of rules.
In this paper, a parallel coordinative visual model-the revised plate parallel retrieval model (Wang Tianzhen et al, 1994) is presented based on the analysis of the global effect of Chinese characters and the recent n...
详细信息
In this paper, a parallel coordinative visual model-the revised plate parallel retrieval model (Wang Tianzhen et al, 1994) is presented based on the analysis of the global effect of Chinese characters and the recent neurobiological research on the function of neuroglia in learning and memory. The theory assumes that visual neurons possess the function of memory and retrieval in addition to the commonly recognised function of signal transformation. It supposes all the pixels in the array of a Chinese character are encoded, stored and retrieved simultaneously and synchronously by each neuron separately. In the model, neuroglia cells play an important role in the integration of the visual signal. The model cannot only satisfactorily explain both the global effect and strokes effect, but can also explain the implicit memory of Chinese characters as well. We have experimented on an SIMD array processor to prove the viability of the PPR algorithm. The results are satisfactory. The model can be extended to general shape vision with some conditions.
We present a method allowing a significant speed-up of the eigen-detection method (detection based on principle component analysis). We derive a formula for an upper bound on the class-conditional probability (or equi...
详细信息
We present a method allowing a significant speed-up of the eigen-detection method (detection based on principle component analysis). We derive a formula for an upper bound on the class-conditional probability (or equivalently a lower bound on the Mahalanobis distance) on which detection is based. Often, the lower bound of Mahalanobis distance (MD) reaches a preset threshold after computation of only a few eigen-projections. In this case the computation of MD can be immediately terminated. Regardless of the precise value of MD, the detection hypothesis (object from class /spl Omega/ is detected) can be rejected. While provably obtaining results identical to the standard technique, we achieved a two- to three-fold speed-up in face detection experiments on images from the CMU database.
Most algorithms for segmenting connected handwritten digit strings are based on the analysis of the foreground pixel distributions and the features on the upper/lower contours of the image. A new approach is presented...
详细信息
ISBN:
(纸本)0780344286
Most algorithms for segmenting connected handwritten digit strings are based on the analysis of the foreground pixel distributions and the features on the upper/lower contours of the image. A new approach is presented to segment connected handwritten two-digit strings based on the thinning of background regions. The algorithm first locates several feature points on the background skeleton of the digit image. Possible segmentation paths are then constructed by matching these feature points. With geometric property measures, these segmentation paths are ranked using fuzzy rules generated from a decision-tree approach. Finally, the top ranked segmentation paths are tested one by one by an optimized nearest neighbor classifier until one of these candidates is accepted based on an acceptance criterion. Experimental results on NIST special database 3 show that our approach can achieve a correct classification rate of 92.4% with only 4.7% of digit strings rejected, which compares favorably with the other techniques tested.
We study the problem of representing images within a multimedia Database Management System (DBMS), in order to support fast retrieval operations without compromising storage efficiency. To achieve this goal, we propos...
We study the problem of representing images within a multimedia Database Management System (DBMS), in order to support fast retrieval operations without compromising storage efficiency. To achieve this goal, we propose new image coding techniques which combine a wavelet representation, embedded coding of the wavelet coefficients, and segmentation of image-domain regions in the wavelet domain. A bitstream is generated in which each image region is encoded independently of other regions, without having to explicitly store information describing the regions. Simulation results show that our proposed algorithms achieve coding performance which compares favorably, both perceptually and objectively, to that achieved using state-of-the-art image/video coding techniques while additionally providing region-based support.
Smooth interpolants defined over tetrahedra are currently being developed for they have many applications in geography, solid modeling, finite element analysis, etc. In this paper, we will characterize a certain class...
详细信息
Smooth interpolants defined over tetrahedra are currently being developed for they have many applications in geography, solid modeling, finite element analysis, etc. In this paper, we will characterize a certain class of C-1 discrete tetrahedral interpolants with only C-1 data required. As special cases of the class characterized, we give two C-1 discrete tetrahedral interpolants which have concise expressions.
A central problem in stereo matching using correlation techniques lies in selecting the size of the search window. Small windows contain only a small number of data points, and thus are very sensitive to noise and the...
详细信息
暂无评论