text:
Starring: Gary Cole Hank Azaria Elizabeth Perkins Russell Brand
Learn more about Hop (DVD + Blu-ray Limited Time Combo Pack):
Format: Blu-Ray DVD
Manufacturer: Universal Home Video
Sku: 227839986
Category Keywords: Computer Animation Drummers Families Family (General) Fantasy Friendships
See more in Family & Kids
Big Game, Big Ears.
|See DVD for this synopsis
"...plenty of wit, verve and surreal mayhem... The Hollywood Reporter
Editor's NoteJobless slacker Fred (James Marsden) discovers that hares make horrible houseguests after injuring the Easter Bunny (Russell Brand) and agreeing to nurse the little hopper back to health in this animated comedy from the writers of DESPICABLE ME, and director Tim Hill (ROCKO'S MODERN LIFE, SPONGEBOB SQUAREPANTS). For the past 4,000 years, the Easter Bunny has brought joy and candy to kids all across the globe; however, the time has come for a new Easter Bunny to take over the tradition. But while EB is the next in line to receive the official title, he couldn't care less about becoming the official bearer of chocolate eggs and jellybeans. Escaping to Hollywood in a bid to find fame and fortune, EB hops in front of an oncoming car driven by Fred, who agrees to give him a place to recover until he's healthy enough to hop along home. Now, the harder Fred struggles to stop his furry new companion from sending his life into a tailspin, the more satisfaction he begins to get out of his newfound responsibility. With a little luck and a whole lot of patience, Fred just might become the man who saved Easter for everyone.
Cast & Crew
|Gary Cole
|Hank Azaria
|Elizabeth Perkins
|Russell Brand
|James Marsden
|Kaley Cuoco
|Cici Lau - Co-Star
|Jayden Lund - Co-Star
|Veronica Alicino - Co-Star
|Chelsea Handler - Co-Star
|David Goldsmith - Co-Star
|Christian Long - Co-Star
|Tiffany Espensen - Co-Star
|Dustin Ybarra - Co-Star
|Jimmy Lee Carter - Co-Star
|Billy Bowers - Co-Star
|Benjamin Moore Jr. - Co-Star
|Eric Dwight McKinnie - Co-Star
|Joey Anthony Williams - Co-Star
|Tracy Roman Pierce - Co-Star
|Will Cleveland Smith - Co-Star
|Coleton Ray - Co-Star
|Nick Drago - Co-Star
|Mark Riccardi - Co-Star
|Rick Pasqualone - Co-Star
|Carlease Burke - Co-Star
|David Hasselhoff - Co-Star
|Hugh Hefner - Voice
|Hugh Laurie - Voice
|Greg Lewis - Co-Star
|Peter Lyons Collister - Director of Photography
|Don Diers - Set Decorator
|Tom Johnson - Sound Re-Recording
|Alan E. Lorimer - Special Effects Supervisor
|John A. Moio - Stunt Coordinator
|William H. Schirmer - Special Effects
|Joy Zapata - Hairstylist
|Ann Scibelli - Sound
|Michele Panelli-Venetis - Assistant Director
|Rhythm & Hues, Inc. - Animation
|Rhythm & Hues, Inc. - Visual Effects Designer
|Ken Daurio - Screenwriter
|Ken Daurio - Story
|Brian Lynch - Screenwriter
|Cinco Paul - Screenwriter
|Cinco Paul - Story
|Julianne Jordan - Music Director
|Albert Delgado - Special Effects
|Gary Rizzo - Sound Re-Recording
|Leigh Shanta - Production Manager/UPM
|Paul Vigil - Special Effects
|Elena Arroy - Makeup Designer
|Chris Bailey - Animation Supervisor
|Chris Bailey - Character Design
|Bryon Rickerson - Music Editor
|Andrew Arnett - Animation Supervisor
|Mark Simone - Optical/Digital Effects
|Peter DeSeve - Character Design
|Jennifer Dozier - Costumes
|Jeannine Berger - Post-Production Supervisor
|Michele Imperato Stabile - Production Manager/UPM
|Rocky Gehr - Special Effects
|Christopher Lennertz - Composer
|Lorraine Cruden - Production Manager/UPM
|Clark James - Special Effects
|Hal Selig - Special Effects
|Tim Hill - Director
Annie (2012)
|, Nominee, Character Animation in a Live Action Production


text:
Keyword: autosampler ×
Metrohm - Model MMS 5000 - Autosamplerby Metrohm AG based in Herisau, SWITZERLAND
MMS 5000 Autosampler from Analytik Jena for use with the Metrohm Combustion IC for fully automatic analysis of liquid and solid samples. In order to match the modular Multi-Matrix sampler with the correct sample type, either the liquid kit (6.7303.000) or the solid kit (6.7302.000) must be used.
GE - Autosamplerby GE Analytical Instruments based in Boulder, COLORADO (USA)
The GE Autosampler succeeds the Sievers 900 Autosampler and features a robust new design for handling high-volume laboratory applications. The GE Autosampler easily integrates with the Sievers 900 Laboratory, 900 Portable, 900 Portable Turbo (in normal mode only), 5310 C Laboratory, and InnovOx Laboratory TOC Analyzers.
InMotion Autosamplersby Mettler - Toledo Int. Inc based in Greifensee, SWITZERLAND
Multiple sample automation with peristaltic sampling for low viscous samples. The perfect solution for the beverage industry.
InMotion Autosamplersby Mettler - Toledo Int. Inc based in Greifensee, SWITZERLAND
Flexible and Efficient Autosamplers: Automation in a laboratory today has high demands for a variety of samples and workflows. Automation is no longer just going from sample to sample for analysis. From eliminating process order and transcription errors of sample information to complex cleaning and environmental control and protection for ...
CETAC - Model ASX-8000 Series - OEM Autosamplerby Teledyne CETAC Technologies based in Omaha, NEBRASKA (USA)
The CETAC ASX-8000 series autosampler is a small-footprint, versatile XYZ workstation designed to be robust and user friendly. It can be applied to many OEM applications including HPLC, UHPLC, Nano-LC, LC-MS, fraction collection, micro sampling, buffer exchange, liquid handling and more. The ASX-8000 autosampler
CETAC - Model ASX-500 Series - OEM Autosampler Platformby Teledyne CETAC Technologies based in Omaha, NEBRASKA (USA)
The platform that started it all, CETAC Automation first produced the ASX-500 autosampler in 1993 in response to customer demand. Now with over 10,000 robust systems, the ASX-500 has become known as the workhorse. The ASX–500 platform is customizable for a wide range of automation applications, including AA, ICP, ICP-MS, TOC, UV-VIS, ...
Model ASX-6000 - OEM Autosamplerby Teledyne CETAC Technologies based in Omaha, NEBRASKA (USA)
The ASX-6000 series autosampler maximizes sample throughput while minimizing lab bench space. Keeping with tradition of what you expect from CETAC OEM Automation.
CETAC - Model ASX-7000 - OEM Autosampler Platformby Teledyne CETAC Technologies based in Omaha, NEBRASKA (USA)
CETAC Automation ASX-7000 autosampler platform was developed to handle the specific requirements of OEM customers needing robust, high-precision automation. The ASX-7000 autosampler provides the accuracy needed to operate with 384 micro-titer wells and injection ports and is able to perform difficult operations
Karl Fischer Oven Autosamplerby Mettler - Toledo Int. Inc based in Greifensee, SWITZERLAND
More Efficient KF Titration: In combination with a V30 or C30 Karl Fischer titrator the Stromboli KF oven autosampler enables up to 14 samples to be titrated in unattended operation.
Model ASI-L Autosampler - Total Organic Carbon Analyzerby Shimadzu Scientific Instruments Inc based in Columbia, MARYLAND (USA)
With the TOC-L series, a variety of options provides diverse functional enhancements.

subset: commoncrawl


text:
By Stephen J. Kotz
Southampton Town Supervisor Anna Throne-Holst told the Bridgehampton Citizens Advisory Committee on Monday that the town was ready to move quickly on the proposed Bridgehampton Gateway development.
The supervisor said she would have a resolution ready for Tuesday's town board meeting to fund the completion of a study, which she said was already about 80 percent done, so the town could officially launch the process of having the site on the south side of Montauk Highway across from the Bridgehampton Commons shopping center designated as a Planned Development District (PDD).
"We can put this on a pretty fast track," she said.
Ms. Throne-Holst appeared at the meeting with Kyle Collins, the town's planning and development administrator, developer Greg Konner, whose company owns the property being eyed for a mixed use development, and representatives of Araiys Design Landscape Architecture.
The CAC said it would support the proposal, and, at Mr. Collins's suggestion, CAC co-chairwoman Nancy Walter-Yvertes, said she would solicit the names of six to eight people from the Bridgehampton community who would begin meeting with Mr. Collins shortly after Thanksgiving to offer suggestions for the scope of the development.
According to preliminary sketches, the development would consist of nine buildings, ranging in size from 4,700 square feet to 15,000 square feet. Eight of them would be designated for some type of commercial use. A total of 28 subsidized apartments would be built on the second floor of those buildings. An additional eight apartments that would be rented at "market rates" would occupy their own building to the rear of the property overlooking Kellis Pond.
Mr. Collins said the development would try "to build on the agricultural heritage of Bridgehampton with a farmstead theme." That means architects would take their design cues from barns and other typical farm buildings. The buildings would be arrayed around a one-acre "pasture" off Montauk Highway, with parking and access roads tucked behind and largely out of sight from the road.
Although committee members in the past have said the development would offer a better location for a CVS pharmacy than the site on the other end of Bridgehampton's shopping district that is being considered for one, Mr. Konner said no such plan is in the works at this early stage.
CAC member Julie Burmeister fretted about whether Mr. Konner would be able to find tenants. "We've had enough trouble keeping tenants at the Commons," she said.
"I've had lots of people asking. I'll have no problem renting them," replied Mr. Konner.
Others said they didn't want to be promised a number of small-scale stores and find themselves staring at a Home Depot or some other big box store.
Committee members also had questions about how the apartments would be managed, who would qualify for the subsidized units and what impact the development would have on schools.
Although most assumed the development would be in the Bridgehampton School District, and provide a tax boon to it, it actually is in the Southampton School District, so any children living there would go to Southampton public schools, as would the tax dollars generated by the development.
No matter what school district the project is in, the tax dollars raised "will vastly outweigh the cost of any kids going to school," said Mr. Collins. He also cited demographic studies that have shown the number of children entering the schools would be limited, even if most of the apartments were two-bedroom units.
CAC members also asked about whether the development would be pedestrian friendly. Mr. Collins assured them it would be much more so than the Commons, which consists of stores surrounding a huge central parking lot. He also said access to the site would be directly across from the Commons, where there is already a traffic light.
Mr. Collins told the board the town has long sought to coordinate the development at the site, given its position as a gateway to Bridgehampton. That was always difficult, he said, because the site consisted of several different pieces. Those individual lots are all controlled by the Konners now, which will make it easier to review the site at once rather than "having a piecemeal application before the planning board," he said.
Plans for the site were first considered as part of the town's comprehensive plan update in 1999 and again in 2004 when the Bridgehampton Hamlet Study was done. A concept plan centering around a proposed 50,000-square-foot Barnes & Noble bookstore were also aired in 2008, but
Fire Commissioner Race
The committee also heard from Phil Cammann, an advanced emergency medical technician, and John O'Brien, a long-time firefighter and former chief, both of whom are seeking the one opening on the Bridgehampton Board of Fire Commissioners. The seat is a five-year term, and voting takes place on December 9.
Mr. Cammann promised better communication between the fire district and citizens, while Mr. O'Brien cited his nearly 40 years of service on the department.


