This paper presents the application of a framework of fast and efficient compressive sampling based on the concept of random sampling of sparse Audio signal. It provides four important features. (i) It is universal with a variety of sparse signals. (ii) The number of measurements required for exact reconstruction is nearly optimal and much less then the sampling frequency and below the Nyquist frequency. (iii) It has very low complexity and fast computation. (iv) It is developed on the provable mathematical model from which we are able to quantify trade-offs among streaming capability, computation/memory requirement and quality of reconstruction of the audio signal. Compressed sensing CS is an attractive compression scheme due to its universality and lack of complexity on the sensor side. In this paper a study of applying compressed sensing on audio signals was presented. The performance of different bases and its reconstruction are investigated, as well as exploring its performance. Simulations results are present to show the efficient reconstruction of sparse audio signal. The results shows that compressed sensing can dramatically reduce the number of samples below the Nyquist rate keeping with a good PSNR.
(13)
Mobile ad hoc network is nothing but the temporary network which is having the collection of mobile nodes. Routing and broadcasting are major operations of MANET network. The major operation in ad hoc mobile network is the broadcasting which sometime results to storm problem of the broadcast if the forwarding mechanism is not properly designated. Thus the challenges in the MANET are to reduce the broadcasting redundancy and under high transmission error rate provides high delivery ratio. Hence in our proposed research, we are introducing and investigating the new mechanism of broadcasting called Dual Covered Broadcast. This method takes the broadcast redundancy advantage order to improve packet delivery ratio especially under environments w
... Show MoreThe cost management of cost indicators in housing projects, on the level of planning and design, is the most important quality indicators, for adoption of strategies of planning and design efficient in managing these indicators. So this research points out the need to highlight the most effective and influential cost indicators in housing projects, and to determine strategies in the management of these indicators in order to raise the efficiency of housing projects quality, to seemly the income level target group, taking into consideration the quality of housing standards, to achieve the basic requirements of housing. This paper highlights the importance of the cost management, the types of housing cost, the method
... Show More
(8)
(7)
(16)
(15)
In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.
There are many images you need to large Khoznah space With the continued evolution of storage technology for computers, there is a need nailed required to reduce Alkhoznip space for pictures and image compression in a good way, the conversion method Alamueja
In this paper, a method is proposed to increase the compression ratio for the color images by
dividing the image into non-overlapping blocks and applying different compression ratio for these
blocks depending on the importance information of the block. In the region that contain important
information the compression ratio is reduced to prevent loss of the information, while in the
smoothness region which has not important information, high compression ratio is used .The
proposed method shows better results when compared with classical methods(wavelet and DCT).
Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.