This study evaluates the seismic response of an existing two stories RC building using non-linear analysis. The original model was resized and there were obtained two buildings designed under two different methodologi...This study evaluates the seismic response of an existing two stories RC building using non-linear analysis. The original model was resized and there were obtained two buildings designed under two different methodologies to fulfill the Venezuelan codes requirements for a high seismic hazard. An elastic analysis was applied to the original building in order to verify interstory drifts;the resizing building it was designed under requirements of strong column-wake beam condition. A third building was modeled according to the seismic displacement design procedure. It were performed non-linear static analysis and 2D and 3D dynamic analyses, obtaining capacity curves, structural ductility, structural performance point, global and interstory drifts for each building. Torsional effects for the resizing building were also computed from 3D analysis. In the original building it was obtained a weak seismic behavior, while resized buildings presented good seismic performance under the Limits States evaluated in this study.展开更多
Content aware image resizing(CAIR)is an excellent technology used widely for image retarget.It can also be used to tamper with images and bring the trust crisis of image content to the public.Once an image is processe...Content aware image resizing(CAIR)is an excellent technology used widely for image retarget.It can also be used to tamper with images and bring the trust crisis of image content to the public.Once an image is processed by CAIR,the correlation of local neighborhood pixels will be destructive.Although local binary patterns(LBP)can effectively describe the local texture,it however cannot describe the magnitude information of local neighborhood pixels and is also vulnerable to noise.Therefore,to deal with the detection of CAIR,a novel forensic method based on improved local ternary patterns(ILTP)feature and gradient energy feature(GEF)is proposed in this paper.Firstly,the adaptive threshold of the original local ternary patterns(LTP)operator is improved,and the ILTP operator is used to describe the change of correlation among local neighborhood pixels caused by CAIR.Secondly,the histogram features of ILTP and the gradient energy features are extracted from the candidate image for CAIR forgery detection.Then,the ILTP features and the gradient energy features are concatenated into the combined features,and the combined features are used to train classifier.Finally support vector machine(SVM)is exploited as a classifier to be trained and tested by the above features in order to distinguish whether an image is subjected to CAIR or not.The candidate images are extracted from uncompressed color image database(UCID),then the training and testing sets are created.The experimental results with many test images show that the proposed method can detect CAIR tampering effectively,and that its performance is improved compared with other methods.It can achieve a better performance than the state-of-the-art approaches.展开更多
Graphical representation of hierarchical clustering results is of final importance in hierarchical cluster analysis of data. Unfortunately, almost all mathematical or statistical software may have a weak capability of...Graphical representation of hierarchical clustering results is of final importance in hierarchical cluster analysis of data. Unfortunately, almost all mathematical or statistical software may have a weak capability of showcasing such clustering results. Particularly, most of clustering results or trees drawn cannot be represented in a dendrogram with a resizable, rescalable and free-style fashion. With the “dynamic” drawing instead of “static” one, this research works around these weak functionalities that restrict visualization of clustering results in an arbitrary manner. It introduces an algorithmic solution to these functionalities, which adopts seamless pixel rearrangements to be able to resize and rescale dendrograms or tree diagrams. The results showed that the algorithm developed makes clustering outcome representation a really free visualization of hierarchical clustering and bioinformatics analysis. Especially, it possesses features of selectively visualizing and/or saving results in a specific size, scale and style (different views).展开更多
A simple and effective content-aware image resizing method is proposed based on the row / column merging and improved importance diffusion,which preserves the important regions in an image as well as the global visual...A simple and effective content-aware image resizing method is proposed based on the row / column merging and improved importance diffusion,which preserves the important regions in an image as well as the global visual effect. By repeatedly merging two rows / columns into one row / column or inserting a new row /column between two rows / columns, this method realizes image-resolution reduction and expansion. The importance of the merged row / column is promoted and diffused to four rows / columns around the merged one,which is to avoid the unwanted image distortions resulted from excessively merging of un-important regions. In addition,the proposed method introduces the direction of gradient vector in the low-pass filter to reduce the interference caused by complex texture background and protect important content better. Furthermore,according to human mechanics principles,different weights are given to the row and column direction components of gradient vectors which can obtain better global visual effect. Experimented results show that the proposed method satisfied in not only visual effect but also objective evaluation.展开更多
Straightforward image resizing operators without considering image contents (e.g., uniform scaling) cannot usually produce satisfactory results, while content-aware image retargeting aims to arbitrarily change image...Straightforward image resizing operators without considering image contents (e.g., uniform scaling) cannot usually produce satisfactory results, while content-aware image retargeting aims to arbitrarily change image size while preserving visually prominent features. In this paper, a cluster-based saliency-guided seam carving algorithm for content- aware image retargeting is proposed. To cope with the main drawback of the original seam carving algorithm relying on only gradient-based image importance map, we integrate a gradient-based map and a cluster-based saliency map to generate a more reliable importance map, resulting in better single image retargeting results. Experimental results have demonstrated the efficacy of the proposed algorithm.展开更多
We propose a novel scheme, called on-line cache resizing (OCR), to dynamically resize the cache and meet the size requirement of each application. At each periodic interval, the scheme gathers the cache hit-miss sta...We propose a novel scheme, called on-line cache resizing (OCR), to dynamically resize the cache and meet the size requirement of each application. At each periodic interval, the scheme gathers the cache hit-miss statistics at runtime using an extra tag array. These executing statistics serve as inputs to an analytical model of cache energy. The scheme uses energy as a primary metric to dynamically increase/decrease the number of active cache ways for the next interval. The scheme minimizes the active cache size to save energy with minimal performance loss. The simulation with SPEC 2000 benchmarks shows that OCR results in an average of 38.4% energy saving compared with fixed-size caches, with only 2.0% performance loss.展开更多
Face detection is applied to many tasks such as auto focus control, surveillance, user interface, and face recognition. Processing speed and detection accuracy of the face detection have been improved continuously. Th...Face detection is applied to many tasks such as auto focus control, surveillance, user interface, and face recognition. Processing speed and detection accuracy of the face detection have been improved continuously. This paper describes a novel method of fast face detection with multi-scale window search free from image resizing. We adopt statistics of gradient images (SGI) as image features and append an overlapping cell array to improve detection accuracy. The SGI feature is scale invariant and insensitive to small difference of pixel value. These characteristics enable the multi-scale window search without image resizing. Experimental results show that processing speed of our method is 3.66 times faster than a conventional method, adopting HOG features combined to an SVM classifier, without accuracy degradation.展开更多
For speckle-correlation-based scattering imaging,an iris is generally used next to the diffuser to magnify the speckle size and enhance the speckle contrast,which limits the light flux and makes the setup cooperative....For speckle-correlation-based scattering imaging,an iris is generally used next to the diffuser to magnify the speckle size and enhance the speckle contrast,which limits the light flux and makes the setup cooperative.Here,we experimentally demonstrate a non-iris speckle-correlation imaging method associated with an image resizing process.The experimental results demonstrate that,by estimating an appropriate resizing factor,our method can achieve high-fidelity noncooperative speckle-correlation imaging by digital resizing of the raw captions or on-chip pixel binning without iris.The method opens a new door for noncooperative high-frame-rate speckle-correlation imaging and benefits scattering imaging for dynamic objects hidden behind opaque barriers.展开更多
Content-aware image resizing is a kind of new and effective approach for image resizing, which preserves image content well and does not cause obvious distortion when changing the aspect ratio of images. Recently, a s...Content-aware image resizing is a kind of new and effective approach for image resizing, which preserves image content well and does not cause obvious distortion when changing the aspect ratio of images. Recently, a seam based approach for content-aware image resizing was proposed by Avidan and Shamir. Their results are impressive, but because the method uses dynamic programming many times, it is slow. In this paper, we present a more efficient algorithm for seam based content-aware iraage resizing, which searches seams through establishing the matching relation between adjacent rows or columns. We give a linear algorithm to find the optimal matches within a weighted bipartite graph composed of the pixels in adjacent rows or columns. Therefore, our method is fast (e.g. our method needs only about 100 ms to reduce a 768x1024 Image's width to 1/3 while Avidan and Shamir's method needs 12 s). This supports immediate image resizing whereas Avidan and Shamir's method requires a more costly pre-processing step to enable subsequent real-time processing. A fast method such as the one proposed will be also needed for future real-time video resizing applications.展开更多
From a visual point of view, the shape of an image is mainly determined by the edges. Conventional polynomial interpolation of image enlarging methods would produce blurred edges, while edge-directed interpolation bas...From a visual point of view, the shape of an image is mainly determined by the edges. Conventional polynomial interpolation of image enlarging methods would produce blurred edges, while edge-directed interpolation based methods would cause distortion in the non-edge areas. A new method for image enlarging is presented. The image is enlarged in two steps. In the first step, a fitting surface is constructed to interpolate the image data. To remove the zigzagging artifact for each pixel, a fitting patch is constructed using edge information as constraints. The combination of all the patches forms the fitting surface which has the shape suggested by image data. Each point on the fitting surface can be regarded as a sampling point taken from a unit square domain, which means that when the fitting surface is used to enlarge the image, each sampling domain of the enlarged pixels is also a unit square, causing the enlarged image to lose some details. To make the enlarged image keep the details as many as possible, the sampling domain of the enlarged pixels should be less than a unit square. Then, in the second step, using the points taken from the fitting surface, new pixels are computed using constrained optimization technique to form the enlarged image, and the size of the sampling domain of the enlarged pixels is inversely proportional to the size of the enlarged image. The image enlarged by the new method has a quadratic polynomial precision. Comparison results show that the new method produces resized image with better quality.展开更多
We address several load shedding techniques over sliding window joins. We first construct a dual window architectural model including aux-windows and join-windows, and build statistics on aux-windows. With the statist...We address several load shedding techniques over sliding window joins. We first construct a dual window architectural model including aux-windows and join-windows, and build statistics on aux-windows. With the statistics, we develop an effective load shedding strategy producing maximum subset join outputs. In order to accelerate the load shedding process, binary indexed trees have been utilized to reduce the cost on shedding evaluation. When streams have high arrival rates, we propose an approach incorporating front-shedding and rear-shedding, and find an optimal trade-off between them. As for the scenarios of variable speed ratio, we develop a plan reallocating CPU resources and dynamically resizing the windows. In addition, we prove that load shedding is not affected during the process of reallocation. Both synthetic and real data are used in our experiments, and the results show the promise of our strategies.展开更多
Current multi-operator image resizing methods succeed in generating impressive results by using image similarity measure to guide the resizing process. An optimal operation path is found in the resizing space. However...Current multi-operator image resizing methods succeed in generating impressive results by using image similarity measure to guide the resizing process. An optimal operation path is found in the resizing space. However, their slow resizing speed caused by inefficient computation strategy of the bidirectional patch matching becomes a drawback in practical use. In this paper, we present a novel method to address this problem. By combining seam carving with scaling and cropping, our method can realize content-aware image resizing very fast. We define cost functions combing image energy and dominant color descriptor for all the operators to evaluate the damage to both local image content and global visual effect. Therefore our algorithm can automatically find an optimal sequence of operations to resize the image by using dynamic programming or greedy algorithm. We also extend our algorithm to indirect image resizing which can protect the aspect ratio of the dominant object in an image.展开更多
文摘This study evaluates the seismic response of an existing two stories RC building using non-linear analysis. The original model was resized and there were obtained two buildings designed under two different methodologies to fulfill the Venezuelan codes requirements for a high seismic hazard. An elastic analysis was applied to the original building in order to verify interstory drifts;the resizing building it was designed under requirements of strong column-wake beam condition. A third building was modeled according to the seismic displacement design procedure. It were performed non-linear static analysis and 2D and 3D dynamic analyses, obtaining capacity curves, structural ductility, structural performance point, global and interstory drifts for each building. Torsional effects for the resizing building were also computed from 3D analysis. In the original building it was obtained a weak seismic behavior, while resized buildings presented good seismic performance under the Limits States evaluated in this study.
文摘Content aware image resizing(CAIR)is an excellent technology used widely for image retarget.It can also be used to tamper with images and bring the trust crisis of image content to the public.Once an image is processed by CAIR,the correlation of local neighborhood pixels will be destructive.Although local binary patterns(LBP)can effectively describe the local texture,it however cannot describe the magnitude information of local neighborhood pixels and is also vulnerable to noise.Therefore,to deal with the detection of CAIR,a novel forensic method based on improved local ternary patterns(ILTP)feature and gradient energy feature(GEF)is proposed in this paper.Firstly,the adaptive threshold of the original local ternary patterns(LTP)operator is improved,and the ILTP operator is used to describe the change of correlation among local neighborhood pixels caused by CAIR.Secondly,the histogram features of ILTP and the gradient energy features are extracted from the candidate image for CAIR forgery detection.Then,the ILTP features and the gradient energy features are concatenated into the combined features,and the combined features are used to train classifier.Finally support vector machine(SVM)is exploited as a classifier to be trained and tested by the above features in order to distinguish whether an image is subjected to CAIR or not.The candidate images are extracted from uncompressed color image database(UCID),then the training and testing sets are created.The experimental results with many test images show that the proposed method can detect CAIR tampering effectively,and that its performance is improved compared with other methods.It can achieve a better performance than the state-of-the-art approaches.
文摘Graphical representation of hierarchical clustering results is of final importance in hierarchical cluster analysis of data. Unfortunately, almost all mathematical or statistical software may have a weak capability of showcasing such clustering results. Particularly, most of clustering results or trees drawn cannot be represented in a dendrogram with a resizable, rescalable and free-style fashion. With the “dynamic” drawing instead of “static” one, this research works around these weak functionalities that restrict visualization of clustering results in an arbitrary manner. It introduces an algorithmic solution to these functionalities, which adopts seamless pixel rearrangements to be able to resize and rescale dendrograms or tree diagrams. The results showed that the algorithm developed makes clustering outcome representation a really free visualization of hierarchical clustering and bioinformatics analysis. Especially, it possesses features of selectively visualizing and/or saving results in a specific size, scale and style (different views).
基金Sponsored by the Natural Science Foundation of China(Grant No.61371099)the Heilongjiang Province Programs for Science and Technology Development(Grant No.GC12A305)
文摘A simple and effective content-aware image resizing method is proposed based on the row / column merging and improved importance diffusion,which preserves the important regions in an image as well as the global visual effect. By repeatedly merging two rows / columns into one row / column or inserting a new row /column between two rows / columns, this method realizes image-resolution reduction and expansion. The importance of the merged row / column is promoted and diffused to four rows / columns around the merged one,which is to avoid the unwanted image distortions resulted from excessively merging of un-important regions. In addition,the proposed method introduces the direction of gradient vector in the low-pass filter to reduce the interference caused by complex texture background and protect important content better. Furthermore,according to human mechanics principles,different weights are given to the row and column direction components of gradient vectors which can obtain better global visual effect. Experimented results show that the proposed method satisfied in not only visual effect but also objective evaluation.
基金supported by“MOST”under Grants No.105-2628-E-224-001-MY3 and No.103-2221-E-224-034-MY2
文摘Straightforward image resizing operators without considering image contents (e.g., uniform scaling) cannot usually produce satisfactory results, while content-aware image retargeting aims to arbitrarily change image size while preserving visually prominent features. In this paper, a cluster-based saliency-guided seam carving algorithm for content- aware image retargeting is proposed. To cope with the main drawback of the original seam carving algorithm relying on only gradient-based image importance map, we integrate a gradient-based map and a cluster-based saliency map to generate a more reliable importance map, resulting in better single image retargeting results. Experimental results have demonstrated the efficacy of the proposed algorithm.
基金The High Technology Research and Development Program of China (No.2006AA01Z226)the Natural Science Foundation of Hubei (No.2007ABD002)the Ministry of Education-INTEL Information Technology Foundation (No.MOE-INTEL-08-05)
文摘We propose a novel scheme, called on-line cache resizing (OCR), to dynamically resize the cache and meet the size requirement of each application. At each periodic interval, the scheme gathers the cache hit-miss statistics at runtime using an extra tag array. These executing statistics serve as inputs to an analytical model of cache energy. The scheme uses energy as a primary metric to dynamically increase/decrease the number of active cache ways for the next interval. The scheme minimizes the active cache size to save energy with minimal performance loss. The simulation with SPEC 2000 benchmarks shows that OCR results in an average of 38.4% energy saving compared with fixed-size caches, with only 2.0% performance loss.
文摘Face detection is applied to many tasks such as auto focus control, surveillance, user interface, and face recognition. Processing speed and detection accuracy of the face detection have been improved continuously. This paper describes a novel method of fast face detection with multi-scale window search free from image resizing. We adopt statistics of gradient images (SGI) as image features and append an overlapping cell array to improve detection accuracy. The SGI feature is scale invariant and insensitive to small difference of pixel value. These characteristics enable the multi-scale window search without image resizing. Experimental results show that processing speed of our method is 3.66 times faster than a conventional method, adopting HOG features combined to an SVM classifier, without accuracy degradation.
基金supported by the National Natural Science Foundation of China(No.62005317)the National Key R&D Program of China(No.2020YFA0713504)the Natural Science Foundation of Hunan Province,China(No.2021JJ40695)。
文摘For speckle-correlation-based scattering imaging,an iris is generally used next to the diffuser to magnify the speckle size and enhance the speckle contrast,which limits the light flux and makes the setup cooperative.Here,we experimentally demonstrate a non-iris speckle-correlation imaging method associated with an image resizing process.The experimental results demonstrate that,by estimating an appropriate resizing factor,our method can achieve high-fidelity noncooperative speckle-correlation imaging by digital resizing of the raw captions or on-chip pixel binning without iris.The method opens a new door for noncooperative high-frame-rate speckle-correlation imaging and benefits scattering imaging for dynamic objects hidden behind opaque barriers.
基金Supported by National Natural Science Foundation of China (Grant Nos.60575002 and 60641002)
文摘Content-aware image resizing is a kind of new and effective approach for image resizing, which preserves image content well and does not cause obvious distortion when changing the aspect ratio of images. Recently, a seam based approach for content-aware image resizing was proposed by Avidan and Shamir. Their results are impressive, but because the method uses dynamic programming many times, it is slow. In this paper, we present a more efficient algorithm for seam based content-aware iraage resizing, which searches seams through establishing the matching relation between adjacent rows or columns. We give a linear algorithm to find the optimal matches within a weighted bipartite graph composed of the pixels in adjacent rows or columns. Therefore, our method is fast (e.g. our method needs only about 100 ms to reduce a 768x1024 Image's width to 1/3 while Avidan and Shamir's method needs 12 s). This supports immediate image resizing whereas Avidan and Shamir's method requires a more costly pre-processing step to enable subsequent real-time processing. A fast method such as the one proposed will be also needed for future real-time video resizing applications.
基金This work was supported by the National Natural Science Foundation of China under Grant Nos. 61020106001, 61332015, 61272430, and 61373078.
文摘From a visual point of view, the shape of an image is mainly determined by the edges. Conventional polynomial interpolation of image enlarging methods would produce blurred edges, while edge-directed interpolation based methods would cause distortion in the non-edge areas. A new method for image enlarging is presented. The image is enlarged in two steps. In the first step, a fitting surface is constructed to interpolate the image data. To remove the zigzagging artifact for each pixel, a fitting patch is constructed using edge information as constraints. The combination of all the patches forms the fitting surface which has the shape suggested by image data. Each point on the fitting surface can be regarded as a sampling point taken from a unit square domain, which means that when the fitting surface is used to enlarge the image, each sampling domain of the enlarged pixels is also a unit square, causing the enlarged image to lose some details. To make the enlarged image keep the details as many as possible, the sampling domain of the enlarged pixels should be less than a unit square. Then, in the second step, using the points taken from the fitting surface, new pixels are computed using constrained optimization technique to form the enlarged image, and the size of the sampling domain of the enlarged pixels is inversely proportional to the size of the enlarged image. The image enlarged by the new method has a quadratic polynomial precision. Comparison results show that the new method produces resized image with better quality.
基金This work is supported by the National Natural Science Foundation of China under Grant Nos. 60473074, 60573089 and National Grand Fundamental Research 973 Program of China under Grant No. 2006CB303103.
文摘We address several load shedding techniques over sliding window joins. We first construct a dual window architectural model including aux-windows and join-windows, and build statistics on aux-windows. With the statistics, we develop an effective load shedding strategy producing maximum subset join outputs. In order to accelerate the load shedding process, binary indexed trees have been utilized to reduce the cost on shedding evaluation. When streams have high arrival rates, we propose an approach incorporating front-shedding and rear-shedding, and find an optimal trade-off between them. As for the scenarios of variable speed ratio, we develop a plan reallocating CPU resources and dynamically resizing the windows. In addition, we prove that load shedding is not affected during the process of reallocation. Both synthetic and real data are used in our experiments, and the results show the promise of our strategies.
基金supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. 60872120, 60902078, 61172104the Natural Science Foundation of Beijing under Grant No. 4112061+2 种基金the Scientific Research Foundation for the Returned Overseas Chinese Scholars of State Education Ministry of Chinathe French System@tic Paris-Region (CSDL Project)the National Agency for Research of French (ANR)-NSFC under Grant No. 60911130368
文摘Current multi-operator image resizing methods succeed in generating impressive results by using image similarity measure to guide the resizing process. An optimal operation path is found in the resizing space. However, their slow resizing speed caused by inefficient computation strategy of the bidirectional patch matching becomes a drawback in practical use. In this paper, we present a novel method to address this problem. By combining seam carving with scaling and cropping, our method can realize content-aware image resizing very fast. We define cost functions combing image energy and dominant color descriptor for all the operators to evaluate the damage to both local image content and global visual effect. Therefore our algorithm can automatically find an optimal sequence of operations to resize the image by using dynamic programming or greedy algorithm. We also extend our algorithm to indirect image resizing which can protect the aspect ratio of the dominant object in an image.