Open Access Adaptive Image Enhancement Algorithm with Complex Background
|
|
- Geoffrey Moore
- 5 years ago
- Views:
Transcription
1 Sen Orers for Reprints to 594 The Open Cybernetics & Systemics Journal, 205, 9, Open Access Aaptive Image Enhancement Algorithm with Complex Bacgroun Zhang Pai * epartment of Information Engineering, Tang Shan College, Tang Shan, , P.R. China Abstract: How to capture an enhance the target from an image with complex texture an ege features is stuie in this paper. For the traitional image enhancement methos can not split ifferent ins of the textures an eges of an image efficiently, a novel aaptive enhancement algorithm base on nonsubsample contourlet transform (NSCT) is projecte. Firstly, by using the irect spatial multiplication of NSCT coefficients of each same irectional subban at ajacent highpass scales, the inter-scale spaces are constructe an the optimal geometrical irections of each matrix region are calculate in the propose spaces. Experimental results show that, in NSCT omain, the geometrical irection information which locates in the inter-scale spaces can represent the ifferent etail features exactly of an image. Therefore, the optimal geometrical irection information as a rule to etermine what in of ege an texture features woul be capture an enhance is employe. After comparing with existing enhancement metho, the propose approach achieves better results, not only clearly ientifies target eges an textures from complex bacgroun, but also enhances them with better visualization. Keywors: Complex bacgroun, Image enhancement, NSCT, Optimal geometrical irection information.. INTROUCTION Image enhancement is to improve the interpretability or perception of information in images for human viewers, or to provie better input for other automate image processing techniques. In this paper, a type of image is iscusse whose targets possess complex eges an high contrast texture features while the bacgroun also has complex eges but lower contrast texture features. The aim is to capture an enhance the targets accurately from the images. Most of traitional enhancement methos [-3] can enhance wea eges an features in an image while restraining the noise an eeping the strong eges, but they are invali in ientifying an enhancing the eges or textures from objective region in an image with complex bacgroun. To overcome the limitation of existing enhancement methos an mae full use of the test image features, we come up with a novel aaptive enhancement algorithm base on nonsubsample contourlet transform (NSCT) [4]. As a shift-invariant version of the contourlet transform [5], NSCT provies an efficient irectional multiresolution image representation. In NSCT omain, each of highpass irectional subbans shows a high egree of irectionality an anisotropy. Taing into account the coefficients epenencies across scale in multiresolution ecomposition an the features of test images, we use the irect spatial multiplication of NSCT coefficients of each same irectional subban at ajacent scales to construct the inter-scale spaces an implemente two concrete steps in the constructe interscale spaces to istinguish target s eges an textures from *Aress corresponence to this author at the epartment of Information Engineering, Tang Shan College, Tang Shan, , P.R. China; Tel: ; rainrop_pai@qq.com 874-0X/5 bacgrouns. Firstly, base on the iea of banelet transform [6], we compute the optimal geometrical information of sub-squares (of matrix region) in constructe inter-scale spaces. This geometrical information can create a full istinction between high contrast ege an texture features an lower contrast ege an texture features of the source image. Then, in terms of the geometrical irections, an aaptive enhancement metho was employe to preserve an enhance the goals, while weaening the bacgroun. In this paper, the motivation is to project a new enhancement algorithm which has ability in capturing an enhancing the target with high contrast features in comparison with the bacgroun of source images. Experimental results show the availability of our approach. 2. PRINCIPLE OF NSCT AN THE CONSTRUCTION OF THE OPTIMAL GEOMETRICAL INFORMATION IN ITS INTER-SCALE SPACES 2.. The Principle of NSCT In the foremost contourlet transform, ownsamplers an upsamplers are presente in both the laplacian pyrami (LP) an the irectional filter bans (FB). Thus, it is not shiftinvariant, which causes pseuo-gibbs phenomenon aroun singularities. NSCT is an improve form of contourlet transform. In contrast with contourlet transform, nonsubsample laplacian pyrami (NLP) structure an nonsubsample irectional filter bans (NFB) are employe in NSCT. The NLP structure is achieve by using two-channel nonsubsample 2 filter bans. The NFB is achieve by switching off the ownsamplers/upsamplers in each two- 205 Bentham Open
2 Aaptive Image Enhancement Algorithm with Complex Bacgroun The Open Cybernetics & Systemics Journal, 205, Volume channel filter ban in the FB tree structure an upsampling the filters accoringly. As a result, NSCT is shift-invariant an leas to better frequency selectivity an regularity. Fig. () shows the ecomposition framewor of NSCT. Input image NSCT is shift-invariant such that each coefficient of the transform subbans correspons to that of the original image in the same location an the N _ Corr of each ajacent scales has the same property. On comparing with the coefficients of subbans in each single scale, N _ Corr over two ajacent scales sharpens an enhances major eges while suppressing small sharp features. Fig. (2) as an illustration shows the effectiveness of N _ Corr in representing the locations of eges an other significant features of images. Banpass irectional subbans Lowpass subban Fig. (): ecomposition framewor of NSCT. In contrast with contourlet transform, nonsubsample laplacian pyrami(nlp) structure an nonsubsample irectional filter bans (NFB) are employe in NSCT. The NLP structure is achieve by using two-channel nonsubsample 2 filter bans. The NFB is achieve by switching off the ownsamplers/upsamplers in each twochannel filter ban in the FB tree structure an upsampling the filters accoringly. As a result, NSCT is shift-invariant an leas to better frequency selectivity an regularity. Fig. () shows the ecomposition framewor of NSCT The Construction of the Optimal Geometrical Information in its Inter-Scale Spaces In wavelet omain, the irect correlation of wavelet coefficients was use by Xu an co-worers to selectively enoise images in an ege-oriente manner [7]. It has been observe that by multiplying the ajacent scales eges coul be sharpen while iluting noise. This paper proposes an NSCT base ege etection scheme by scale multiplication. The NSCT coefficients coming from same irectional subbans at two ajacent scales are multiplie as a prouct function. We efine the function as follows: N _ Corr = N! N () l l + Here, N _ Corr represents the prouct ata of NSCT coefficients in the irection at l an l + scales. Nl an N + are the NSCT coefficients of irection at ajacent l l an l+scales, respectively, where l ( l [, L ]! ", L is the total number of scales) is the number of scales involve in!,, is the total the irect multiplication an ( [ ] number of irections) is the number of irections in corresponing scales. Fig. (2): An illustration of NSCT coefficients in the same irection(where ) at several single scales(where ) an coefficient proucts at corresponing ajacent scales of an horse image. From top left to bottom right: Original image; N _ Corr ; N _ Corr. 2,3 N ; 2 N ; 3 N ; From Fig. (2), we can observe that, in each coefficient space, non-zero ata represent the singularities of source image. In N l spaces, too many ege an texture features are presente that can not istinguish them in an efficient way. spaces, only significant eges an textures In l, l are preserve while small eges an regular parts of source image are eliminate. Therefore, the geometrical information spaces is more effective an tractable. in l, l Next, we nee to exploit an efficient approach to istinguish ifferent ege an texture features in each space. Firstly, we woul lie to introuce a l, l brief review of the banelet transform. The banelet approximation scheme, introuce in [6], taes avantage of geometric image regularity by removing the reunancy of a warpe wavelet transform by performing a baneletization which is efine as reorering the 2 wavelet coefficients an then performing a wavelet transform. The classical tensor wavelet transform of an image is the ecomposition of the latter on an orthogonal basis forme by the translation an ilation of three mother wavelets!,!,! for the horizontal, vertical an iagonal { } H V irections. Once the wavelet transform is foun, the quatree is compute by iviing the image into yaic squares with 4
3 596 The Open Cybernetics & Systemics Journal, 205, Volume 9 Zhang Pai variable sizes (refer to [6] for more information on computing the quatree). For each square in the quatree the optimal geometrical irection is compute by the minimization of a lagrangian (refer also to [6]). Then, a projection of the wavelet coefficients along the optimal irection is performe [6]. Finally, a iscrete wavelet transform is carrie on the projecte coefficients. For each highpass scale of the wavelet transform, the quatree an a zoom on the orientation of the linear flow on each yaic square are require. Notice that the quatree segmentation performs very well. Base on the iea of banelet transform, we compute the optimal geometrical irection of each square with a fixe size in the propose N _ Corr spaces. The best irection is the one that leas to the best compresse representation after the baneletization. If there is no preferential orientation in the square S, then it is better not to perform any baneletization. In this case, we set irection is equal to NULL in the present square S. Fig. (3) as an illustration shows the optimal geometrical information of each square S in one of the N _ Corr spaces of the part of horse image. For the square whose irection is not equal to NULL, we now perform the iscrete reorering of the sampling location. This is one by projecting the sampling location along geometrical irection an sorting the resulting points from left to right. The obtaine numbering of the sampling points efines a iscrete signal f, an then performs a iscrete wavelet transform of f. We enote by { b } the coefficients of the wavelet transform of f. From { b }, one can see that the high wavelet coefficients corresponing to most of ege information are gathere, an this property provies convenience in the following processing. 3. IMAGE ENHANCEMENT ALGORITHM 3.. The Effectiveness of Image Eges Representation in the Inter-Scale Space When encountering a type of images whose targets are possesse of complex strong eges an high contrast texture features while the bacgroun also has complex strong eges but lower contrast texture features, we are incline to capture an enhance the target from complex bacgroun. Traitional enhancement algorithms lose efficacy in solving the problem. To mae full use of the own features of this type of images while processing them has become significant. Refer to [7] pointe out that the steep regions of source image yiel bigger coefficient amplitues in frequency omain while the smooth region is corresponing with small coefficient amplitues. In this section, we woul lie to explore the properties of ifferent ins of ege an texture features representation in propose space. The horse image is still taen as a test image ecompose by NSCT in several scales. Fig (4) shows each inter-space constructe by corresponing N _ Corr (where l = 3, l + = 4 an the total irection num is set as four which is the same in two ajacent scales). Fig. (4): An illustration of inter-scale spaces of all irections. From 2 left to right: Original image; N _ Corr ; N _ Corr ; N _ Corr ; 3 N _ Corr. 4 Fig. (3): The optimal geometrical information of each square S in one of the N _ Corr spaces of the part of horse image. From Fig. (4), it can be observe that the sie face of horse has high contrast textures but not so strong as textures of the front face are transforme into wea eges in the spaces, while the textures of the front face are l, l transforme into strong eges an the textures of the nose are suppresse in the N _ Corr spaces. Hence, it can be conclue that the wea eges in N _ Corr space are the representation of texture features with high contrast in source image. Now, to orientate wea eges accurately in N _ Corr space becomes an important issue. In NSCT omain, the
4 Aaptive Image Enhancement Algorithm with Complex Bacgroun The Open Cybernetics & Systemics Journal, 205, Volume strong eges correspon to those pixels with big-value coefficients in all subbans. The wea eges correspon to those pixels with big-value coefficients in some irectional subbans but small-value coefficients in other irectional subbans within the same scale. The noises correspon to those pixels with small-value coefficients in all subbans. (refer also to [8]).This observation is also effective in spaces. epening on the geometrical irection l, l information of each fixe square region in N _ Corr spaces, we exploit a new approach by aing up to the number of geometrical irections which are unequal to NULL to etermine the class of eges in the present fixe square region. Then, repeat the previous steps to etect other sub-regions. The etaile escription will be taen in the next section The Implement Steps of the Enhancement Algorithm In this section, the implement steps of propose enhancement algorithm can be ivie into four ifferent stages with reference to Fig. (5). Stage I ) Mae the source image via NSCT an illustrate it. The mapping is assume to be of the form: 0 x! N, N2,! NL, xl. Where, Nl is the etail image at { } level l an xl is the approximation at the coarsest level L. Then, N, l =, 2! L is further separate into subbans l 2 accoring to its orientation, namely, Nl = { Nl, Nl,!, Nl } representing irections. Here, the number of irectional subbans at all high-frequency levels is the same with each other, which is for preparation of constructing the inter-scale coefficient prouct spaces in the same irectional subban across ajacent levels. 2) By using the irect spatial multiplication of NSCT coefficients of each same irectional subban at ajacent scales to construct the inter-scale spaces. N _ Corr represents the prouct ata of NSCT coefficients in irection at l an l!, L ", L is l + scales, where l ( [ ] the total number of scales) is the number of scales involve!,, is the total in the irect multiplication an ( [ ] number of irections) is the number of irections in corresponing scales. This is efine as previous section. 3) ivie N _ Corr into subregions (of 4! 4 matrix region) which can be enote as N _ Corr, N _ Corr 2,!, N _ Corr P. P is { } the total number of subregions. Then, we perform banazation to calculate the optimal geometrical irections N _ Corr p! + p as representation of of an efine l, l irection information of each p square region, especially,! p = Inf represents non geometrical information in N _ Corrl, l + p region. Here, we efine a new variable S + to ivie l, l l, l state as follows: S! + into two categories, which is "! # Inf = % & 0 else where l![, L " ],![, ], p [, P] Stage II!. ) In term of the geometric information features pixel by pixel of the NSCT coefficients emonstrate in section 3., we observe that in the same inter-scales, the wea eges probably exist in the sub-region whose! = Inf at a part of irectional subbans while at others,, the strong eges correspon to l, l p Inf (2)! l l + p " Inf,! + " through the whole irectional subbans, the small eges an smooth regions correspon to! " Inf at most of irectional subbans. These properties prompt us the total number of path regions whose! " Inf at all irectional subbans in present inter-scale can be use as a rule to classify the eges. Equation (3) is a statement of the concrete rule.! small ege 0 " ' S < # = 2 ege _ style = % wea ege # " ' S " # 2 = strong ege ' S = & = The threshols of etermining the ege styles are aopte by the test of numerous experiments. We further investigate to generate a map compose of 0 or as the representation of the ifferent type of eges. map (3)! wea ege = " (4) # 0 else 2) Here are two confusing issues: Firstly, owing to the complexity an irregularity of bacgroun in source images, wea eges may also exist in the region of N _ Corr spaces which correspon to the source bacgroun regions. This will cause ba accuracy in capturing the target s regions. Seconly, the strong eges are both in the target s an the bacgroun s region of source images, an how to ientify strong eges of the target region is another issue we nee to solve. To settle these ifficulties, we nee to consier the features of source images once again. Firstly, in source images, owing to the fact that texture features of bacgroun often possess lower contrast an not so steep, their corresponing sub-regions with wea eges in inter-scale woul be scattere an inepenent. Seconly, the target s strong eges are along with its texture features to compose an integral goal.
5 598 The Open Cybernetics & Systemics Journal, 205, Volume 9 Zhang Pai Hence, we affirm that the strong ege regions which surroun the wea ege regions in each inter-scale space are the corresponing eges belonging to the target in source image. In terms of these two analyses, we prouce an operator! " which consists of 3! 3 ernels of the form W = # an # #% & use it to operate the map matrix (formula 5). The function of this operator is to reset the centre element value, which can coincie with most of the neighbors aroun it in the present 3! 3 region. This implementation can remove the single region with singularity in the inter-scale spaces, meanwhile preserving the objective strong ege regions. The following formula is a statement of the concrete rule of the operator. map # if ( map( p + i, p + j) 6 % i! " = & %' 0 [ [,] j! " else The element values of new map matrix can represent the belongings of corresponing sub-regions exactly in interscale spaces. Now, we achieve in capturing the target s region in the source. In the next stage, we woul lie to exploit an effective approach to enhance the objective region. Stage III ) The mapl, l +,!, l [, L ]![, ], p [, P] (5)! ", an! are use as the information to operate NSCT corresponing irectional subbans in previous l!, L ". For the finest scale ( l = L ) represents l scale [ ] most of the strong eges feature, we are not taing it into account here. In orer to highlight the objective region, an operation is performe by enhancing the target meanwhile weaening the bacgroun. At each highpass irectional map p! + p as subban in NSCT omain, by using, l, l the rule, the corresponing sub-regions can be etermine whether to enhance or not. The concrete rule is shown as follows: [, ]; &[, ],!" enhance mapl l + p = sub # regionl =, "% weaen mapl, l + = 0 p & P 2) To provie an effective way in enhancing the objective region, we propose a new enhancement metho name Bb (has been mentione in algorithm by consiering { } previous section) as each sub-region s ata. The B- algorithm is implemente as follows: firstly, the threshol of each{ b } is calculate respectively in formula (7). Then, the coefficients greater than the threshol are regare as the high coefficients which represent the eges information in (6) the { b }, we enhance them with a suitable weight (here, it is set to 3). The corresponing formula is shown as follows: meian( b i, j ) T =, b( i, j)!{ b } (7) "# b( i, j)! 3 b( i, j) > T b( i, j) = %, b( i, j) { b } #& b( i, j) b( i, j) < T (8) here, b( i, j ) represents each coefficient of { } Stage IV b. Perform inverse wavelet transform on each { b }. Then, by using the processe coefficients reconstruct the enhance image via inverse NSCT. Source image Forwar NSCT Construct the inter-scale space Compute the optimal geometrical irections B- enhancement algorithm Inverse NSCT Enhance image Fig. (5): Schematic iagram of propose fusion algorithm. Intelligent setch technology is base on the stuy of esign thining, setches behavior, its characteristics, the paper Setch esign technology an computer support, each of which has its own strengths an weanesses [8]. It will be a very useful wor if their avantages are combine together. Especially, now the CA technology which orients the etaile esign stage has evelope perfectly. It can guarantee the support an assistance of the computer for the entire esign process, consistently unifying the entire esign process. Moreover, the outstaning characteristics of the computer itself are boun to raise the level of efficiency an esign at the early esign stage. Especially, it can enhance the setch esign innovation performance through smart innovation an technology. The ey to intelligent setch technology is in-epth unerstaning of the raft plan to the behavior. Setching behavior an esign thining are closely relate. The setches capture inherent human behavior thining outsie or concrete which is a necessary extension of the visual image of the esigner s perception. Intelligent setch technology for computer support, accoring to the characteristics of the computer itself, can be roughly ivie into four categories: Natural interaction behavior smart setch; Setch of expression an freeom of freehan setch input; esign intent capture an setch recognition; an setch-base geometric moeling. Fig. () shows the
6 Aaptive Image Enhancement Algorithm with Complex Bacgroun The Open Cybernetics & Systemics Journal, 205, Volume computer support han-painte ceramic pattern setches technology framewor. 4. EXPERIMENTAL RESULTS In this section, two typical images with complex ege an texture features are taen as the experimental images. Our aim is to capture an enhance the target from bacgroun accurately. We compare the enhancement results by the propose algorithm with those by the B- algorithm in wavelet transform an enhancement algorithm in NSCT omain. In the first experiment, the input is a butterfly in the littery grass as shown in Fig. (6). From Fig. (7), we can observe that the propose algorithm removes most of the ege an texture features belonging to the bacgroun an also performs excellent result in enhancing the objective region in the test image when compare with other two liste methos. Fig. (7): Cactus image enhancement results. From top to bottom: Original image; enhance image base B- in wavelet omain; Enhance image base NSCT enhancement algorithm; Enhance image base the propose algorithm. Fig. (6) Butterfly image enhancement results. From top to bottom: Original image; enhance image base B- in wavelet omain; Enhance image base NSCT enhancement algorithm; Enhance image base the propose algorithm. From Fig. (6), it can be observe that, in the enhance image of B- enhancement algorithm in wavelet omain metho, some of the eges an textures from bacgroun are preserve an enhance unexpectely, which causes the final experimental result to be unsatisfactory in visual observation. The reason is that, the wavelets lac the important feature of irectionality an hence, they are not efficient in retaining textures an fine etails of images in wavelet omain. NSCT enhancement algorithm oes better jobs in enhancing the wea eges in the textures an istinguishing wea eges from noises, but losing efficacy in capturing the objective region an hence its enhance result is not excellent in visual appearance either. Our experiments show that the propose approach outperforms other enhancement methos in visual effect. Fig. (7), as a escription of a coccinella septempunctata in the cereus, will give another strong example. CONCLUSION In this paper, we propose a new algorithm in capturing an enhancing the objective region from an image with complex texture an ege features. The approach base on NSCT, by using the coefficient proucts of each inter-scale an the corresponing geometrical irection information in the propose spaces, we can etect the location of the target accurately from source image. Then, we project a B- algorithm to enhance the target. The simulation results inicate that the propose metho is visually superior to others in preserving an enhancing eges an textures of target. CONFLICT OF INTEREST The author confirms that this article content has no conflict of interest. ACKNOWLEGEMENTS eclare none. REFERENCES [] A. Laine, J. Fan, an W. Yang, Wavelets for contrast enhancement of igital mammography, IEEE Engineering in Meicine an Biology, pp , 995.
7 600 The Open Cybernetics & Systemics Journal, 205, Volume 9 Zhang Pai [2] S. ippel, M. Stahl, R. Wiemer, an T. Blaffert, Multiscale contrast enhancement for raiographies: Laplacian pyrami versus fast wavelet transform, IEEE Transactions in Meical Imaging, vol. 2, no. 4, pp , [3] K. V. Vele, Multi-scale color image enhancement, Proceeings of IEEE International Conference on Image Processing, vol. 3, pp , 999. [4] A. L. Cunha, J. Zhou, an M. N. o, The nonsubsample contourlet transform: theory, esign an applications, IEEE Transactions on Image Processing, vol. 5, pp , [5] M. N. o an M. Vetterli, The contourlet transform: An efficient irectional multiresolution image representation, IEEE Transactions on Image Processing, vol. 4, pp , [6] G. Peyr, an S. Mallat, Surface compression with geometric banelets, ACM Transactions on Graphics (TOG), vol. 24, no.3, pp , [7] Y. Xu, J. B. Weaver,. M. Healy, an J. Lu, Wavelet transform omain filters: A spatially selective noise filtration technique, IEEE Transactions on Image Processing, vol. 3, pp , 994. [8] J. Zhou, A. L. Cunha an M. N. o, Nonsubsample contourlet transform: Construction an application in enhancement, Proceeings on IEEE International Conference on Image, vol., pp. 469, Receive: September 6, 204 Revise: ecember 23, 204 Accepte: ecember 3, 204 Zhang Pai.; Licensee Bentham Open. This is an open access article license uner the terms of the Creative Commons Attribution Non-Commercial License ( which permits unrestricte, non-commercial use, istribution an reprouction in any meium, provie the wor is properly cite.
Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationZero Disparity Filter Based on Wavelet Representation in an Active Vision System
IEEE ICSP'96, Beiing, China Huang Yu etal Zero isparity Filter Base on Wavelet Representation in an Active Vision System Huang Yu, Yuan Baozong Institute o Inormation Science, Northern Jiaotong University,
More informationText Particles Multi-band Fusion for Robust Text Detection
Text Particles Multi-ban Fusion for Robust Text Detection Pengfei Xu, Rongrong Ji, Hongxun Yao, Xiaoshuai Sun, Tianqiang Liu, an Xianming Liu School of Computer Science an Engineering Harbin Institute
More informationTight Wavelet Frame Decomposition and Its Application in Image Processing
ITB J. Sci. Vol. 40 A, No., 008, 151-165 151 Tight Wavelet Frame Decomposition an Its Application in Image Processing Mahmu Yunus 1, & Henra Gunawan 1 1 Analysis an Geometry Group, FMIPA ITB, Banung Department
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationI. Introuction With the evolution of imaging technology, an increasing number of image moalities becomes available. In remote sensing, sensors are use
A multivalue image wavelet representation base on multiscale funamental forms P. Scheuners Vision Lab, Department ofphysics, University ofantwerp, Groenenborgerlaan 7, 00 Antwerpen, Belgium Tel.: +3/3/8
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationTexture Recognition with combined GLCM, Wavelet and Rotated Wavelet Features
International Journal of Computer an Electrical Engineering, Vol.3, No., February, 793-863 Texture Recognition with combine GLCM, Wavelet an Rotate Wavelet Features Dipankar Hazra Abstract Aim of this
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
More informationRefinement of scene depth from stereo camera ego-motion parameters
Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho
More information5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)
5th International Conference on Avance Design an Manufacturing Engineering (ICADME 25) Research on motion characteristics an application of multi egree of freeom mechanism base on R-W metho Xiao-guang
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationA multiple wavelength unwrapping algorithm for digital fringe profilometry based on spatial shift estimation
University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 214 A multiple wavelength unwrapping algorithm for
More informationReversible Image Watermarking using Bit Plane Coding and Lifting Wavelet Transform
250 IJCSNS International Journal of Computer Science an Network Security, VOL.9 No.11, November 2009 Reversible Image Watermarking using Bit Plane Coing an Lifting Wavelet Transform S. Kurshi Jinna, Dr.
More informationFeature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory
Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationOn the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems
On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationRough Set Approach for Classification of Breast Cancer Mammogram Images
Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems
More informationSMART IMAGE PROCESSING OF FLOW VISUALIZATION
SMAR IMAGE PROCESSING OF FLOW VISUALIZAION H Li (A Rinoshika) 1, M akei, M Nakano 1, Y Saito 3 an K Horii 4 1 Department of Mechanical Systems Engineering, Yamagata University, Yamagata 99-851, JAPAN Department
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationIMAGE ENHANCEMENT USING NONSUBSAMPLED CONTOURLET TRANSFORM
IMAGE ENHANCEMENT USING NONSUBSAMPLED CONTOURLET TRANSFORM Rafia Mumtaz 1, Raja Iqbal 2 and Dr.Shoab A.Khan 3 1,2 MCS, National Unioversity of Sciences and Technology, Rawalpindi, Pakistan: 3 EME, National
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationExploring Context with Deep Structured models for Semantic Segmentation
APPEARING IN IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, APRIL 2017. 1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en
More informationMultilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis
Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT
More informationExploring Context with Deep Structured models for Semantic Segmentation
1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en Hengel, Ian Rei between an image patch an a large backgroun image region. Explicitly moeling
More informationEFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra
th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical
More information0607 CAMBRIDGE INTERNATIONAL MATHEMATICS
CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 03 series 0607 CAMBRIDGE INTERNATIONAL MATHEMATICS 0607/4 Paper 4 (Extene), maximum
More information0607 CAMBRIDGE INTERNATIONAL MATHEMATICS
PAPA CAMBRIDGE CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Seconary Eucation MARK SCHEME for the May/June 0 series CAMBRIDGE INTERNATIONAL MATHEMATICS /4 4 (Extene), maximum
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationFast Window Based Stereo Matching for 3D Scene Reconstruction
The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department
More informationDigital fringe profilometry based on triangular fringe patterns and spatial shift estimation
University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 4 Digital fringe profilometry base on triangular
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationWavelet-Based Multiscale Anisotropic Diffusion with Adaptive Statistical Analysis for Image Restoration
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Wavelet-Base Multiscale Anisotropic Diffusion with Aaptive Statistical Analysis for Image Restoration Junmei Zhong Huifang Sun TR008-067 November
More informationParallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm
NASA/CR-1998-208733 ICASE Report No. 98-45 Parallel Directionally Split Solver Base on Reformulation of Pipeline Thomas Algorithm A. Povitsky ICASE, Hampton, Virginia Institute for Computer Applications
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationA Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images
A Comparative Evaluation of Iris an Ocular Recognition Methos on Challenging Ocular Images Vishnu Naresh Boeti Carnegie Mellon University Pittsburgh, PA 523 naresh@cmu.eu Jonathon M Smereka Carnegie Mellon
More informationTexture Defect Detection System with Image Deflection Compensation
Texture Defect Detection System with Image Deflection Compensation CHUN-CHENG LIN CHENG-YU YEH Department of Electrical Engineering National Chin-Yi University of Technology 35, Lane 15, Sec. 1, Chungshan
More informationConsidering bounds for approximation of 2 M to 3 N
Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for
More informationCalculation on diffraction aperture of cube corner retroreflector
November 10, 008 / Vol., No. 11 / CHINESE OPTICS LETTERS 8 Calculation on iffraction aperture of cube corner retroreflector Song Li (Ó Ø, Bei Tang (», an Hui Zhou ( ï School of Electronic Information,
More informationA FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES
A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES Archana.S 1 an Srihar.S 2 1 Department of Information Science an Technology, College of Engineering, Guiny archana.santhira@gmail.com
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationFSRM Feedback Algorithm based on Learning Theory
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 699-703 699 FSRM Feedback Algorithm based on Learning Theory Open Access Zhang Shui-Li *, Dong
More informationDense Disparity Estimation in Ego-motion Reduced Search Space
Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationDistributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationAN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY
AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE D CIRCULAR ULTRASONIC PHASED ARRAY S. Monal Lonon South Bank University; Engineering an Design 103 Borough Roa, Lonon
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationNET Institute*
NET Institute* www.netinst.org Working Paper #08-24 October 2008 Computer Virus Propagation in a Network Organization: The Interplay between Social an Technological Networks Hsing Kenny Cheng an Hong Guo
More informationChapter 5 Proposed models for reconstituting/ adapting three stereoscopes
Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,
More informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
More informationAdjacency Matrix Based Full-Text Indexing Models
1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationReconstructing the Nonlinear Filter Function of LILI-128 Stream Cipher Based on Complexity
Reconstructing the Nonlinear Filter Function of LILI-128 Stream Cipher Base on Complexity Xiangao Huang 1 Wei Huang 2 Xiaozhou Liu 3 Chao Wang 4 Zhu jing Wang 5 Tao Wang 1 1 College of Engineering, Shantou
More informationESTIMATION OF VISUAL QUALITY OF INJECTION-MOLDED POLYMER PANELS
ESTIMATION OF VISUAL QUALITY OF INJECTION-MOLDED POLYMER PANELS J. Jay Liu an John F. MacGregor McMaster Avance Control Consortium, Department of Chemical Engineering, McMaster University. Hamilton, ON
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationA Duality Based Approach for Realtime TV-L 1 Optical Flow
A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More information1 Surprises in high dimensions
1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic
More informationPERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING
PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING PAMELA RUSSELL ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. Birchall an Teor prove that
More informationInuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem
Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art
More informationExercises of PIV. incomplete draft, version 0.0. October 2009
Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary
More informationEstimating Velocity Fields on a Freeway from Low Resolution Video
Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department
More informationDetecting Overlapping Communities from Local Spectral Subspaces
Detecting Overlapping Communities from Local Spectral Subspaces Kun He, Yiwei Sun Huazhong University of Science an Technology Wuhan 430074, China Email: {brooklet60, yiweisun}@hust.eu.cn Davi Binel, John
More informationDepth Sizing of Surface Breaking Flaw on Its Open Side by Short Path of Diffraction Technique
17th Worl Conference on Nonestructive Testing, 5-8 Oct 008, Shanghai, China Depth Sizing of Surface Breaking Flaw on Its Open Sie by Short Path of Diffraction Technique Hiroyuki FUKUTOMI, Shan LIN an Takashi
More informationEFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER
FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In
More informationParticle Swarm Optimization with Time-Varying Acceleration Coefficients Based on Cellular Neural Network for Color Image Noise Cancellation
Particle Swarm Optimization with Time-Varying Acceleration Coefficients Base on Cellular Neural Network for Color Image Noise Cancellation Te-Jen Su Jui-Chuan Cheng Yang-De Sun 3 College of Information
More informationInvestigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal
991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea
More informationDESIGNING STEGANOGRAPHIC DISTORTION USING DIRECTIONAL FILTERS. Vojtěch Holub and Jessica Fridrich
DESIGNING STEGANOGRAPHIC DISTORTION USING DIRECTIONAL FILTERS Vojtěch Holub an Jessica Fririch Department of ECE, SUNY Binghamton, NY, USA {vholub1, fririch}@binghamton.eu ABSTRACT This paper presents
More informationCompressive sensing image-fusion algorithm in wireless sensor networks based on blended basis functions
Tong et al. EURASIP Journal on Wireless Communications and Networking 2014, 2014:150 RESEARCH Open Access Compressive sensing image-fusion algorithm in wireless sensor networks based on blended basis functions
More informationLakshmish Ramanna University of Texas at Dallas Dept. of Electrical Engineering Richardson, TX
Boy Sensor Networks to Evaluate Staning Balance: Interpreting Muscular Activities Base on Inertial Sensors Rohith Ramachanran Richarson, TX 75083 rxr057100@utallas.eu Gaurav Prahan Dept. of Computer Science
More informationA Novel NSCT Based Medical Image Fusion Technique
International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 3 Issue 5ǁ May 2014 ǁ PP.73-79 A Novel NSCT Based Medical Image Fusion Technique P. Ambika
More informationTHE increasingly digitized power system offers more data,
1 Cyber Risk Analysis of Combine Data Attacks Against Power System State Estimation Kaikai Pan, Stuent Member, IEEE, Anré Teixeira, Member, IEEE, Milos Cvetkovic, Member, IEEE, an Peter Palensky, Senior
More informationDual Arm Robot Research Report
Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA
More informationUnknown Radial Distortion Centers in Multiple View Geometry Problems
Unknown Raial Distortion Centers in Multiple View Geometry Problems José Henrique Brito 1,2, Rolan Angst 3, Kevin Köser 3, Christopher Zach 4, Pero Branco 2, Manuel João Ferreira 2, Marc Pollefeys 3 1
More informationIMAGE SUPER RESOLUTION USING NON SUB-SAMPLE CONTOURLET TRANSFORM WITH LOCAL TERNARY PATTERN
IMAGE SUPER RESOLUTION USING NON SUB-SAMPLE CONTOURLET TRANSFORM WITH LOCAL TERNARY PATTERN Pikin S. Patel 1, Parul V. Pithadia 2, Manoj parmar 3 PG. Student, EC Dept., Dr. S & S S Ghandhy Govt. Engg.
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationAdvanced method of NC programming for 5-axis machining
Available online at www.scienceirect.com Proceia CIRP (0 ) 0 07 5 th CIRP Conference on High Performance Cutting 0 Avance metho of NC programming for 5-axis machining Sergej N. Grigoriev a, A.A. Kutin
More informationAdaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots
Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More information