An efficient contour-based method for the coding of binary shape information is described. Conventional chain coding techniques show high coding efficiency for lossless compression, but they exploit the coherence of t...
详细信息
An efficient contour-based method for the coding of binary shape information is described. Conventional chain coding techniques show high coding efficiency for lossless compression, but they exploit the coherence of the contour in only a restricted manner. Higher coding efficiency can be achieved by realising the neighbourhood relation as a Markov chain, and this is exploited in a new coding scheme, the directional grid chain coding (DGCC). The method is computationally efficient and the coding process adapts to the inherent changes in the contour. Two schemes are proposed, a lossless and a quasi-lossless method. The lossless scheme achieves 32% saving in bit rate compared with the conventional differential chain code (DCC). The second, quasi-lossless technique achieves 44% bit reduction compared with the DCC and the distortions present in the reconstructed contour are hardly noticeable to the human eye. (c) 2007 Elsevier B.V. All rights reserved.
In object-based video representation, video scenes are composed of several arbitrarily shaped video objects (VOs), defined by their texture, shape and motion. In error-prone communications, packet loss results in miss...
详细信息
In object-based video representation, video scenes are composed of several arbitrarily shaped video objects (VOs), defined by their texture, shape and motion. In error-prone communications, packet loss results in missing information at the decoder. The impact of transmission errors is minimized through error concealment. In this paper, we propose a spatial error concealment technique for recovering lost shape data. We consider a geometric shape representation consisting of the object boundary, which can be extracted from the alpha-plane. Missing macroblocks result in a broken boundary. A B-spline curve is constructed to replace a missing boundary segment, based on a T-spline representation of the received boundary. We use T-splines because they produce shape-preserving approximations and do not change the characteristics of the original boundary. The representation ensures a good estimation of the first derivatives at the points touching the missing segment. Applying smoothing conditions, we manage to construct a new spline that joins smoothly with the received boundary, leading to successful concealment results. Experimental results on object shapes with different concealment difficulty demonstrate the performance of the proposed method. Comparisons with prior proposed methods are also presented.
Document imaging technology has developed to the point where it is not uncommon for organizations to scan large numbers of documents into databases with little or no index information. This may be done for archival pu...
详细信息
Document imaging technology has developed to the point where it is not uncommon for organizations to scan large numbers of documents into databases with little or no index information. This may be done for archival purposes with an index as simple as a case number, or with the ultimate goal of automatically extracting index information for content-based queries. Maintaining the integrity of such a database is difficult, however, especially in a distributed environment where copies of the same documents may be scanned at different times. In this paper we present a novel approach to detecting duplicate documents in very large databases using only features extracted from the image. The method is based on a robust 'signature' extracted from each document image which is used to index into a table of previously processed documents. The system is able to deal with differences between scanned document instances such resolution, skew and image quality. The approach has a number of advantages over OCR or other recognition-based methods including speed and robustness to imaging distortions. To justify the approach and demonstrate its scalability, we have developed a simulator which allows us to change parameters of the system and examine performance while processing millions of document signatures. A complete system has been implemented and tested on a collection of technical articles and memos. (C) 1998 Elsevier Science B.V. All rights reserved.
This paper presents a fast binary motion estimation (BME) algorithm and its architecture for MPEG-4 shape encoding. The proposed algorithm explores the property of the binary-value in BME to quickly skip the unnecessa...
详细信息
This paper presents a fast binary motion estimation (BME) algorithm and its architecture for MPEG-4 shape encoding. The proposed algorithm explores the property of the binary-value in BME to quickly skip the unnecessary sum of absolute differences (SAD) computation. When comparing with the full search algorithm, simulation results show that it can efficiently save in the search positions to an average -99.58% of that in the full search algorithm with the same PSNR quality. Due to the algorithm's simplicity and regularity, the resulting hardware implementation also exhibits simple and regular control and data flow. It can achieve real-time encoding with only 11582 gate count.
Selecting the incorrect control during the operation of underground bolting and drilling equipment causes serious injuries. shape coding and the layout of dual control banks are two aspects of control design which req...
详细信息
Selecting the incorrect control during the operation of underground bolting and drilling equipment causes serious injuries. shape coding and the layout of dual control banks are two aspects of control design which require further examination. The aims of this research were: (i) to determine whether arbitrary shape coding was effective in reducing selection error rates in a virtual analogy of roof-bolting;and (ii) to determine whether any advantages exist for mirror or place layouts for dual control situations in this situation. Two experiments were conducted to address these questions. No benefits of arbitrary shape coding were evident while control location remained constant. When control location was altered, shape coding did provide a significant reduction in selection error rate. No differences between mirror or place arrangements were detected and this question remains open. (C) 2009 Elsevier Ltd. All rights reserved.
Compression of point clouds has so far been confined to coding the positions of a discrete set of points in space and the attributes of those discrete points. We introduce an alternative approach based on volumetric f...
详细信息
Compression of point clouds has so far been confined to coding the positions of a discrete set of points in space and the attributes of those discrete points. We introduce an alternative approach based on volumetric functions, which are functions defined not just on a finite set of points, but throughout space. As in regression analysis, volumetric functions are continuous functions that are able to interpolate values on a finite set of points as linear combinations of continuous basis functions. Using a B-spline wavelet basis, we are able to code volumetric functions representing both geometry and attributes. Attribute compression is addressed in Part I of this paper, while geometry compression is addressed in Part II. Geometry is represented implicitly as the level set of a volumetric function (the signed distance function or similar). Experimental results show that geometry compression using volumetric functions improves over the methods used in the emerging MPEG Point Cloud Compression (G-PCC) standard.
Recently, a new technique for the lossless encoding of contour maps was introduced, based on the concept of "transition points." in this paper we show that by using a simple representation for the transition...
详细信息
Recently, a new technique for the lossless encoding of contour maps was introduced, based on the concept of "transition points." in this paper we show that by using a simple representation for the transition points, i.e., the map of transition points, the problem of encoding arbitrary contour maps can be easily converted into a problem of lossless image coding. Experimental results show that the joint bilevel image experts group (JBIG) image coding standard can be used successfully For encoding maps of transition points, outperforming, in most cases, differential chain-coding. Moreover, if we take into account that JBIG codecs are available as "off the shelf" components, then the effort required to implement the proposed method is small.
Sentence description of objects are utilized in the model. The description is transformable into graphs. Fast shape coding is accomplished by an operator translated along linear objects or contours. A separate node of...
详细信息
Sentence description of objects are utilized in the model. The description is transformable into graphs. Fast shape coding is accomplished by an operator translated along linear objects or contours. A separate node of a graph is obtained for each new position of the operator. After a reduction, the graph is equivalent to a sentence describing an object. A technique incorporating a rotating neighbourhood is introduced and utilized for image enhancement and texture derivation. The technique preserves edges of objects. A threshold which adapts itself to an unknown noise level and image segmentation into individual objects are also presented. All the methods discussed satisfy the basic condition on representing images.
In this paper, new methods for error concealment of shape information are proposed for compressed MPEG-4 bit-streams transmitted over error prone channels. For spatial domain, the proposed approach employs the Bezier ...
详细信息
In this paper, new methods for error concealment of shape information are proposed for compressed MPEG-4 bit-streams transmitted over error prone channels. For spatial domain, the proposed approach employs the Bezier curve fitting to approximate and outline the intra-video object plane (I-VOP). For temporal domain, the proposed scheme uses the weighted side matching criterion to reconstruct the inter-video object planes (P-/B-VOPs). The proposed algorithms get better subjective and objective qualities than previous works.
The efficiency of shape coding is an important problem concerning content-based image manipulations and object-based coding of the video sequences. In order to encode the shape information of an object, the boundary i...
详细信息
The efficiency of shape coding is an important problem concerning content-based image manipulations and object-based coding of the video sequences. In order to encode the shape information of an object, the boundary is approximated by a polygon which can be encoded with the smallest number of bits for maximum allowable distortion. The conventional boundary coding schemes, however, does not successfully remove the temporal redundancy of the video sequences. This paper proposes a new boundary encoding scheme by which the temporal redundancy between two successive frames is efficiently removed, resulting in lower bit-rate than the conventional algorithms. The interframe vertex selection problem is solved by finding the path with the minimum cost in the directed acyclic graph (DAG) and its fast version using a simplified graph is introduced to reduce the computational load. The vertices were selected from both the current frame to be encoded and the previous frame already encoded, and thus, the temporal redundancy was effectively removed.
暂无评论