33293924
Intelligent Object Extraction Algorithm Based on Foreground/Background Classification
In this paper, we propose an intelligent object extraction algorithm based on foreground/background classification. The proposed algorithm can offer the users more friendly interface for object extraction from image without unnecessary steps. After the interactive steps from user (marking the foreground and background parts), the wanted object is extracted from the background automatically. The proposed algorithm processes the input image by watershed to produce the regions. Then, the regions are labeled after marking parts of regions. We also introduce an implementation of hierarchical queues to store the unlabeled regions. The classification of foreground and background will generate the final image with selected object. In our experimental results, the proposed algorithm provides the output image with high efficiency. The wanted object is generated after user marking the foreground and background parts less than one second. In addition, the application of this work also can be used in image synthesis or object removal in other fields of image processing.
21513395
VLSI architecture and implementation for FS1016 CELP decoder with reduced power and memory requirements
Abstract The code-excited linear predictive (CELP) coder is the most effective technique among various linear predictive coding methods for speech compression. Hence, designing a relatively low-cost and low-power CELP decoder chip for the portable systems and wireless digital communication environment becomes increasingly important. This paper presents the VLSI architecture and chip implementation for the FS1016 CELP decoder with reduced power and memory requirements. A single-chip implementation of the CELP decoder drastically reduces the cost and the size of many CELP vocoder systems. The decoder chip can achieve the following: (1) excellent accuracy results due to the accuracy studies for the finite word length, (2) power savings and high-speed operations owing to the combined advantages of pipeline and concurrent processing structures, (3) table size reducing by applying the memoryless realization for stochastic codebook and partial sums technique and (4) specification satisfying the FS1016 CELP coder. Fabricated with 0.8 μm double-metal CMOS technology, the chip contains approximately 13 000 transistors occupying a 6.1 × 6.2 mm2 area. It has been tested to be fully functional at IMS XL-60 tester and is the first working FS1016 CELP 4.8 K decoder chip. In particular, the fixed-point accuracy studies for the CELP decoder are also addressed herein.
17964420
A learning process to the identification of feature points on Chinese characters
The paper describes a novel stroke extraction approach to identify the feature points of a character, using line-filtering and learning-based techniques. The line-filtering technique based on convolution operations with a set of one-dimensional (1D) Gabor templates efficiently extracts the stroke segments from noisy and degraded characters. Furthermore, the relationship between endpoints of stroke segments is modeled as junction structure during a learning process. Finally, each endpoint is identified as a feature point to determine the junction structure by the learning-based technique, rather than rule-based techniques with manual rule creation. Experimental results indicate that the learning-based technique can generalize learning knowledge to identify 1200 feature points with an average identification rate of 93.58% for test set, using k-fold cross-validation testing.
19723482
A learning process to the identification of feature points on Chinese characters
The paper describes a new stroke extraction approach to identify the feature points of a character, using line-filtering and learning-based techniques. The line-filtering technique based on the convolution operations with a set of 1-D Gabor templates is efficient in extracting the stroke segments of the character and robust in noise tolerance. Furthermore, unlike conventional feature-point detection techniques where decision rules and thresholds have to be specified, our learning-based technique for feature-point identification implicitly represents the rules and thresholds without further parameter adjustments. Experimental results show that the learning-based technique is capable of generalizing the learning knowledge to identify feature points and can get an average identification rate of 95.27% for hand-printed test characters and 96.78% for machine-printed test characters.
11945508
Content-Based Audio Classification Using Support Vector Machines and Independent Component Analysis
In this paper, we present a new audio classification system. First, a frame-based multiclass support vector machine (SVM) for audio classification is proposed. The accuracy rate has significant improvements over conventional file-based SVM audio classifier. In feature selection, this study transforms the log powers of the critical-band filters based on independent component analysis (ICA). This new audio feature is combined with mel-frequency cepstral coefficients (MFCCs) and five perceptual features to form an audio feature set. The superiority of the proposed system has been demonstrated via a 15-class sound database with a 91.7% accuracy rate
45865876
Graph theoretic characterization and reliability of the generalized Boolean n-cube network
In this paper, a general class of Boolean n-cube structures is investigated. The interconnection is based on a mixed radix number system which results in a variety of generalized Boolean n-cube structures for a given number of processors N = x·2y, where x and y are positive integers. A number of interesting properties of the network are revealed. By a constructive method, the node connectivity of this network is found. Finally, we show that the graph is super-λ and is an optimal reliable structure for interconnection networks.
12807394
A novel data caching scheme for multimedia servers
Abstract In this paper, we propose a Bi-directional Fragmental Pipelining (BFP) technique and its variable buffer size data-caching scheme BFPV to reduce the disk I/O bandwidth requirement for multimedia servers. Our mathematical analysis shows that the BFP technique is superior to the traditional unidirectional pipelining technique in terms of memory buffer space requirement. We further demonstrate that the memory buffer management using BFPV is better than that of using the fixed buffer size approach BFPF. We have mathematically proved that BFPV saves more disk I/O bandwidth than BFPF does using the same memory buffer space. Our simulation results have quantitatively confirmed our analysis.
8673951
An iterative optimization approach for unified image segmentation and matting
Separating a foreground object from the background in a static image involves determining both full and partial pixel coverages, also known as extracting a matte. Previous approaches require the input image to be presegmented into three regions: foreground, background and unknown, which are called a trimap. Partial opacity values are then computed only for pixels inside the unknown region. This presegmentation based approach fails for images with large portions of semitransparent foreground where the trimap is difficult to create even manually. In this paper, we combine the segmentation and matting problem together and propose a unified optimization approach based on belief propagation. We iteratively estimate the opacity value for every pixel in the image, based on a small sample of foreground and background pixels marked by the user. Experimental results show that compared with previous approaches, our method is more efficient to extract high quality mattes for foregrounds with significant semitransparent regions
14383826
Wavelet-based image indexing techniques with partial sketch retrieval capability
This paper describes WBIIS (Wavelet-Based Image Indexing and Searching), a new image indexing and retrieval algorithm with partial sketch image searching capability for large image databases. The algorithm characterizes the color variations over the spatial extent of the image in a manner that provides semantically-meaningful image comparisons. The indexing algorithm applies a Daubechies' wavelet transform for each of the three opponent color components. The wavelet coefficients in the lowest few frequency bands, and their variances, are stored as feature vectors. To speed up retrieval: a two-step procedure is used that first does a crude selection based on the variances, and then refines the search by performing a feature vector match between the selected images and the query. For better accuracy in searching, two level multiresolution matching may also be used. Masks are used for partial-sketch queries. This technique performs much better in capturing coherence of image, object granularity, local color/texture, and bias avoidance than traditional color layout algorithms. When tested on a database of more than 10,000 general-purpose images, WBIIS is much faster and more accurate than traditional algorithms.
17015567
Effect of channel-estimation error on QAM systems with antenna diversity
This paper studies the effect of channel estimation error and antenna diversity on multilevel quadrature amplitude modulation (M-QAM) systems over Rayleigh fading channels. Based on the characteristic function method, a general closed-form bit-error rate (BER) for M-QAM systems is presented. The effect of the inaccurate channel estimation on the performance for pilot-symbol-assisted modulation M-QAM systems with antenna diversity is investigated. Simulation results for M-QAM (M = 4, 16, 64, 256, etc.) show that the analytical method can accurately estimate the system performance. Moreover, numerical results show that with the antenna-diversity technique, the BER performance improves significantly, especially in perfect channel-estimation cases. It is also found that the channel-estimation error limits the benefit of antenna diversity. By increasing the length of the channel estimator and the amplitude of the pilot symbol, more accurate channel estimation can be achieved, so that the BER performance is improved.
14083792
Multicarrier CDMA overlay for ultra-wideband communications
In this letter, the performance of multicarrier code-division multiple-access (CDMA) systems is studied in the presence of narrowband interference for future ultra-wideband (UWB) communications. A Nakagami fading channel is assumed, and notch filters along with diversity techniques are used in the multicarrier CDMA receiver. A complete performance analysis of error probability is given. It is shown that when the number of subcarriers jammed by narrowband interference is small, the multicarrier receiver without notch filters can work well, due to the gain of frequency diversity from nonjammed subcarriers. On the other hand, when the number of subcarriers jammed by the narrowband interference is large, using notch filters can improve the multicarrier system performance significantly.