text:
Il semble que votre langue préférée soit Francais.
If you are traveling in a large group, let our sister site - Hostelbookers, tailor an expert solution for you.
Roof hostel is located in the capital of Central Chernozem Region. We're situated on the 1st floor of a new 16-story...
Plus d'info »
Hostel Voronezh offers you a quality budget accommodation in nice place.
Plus d'info »


text:
Mav's a n00b (American Fork Canyon)
It seems like it has been ages since I hit the western portion of the TAT. A lot has happened between then and now--like entering the actual adult world(Blows P.s). I've spend about two years without a bike, henceforth known as the dark ages. However, I'm BACK!
We hit riding hard late April, early May. We even had an extra rider this year. Nothing is a true Maverickchick story without some drama and gore though. So true to Mav fashion someone ate it big, and had to be transported via ambulance to the hospital. Now I know you are thinking, Mav is bound to go to the hospital at one point--she falls like 50 times a day.
Wrong. My little sister had been riding for a month or so, when she missed a corner out in the west desert. Total fluke accident, she went up and off the road--about a foot climb. I was right behind her when she hit the ground and she was was screaming, 14 year old dramatic flair I thought. Wrong again. Long story short she ended up taking a bar to the tummy wrong and ended up in a children's hospital for a week with Spleen, liver and lung damage. She is safely home now, and will be crusin' around on a 4 wheeler until she wants to get back on a bike.
On to the less depressing stuff--
OURAY, CO in August 2013!! Hopefully we will be able to schedule Hancock pass for a little 'Web-redemption' , cue Tosh.0.
So to get me back into the swing of things, we are riding American Fork in Utah. This area is known to be a little sketch, so it will be the perfect training ground for my (hopefully) triumphant return. I'm planning on documenting our weekend trips to AF here, and then will be doing a longer and in-depth one about day trippin' in Colorado.
This was our weekly ride to Mineral Basin in American Fork Canyon. It's been a good two years since I've been in the dirt--and it shows.

n00b shows the wannabes
Good goin MCHick. Sorry bout the lil sis' gut shot. She got the actual injuries most of us only feared while writhing and gasping from the handlebar punch.
Re: your AmFork training rides, I saw you'd been up Mineral Fork too, lighten up girl. That steep rock garden riding is baptism by fire. But ain't the scenery grand? When you stop?
I figure to scout the 157 ridge trail on the mountain bike but you could GoPro it for me so I don't get self in to extreme heavy lifting with the DR650.
For training I'd recommend feet on the pegs, standing single track riding with fewer rocks. It's tough to get a rhythm and feel for the bike in a bounce and bash climb like that 194 to Forest Lake route. The trick is to maintain momentum when you get knocked out of your line. That kind of riding requires looking ahead, scanning alternate lines through the obstacles and making quick decisions. That said, you're full adventure! The GoPro doesn't do justice to the challenge there.
You should try the single track in the Stansburys between South Willow and North Willow but ride it early in the morning this time of year.
That does NOT look like fun at all....but the scenery is magnificent!
I'll bet gearing down a couple of teeth would really cut down on the stalls, and make like easier for the clutch.
I was dabbing in that rock field just to keep my balance, no way I could maintain speed in that situation yet. Oh well, I'll get back in the groove one day :evil
I'm actually more apt to try stuff with massive boulders than single track. I saw a couple of YouTube video's with some wicked switchbacks--and those right handers...Which,actually leads me into my next post for last weekend when we took the trials bike out to play.:clap
Thank you for your recommendations and words of encouragement :D
Mav struggles on the Trials bike
I know I know, I've been slacking on the updates.To keep any interested parties updated--we've still been hitting American Fork.
We tried Mineral fork again--this time with my mom and sister on the ATV. Needless to say they didn't like being brought there. I managed to hit the same rock and tip the rock and tip the bike in the exact same spot. However, I was able to get out with zero stalls and on my first try. Any progress is progress I guess :D
Well, my pops thought that mineral basin would be slightly easier to get up on a four wheeler. My conclusion is nope! I rode this beast a couple of times while we were there. Let's just say I will for sure be sticking to my two wheels. :lol3

My favorite parts are around 1:18 and 5:11
As the title suggests, we did take the trials bike again. My dad was convinced if I gave it more time--that it would work out better for me. So I do try. Well previously I had semi conquered this steep foot path-esque route to the river. I say previously because I rookied it, and hit a step at a weird angle. My dad and I both thought that I had spun out the back tire--but the video shows all (upload soon)! Anyywayss I try it on the trials bike three times--and none of them are pretty. I hit a root and got knocked forward--effectively burning the crap out of my right leg. And I cant seem to manage to stay on those pegs...going up I take a rock, get knocked backwards and feet off the pegs, going down get knocked backwards grab clutch and speedy demon down the sketchiness...I do however have a blast on it driving through the little streams though.
Lots of people, I feel like assume Utah is just a giant desert where nothing green grows. We did happen upon some beautiful single track. The sand pit? Oh don't mind that.
Needless to say the trials bike is going up for sale. Yes I probably am being a premature quitter, but I'm content with the 525.
for punishment. That four wheeler video looks made for masochists. Give me a bike any day but I'm starting to wonder about your Pop and all the boulders. Am Fork is crazy beautiful and I've been back again too. May just jump over Guardsman's and back that way if the weather's not to gnarly after I get my new tire on this afternoon.
I hope that tire didn't give you crap, and you made it over to Guardsmans!
different boulders
Where is that single track? Is it up by Bakers fork?
I found a single track that looked very similar to that up snake creek that eventually dropped down into AF canyon. Thanks for the report.
Speaking of....We leave tomorrow :evil Happy Friday to me
Link to where we were sitting when we saw the track:
We went to the top of the FR420 and while talking about where to go next my buddy spotted the single track - it took us south to just above forrest lake where we had to bail down into AF canyon and head home. Fun run but no cake walk.
Do either of you know if the trail to pittsburg lake is reachable via motorcycle?
40.579379,-111.582624 (enter this coordinate in google earth)
We used to ride to Pittsburg Lake in the early 70's on our Huskys and I think that's still open. I'm not such a fan of riding a heavier bike in that terrain but keep finding myself in it.
I rode to Forest Lake on the AmFork side but didn't attempt the 171 link from there up to 157.
I'm still interested in trying your 420 to 157 all the way to Timp and back but need to borrow a lighter bike for the single track. If nothing else, it would look a bit ridiculous to encounter an old dude on a DR650 with windshield up there. Especially if you had to help him pick it up:D
|Times are GMT -7. It's 11:17 AM.
Powered by vBulletin® Version 3.8.5
Copyright ©2000 - 2015, Jelsoft Enterprises Ltd.
Copyright ADVrider 2011-2015


text:
When you've been living in a country for a long time, you often forget to explore it properly. It's always great to jet off on a relaxing holiday abroad, but then you don't actually get to see everything the UK has to offer. This summer, why not plan to take some time to investigate parts of your home country instead? Taking the car is a great way to see the countryside and gives you the flexibility to make the most of your trip. Here are a few areas where you can set off driving on some of the best road trips in the UK:
Snowdonia National Park is full of classic Welsh beauty in the form of green valleys, rugged mountains and lots of wildlife to see. If you're feeling energetic, Snowdon, the highest mountain in Wales, makes a great climb, but there are also plenty of small market towns to enjoy a more relaxing side of Wales. Stay in our Porthmadog Hotel to be near the famous charming town of Portmeirion, and the Welsh coast too.
Peak District
Drive from our Ashbourne Hotel to Buxton, making your way through Wirksworth and Bakewell and you'll see some of the most idyllic countryside in Britain's first national park. The Peak District is all about rolling hills and farmland, as well as quaint little market towns. If promises of Bakewell tarts aren't enough to keep the kids excited, you could always add in a trip to nearby Alton Towers Theme Park too.
Scottish Highlands
Edinburgh is a great place to begin a drive in beautiful Scotland, so book a room in one of our Edinburgh Hotels for a few days. Then, drive to the spectacular Stirling Castle, and on to the natural wonder and richly historic place that is the valley of Glencoe. Move up from there to stay in our Fort William Hotel, before making the drive up to the beautiful Isles, which are unlike anywhere else in the world. There's no better way to explore Skye and The Orkneys than at your own pace by car.
Cornish Coast
The Atlantic Highway will get you down to Cornwall in no time, but once you get there, don't expect to move anywhere quickly. This is partly due to the wiggly little Cornish roads and partly due to the amazing views you can see from them. Every new turn or hill promises a new vista, of waves crashing against cliffs or of the perfect sandy beaches. This is a great road trip to go on with little kids, as there is nothing like the seaside for keeping them entertained. Stay in our Newquay Seafront Hotel and our Hayle Hotel along the way.
Lake District
Start at our Penrith Hotel, then drive to Ambleside and the famous Lake Windemere. From there, head to Coniston, but before you arrive, turn off onto the spectacular Wrynose and Hardknott passes, which require a head for heights and a steady hand on the wheel! But the views are absolutely worth it. Continue onto Carlisle via Cockermouth and you will have seen the best of what the Lake District has to offer.
Like this article? Share it with your friends.


text:
Take your picture to view with frames
upload image
Login to save and select your images.
Select a face below to view with frames
Includes 1.59 Index Single Vision Lenses
Phat Farm 603 Brown eyeglasses are all about clean, polished lines with an urban vibe! These rectangular eyeglasses come in a semi-rimless style in brown acetate.About the Brand
Dress them up or dress them down, Phat Farm eyeglasses have a versatile look that fuses contemporary urban culture with preppy lifestyle. Phat Farm is a brand that breaks boundaries and strives to set a new standard in eyewear.


text:
"Hunger Games" Party at MPL!
The Manchester Public Library is having a Hunger Games party! Come celebrate Katniss, Peeta and all things Mockingjay during vacation week. We'll have trivia, games and challenges of skill, strategy and creativity, crafts and District snacks. Dress up as your favorite character... prize for best costume.
Space is limited - sign up now!
When:Wednesday, April 18, 2012 1:00PM


text:
Originally written on Fox Sports North | Last updated 3/20/13
FORT MYERS, Fla. (AP) -- Samuel Deduno entered spring training with an outside chance of making the Minnesota Twins' rotation. His performance at the World Baseball Classic might have given him an edge. Deduno is scheduled to return to Twins spring training camp Thursday after helping the Dominican Republic beat Puerto Rico 3-0 in the championship game of the WBC. Deduno pitched five innings of two-hit ball to earn the win. "It was fun to watch," Twins manager Ron Gardenhire said Wednesday, when the game between Tampa Bay Rays and Minnesota was rained out. "It was very, very enjoyable to watch him out there. We were very happy to let him go over there, and now we're happy to get him back. I think it says an awful lot about him." With less than two weeks until the start of regular season, the Twins now will figure out how to fit Deduno into exhibition games as he rejoins the competition for the fifth spot in the rotation. He is up against Cole De Vries, P.J. Walters and Liam He...
Comments are closed.
What do you think?To leave a comment, you can:
MLB News
Delivered to your inbox
You'll also receive Yardbarker's daily Top 10, featuring the best sports stories from around the web. Customize your newsletter to get articles on your favorite sports and teams. And the best part? It's free!
Follow us on Twitter
|Best of Yardbarker
|NFL News
|MLB News
Today's Best Stuff
For Bloggers
Join the Yardbarker Network for more promotion, traffic, and money.
Company Info
What is Yardbarker?
Yardbarker is the largest network of sports blogs and pro athlete blogs on the web. This site is the hub of the Yardbarker Network, where our editors and algorithms curate the best sports content from our network and beyond.
|© 2015 Yardbarker, Inc. All rights reserved. Use of this website (including any and all parts and components) constitutes your acceptance of these Terms of Use and Privacy Policy. (What's New?)


text:
Sunday, August 12, 2012
© Copyright 2015 Gwinnett Daily Post
SUWANEE -- Sometimes the best compliments come from an opposing team.
For the North Gwinnett Blaze, a travel softball team of girls 12-and-under, they came from a coach of a team based in St. Louis.
"The heart these girls have, and the coaching these girls have, if there's one team that I'd like to see make the finals, it's you guys," coach Chris Wilbur said.
The Blaze, based out of George Pierce Park, last week finished fifth in an Amateur Softball Association of America 12-U Fastpitch National Championship in Moline, Ill. The tournament consisted of 83 teams from 20 states.
After a bye, the Blaze went 5-2 with wins over teams from Illinois, California, Ohio, Georgia, Missouri and Texas. It lost to two teams from California.
"We like to say, 'Shut them down on defense and talk with our bats,'" Wilbur said.
Many of the team's players have been together for seven and eight years as they began in T-ball leagues at George Pierce Park. Seven players of the team attend North Gwinntt High School. The core of this group, though, has been together for about two years when it became a travel team.
In its second year competing in a 10-U division, the Blaze advanced to a national tournament in Chattanooga, Tenn.
But before this season, Wilbur said he wouldn't have imagined a top finish.
"If you would have told me we'd finish fifth, back then, I would have thought you were crazy," he said.
More like this story
- YOUTH ROUNDUP: North Gwinnett Blaze takes fifth at Nationals ( August 12, 2012 )
- Youth roundup: Georgia Elite national runner-up ( August 2, 2009 )
- Pierce takes over Collins Hill softball ( June 2, 2011 )
- Ice places second at World Series ( August 13, 2011 )
- YOUTH ROUNDUP: Hodge wins gold at AAU national championship ( August 14, 2010 )


text:
Stock Photo:
portrait of beautiful woman
- Image ID: 93409648
- Copyright: thuatha
- Release Information: Signed model release filed with Shutterstock, Inc
High quality images curated from over 150 countries.
Over 50 million photos, vectors, illustrations, and more.
Simple and flat pricing by image or by month.
Over 230,000 images downloaded every day.


text:
Commish unhappy about public fights
Updated: May 27, 2009, 8:41 PM ETAssociated Press
DESTIN, Fla. -- Southeastern Conference commissioner Mike Slive didn't use notes and didn't know how long he spoke. His message to his football coaches and athletic directors Wednesday couldn't be clearer: Stop the public verbal sparring of the past few months. Now.
"I had all 5-9, 170 pounds of me into every word I said," Slive said.
Slive hasn't been happy about the string of public exchanges over the past few months, almost all involving new Tennessee coach Lane Kiffin.
Coaches ...
Read full story
You must be signed in to post a comment
You are fully responsible for the content you post. Content that includes profanity, personal attacks or antisocial behavior (such as "spamming" or "trolling"), or other inappropriate content or material will be removed. We reserve the right to block any user who violates our terms of use, including removing all content posted by that user.


text: Andre & Calvin's top 10 tips for kids As the offspring of the Dog Whisperer, you definitely learn a thing or two about dogs. Being around dogs, big and small, aggressive and shy, old and young, Andre and Calvin Millan have picked up on some of their father's methods and techniques and want to share some of the most important tips for kids. Read more


text:
+ - Choose what to pay for Radiohead's new album->
Submitted by Matt
Matt writes: Radiohead are offering their latest album as a download several weeks before the CD comes out, and you get to choose how much to pay. $1,000 or $0.00, it's entirely up to you. The band are free of a record contract for this, their seventh album, so are free to pursue as many wacky plans as they like.
Link to Original Source
Link to Original Source


text:
Preparation for College and Career!
Our college preparatory General Studies program has been carefully crafted to prepare Fasman Yeshiva High School students for entrance into leading universities. Our knowledgeable staff has the experience and ability to transmit their subjects to each student at his level of understanding. Our comprehensive general education, which includes Advanced Placement college level courses and SAT and or ACT preparation offers each student a personalized learning experience. Both the Limudei Kodesh and General Studies programs are designed to prepare our young men to be the leaders of their communities and chosen professions, and to instill a desire to continue the pursuit of knowledge throughout their lives.
The ideal student-teacher ratio provides for individualized instruction and the inclusion of all students in the classroom discussion. Through the General Studies program, Fasman Yeshiva High School students are encouraged to pursue their interests with the knowledge that they are learning from experienced teachers and mentors who can help guide their educational and career choices throughout their years in the Yeshiva.
Most classes are taught on multiple levels.
General Studies Curriculum
|Linear Algebra
|Pre-Calculus, Calculus
U.S. Government & Politics
|World History
|U. S. History
|Algebra 2
Computer Applications
Computer Science
Preparation for Torah Life!
HTC will say Kaddish to honor the memories of your parents or loved ones and notify you of the upcoming yahrzeit. Additionally, we can establish a plaque in memory of a deceased.
We engage our students in a variety of opportunities to serve the local and global community, working with community partners to provide meaningful, hands-on learning for our students while helping members of our community meet their need for knowledgeable, committed volunteers.
Program Components for Accelerated BA/MSc in Occupational Therapy with Rush Universtiy


text:
1923 - 2012
REDLANDS, Calif. – Former College Place resident Gwendolyn "Gwen" Ruth (McEwen) Jensen, 88, died Sept. 5, 2012, of cardio-pulmonary arrest. The memorial service for Gwen was held at Cedar Creek Seventh-day Adventist Church in Cedar Creek, Wash., on Sept. 16, 2012. Her remains were interred at Mt. View Cemetery in Amboy, Wash.
Gwen was born in Tompkins, Saskatchewan, Canada, on Sept. 7, 1923, to Hiram and Rosella McEwen. She graduated from high school at Portland Union Academy in Portland in 1941. She married William "Bill" Emanuel Jensen on Oct. 15, 1942. (They had met at a camp meeting in Gladstone, Ore., when she was 13 years old, and he was 14.) Shortly after their wedding, Bill was drafted into the U.S. Army. After the war, Gwen and Bill worked and began raising a family in Cedar Creek, Wash., until moving to College Place in 1958. They purchased a home on Hillcrest Lane in 1962 and lived there until 2004.
In 2004 Gwen and Bill moved to Spokane in order to be closer to their daughter, Carolynn Bohlman. They lived together there until June 2008 when Bill was killed in a farming accident. Five months later Gwen moved to Redlands, Calif., to be closer to her son, William.
Gwen lived from July 2009, until the time of her death at Mission Commons in Redlands, Calif. Gwen was active in the Seventh-day Adventist Church, teaching Sabbath School to little children for over 30 years. She also loved to cook large Sabbath meals, and most Sabbaths invited friends, neighbors and college students to dine with her family.
Gwen also worked as a bookkeeper for Craik Lumber Co. in Walla Walla for many years, and was later the "G" in B & G Timber Co. where she continued to keep the books for the business she and Bill started and ran until their retirement in the early 1980s.
Gwen and Bill traveled in Asia and the South Pacific after they retired, often volunteering on "Maranatha" mission trips. They also traveled throughout the U.S. in their motorhome. She enjoyed visiting her five children and her seven grandchildren and six great-grandchildren.
Gwen is survived by her four daughters and one son, Carolynn Bohlman of Cheney, Dianne Frost (Jack) of Salinas, Calif., Melinda Blake of Bullhead City, Ariz., Carmen Rima (Rusty) of Bullhead City, Ariz., William Brown-Jensen (Wendy) of Redlands, Calif.; sister, Audrey Lunsford (Joseph) of Calimesa, Calif.; and a brother, Lawrence McEwen (Sandra) of Loma Linda, Calif.; seven grandchildren and six great-grandchildren.
Use the comment form below to begin a discussion about this content.


text:
RR Construction Company
7117 Fitzpatrick Drive
Laurel, MD 20707
Laurel, MD 20707
Your use of our services is governed by our Terms & Conditions
RR Construction Company
Add a special touch to your home with remodeling services from RR Construction Company. We offer unique, custom work. Our staff will work closely with you to ensure all of your goals are met. The strength of our experience brings the service and reliability you can trust. Call today to schedule an appointment.
Services Offered
Carpet & Upholstery Cleaning
Drywall & Plaster
Flooring & Carpet
Handyman Services
Power Washing
Sheds & Enclosures
Window Coverings
Service Area
- Washington
Areas of Expertise
- Renovations
- Custom Remodeling Projects
- Hardwood Refinishing
- Home Maintenance and Repairs
- and Much Moor...
Quick Facts
Business HoursMonday - Friday 8:00 am - 7:00 pm
Saturday - Sunday 8:30 am - 1:00 pm
(Please call to confirm)
- Small Jobs Welcome
- Warranty Offered
- Free Estimates
- Materials
- Warranty Description: 69 days
In Business Since: 2002
State Licensing
Trade: Home Improvement Contractor
License #: 66005369
Expiration: 07-31-2016
Trade: Home Improvement Salesperson
License #: 66005370
Expiration: 07-31-2016
ScreeningHomeAdvisor Screened. View Details
*HomeAdvisor verifies state-level licensing where applicable - note: some states require local or county level licensing and you should verify whether or not your pro is properly licensed.
Business Overview
How We Got Started
I love working in Washington, DC because Reason You Enjoy Working There.
We started in this industry in 2001.
We describe our business as Rooted in the community
RR Construction Company
My Work
1 Projects
RR Construction Company
202-730-19617117 Fitzpatrick Drive
Laurel, MD 20707
Find More
- Washington Appliance Repair & Installation Services
- Washington Cabinet Contractors
- Washington Carpet Cleaning Services
- Washington Deck Builders
- Washington Door Services
- Washington Drywall & Plaster Contractors
- Washington Fence Contractors
- Washington Flooring & Carpet Contractors
- Washington Handyman Services
- Washington Painting Contractors
- Washington Pressure Washing Services
- Washington Shed & Enclosure Builders
- Washington Window Covering Contractors
- Washington Window Replacement Companies


text:
I guess i lied. Sorry guys it's been awhile :(
leoncloud11 Blog
Lol I ain't even dead
by leoncloud11 on Comments
I'll try to keep in touch guys.
I m back and its my 1st anniversary? sort of :P
by leoncloud11 on Comments
Well its been months that ive logged in gamespot im still pretty busy :evil:
And if its right it says on my member since thing ive been a member since august 24 2010
so i guess i have my 1st Anniversary party!!!!!1! WOOOT!:shock:(not really im still pretty busyi dont have time to party lol)
i havent been doing this bloging thing again so my memory is whiped i have no idea what to write about
but i guess i just i ll talk about howi got my name. So it started by........ Whoops look at the time looks like i got to go :? wow im typing jibberish i havent gotten any new games so far but i will on nov 3 my birth day :D
hopefully and i guess thats a wrap well ill talk to you guys later!
by leoncloud11 on Comments
Well i been pretty inactive in gamespot for a while so i decided to make a blog.
Well i ve beaten (psp) modnation racers and little big planet so im gonna write some reviews later and im currently working
on killzone liberation. They're all great games i would reconmend all of them! I m kinda getting bored of summer not much to do anymore and its so Freakin Hot here:cry:! I also tried to fix my xbox's RROD problem with the (penny trick) but it didnt work!:cry: My new plan is to sell my dsi and games and stuff for around ($150) and sell the broken xbox for $40-50
so ill have a total around $200 and the ps3 i want cost $250 so ill have find some way to get $60:? and in this economy
its gonna be harder then it seems :cry:
Well thats it for now i guess
-Leoncloud11 :P
"Hunny Get the kids!!!! " *Goes outside* "Never mind....&
by leoncloud11 on Comments
LoL another reason not to trust crazy christian hobos!
Wow i havent made a blog in loong time :P
Oh i ve gotten FF 7 Crisis Core!!! :D
The game is so Epic and emotional! :cry:
I was playing Goldeneye and there is a 007 movie on rite now :P
Well forget what to write so thats it!!
Leoncloud11 :P
Leoncloud11 hits YOUTUBE :D!!!
by leoncloud11 on Comments
Yes i have i made this epic (lame) video on YOUTUBE!!! :D
Get your popcorn ready!
Ready? ok
Umm we are having some tech issues so....
Go on youtube type in leoncloud98 and click the first video!
Enjoy!!! :D
tell what you think about it in the comments in youtube or here!
Leoncloud11 :P
Earth HOUR!!!!
by leoncloud11 on Comments
Happy Earth hour day :D
If you didnt know it was today you know it NAO It starts at 8:30 and ends at 9:30 so turn off all electric stuff
to conserve the Earths energy! :D
Thats about it.Im might be doing blogs everyday know since i got use to it.
OH i got the CUTEST KITTEH IN THE WORLDZ.hes about 3 weeks old.My ***** cat got pregnant AGAIN!!!!So ill try to give you guys a pic cause thats how bored i am :/
Umm i beaten goldeneye a week ago and im hooked on their multiplayer mode!! :D
I wished you guys with a wii had goldeneye or a interWEBS connection so i could play with ya:/
I wanting to get FF7 crisis core or/and super mario galaxy but i need money!!!
I still cant believe super mario galaxy is still around $30:00 :shock:
yesterday i saw the new Gamespot layout and i didnt like it im glad they changed it back though
so thats it.....this was a huge blog:D
- leoncloud11:P
by leoncloud11 on Comments
I dont what to write its been so long :/
OH YEAH I made a review for you guys as a little make up for my absence :P
I have interWEBS connection in mah house nao so you guys who has Wii's can add me or whatever( im new to the consloe internet thing :P ) I have the wii in mah room so i can watch netflix anytime! :D
Am i that bored talking about netflix.... :P
Does anyone have Goldeneye? or a Wii cause I got no friends on the Wii :cry:
Cause all mah friends just play the ps3 or xbox :roll: I want a ps3. :/
This blog has too many awkward moments so i must stop here!Laterz
Hey Guys IM BACK :D
by leoncloud11 on Comments
Sorry for not being here FOR A LONG TIME :P
Just family and friends things happen out of nowhere :P
I'll write another Bigger blog later:)
-leoncloud11 :D
HAPPY-ALMOST-NEW YEARS Day!!!!!!!
by leoncloud11 on Comments
Well what the title says :P oh and I have a Battlefield Heroes account now so if you have it you can
add me as leoncloud11(duh)


text:
Oh, the complications of being female.
One Thing In Common
Team Edward Team Jacob Team Buffy
People who hate Kristen Stewart
10 Benefits of Having a Cat
Protip: The Bullets Go HORIZONTALLY in the Magazine
Damn It, Google!
We Have No Idea Why We Have to Tell You This!
So Much for Being Free
You Can't Celebrate Independence Without Shooting Hot Dogs ...
Bread Avengers: Getting a Rise Out of Criminals
America Officially Challenges Japan to a Robot Duel
There's a Reason That No Man in Mexico Can Tell You What ...
30 Shower Thoughts You've Never Realized Before
Pick Your Site Name
Tell us more about it


text:
Arena Profile: Ross Baker
Ross K. Baker is Professor of Political Science at Rutgers University. He received his Ph.D. from the University of Pennsylvania. He was a research associate at the Brookings Institution and has served on the staffs of five U.S. Senators and a member of the House.
He was a Fulbright Lecturer in 1992 at the Swedish Institute of International Affairs. His most recent Capitol Hill service was with Senator Chuck Hagel, a Nebraska Republican in 2000 and with Senator Patrick J. Leahy, a Vermont Democrat. In 2008 he was Scholar-in-Residence in the Office of the Majority Leader of the Senate, Senator Harry Reid, Democrat of Nevada. Professor Baker is currently a member of the Board of Contributors of USA Today. His most recent book is the 4th edition of House and Senate, (W.W. Norton: 2008) He is also author of Strangers on a Hill published in 2007 by W.W. Norton.
*All Arena bios and photos are provided by contributors
Ross Baker's Recent Discussions
Will the wealthy bite back at the GOP?
I think that Grover Norquist should come out of the shadows and assume his rightful place as head of the GOP.
He has vastly more influence than Reince Preibus, has more experience than Marco Rubio, is more beloved by the tea party than Jeb Bush, and his Harvard education places him far above those educated in lesser schools such as Paul Ryan.
Besides, he has been the power behind the throne for so long, he might as well claim the throne for himself.See more
Fox News wise to sideline Rove?
A very surprising decision and an even more remarkable place for DeMint to land. The big question is will DeMint remake Heritage or will Heritage remake DeMint? I'm betting on the latter. He will be probably replaced in the Senate by Ted Cruz.See more
A looming tea party backlash?
The hollow threats of a vainglorious windbag.See more
A Romney-Obama friendship?
The initiative should have come from Romney on the day after the election rather than rag on Obama for giving "gifts" in exchange for votes.
Romney would have stood taller in the eyes of Americans if he had called for reconciliation. His first public appearance should have been a press conference calling for compromise on the fiscal cliff, not materializing furtively at Disneyland.See more
Did Chris Christie help Romney lose?
My Republican governor has built strong reputation in this blue state and earned broader acclaim among conservatives for his bluntness and spontaneity.
These qualities were applauded when his barbs were directed at elements of the Democratic base such as the teachers' union and state employees. Somehow these traits are less endearing when he puts away the hatchet and extends an olive branch to a Democratic president when his state us in mortal peril and in need of Washington's help.
His understandable gesture of gratitude to the president probably will hurt him with the South Waziristan branch of the GOP but his unapologetic response to their maledictions will win him many more friends outside the walls of the right wing madrasa.
Posted onDec. 17, 2012
Posted onDec. 15, 2012
Posted onDec. 13, 2012
Posted onDec. 12, 2012
Posted onDec. 11, 2012
Posted onDec. 10, 2012
Posted onDec. 08, 2012
Recent Arenas
- Farewell to the Arena
- Too soon to talk about 2016?
- Should Congress have to work on the fiscal cliff through the holidays?
- Should gun control be discussed?
- Open Mike, Dec. 15-16
- Is Susan Rice right to step aside?
- Has Stephen Colbert run his course?
- Is the U.S. pursuing the right strategy in Afghanistan?
- Will the wealthy bite back at the GOP?
- Open Mike, Dec. 8-9
Arena Referees
Arena Players
Current and Former Elected Officials
- Rep. Jason Altmire
- Former Rep. Michael Arcuri (D-N.Y.)
- Rep. Karen Bass
- Former Rep. Bob Beauprez (R-Colo.)
- Rep. Brian Bilbray
- Rep. Rob Bishop
- Rep. Marsha Blackburn
- Former Ohio SOS Ken Blackwell (R)
- Sen. Richard Blumenthal (D-Conn.)
- Rep. Dan Boren (D-Okla.)
- Rep. Charles Boustany
- State Rep. Brendan Boyle (D-Pa.)
- Rep. Kevin Brady (R-Texas)
- Rep. Mo Brooks
- Rep. Paul Broun
- Former Rep. Ginny Brown-Waite (R-Fla.)
- Ex-SOS Jennifer Brunner
- Rep. Larry Bucshon
- Ed Bunch
- Rep. Michael Burgess
- Rep. Dan Burton (R-Ind.)
- St. Rep. James Byrd
- Rep. Mike Capuano
- Assemblyman Robert Castelli (R-N.Y.)
- Rep. Steve Chabot
- Rep. Steve Cohen (D-Tenn.)
- Rep. Gerald Connolly (D-Va.)
- Former Rep. Artur Davis
- Rep. Norm Dicks (D-Wash.)
- Rep. Mike Doyle
- Former Rep. Philip English
- State Sen. Will Espero
- Rep. Sam Farr
- Former Rep. Martin Frost
- Rep. John Garamendi
- Rep. Cory Gardner
- Rep. Jim Gerlach
- Rep. Charles Gonzalez (D-Texas)
- Jim Greenwood
- Rep. Tim Griffin (R-Ark.)
- Former State Rep. Jason Grill
- Del. Nancy Guthrie
- Former Rep. Jane Harman
- Gov. Gary Herbert
- Rep. Rush Holt
- Rep. Michael Honda (D-Calif.)
- Rep. Randy Hultgren
- Ex-St. House Speaker Rodney Jetton
- Rep. Tim Johnson (R-Ill.)
- Rep. Walter Jones
- Former Sen. Ted Kaufman
- Ex-Rep. Ron Klein
- Rep. Jim Langevin
- Rep. Steve LaTourette
- Rep. Steve LaTourette
- Rep. Barbara Lee
- Rep. Sander Levin
- Rep. Dan Lungren
- Rep. Edward Markey
- State Sen. Tim Mathern (D-N.D.)
- Rep. Brad Miller (D-N.C.)
- St. Sen. Richard Moore
- Rep. Mick Mulvaney
- Former State Rep. David Orentlicher (D-Ind.)
- Rep. Charles Rangel (D-N.Y.)
- Former N.M. Gov. Bill Richardson (D)
- Gov. Christine Todd Whitman and Robert Sisson, President of ConservAmerica
- Rep. Dana Rohrabacher (R-Calif.)
- Rep. Dennis Ross
- Rep. Mike Ross
- Rep. Tim Ryan (D-Ohio)
- Rep. Adam Schiff (D-Calif.)
- Brad Schneider
- Rep. Jose Serrano
- Rep. Brad Sherman (D-Calif.)
- Former State Sen. Jeff Smith (D-Mo.)
- Rep. Marlin Stutzman
- Rep. Mac Thornberry
- Rep. Patrick Tiberi
- Rep. John Tierney
- Sen. Pat Toomey
- Former State Rep. Fran Wendelboe (R)
- Former N.J. Gov. Christine Todd Whitman
- Rep. Frederica Wilson (D-Fla.)
- Rep. Rob Woodall (R-Ga.)
Strategists, Scholars and Authors
- Brad Adgate
- Alfonso Aguilar
- Richard Albert
- Peter Alexander
- Jeanne Allen
- Richard V. Allen
- Luis Alvarado
- John Anzalone
- Jerome Armstrong
- Christopher Arterton
- Leif Babin
- Dean Baker
- Ross Baker
- Krystal Ball
- Joanne Bamberger
- Brad Bannon
- Gary L. Bauer
- Frances Beinecke
- Richard Benedetto
- Mary Frances Berry
- Rick Beyer
- David Biespiel
- Bill Bishop
- Elizabeth Blackney
- David Boaz
- Adam Bonin
- Ron Bonjean
- Robert L. Borosage
- David N. Bossie
- Matthew Brooks
- Lara Brown
- Barry Burden
- William Burke-White
- Jano Cabrera
- Steven G. Calabresi
- Andrea Camp
- James Carafano
- Maria Cardona
- Jamie Chandler
- Inimai Chettiar
- Ron Christie
- Dewey Clayton
- Marjorie Clifton
- David B. Cohen
- Rory Cooper
- Anthony Cordesman
- Jonathan Cowan
- Chester Crocker
- Philip J. Crowley
- Joe Crummey
- Dinesh D'Souza
- Brendan Daly
- Nathan Daschle
- Stephen M. Davidson
- Soren Dayton
- Victoria M. DeFrancesco Soto
- Chris DeRose
- Donna Robinson Divine
- David Donnelly
- Patrick Dorinson
- Greg Dworkin
- Corey Ealons
- Jason Edwards
- Laurel Elder
- Mo Elleithee
- Steve Elmendorf
- Boris Epshteyn
- Ed Espinoza
- Alyssa Farah
- Ron Faucheux
- Michael K. Fauntroy
- Douglas Feith
- Gloria Feldt
- Ken Feltman
- Peter Fenn
- Thomas E. Fiedler
- Terri Fine
- Karen Finney
- Michael Fitts
- Karen Floyd
- Mike Fraioli
- Luke Frans
- Amy Fried
- Diana Furchtgott-Roth
- Frank Gaffney
- Jack Gerard
- Daniella Gibbs Leger
- Lisa Gilbert
- Andra Gillespie
- Tom Giovanetti
- Ed Goeas
- Adam Green
- Edward Gresser
- Christian Grose
- Christopher Hahn
- Gretchen Hamel
- Stefan Hankin
- Mark Hannah
- Tyler Harber
- Trey Hardin
- Chase Hardin
- David A. Harris
- Melissa Harris-Perry
- Gregg Hartley
- Richard Hasen
- Gerald Hebert
- Paul Henderson
- Chris Henick
- Stephen Hess
- Gregory D. Hess
- Scott Hodge
- Scott Hodge
- Donna Hoffman
- Jeffrey Holmstead
- Jason Huff
- Christopher Hull
- Bud Jackson
- Cheri Jacobus
- Timothy Stoltzfus Jost
- Victor Kamber
- Richard Keil
- Phil Kerpen
- Karen Kerrigan
- Sally Kohn
- Tom Korologos
- Celinda Lake
- Elizabeth Lauten
- Jennifer Lawless
- Chris Lehane
- David Leland
- Rabbi Michael Lerner
- Curt A. Levey
- James Andrew Lewis
- Peter Loge
- Steve Lombardo
- Carolyn Lukensmeyer
- Matt Mackowiak
- Elisabeth MacNamara
- Liz Mair
- Sandy Maisel
- Jim Manley
- Thomas E. Mann
- Aaron Mannes
- David Marin
- Mary Anne Marsh
- Will Marshall
- Leslie Marshall
- Joe Mathews
- Jeremy Mayer
- Anita McBride
- Mike McCurry
- Meredith McGehee
- Tom McMahon
- John McNulty
- Sara Mead
- Eliseo Medina
- Lisa Camooso Miller
- Aaron David Miller
- Elissa Miller
- Peter Mirijanian
- Andrea Mitchell
- Rodell Mollineau
- Kirk Monroe
- Molly Moore
- Yousef Munayyer
- Steve Murphy
- Phil Musser
- Josh Nanberg
- Ron Nehring
- Andrew Nesi
- Grover Norquist
- Ben Nuckels
- Ford O'Connell
- Patrick J. O'Neill
- Margie Omero
- Jim Papa
- Michael Parkin
- Scott Paterno
- Stacie Paxton
- Joel Payne
- Christine Pelosi
- Brad Phillips
- Roger Pilon
- James P. Pinkerton and Elaine Kamarck
- Kevin Pirch
- Jason Poblete
- David Polyansky
- Clyde Prestowitz
- Jonathan Prince
- Cortland Putbrese
- Ari Rabin-Havt
- Rachel Racusen
- Nick Ragone
- Michael Ramlet
- Elayne Rapping
- Scott Rasmussen
- Diane Ravitch
- Raul A. Reyes
- Michelle Richardson
- Jonathan Riehl
- Peter Roff
- Dean Rosen
- Marji Ross
- Michael S. Roth
- Marc Rotterman
- Ryan Rudominer
- Sal Russo
- Larry J. Sabato
- Dante Scala
- Sabrina L. Schaeffer
- Frederick Schauer
- Cliff Schecter
- Dan Schnur
- Eric Schnurer
- Alex Schriver
- Alan Schroeder
- Jim Schweiter
- Matthew Segal
- Michael Shank
- Eileen Shields-West
- Craig Shirley
- Michael A. Siegel
- Carlos Sierra
- Carole Simpson
- Cliff Sims
- Richard M. Skinner
- Theda Skocpol
- Bradley A. Smith
- Heather Smith
- Eileen Smith
- Glenn Smith
- Heather Smith
- Rod Snyder
- Ilya Somin
- Garry South
- Jason Stanford
- Steve Steckler
- Michael S. Steele
- Jeffrey C. Stewart
- Natalie (Talia) Stroud
- Michele L. Swers
- Don Taylor
- Jeffrey Taylor
- Robert Thompson
- Doug Thornell
- Brad Todd
- Don Todd
- Eric Toder
- Michael Toner
- Tevi Troy
- Joshua A. Tucker
- Peter Ubertaccio
- Joshua Ulibarri
- Richard A. Viguerie
- Charles Walcott
- Janelle Ward
- Doug Wead
- Mark Weinberg
- Fred Wertheimer
- Darrell M. West
- Drew Westen
- Robert White
- Morley Winograd
- Michael D. Hais and Morley Winograd
- Julie Woestehoff
- Michael Yaki
- David Yepsen
- Robert Zelnick
- Lou Zickar
- James J. Zogby
More POLITICO Arena
About the Arena
The Arena is a cross-party, cross-discipline forum for intelligent and lively conversation about political and policy issues. Contributors have been selected by POLITICO staff and editors. Each morning, POLITICO sends a question based on that day's news to all contributors.Frequently Asked Questions


text:
Process and device for the compression of image data by a mathematical transformation implemented at low cost, particularly for the transmission at reduced speed of sequences of images.
The objective is to provide an economical method in "silicon area - processing speed" cost to implement a mathematical transformation of the DCT type, on arrays of pixels, suitable for image compression.
According to the invention, the method consists essentially of combining a permutation (1) of each block of pixels with a series of one dimensional FFT (211, 213). A series of variants is obtained by adding or not adding steps of matrix calculation (22) of reconstitution of a complex 2D-FET, of rotations (3) of reconstitution of the DCT, and/or of suppression of the imaginary coefficients.
1. Process of compression of data representative of an image signal, of the type consisting of decomposing the image into blocks forming arrays of pixels, of effecting a mathematical operation of transformation on each array of pixels according to a transform making it possible to obtain a resulting array of elements representative of the activity of the image, and of eliminating in each resulting array the elements of little psychovisual relevance by thresholding in relation to an array of reference thresholds, process characterized in that the said mathematical operation of transformation consists of the steps of:
transposing the elements of the array of pixels by permutation of the indices of the said elements, so as to symmetrize the signal;
applying an interlacing of two series of one dimensional real value FFT, bearing successively on each line of the permuted array of pixels, then on each of the columns of the intermediate array resulting from the first series of one dimensional FFT.
2. Process according to claim 1 characterized in that at least part of the imaginary coefficients that are obtained after at least one of the two series of one dimensional real value FFT are cancelled.
3. Process according to claim 1 wherein said interlacing of two series of one dimensional real value FFT are replaced with a two dimensional real or complex value FFT.
4. Process according to the claim 1 characterized in that at least one of the two one dimensional FFT is followed by an operation of matrix transposition with bit reverse.
5. Process according to claim 4 characterized in that on the transformed array resulting from the two interlaced one dimensional FFT a matrix calculation is effected designed to reconstitute the array transformed by complex value FFT corresponding to the said initial transposed array of pixels.
6. Process according to the claim 5 characterized in that the said array transformed by complex value FFT is subjected to a treatment of rotations, so that a resulting array is obtained corresponding to the real value DCT transform of the initial array of pixels.
7. Process according to claim 5 wherein said interlacing of two series of one dimensional real value FFT are replaced with a two dimensional real or complex value FFT.
8. Process according to any of the claims 1 to 6 characterized in that the law of permutation of the indices of the elements of the array of pixels is combined with a scanning of the array being chosen in the group comprising a line to line scan of the array and a zigzag scan of the array.
9. Process according to claim 3 or 7 characterized in that at least part of the imaginary coefficients that are obtained after said two-dimensional real or complex value FFT are cancelled.
10. Device to implement the process according to any one of the claims 1 to 6, 3, 7 or 2 characterized in that it comprises two distinct memory units, the said memory units cooperating with a data path effecting in pipeline the interlaced operations of reading coefficients in the memories, the calculation operations on the said coefficients, and the interlaced writing operations of the resulting coefficients in the memory units, so as to effect the steps of the process by successive passages of the coefficients in the said data path.
1. Field of the Invention
The invention relates to a process for the compression of data representative of an image signal, of the type consisting of decomposing the image into blocks forming arrays of pixels, of effecting a mathematical transformation operation on each array of pixels according to a transform that permits obtaining a resulting array of elements representative of the activity of the image, and of eliminating in each resulting array the elements of low psychovisual pertinence by thresholding in relation to an array of reference thresholds.
More specifically, the invention relates to a process of implementation of a new transform of the arrays of pixels, enabling the process of compression to be implemented at low cost.
The invention applies advantageously, but not exclusively, to the compression of images emitted in sequences of images at reduced rate, of the type used in audiovideography, photovideotex, telesurveillance, or in visiophony and visioconference on a switched telephone network, or on a digital network with service integration. However, the invention applies also to any other type of images or of sequences of images, including the coding of digital television pictures and even of high definition television.
2. Description of the Prior Art
Several laws of transformation of arrays of pixels are known, the principal laws being the Fast Fourier Transform, FFT, and the Discrete Cosine Transform, DCT. At least three parameters determine the choice of the transform, for a given application:
the rate of compression of the image signal;
the psychovisual quality of the image reconstituted from the compressed image signal; and
the "processing speed x semiconductor area" cost of implementation of the transform on integrated circuit.
The DCT is generally the transform prefered today for the compression of images, because it permits a higher concentration of the "activity" ("energy") of the image than the FFT. In other words, the transformed array resulting from the CDT operation on the initial array of pixels, comprises fewer significant elements, from the psychovisual point of view. The amount of information relative to the image is therefore smaller, which permits the transmission of the image signal at a slower rate.
However, the implementation of the CDT on the arrays of pixels implies a "processing speed x semiconductor area" cost greater than that of the FFT. All the recent research of the experts in this area aimed therefore to find means to implement the CDT which minimizes this cost.
The CDT implemented on an image block N�N is expressed by the formula: ##EQU1## where: i,j: spatial coordinates of the pixel array elements,
u,v: coordinates of the coefficients of the transformed array,
C(u)=1/√2 if u=0,
C(v)=1 if u≠0, and
f(i,j): amplitude of the pixel of coordinates (i,j).
The objective of the weighting coefficients C(u) and C(v) is to take into account the edge effect in the transformed block. The calculation of the double sum, effected systematically, leads to effect N2 multiplications, multiplied by N2 coefficients, or N4 values to be summed.
Now, the cost of implementation of the DCT, on an integrated circuit, is tied directly to the number of additions and multiplications to be done. Further, it should be noted that the cost of a multiplication operation is about 5 to 7 times greater than that of an addition operation.
Two approaches have been tried to reduce the cost of implementation of the transform:
the decomposition of the lines/columns during implementation of the DCT on the array of pixels; and
the implementation of the DCT directly in two dimensions, through a decomposition into elementary steps which in the aggregate is less expensive.
An illustration of the first approach is the method recommended by CHEN and others (see article W. H. CHEN, C. H. SMITH, S. C. FPALICK, "A fast computational algorithm for the Discrete Cosine Transform", IEEE Trans. on Communication, vol. COM-25, Sept. 1977). The method presented consists, essentially, of using the symmetries appearing in the transformation array to reduce the number of operations. The decomposition into lines/columns amounts to effecting successively two series of one dimentional transforms, successively on the lines, and on the columns of the array respectively. The intermediate array, between the two series of transformation, is subjected to a line/column transposition, so that the same mathematical index operations can be applied for the two series of transformations. The approach of CHEN makes it possible to reduce the cost of the DCT to 256 multiplications and 416 additions for arrays of 8�8 pixels.
Another method based on the same principle is described in the article of B. C LEE "A new algorithm to compute the discrete cosine Transform" (IEEE trans. ASSP vol. ASSP. 32). This approach is slightly less expensive, in the aggregate, for it requires only 192 multiplications, at the cost of a small increase of the number of additions (464 additions).
Finally, contrary to the preceding methods with direct factorizing, M. VETTERLI and H. NUSSBAUMER have proposed a method by decomposition of the DCT into elementary steps, in "Algorithmes de transformations de Fourier et en Cosinus mono et bidimensionnels" (Algorithms for Fourier and in Cosine one and two-dimensional transformations) (Ann. des Telecom. 40 n0 9-10, 1985). According to this method, the DCT is decomposed into three successive operations, which are:
a permutation of the elements of the initial array of pixels;
an FFT generated on the permuted array; and
a series of rotations applied to the array transformed by the FFT, so as to obtain the final array corresponding to the DCT transform of the initial array of pixels.
The FFT on the permuted array is generated in the form of two series of one dimensional transformations, applied successively to the lines of the permuted initial array, then to the columns of the intermediate array resulting from the first series of one dimensional transformations. This method represents a cost of 464 additions, and of 192 multiplications, which can be reduced to 176 multiplications through arithmetical astuteness.
An additional gain has been obtained by VETTERLI, by means of a direct two-dimensional approach, based on the same type of decomposition into three successive operations (see the article "Fast 2-D Discrete Cosine Transform" ICASSP 1985). Contrary to the one dimensional approach, the permutation, FFT and rotation operations are effected directly in two dimensions. The FFT, in particular, is generated by an approach of polynomial transformation of the entire array. The cost of this two-dimensional method is interesting, since it is reduced to 104 multiplications and 460 additions.
This invention aims to provide a process to compress image data, by mathematical transformation of arrays of pixels, which makes it possible to obtain a still lower cost of implementation. Cost is a very important parameter in applications intended for distribution to the general public, requiring the purchase of image decoding terminals (photovideotex, HDTV, etc.).
More specifically, the inventors have discovered that it is not only possible to implement a DCT type transformation suitable for image compression, but also that certain variants of this method, even more economical, are quite satisfactory from the psychovisual point of view, and give better performance from the point of view of the compression ratio. These variants are particularly well adapted to image coding at slow speed, without being restricted to this type of application.
The process according to the invention has been specifically worked out for image coding at slow speed, and is particularly advantageous for processing image blocks in 4�4 pixel, 8�8 pixel or 16�16 pixel sizes. In the case of the most complex variant, corresponding to a new method to implement a DCT, the greater efficacy when compared with the VETTERLI method, can be explained, a posteriori, by the fact that the VETTERLI approach in two-dimensional DCT, while having a very low arithmetical complexity, has the drawback of applying a calculation structure that is not regular. The process of the invention has indeed both a low mathematical complexity and a regular structure, allowing a simple implementation and therefore a low cost material embodiment.
In addition, the invention can be implemented in a material device providing the best "frequency of operation/area of silicon" ratio, for a flow of data entering at 256 kHz (which corresponds to a transmission of fixed images coded at 0.25 bits per pixel (bpp) on networks at 64 kbits/s) as well as for a flow of data at 27 MHz (corresponding to the digital television data rate).
According to the invention, these advantageous characteristics are obtained by means of a process of compression of data representative of an image signal, of the type consisting of decomposing the image into blocks forming arrays of pixels, of effecting a mathematical operation of transformation on each array of pixels according to a transform to obtain a resulting array of elements representative of the activity of the image, and of eliminating in each resulting array the elements of low psychovisual relevance by thresholding in relation to an array of reference thresholds, the said mathematical operation of transformation being composed of a first step of transposition of the elements of the array of pixels by permutation of the indices of the said elements, so as to symmetrize the signal, followed by a second step of transformation of the transposed array, by fast Fourier transform (FFT).
As will be seen below, the FFT can be generated either by a two-dimensional approach, or by a one dimensional approach, conducted partially or totally according to its terms.
According to a first variant of the invention, the resulting array to which the compression thresholding is applied, then the coding, is the array obtained following the FFT, partial or total, applied to the transposed array of pixels. Advantageously, the FFT is effected by applying to the transposed array of pixels a chain of two series of one dimensional FFT with real values, bearing successively on each of the lines of the permuted array of pixels, then on each of the columns of the intermediate array resulting from the first series of one dimensional FFT. In this case, two sub-variants are obtained, depending on whether or not the chaining of the two series of one dimensional FFT is followed by the calculation matrix designed to reconstitute the array transformed by FFT with complex values corresponding to the said initial permuted array of pixels.
In these first two variants of the invention, surprisingly good psychovisual results are obtained, which indicates the preponderance of the permutation step, for the symmetrization of the signal in the chain of steps composed by VETTERLI to generate a DCT. This permits disregarding, possibly, the subsequent steps of VETTERLI.
However, in a third variant of the invention, it is possible to generate a complete DCT on the initial array of pixels. The new method of the invention consists of effecting this complete DCT by means of a two-dimensional approach for the permutation, and rotation, operations, but a one dimensional approach for the FFT operation. This double approach, two-dimensional and one dimensional, permits regularizing the succession of arithmetic operations. The gain does not result in a reduction of the cost in addition and subtraction operations, but rather in an advantage regarding the management of addresses in an implementation with an integrated circuit. This advantage proves to be the determining factor in improving the "processing speed/area of silicon" cost which is to be minimized.
According to a fourth and a fifth variant of the invention, the resulting array on which thresholding is effected, then coding, is either the array resulting from the DCT worked out according to the one directional approach, during which at least part of the imaginary coefficients obtained after at least one of the two series of one dimensional FFT with real value are cancelled (fourth variant), or the array resulting from a two-dimensional FFT in which the same type of partial or total cancellation of the imaginary coefficients was effected (fifth variant).
Other variants of the invention are also possible, particularly by combining the partial or total cancellation of the imaginary coefficients with the step of not conducting the DCT of the process of the invention. Other features and advantages of the invention will appear when reading the following description of preferred embodiments and the variants of the process of the invention, given only for illustration and as a non-limitative example, and the attached drawings.
FIG. 1 shows a diagram of the mode of zigzag scanning of the blocks of coefficients prior to implementing, in decoding, the reverse process of the invention in case of a photovideotex type application.
FIG. 2 shows a diagram of the mode of line to line scanning of the blocks of pixels, during the preliminary step according to the process of the invention.
FIG. 3 shows a diagram of the content of the read-only memory for transcoding in zigzag scanning, on a block of coefficients.
FIG. 4 shows a diagram of the preliminary step of permutation by bit reverse for the permutation step according to the process of the invention.
FIG. 5 shows a diagram of succession of the four steps of one dimensional FFT line, and column, with inserted matrix transpositions, according to the process of the invention.
FIG. 6 is a butterfly graph illustrating the logic of generation of the one dimensional FFT, as implemented in the diagram of the FIG. 5.
FIG. 7 shows a diagram illustrating the sub-steps of matrix permutation by bit reverse, in the process illustrated in FIG. 5.
FIG. 8 illustrates the spatial distribution of the real and imaginary parts, in the array transformed by two one dimensional FFT with real value.
FIG. 9 shows a diagram of the operations performed in order to reconstitute the transformation values into a 2D-FFT with complex value, according to the geographic zones of the array.
FIG. 10 shows a diagram of the rule to obtain the coefficients of the array N�N, symmetrical in relation to the point (N/2,N/2) by processing of the addressing bits of the said coefficients.
FIG. 11 localizes the seven families of final rotation of reconstitution of the DCT, according to the process of the invention.
FIGS. 12 to 17 are graphs illustrating certain aspects of the mode of implementation of the rotations, for each of the seven families localized in FIG. 11.
FIG. 18 shows an advantageous circuit for implementing the process of the invention;
FIGS. 19A and 19B are diagrams of the pipeline operation of the circuit of FIG. 18, in case of interlacing 4/4 and 1/1, respectively.
FIG. 20 is a diagram symbolizing the principal variants of the invention according to the steps of the process actually effected.
The process of compression of image data of the invention fits advantageously into a low rate fixed or mobile image coding process. Such a process consists essentially of the following steps:
The source image is cut into elementary blocks for processing. The block size corresponds advantageously to a compromise between: on the one hand, the need to obtain a sufficient level of decorrelation of the pixels, and therefore a size sufficientlY large for each block; and on the other hand, a size that is not too large for each block in order to minimize the processing complexities. In the embodiment presented below, the preliminary cutting up of the image is effected on 8�8 pixel blocks, but the invention can be applied to different block sizes.
A step of mathematical transformation is effected on each block cut out from the image. The transformation operation aims to concentrate the relevant data concerning each block of images, on a volume of information smaller than the array of pixels forming each source block. The transformation operation, often by means of an FFT or of a DCT, concentrates the energy of each block of images, generally, on at the most half of the block, except in case of blocks of images with high psychovisual complexity.
A step of thresholding, and of quantification of the information contained in the transformed blocks of images is then effected. The thresholding operation consists of eliminating from each transformed array the elements of information that are lower than experimentally determined thresholds of psychovisual perception. This is done by uperposing on each transformed array an array of threshold coefficients. This filtering operation by thresholding is followed by an operation of quantification of each filtered transformed block, which is represented by a closest configuration chosen in a dictionary of standard basic sub-images.
A step of coding, preferably of entropic coding, is then performed. (See for example the article "A method for the construction of minimum-redundancy codes", David A. HOFFMAN, proceedings of the I. R. E., September 1952, pages 1098 to 1101.) Other entropic codes than the HOFFMAN code can be used.
The implementation of the image data compression process of the invention described below relates to the step of transformation of the arrays of pixels, corresponding to 8�8 blocks, cut from a fixed or mobile image to be coded. Some of the steps of the image data compression process described below may be selectively preserved or eliminated, depending on system constraints and the performances required for each compression application.
In the most complex embodiment of the invention, illustrated in FIG. 20, the process comprises the succession of the following steps:
(1) a transcoding operation of the source pixel arrays, effected advantageously in the form of permutations of pixels, combined with a television scan logic;
(2) a mathematical transformation of the transcoded array of pixels, by 2D-FFT with complex value, decomposed in the form of a double 1D-FFT with real value followed by a sub-step of reconstitution of the 2D-FFT with complex value, or more precisely:
(21) the double 1D-FFT with real value is effected advantageously as follows:
(211) a real FFT is performed on each of the lines of the transcoded array;
(212) a line/column matrix transposition is performed;
(213) a FFT with real value on each of the eight lines is obtained after transposition; and
(214) line/column transposition of the array obtained in this manner;
(21) reconstitution of the array resulting from a 2D-FFT transformation with complex value, through a series of equations of arithmetic combinations of the coefficients of the array resulting from the double 1D-FFT with real value. The number of equations to be calculated is advantageously reduced by using the square symmetry of the Fourier transform of a real signal;
(3) --a reconstitution of the discrete cosine transform, advantageously in the form of a series of two-dimensional rotations. In a preferred embodiment of the invention, these two-dimensional rotations are achieved by regrouping the corresponding equations in seven distinct families, with homogeneous processing within each family.
The carrying out of all the steps and sub-steps described above corresponds to the embodiment of the invention that permits implementing an optimized DCT on the image blocks, at reduced "processing speed x semiconductor area" cost. However, as explained in the preamble, it is possible to eliminate selectively some of the steps, i.e.:
elimination of step 3 (DCT reconstitution rotations). In this case, the step 2 of generation of the complex FFT can be effected either by the succession of the steps 21 and 22 described above, or by the generation of an 2D-FFT with complex value according to the direct method recommended by VETTERLI.
elimination of step 21 of the matrix calculations for reconstitution of the complex 2D-FFT.
finally, in an even more simplifying variant, the imaginary coefficients coming from the 1D-FFT of the steps 211 and 213 can be cancelled. Such simplification is justified if the array of pixels corresponding to each image block carries a strongly correlated signal.
On the other hand, in the case of elimination of the step 213 of final rotations, and possibly of the step 212 of the calculation matrix, the invention covers also the variant in which the DCT generated in this manner comprises a step 4 of obtaining a 2D-FFT, complex or real respectively, instead of the pair of one dimensional FFT.
The preferred principle and a mode of implementation of each step of a complete variant of the invention will now will be defined more precisely.
The permutation is the first operation to be performed. It is effected at the time the input data is entered into a memory of 64 words corresponding to an 8�8 block to be transformed, in combination with the scan operation of the elements of the array of pixels. The data of the 8�8 block is introduced according to a sequence that may be similar to the line to line television scan (FIG. 1) in case of the direct transform (at the transmission). At the reception, it will be noted that it is necessary, in order to generate the reverse transform, to effect a "zigzag" scan for the photovideotex, photosurveillance, visiophony applications (FIG. 2), while a simple line to line scan is suitable for decoding in television application. The addresses of the tables (in FIG. 1 and 2) are the line and column numbers of the reconstituted block and the content of the table is the number of the data in the sequence.
The television scan requires no address transcoding since, naturally, the sequence number=(8 * i)+j, i.e. the binary coded couple (i,j) is also the binary code of the sequence number. Transcoding of the zigzag scan is advantageously effected in a read-only memory (ROM) of 64 bit words whose input address is the sequence number and the output the couple (i,j) where the data is to be written. The content of the zigzag transcoding ROM is shown in FIG. 3.
The permutation proper consists of transforming each of the line and column indices i and j in the manner shown in the diagram, FIG. 4. This operation corresponds somewhat to a mixing of the coefficients, which symmetrizes the signal and permits, in a way, decorrelating the coefficients.
If i and j are coded on 3 bits B2, B1, B0 the new calculated indices i' and j' expressed on 3 bits B'2,B'1,B'0 are such that:
As shown diagrammatically on the FIG. 5, the Fast Fourier Transform or FFT with real values is generated by using a real value FFT on each of the 8 lines (211), followed by an 8�8 matrix transposition (212), and finally by a second series (213) of FFT on the 8 lines obtained after the transposition, prior to new 8�8 matrix transposition (214).
It should be noted that in the embodiment of the invention consisting of eliminating the steps of matrix calculation (22) and of rotation (3), it is also possible to omit the step 214 of matrix transposition, provided that the array of psychovisual thresholds of the step of quantification of the coding be adapted, as well as the implementation of the reverse decoding transform.
FIG. 6 shows a diagram of the logic for generation of the one dimensional FFT in the form of a butterfly graph making it possible to obtain from the coefficients (x0, . . . x7) of the source line, transform coefficients (X0, . . . X7). As shown in FIG. 6, these indices (X0, . . . X7) are attributed by integrating the permutation consecutive to the one dimensional FFT.
The data resulting from the FFT with real value on each of the lines must be arranged in the bit reverse order (reversal of addressing bits) instead of the natural order. This bit reverse permutation inverts the bits of the line and column indices i and j, according to the process of the diagram of FIG. 7. It is not to be confused with the permutation effected on the input data. The combination of this permutation operation with the matrix transposition, in the steps 212, 214, requires no memory transfer (and therefore time), but merely a transformation of the address (i,j) into an address (i',j'). It is effected after each series of 8 real value FFT transformations in the form of the following operation: ##EQU2##
The bit reverse permutation could also be effected at the input of the one dimensional FFT.
The outputs of the 1D-FFT with real values are, due to the square symmetry of the complex Fourier transform of a real signal, real parts (X0, X1, X2, X3, X4) and imaginary parts (X5, X6, X7), FIG. 8 illustrates the spatial distribution, in the transformed array RVFFT, of the real and imaginary parts. Note the square symmetries according to the axes i 81 and j 82. The coefficients of the transformed RVFFT array are the real data thus making it possible to reconstruct the coefficients of the complex Fourier transform, as follows: ##EQU3## where: ε1 =�1 according to the square symmetry
ε2 =�1 according to the square symmetry
except: quadrant 1 (91)=ε1 =ε2 =+1
The notations Im[Re], Im[Im], Re[Re], Re[Re]are to be interpreted according to the following example:
example: Re[Re]=Re[1D-FFT[Re[1D-FFT]]]
* 1D-FFT: results in the lines of 1D-FFT, and
* 1D-FFT[Re[1D-FFT]]: results in the columns of 1D-FFT.
To obtain in all cases the real and imaginary parts of the complex value 2D-FFT, the terms Re[Re], Re[Im], Im[Re], Im[Im] from the two series of real value 1D-FFT are simply replaced by the respective values of the diagram of FIG. 9, and according to the logic presented in Table I. The conditional branches presented in Table I identify the non-zero elements of calculation among Re[Re], Im[Re], Re[Im], Im[Im]. It will be noted that a certain number of simplifications can be introduced, especially due to the fact that the imaginary parts are zero for the elements 0 and 4.
The reconstitution is effected by taking into account the square symmetry that is again found in the two-dimensional case, and is a symmetry in relation to the couple (N/2, N/2), i.e. (4,4) when N=8. This permits deducing directly the complex values of the 2D-FFT of the 3rd and 4th quadrants 93 and 94 of FIG. 9, from those of the 1st and 2nd quadrants 91 and 92.
The calculations of the values of the complex value 2D-FFT from the outputs of the real value 2D-FFT cost in sum 4�(3�3) additions/subtractions, or 36 additions/subtractions. The additions and subtractions are made by taking the two symmetrical words in relation to the point (4,4), the address of the symmetrical word is obtained by the address calculation of the diagram of FIG. 10, according to the following symmetry logic: B'0:=B0 and B'1:=B0⊕B1
TABLE I______________________________________ -if j = 0,4 ----then Im[1D-FFT (lines)] = 0 if i = 0,4 ----then Im[1D-FFT (columns)] = 0 only the term Re[Re] = 0 --fsi -if i = 1,2,3 ----then Im[1D-FFT (columns)] = 0 only Re[Re] = 0 and Im[Re] = 0 --fsi --fsi -if j = 1,2,3 ----then Im[1D-FFT (lines)] = 0 -if i = 0,4 ----then Im[1D-FFT (columns)] = 0 only the terms Re[Re] = 0 and Re[Im] = 0 --fsiif i = 1,2,3, ---- then all terms Re[Re] = 0, Re[Im] = 0 Im[Re] = 0, Im[Im] = 0 --fsi --fsi______________________________________
The values of the DCT 8�8 are deduced from the complex value FFT 8�8 by the following matrix equation: ##EQU4## where ck=cos(kπ/16) and sk=sin (kπ/16) The particular values of the sk and ck lead to simplifications in the generation of the rotations and the above-described matric equation can therefore be put in seven different forms called "families". The seven families are located in the complex FFT array as shown in FIG. 11.
FIGS. 12 to 17 are graphs illustrating certain aspects of the modes of implementation of the rotations, for each of the seven families F1, F2, . . . F7.
It is the most general family, for without any simplification at all. Given sk:=sin(kπ/16) and ck:=cos(kπ/16). The graph of the FIG. 12 shows an embodiment with three cells: 101, 102, 103. The cell 102 is identical with the cell 101, but for a different value of the coefficient k (k=i+j, and k=i-j respectively for the cells 101 and 102). From the couple (i,j) on, it is necessary to use the symmetry in relation to 4 to obtain 8-i/8-j, that is:
______________________________________ (i,j) = (i,j) (sym4(i),j) = (8-i,j) (sym4(i),sym4(j) = (8-i,8-j) (i,sym4(j)) = (i,8-j)______________________________________
The family F1 is generated for the couples (1,2), (2,1), (2,3), (3,2) according to the table:
__________________________________________________________________________(i,j) k=i+j sk ck k=i-j sk ch__________________________________________________________________________(1,2) 3 sin3π/16 cos3π/16 -1 -sinπ/16 cosπ/16(2,1) 3 sin3π/16 cos3π/16 +1 sinπ/16 cosπ/16(2,3) 5 sin5π/16 cos5π/16 -1 -sinπ/16 cosπ/16(3,2) 5 sin5π/16 cos5π/16 +1 sinπ/16 cos/π16__________________________________________________________________________
The family F1 uses the values sin(3π/16),
sin(π/16), cosπ/16), cos(3π/16), sin(5π/16), cos(5π/16). To minimize the number of multiplications the cell CEL1 can be modified and shown in FIG. 13. The version of the FIG. 13 requires only three multiplications and three additions instead of four multiplications and two additions for the version of the FIG. 12.
For the other families, it would be possible to use the same general rotation as the one just described for the family F1. However, this would allow to increase the regularity of the algorithm by using the same rotation cell, at the cost of a slightly longer calculation time.
This rotation is implemented for the couples (i,j)ε{(1,3),(3,1)}. Its graph is shown by implementing the cell 104 of FIG. 14, instead of the cell 101 of FIG. 12.
The family F2 uses the values sin(π/8) and cos(π/8) as well as cos(π/4), according to the table
______________________________________(i,j) k-i+j sk ck______________________________________(1,3) - -sin(π8) cos(π/8)(3,1) +2 sin(π8) cos(π/8)______________________________________
This rotation is effected for the couples (i,j)ε{(1,1), (3,3)}. As shown in FIG. 15, the cell 105 is identical with the cells 101 and 102 of FIG. 12 (and possibly with the equivalent cell of FIG. 13). The cell 106 consists of two lines without any specific processing. The family F3 uses the values sin(π/8), sin(3π/8), cos(π/8), cos(3π/8) according to the table
______________________________________(i,j) k=-i+j sk ck______________________________________(1,1) 2 sin(π8) cos(π/8)(3,3) 6 sin(3π8) cos(3π/8)______________________________________
In this family, the rotation is achieved by the couple (i,j)=(2,2), according to the graph of FIG. 16. The supply cells for the matrix 103 are the cells 104 and 106 of FIGS. 14 and 15 respectively. The family F4 uses only the value cos(π/4).
For the family F5, the rotation consists of effecting the multiplications by 2 instead of the calculation matrix 103 (FIG. 17). The cells 107, 108 are identical with those 101, 102 of FIGS. 12 and 13.
The family F5 corresponds to the couples (i,j) such as
i=0 and j=1,2,3
j=0 and i=1,2,3
and is effected according to the table
__________________________________________________________________________(i,j) k:i+j sk ck k:=i-j sk ck__________________________________________________________________________(0,1) 1 sin(π/16) cos(π/16) -1 -sin(π/16) cos(π/16)(0,2) 2 sin(π/8) cos(π/8) -2 -sin(π/8) cos(π/8)(0,3) 3 sin(3π/16) cos(2π/16) -3 -sin(3π/16) cos(3π/16)(1,0) 1 sin(π/16) cos(π/16) 1 sin(π/16) cos(π/16)(2,0) 2 sin(π/8) cos(π/8) 2 sin(π/8) cos(π/8)(3,0) 3 sin(3π/16) cos(3π/16) 3 sin(3π/16) cos(3π/16)__________________________________________________________________________
For the family F6, the rotation is limited to the cells 107 and 108 of FIG. 17, without using the multiplications by 2. The family F6 comprises the couples (i,j) such as: i=4 and j=1,2,3; j=4 and i=1,2,3 and is effected according to the table:
__________________________________________________________________________(i,j) k:i+j sk ck k:=i-j sk ck__________________________________________________________________________(1,4) 5 sin(5π/16) cos(5π/16) -3 -sin(3π/16) cos(3π/16)(2,4) 6 sin(3π/8) cos(3π/8) -2 -sin(π/8) cos(π/8)(3,4) 7 sin(7π/16) cos(7π/16) -1 -sin(π/16) cos(π/16)(4,1) 5 sin(5π/16) cos(3π/16) 3 sin(3π/16) cos(3π/16)(4,2) 6 sin(3π/8) cos(3π/8) 2 sin(π/8) cos(π/8)(4,3) 7 sin(7π/16) cos(7π/16) 1 sin(π/16) cos(π/16)__________________________________________________________________________
The family F7 consists of the rotations reduced to the minimum:
______________________________________ DCT(0,0) = 2 F(0,0) DCT(0,4) = 2 cos(π/4) F(0,4) DCT(4,0) = 2 cos(π/4) F(4,0) DCT(4,4) = 2 F(4,4)______________________________________
In the description that has just been given of all the steps of the process of the invention for implementing a transform of the DCT, it appears clearly that the calculation load lies mainly at the level of the rotations.
Also, the permutation tends to symmetrize the input data. The imaginary part of the coefficients of the real value FFT will thus tend toward "0" when the correlation between the input data increases. Now, in certain practical applications such as slow speed image coding, the input signals are in general strongly correlated. The rotations will therefore apply to complex numbers whose real part is predominant and therefore should not modify the entropy of the signal to be coded. The suppression of these rotations thus introduces a new transform usable in image coding.
Specifically, this step consists of selectively cancelling at least some, or even all of the coefficients corresponding to the imaginary parts of the complex coefficients, at each one dimensional FFT in the steps 211 and 213. The criterion for selective cancellation can be a thresholding. The cancellation of a coefficient results for example in the non-execution of he corresponding addition and/or subtraction operations (see FIG. 6).
In addition, since the signals of images to be coded are real (basic hypothesis enabling the real value Fourier transform to be introduced into the calculation of the DCT), the spectrum of the real value Fourier transform is of square symmetry. It is then possible to take as other transform, the real value Fourier transform of the permuted signal. This transform has a very reduced arithmetic complexity since, for a size 8�8, it is generated in 32 multiplications and 320 additions, or a number of multiplications divided by 3.5 and a number of additions divided by 1.5.
Besides, its performances in compression are quite comparable to those of a Cosine transform.
For comparison, the performances in terms of number of additions and multiplications involved in the CHEN, LEE and VETTERLI processes on the one hand, and the two variants of the invention (with, then without rotations) on the other hand, are given in the table II, as a function of the size of the image blocks (N=8 to 64).
TABLE II__________________________________________________________________________CHEN & AL B.G LEE FFTC Invention Withoutline/colmn line/colmn line/colmn W/rotations rotationsN mult add mult add mult add mult add mult add__________________________________________________________________________ 8 256 416 192 464 192 464 112 470 32 32016 1408 2368 1024 2592 1024 2592 672 2662 320 192032 7424 12416 5120 13376 5120 13376 3648 13766 2176 1049664 37376 61696 24576 65664 24576 65664 18560 67462 12544 53760__________________________________________________________________________
In case of suppression of the matrix calculation step, the number of additions is reduced by 4�(N/2 -1)2, or for example 36 additions suppressed for N=8. The number of multiplications remains the same.
FIG. 18 shows an advantageous circuit enabling the process of the invention to be implemented. As shown in FIG. 18, the DCT operator consists of a working storage 200 of 64 words, corresponding to the 64 elements of an 8 line and 8 column array, and of a "data path" 210 effecting additions and multiplications from the data read in the memory. Since the calculations are carefully arranged, the results of the calculations of the "data path" are written into the same addresses as the read addresses, in the working storage 200. One may say that the data is caused to "turn" between the memory 200 and the data path 210, until the final result is obtained. The data is introduced into and extracted from the DCT operator through input 221 and output 222 FIFO.
Considering the large number of elementary operations of the butterfly type to be effected [effecting for example (X0+X4) and (X0-X4)], the memory is divided into two equal parts 201 and 202 called MA and MB. MA stores the even lines of the block 8�8 whereas MB stores the odd lines. Also, in order to access simultaneously these two memories 201 and 202, either in reading, or in writing, MA and MB are connected to two busses 203 and 204, through registers 205 and 206, one 203 of the busses serving systematically in reading, the other bus 204 for writing into memory. The memories MA 201 and 202 are advantageously RAM memories with 32 words of 20 bits.
The data path consists mainly:
of four registers A0, Al, A2, A3 (205,206,207,208), storing the data read in memory (200,201,202),
of two multiplexors (211,212) by the values "cosine", "sine" and various constants (0, +1, -1, . . . ) from a table in the read-only memory 213 This memory 213 is a ROM with 16 words of 12 bits containing the sine and cosine tables of the angles from 0 to π/2 at a pitch of π/16,
of an adder 214,
and of four output registers S0, S1, S2, S3 (215,216,217,218), storing the results from the adder 214 output. They have also multiplexer Mx and demultiplexer DMx modules.
The commands of the memory 200 and of the "data path" 210 are generated in such a way that the memory and the "data path" are used 100% of the time during the entire DCT calculation algorithm. To this end, the partition of the memory MA and MB, the four input registers A and the four registers B of the "data path" work in pipeline according to an interlacing 4--4 or 1--1, depending on whether or not the data to be processed comes from the same line.
The pipeline operation of the DCT operator is based on the partitioning of the data memory of 64 words (corresponding to the elements B(i,j) of a block B of size 8�8, (i=0, . . . ,7, j=0, ,7), into two memories MA and MB, MA containing the even lines, i=0,2,4,6 and MB containing the odd lines i=1, 3,5,7, this allowing either to read in the memory MA 201 and to write parallelly into the memory MB, or to read in the memory MB 202 and to write parallelly into the memory MA. This way the apparent access time of the memory is divided by 2.
The elementary operators are:
either a butterfly which from two elements A0 and A1 generates (A0+A1) and (AO-A1),
or simple multiplication couples which from two elements A0,A1 generate α�AO and β�A1,
or angle rotations Θ which from two elements A0 and A1 generate (AOcos(Θ)-A1sin(Θ)) and (A0Sin(Θ)+Alcos(Θ) (see cell 101, FIG. 12).
This is more clearly defined in FIGS. 19A and 19B wherein the left columns of the tables show the successive readings in memories MA and MB, the center columns show the calculation operations (additions, subtractions, multiplications) on the content of the registers, and the right columns show the successive writings into the memories MA, MB.
The operation shown on the FIG. 19A corresponds to the case where all the data originates in the same memory. This corresponds to the case where the operands of the addition and multiplication operations to be effected come from the same line, since the memories MA 201 and MB 202 correspond respectively to the storing of the coefficients of the even lines and of the odd lines. The only possible combination, allowing a pipeline operation, consists of reading successively four coefficients from the memory MA 201 (step 190), to place them in registers AO,A1,A2,A3 (205 to 208), then four coefficients in memory MB (step 191), and so forth, alternatingly. This regrouping of the readings by four permits then effecting, alternatingly, in each memory MA 201 and MB 202, the writings of the contents of the output registers S0,S1,S2,S3 (215 to 218), of the steps 192 and 193 of the FIG. 19A. The content of the registers S0,S1,S2,S3 is achieved by application 194 of the elementary operators defined earlier on the content of the registers A0,A1,A2,A3. The pipeline operation thus permits using each memory MA and MB 100% of the time.
In the case diagrammed in FIG. 19B, the operands of the addition or subtraction operations originate one in an even line and the other in an odd line. In this case, the interlacing, for the reading of the memories MA 201 and MB 202, is a 1--1 interlacing. The meaning of the symbols used in FIG. 19B corresponds to the symbols of FIG. 19A.
It is to be noted finally that the operations according to the interlacing "1--1" (FIG. 19B) can be chained in pipeline, without loss of time, with the operations according to the interlacing "4--4" (FIG. 19A).
Patent Citations
Referenced by
Legal Events
Original Image